Question
For the 4 problems, write a python code with grep -E .......... that will ONLY match all strings in top given set with the least
For the 4 problems, write a python code with grep -E .......... that will ONLY match all strings in top given set with the least amount of characters possible .
1:
AA 5776196167
BB 4968696920
CC 3611261614
DD 2616380569
EE 1563679036
FF 6306223456
GG 6128696732
AA 1932596926
BB 2680488969
CC 3098273454
DD 4968396920
EE 5736923677
FF 6208693111
GG 8910469012
2:
00 john ( paul ( george ringo ) )
01 john paul ( ( george ringo ) )
02 john paul george ( ringo ) ( )
03 ( john paul (george) ringo )
04 ( john paul george ) ( ringo )
00 john ( paul ) ( george ) ringo
01 john ( paul )(( george ringo ))
02 john paul ( ( ( george ) ringo
03 (( john )) paul george (ringo)
04 ( john paul george ringo )
00 This does not make sense
01 Both sets of lines look the same
02 They have the exact same characters
03 Except- For this line.
04 And maybe this line.
05 But al1 the others look identical!
06 Besides that, there seems to be ZERO differences.
00 This does not make sense
01 Both sets of lines look the same
02 They have the exact same characters
03 Except For this line.
04 And maybe this line.
05 But all the others look identical!
06 Besides that, there seems to be ZER0 differences.
AA 00
BB 01
CC 1010
DD 0001
EE 101010
FF 0001101100011011
AA 0
BB 1
CC 111
DD 010
EE 10101
FF 0000000110000
Example :
Step by Step Solution
There are 3 Steps involved in it
Step: 1
Get Instant Access to Expert-Tailored Solutions
See step-by-step solutions with expert insights and AI powered tools for academic success
Step: 2
Step: 3
Ace Your Homework with AI
Get the answers you need in no time with our AI-driven, step-by-step assistance
Get Started