findit | find target icon on your picture , and get its position | Computer Vision library

I have a string with data that looks like this:

I try to extract information from a complex string with regex. I try to extract what in the first { an last } as the content. Unfortunately, I struggle with nested {}. How is it possible to deal with this ?

I think the key is to balance the {} over the all regex by I haven't been successful so far... See example below for parenthesis: Regular expression to match balanced parentheses

This is my code below. When I run it i get the error:

c:\Users\renne\Documents\Code\Text Analysis\Assignment1.1C.py:27:
FutureWarning: Possible nested set at position 54
for item in
re.finditer("(?P\d{3}[.]\d{3}[.]\d{3}[.]\d{3})(?P[[\w]+\d{4}]|[-])(?P\d{2}/\w+/\d{4}:\d{2}:\d{2}:\d{2} -\d{4})(?P[A-Z]+ \S* HTTP/\d[.]\d)", logdata):

I dont know how to solve this. I have looked over my code a few times and cant figure out the problem.

I used a random string out of the test data instead of the enire txt file to make the testing easier. When this works ill change logdata = '...' to a read.

Im trying to add a space after a special character if there isn't one already in a string.

This is my code

I have a string of text with numbered paragraphs from '1.' to '221.', however, there are certain paragraphs that do not follow the order and I want to remove them. Here is how the data looks:

I need to find the Max consecutive occurrences on a String based on the condition that they can count as more than one if they are consecutive if we have a match of the same word inside of the same sequence but is not consecutive doesn't count, here is an example:

I'm trying to find file sequences between filenames in a given list of filenames. However the position of the potential file sequence is unknown. It may be at any position in the filename.

There are the following rules for sequences:

1. Sequences are always of the same length. So 01 - 12 and 070 - 110 are valid sequences. 1 - 12 and 70 - 110 are not.
2. Sequences are allowed to have gaps. 01, 02, 05, 10, 21 would be a valid sequence.

Example:

Input:

I have a formatted string, that can have a repeated part of arbitrary length. For example, here is an example of the metadata I have that I want to parse.

Need to create a string based on a given pattern.

If the pattern is 222243243 string need to be created is "2{4,6}[43]+2{1,3}[43]+". Logic to create the above string is, check how many 2's sets in pattern and count them and add more two 2's .here contains two sets of 2's. The first one contains 4 2's and the seconds part contains 1 2's. So the first 2's can be 4 to 6(4+2) 2's and seconds 2's can be 1 to 3(1+2). when there are 3's or 4's, [43]+ need to add.

workings: