Try to solve the exercises in every chapter using only the features discussed until that chapter. Some of the exercises will be easier to solve with techniques presented in the later chapters, but the aim of these exercises is to explore the features presented so far.
1) Check if the given input strings contain two irrespective of case.
> let s1 = 'Their artwork is exceptional'
> let s2 = 'one plus tw0 is not three'
> let s3 = 'TRUSTWORTHY'
> const pat1 = // add your solution here
> pat1.test(s1)
< true
> pat1.test(s2)
< false
> pat1.test(s3)
< true2) For the given array, filter all elements that do not contain e.
> let items = ['goal', 'new', 'user', 'sit', 'eat', 'dinner']
> items.filter(w => test(w)) // add your solution here
< ['goal', 'sit']3) Replace only the first occurrence of 5 with five for the given string.
> let ip = 'They ate 5 apples and 5 oranges'
> ip.replace() // add your solution here
< 'They ate five apples and 5 oranges'4) Replace all occurrences of 5 with five for the given string.
> let ip = 'They ate 5 apples and 5 oranges'
> ip.replace() // add your solution here
< 'They ate five apples and five oranges'5) Replace all occurrences of note irrespective of case with X.
> let ip = 'This note should not be NoTeD'
> ip.replace() // add your solution here
< 'This X should not be XD'6) For the given multiline input string, filter all lines NOT containing the string 2.
> let purchases = `items qty
apple 24
mango 50
guava 42
onion 31
water 10`
> const num = // add your solution here
> console.log(purchases.split('\n')
.filter(e => test(e)) // add your solution here
.join('\n'))
< items qty
mango 50
onion 31
water 10
replace()method by the end of the Dot metacharacter and Quantifiers chapter.
7) For the given array, filter all elements that contain either a or w.
> let items = ['goal', 'new', 'user', 'sit', 'eat', 'dinner']
> items.filter(w => test(w) || test(w)) // add your solution here
< ['goal', 'new', 'eat']8) For the given array, filter all elements that contain both e and n.
> let items = ['goal', 'new', 'user', 'sit', 'eat', 'dinner']
> items.filter(w => test(w) && test(w)) // add your solution here
< ['new', 'dinner']9) For the given string, replace 0xA0 with 0x7F and 0xC0 with 0x1F.
> let ip = 'start address: 0xA0, func1 address: 0xC0'
> ip.replace() // add your solution here
< 'start address: 0x7F, func1 address: 0x1F'1) Check if the given input strings contain is or the as whole words.
> let str1 = 'is; (this)'
> let str2 = "The food isn't good"
> let str3 = 'the2 cats'
> let str4 = 'switch on the light'
> const pat1 = // add your solution here
> const pat2 = // add your solution here
> pat1.test(str1) || pat2.test(str1)
< true
> pat1.test(str2) || pat2.test(str2)
< false
> pat1.test(str3) || pat2.test(str3)
< false
> pat1.test(str4) || pat2.test(str4)
< true2) For the given input string, change only the whole word red to brown.
> let ip = 'bred red spread credible red;'
> ip.replace() // add your solution here
< 'bred brown spread credible brown;'3) For the given array, filter all elements that contain 42 surrounded by word characters.
> let items = ['hi42bye', 'nice1423', 'bad42', 'cool_42a', 'fake4b']
> items.filter(e => test(e)) // add your solution here
< ['hi42bye', 'nice1423', 'cool_42a']4) For the given input array, filter all elements that start with den or end with ly.
> let items = ['lovely', '1\ndentist', '2 lonely', 'eden', 'fly\n', 'dent']
> items.filter(e => test(e) || test(e)) // add your solution here
< ['lovely', '2 lonely', 'dent']5) For the given input string, change whole word mall to 1234 only if it is at the start of a line.
> let para = `(mall) call ball pall
ball fall wall tall
mall call ball pall
wall mall ball fall
mallet wallet malls
mall:call:ball:pall`
> console.log(para.replace()) // add your solution here
< (mall) call ball pall
ball fall wall tall
1234 call ball pall
wall mall ball fall
mallet wallet malls
1234:call:ball:pall6) For the given array, filter all elements having a line starting with den or ending with ly.
> let items = ['lovely', '1\ndentist', '2 lonely', 'eden', 'fly\nfar', 'dent']
> items.filter(e => test(e) || test(e)) // add your solution here
< ['lovely', '1\ndentist', '2 lonely', 'fly\nfar', 'dent']7) For the given input array, filter all whole elements 12\nthree irrespective of case.
> let items = ['12\nthree\n', '12\nThree', '12\nthree\n4', '12\nthree']
> items.filter(e => test(e)) // add your solution here
< ['12\nThree', '12\nthree']8) For the given input array, replace hand with X for all elements that start with hand followed by at least one word character.
> let items = ['handed', 'hand', 'handy', 'un-handed', 'handle', 'hand-2']
> items.map(w => w.replace()) // add your solution here
< ['Xed', 'hand', 'Xy', 'un-handed', 'Xle', 'hand-2']9) For the given input array, filter all elements starting with h. Additionally, replace e with X for these filtered elements.
> let items = ['handed', 'hand', 'handy', 'unhanded', 'handle', 'hand-2']
> items.filter(w => test(w)).map(w => w.replace()) // add your solution here
< ['handXd', 'hand', 'handy', 'handlX', 'hand-2']10) Why does the following code show false instead of true?
> /end$/.test('bend it\nand send\n')
< false1) For the given input array, filter all elements that start with den or end with ly.
> let items = ['lovely', '1\ndentist', '2 lonely', 'eden', 'fly\n', 'dent']
> items.filter() // add your solution here
< ['lovely', '2 lonely', 'dent']2) For the given array, filter all elements having a line starting with den or ending with ly.
> let items = ['lovely', '1\ndentist', '2 lonely', 'eden', 'fly\nfar', 'dent']
> items.filter() // add your solution here
< ['lovely', '1\ndentist', '2 lonely', 'fly\nfar', 'dent']3) For the given input strings, replace all occurrences of removed or reed or received or refused with X.
> let s1 = 'creed refuse removed read'
> let s2 = 'refused reed redo received'
> const pat1 = // add your solution here
> s1.replace(pat1, 'X')
< 'cX refuse X read'
> s2.replace(pat1, 'X')
< 'X X redo X'4) For the given input strings, replace late or later or slated with A.
> let str1 = 'plate full of slate'
> let str2 = "slated for later, don't be late"
> const pat2 = // add your solution here
> str1.replace(pat2, 'A')
< 'pA full of sA'
> str2.replace(pat2, 'A')
< "A for A, don't be A"1) Transform the given input strings to the expected output using the same logic on both strings.
> let str1 = '(9-2)*5+qty/3-(9-2)*7'
> let str2 = '(qty+4)/2-(9-2)*5+pq/4'
> const pat1 = // add your solution here
> str1.replace() // add your solution here
< '35+qty/3-(9-2)*7'
> str2.replace() // add your solution here
< '(qty+4)/2-35+pq/4'2) Replace (4)\| with 2 only at the start or end of the given input strings.
> let s1 = '2.3/(4)\\|6 fig 5.3-(4)\\|'
> let s2 = '(4)\\|42 - (4)\\|3'
> let s3 = 'two - (4)\\|\n'
> const pat2 = // add your solution here
> s1.replace() // add your solution here
< '2.3/(4)\\|6 fig 5.3-2'
> s2.replace() // add your solution here
< '242 - (4)\\|3'
> s3.replace() // add your solution here
< 'two - (4)\\|\n'3) Replace any matching element from the array items with X for given the input strings. Match the elements from items literally. Assume no two elements of items will result in any matching conflict.
> let items = ['a.b', '3+n', 'x\\y\\z', 'qty||price', '{n}']
// add your solution here
> const pat3 = // add your solution here
> '0a.bcd'.replace(pat3, 'X')
< '0Xcd'
> 'E{n}AMPLE'.replace(pat3, 'X')
< 'EXAMPLE'
> '43+n2 ax\\y\\ze'.replace(pat3, 'X')
< '4X2 aXe'4) Replace the backspace character \b with a single space character for the given input string.
> let ip = '123\b456'
> ip.replace() // add your solution here
< '123 456'5) Replace all occurrences of \e with e.
> let ip = 'th\\er\\e ar\\e common asp\\ects among th\\e alt\\ernations'
> ip.replace() // add your solution here
< 'there are common aspects among the alternations'6) Replace any matching item from the array eqns with X for given the string ip. Match the items from eqns literally.
> let ip = '3-(a^b)+2*(a^b)-(a/b)+3'
> let eqns = ['(a^b)', '(a/b)', '(a^b)+2']
// add your solution here
> const pat4 = // add your solution here
> ip.replace(pat4, 'X')
< '3-X*X-X+3'
sflag for these exercises depending upon the contents of the input strings.
1) Replace 42//5 or 42/5 with 8 for the given input.
> let ip = 'a+42//5-c pressure*3+42/5-14256'
// add your solution here
< 'a+8-c pressure*3+8-14256'2) For the array items, filter all elements starting with hand and ending immediately with at most one more character or le.
> let items = ['handed', 'hand', 'handled', 'handy', 'unhand', 'hands', 'handle']
// add your solution here
< ['hand', 'handy', 'hands', 'handle']3) Use the split() method to get the output as shown for the given input strings.
> let eqn1 = 'a+42//5-c'
> let eqn2 = 'pressure*3+42/5-14256'
> let eqn3 = 'r*42-5/3+42///5-42/53+a'
> const pat1 = // add your solution here
> eqn1.split(pat1)
< ['a+', '-c']
> eqn2.split(pat1)
< ['pressure*3+', '-14256']
> eqn3.split(pat1)
< ['r*42-5/3+42///5-', '3+a']4) For the given input strings, remove everything from the first occurrence of i till the end of the string.
> let s1 = 'remove the special meaning of such constructs'
> let s2 = 'characters while constructing'
> let s3 = 'input output'
> const pat2 = // add your solution here
> s1.replace(pat2, '')
< 'remove the spec'
> s2.replace(pat2, '')
< 'characters wh'
> s3.replace(pat2, '')
< ''5) For the given strings, construct a regexp to get the output as shown.
> let str1 = 'a+b(addition)'
> let str2 = 'a/b(division) + c%d(#modulo)'
> let str3 = 'Hi there(greeting). Nice day(a(b)'
> const remove_parentheses = // add your solution here
> str1.replace(remove_parentheses, '')
< 'a+b'
> str2.replace(remove_parentheses, '')
< 'a/b + c%d'
> str3.replace(remove_parentheses, '')
< 'Hi there. Nice day'6) Correct the given regexp to get the expected output.
> let words = 'plink incoming tint winter in caution sentient'
// wrong output
> const w1 = /int|in|ion|ing|inco|inter|ink/g
> words.replace(w1, 'X')
"plXk XcomXg tX wXer X cautX sentient"
// expected output
> const w2 = // add your solution here
> words.replace(w2, 'X')
"plX XmX tX wX X cautX sentient"7) For the given greedy quantifiers, what would be the equivalent form using the {m,n} representation?
?is same as*is same as+is same as
8) (a*|b*) is same as (a|b)* — true or false?
9) For the given input strings, remove everything from the first occurrence of test (irrespective of case) till the end of the string, provided test isn't at the end of the string.
> let s1 = 'this is a Test'
> let s2 = 'always test your regexp for corner\ncases'
> let s3 = 'a TEST of skill tests?'
> let pat3 = // add your solution here
> s1.replace(pat3, '')
< 'this is a Test'
> s2.replace(pat3, '')
< 'always '
> s3.replace(pat3, '')
< 'a '10) For the input array words, filter all elements starting with s and containing e and t in any order.
> let words = ['sequoia', 'subtle', 'exhibit', 'a set', 'sets', 'tests', 'site']
// add your solution here
< ['subtle', 'sets', 'site']11) For the input array words, remove all elements having less than 6 characters.
> let words = ['sequoia', 'subtle', 'exhibit', 'asset', 'sets', 'tests', 'site']
// add your solution here
< ['sequoia', 'subtle', 'exhibit']12) For the input array words, filter all elements starting with s or t and having a maximum of 6 characters.
> let words = ['sequoia', 'subtle', 'exhibit', 'asset', 'sets', 't set', 'site']
// add your solution here
< ['subtle', 'sets', 't set', 'site']13) Delete from the string start if it is at the beginning of a line up to the next occurrence of the string end at the end of a line. Match these keywords irrespective of case.
> let para = `good start
start working on that
project you always wanted
to, do not let it end
hi there
start and end the end
42
Start and try to
finish the End
bye`
> const mpat = // add your solution here
> console.log(para.replace(mpat, ''))
< good start
hi there
42
bye14) Can you reason out why this code results in the output shown? The aim was to remove all <characters> patterns but not the <> ones. The expected result was 'a 1<> b 2<> c'.
> let ip = 'a<apple> 1<> b<bye> 2<> c<cat>'
> ip.replace(/<.+?>/g, '')
< 'a 1 2'15) Use the split() method to get the output as shown below for the given input strings.
> let s1 = 'go there :: this :: that'
> let s2 = 'a::b :: c::d e::f :: 4::5'
> let s3 = '42:: hi::bye::see :: carefully'
> const pat4 = // add your solution here
> s1.split() // add your solution here
< ['go there', 'this :: that']
> s2.split() // add your solution here
< ['a::b', 'c::d e::f :: 4::5']
> s3.split() // add your solution here
< ['42:: hi::bye::see', 'carefully']1) For the given strings, extract the matching portion from the first is to the last t.
> let str1 = 'What is the biggest fruit you have seen?'
> let str2 = 'Your mission is to read and practice consistently'
> const pat1 = // add your solution here
// add your solution here for str1
< 'is the biggest fruit'
// add your solution here for str2
< 'ission is to read and practice consistent'2) Find the starting index of the first occurrence of is or the or was or to for the given input strings. Assume that there will be at least one match for each input string.
> let s1 = 'match after the last newline character'
> let s2 = 'and then you want to test'
> let s3 = 'this is good bye then'
> let s4 = 'who was there to see?'
> const pat2 = // add your solution here
// add your solution here for s1
< 12
// add your solution here for s2
< 4
// add your solution here for s3
< 2
// add your solution here for s4
< 43) Find the starting index of the last occurrence of is or the or was or to for the given input strings. Assume that there will be at least one match for each input string.
> let s1 = 'match after the last newline character'
> let s2 = 'and then you want to test'
> let s3 = 'this is good bye then'
> let s4 = 'who was there to see?'
> const pat3 = // add your solution here
// add your solution here for s1
< 12
// add your solution here for s2
< 18
// add your solution here for s3
< 17
// add your solution here for s4
< 144) The given input string contains : exactly once. Extract all characters after the : as output.
> let ip = 'fruits:apple, mango, guava, blueberry'
// add your solution here
< 'apple, mango, guava, blueberry'5) Extract all words between ( and ) from the given input string as an array (including the parentheses). Assume that the input will not contain any broken parentheses.
> let ip = 'another (way) to reuse (portion) matched (by) capture groups'
// add your solution here
< ['(way)', '(portion)', '(by)']6) Extract all occurrences of < up to the next occurrence of >, provided there is at least one character in between < and >.
> let ip = 'a<apple> 1<> b<bye> 2<> c<cat>'
// add your solution here
< ['<apple>', '<> b<bye>', '<> c<cat>']7) Use matchAll() to get the output as shown below for the given input strings. Note the characters used in the input strings carefully.
> let row1 = '-2,5 4,+3 +42,-53 4356246,-357532354 '
> let row2 = '1.32,-3.14 634,5.63 63.3e3,9907809345343.235 '
> const pat4 = // add your solution here
// add your solution here for row1
< (4) [Array(2), Array(2), Array(2), Array(2)]
0: (2) ['-2', '5']
1: (2) ['4', '+3']
2: (2) ['+42', '-53']
3: (2) ['4356246', '-357532354']
length: 4
[[Prototype]]: Array(0)
// add your solution here for row2
< (3) [Array(2), Array(2), Array(2)]
0: (2) ['1.32', '-3.14']
1: (2) ['634', '5.63']
2: (2) ['63.3e3', '9907809345343.235']
length: 3
[[Prototype]]: Array(0)8) This is an extension to the previous question. Sum each pair of numbers that are separated by a comma.
- For
row1, find the sum of integers. For example, sum of-2and5is3. - For
row2, find the sum of floating-point numbers. For example, sum of1.32and-3.14is-1.82.
> let row1 = '-2,5 4,+3 +42,-53 4356246,-357532354 '
> let row2 = '1.32,-3.14 634,5.63 63.3e3,9907809345343.235 '
// should be same as the previous question
> const pat5 = // add your solution here
// add your solution here for row1
< [3, 7, -11, -353176108]
// add your solution here for row2
< [-1.82, 639.63, 9907809408643.234]9) Use the split() method to get the output as shown below.
> let ip = '42:no-output;1000:car-tr:u-ck;SQEX49801'
// add your solution here
< ['42', 'output', '1000', 'tr:u-ck', 'SQEX49801']10) Write a string function that changes the given input to alternate case. The first alphabet should be changed to lowercase, the next one to uppercase and then lowercase and so on. Characters other than alphabets should be left alone and not affect case changing.
> function aLtErNaTeCaSe(ip) {
// add your solution here
}
> aLtErNaTeCaSe('HI THERE!')
< 'hI tHeRe!'
> aLtErNaTeCaSe('good morning')
< 'gOoD mOrNiNg'
> aLtErNaTeCaSe('Sample123string42with777numbers')
< 'sAmPlE123sTrInG42wItH777nUmBeRs'11) Replace all occurrences of par with spar, spare with extra and park with garden.
> let s1 = 'apartment has a park'
> let s2 = 'do you have a spare cable'
> let s3 = 'write a parser'
> let d1 = // add your solution here
> const pat6 = // add your solution here
> s1.replace(pat6, k => d1[k])
< 'aspartment has a garden'
> s2.replace(pat6, k => d1[k])
< 'do you have a extra cable'
> s3.replace(pat6, k => d1[k])
< 'write a sparser'12) Name the flag and property you can use with the match() method to get both the starting and ending locations of the matched portions.
1) For the array items, filter all elements starting with hand and ending with s or y or le. No other character in between, for example, hands should match but not hand-has.
> let items = ['-handy', 'hand', 'handy', 'unhand', 'hands', 'hand-icy', 'handle']
// add your solution here
< ['handy', 'hands', 'handle']2) Replace all whole words reed or read or red with X.
> let ip = 'redo red credible :read: rod reed bred'
// add your solution here
< 'redo X credible :X: rod X bred'3) For the array words, filter all elements containing e or i followed by l or n. Note that the order mentioned should be followed.
> let words = ['surrender', 'unicorn', 'newer', 'door', 'empty', 'eel', 'pest']
// add your solution here
< ['surrender', 'unicorn', 'eel']4) For the array words, filter all elements containing e or i and l or n in any order.
> let words = ['surrender', 'unicorn', 'newer', 'door', 'empty', 'eel', 'pest']
// add your solution here
< ['surrender', 'unicorn', 'newer', 'eel']5) Extract all hex character sequences, with 0x optional prefix. Match the characters case insensitively, and the sequences shouldn't be surrounded by other word characters.
> let str1 = '128A foo 0xfe32 34 0xbar'
> let str2 = '0XDEADBEEF place 0x0ff1ce bad'
> const hex_seq = // add your solution here
> str1.match(hex_seq)
< ['128A', '0xfe32', '34']
> str2.match(hex_seq)
< ['0XDEADBEEF', '0x0ff1ce', 'bad']6) Delete from ( to the next occurrence of ) unless they contain parentheses characters in between.
> let str1 = 'def factorial()'
> let str2 = 'a/b(division) + c%d(#modulo) - (e+(j/k-3)*4)'
> let str3 = 'Hi there(greeting). Nice day(a(b)'
> const remove_parentheses = // add your solution here
> str1.replace(remove_parentheses, '')
< 'def factorial'
> str2.replace(remove_parentheses, '')
< 'a/b + c%d - (e+*4)'
> str3.replace(remove_parentheses, '')
< 'Hi there. Nice day(a'7) For the array words, filter all elements not starting with e or p or u.
> let words = ['surrender', 'unicorn', 'newer', 'door', 'empty', 'eel', '(pest)']
// add your solution here
< ['surrender', 'newer', 'door', '(pest)']8) For the array words, filter all elements not containing u or w or ee or -.
> let words = ['p-t', 'you', 'tea', 'heel', 'owe', 'new', 'reed', 'ear']
// add your solution here
< ['tea', 'ear']9) The given input strings contain fields separated by , and fields can be empty too. Replace the last three fields with WHTSZ323.
> let row1 = '(2),kite,12,,D,C,,'
> let row2 = 'hi,bye,sun,moon'
> const pat1 = // add your solution here
// add your solution here for row1
< '(2),kite,12,,D,WHTSZ323'
// add your solution here for row2
< 'hi,WHTSZ323'10) Split the given strings based on consecutive sequence of digit or whitespace characters.
> let s1 = 'lion \t Ink32onion Nice'
> let s2 = '**1\f2\n3star\t7 77\r**'
> const pat2 = // add your solution here
> s1.split(pat2)
< ['lion', 'Ink', 'onion', 'Nice']
> s2.split(pat2)
< ['**', 'star', '**']11) Delete all occurrences of the sequence <characters> where characters is one or more non > characters and cannot be empty.
> let ip = 'a<apple> 1<> b<bye> 2<> c<cat>'
// add your solution here
< 'a 1<> b 2<> c'12) \b[a-z](on|no)[a-z]\b is same as \b[a-z][on]{2}[a-z]\b. True or False? Sample input lines shown below might help to understand the differences, if any.
> console.log('known\nmood\nknow\npony\ninns')
known
mood
know
pony
inns13) For the given array, filter elements containing any number sequence greater than 624.
> let items = ['hi0000432abcd', 'car00625', '42_624 0512', '3.14 96 2 foo1234baz']
// add your solution here
< ['car00625', '3.14 96 2 foo1234baz']14) Convert the given input string to two different arrays as shown below.
> let ip = 'price_42 roast^\t\n^-ice==cat\neast'
// add your solution here
< ['price_42', 'roast', 'ice', 'cat', 'east']
// add your solution here
< ['price_42', ' ', 'roast', '^\t\n^-', 'ice', '==', 'cat', '\n', 'east']15) Filter all elements whose first non-whitespace character is not a # character. Any element made up of only whitespace characters should be ignored as well.
> let items = [' #comment', '\t\napple #42', '#oops', 'sure', 'no#1', '\t\r\f']
// add your solution here
< ['\t\napple #42', 'sure', 'no#1']16) For the given string, surround all whole words with {} except par and cat.
> let ip = 'part; cat {super} rest_42 par scatter'
// add your solution here
< '{part}; cat {{super}} {rest_42} par {scatter}'1) Replace the space character that occurs after a word ending with a or r with a newline character.
> let ip = 'area not a _a2_ roar took 22'
> console.log() // add your solution here
area
not a
_a2_ roar
took 222) Add [] around words starting with s and containing e and t in any order.
> let ip = 'sequoia subtle exhibit asset sets2 tests si_te'
// add your solution here
< 'sequoia [subtle] exhibit asset [sets2] tests [si_te]'3) Replace all whole words with X that start and end with the same word character (irrespective of case). Single character word should get replaced with X too, as it satisfies the stated condition.
> let ip = 'oreo not a _a2_ Roar took 22'
// add your solution here
< 'X not X X X took X'4) Convert the given markdown headers to corresponding anchor tags. Consider the input to start with one or more # characters followed by space and word characters. The name attribute is constructed by converting the header to lowercase and replacing spaces with hyphens. Can you do it without using a capture group?
> let header1 = '# Regular Expressions'
> let header2 = '## Named capture groups'
> function hyphenify(m) {
// add your solution here
}
> header1.replace() // add your solution here
< "# <a name='regular-expressions'></a>Regular Expressions"
> header2.replace() // add your solution here
< "## <a name='named-capture-groups'></a>Named capture groups"5) Convert the given markdown anchors to corresponding hyperlinks.
> let anchor1 = "# <a name='regular-expressions'></a>Regular Expressions"
> let anchor2 = "## <a name='subexpression-calls'></a>Subexpression calls"
> const hyperlink = // add your solution here
> anchor1.replace() // add your solution here
< '[Regular Expressions](#regular-expressions)'
> anchor2.replace() // add your solution here
< '[Subexpression calls](#subexpression-calls)'6) Check if the given input strings have words with at least two consecutive repeated alphabets irrespective of case. For example, words like stillnesS and Committee should return true but words like root or readable or rotational should return false. Consider word to be as defined in regular expression parlance.
> let s1 = 'readable COMMItTEe'
> let s2 = 'rotational sti1lness _foot_'
> let s3 = 'needed repeated'
> let s4 = 'offsh00t'
> const pat1 = // add your solution here
> pat1.test(s1)
true
> pat1.test(s2)
false
> pat1.test(s3)
false
> pat1.test(s4)
true7) For the given input string, replace all occurrences of digit sequences with only the unique non-repeating sequence. For example, 232323 should be changed to 23 and 897897 should be changed to 897. If there are no repeats (for example 1234) or if the repeats end prematurely (for example 12121), it should not be changed.
> let ip = '1234 2323 453545354535 9339 11 60260260'
// add your solution here
< '1234 23 4535 9339 1 60260260'8) Replace sequences made up of words separated by : or . by the first word of the sequence. Such sequences will end when : or . is not followed by a word character.
> let ip = 'wow:Good:2_two.five: hi-2 bye kite.777:water.'
// add your solution here
< 'wow hi-2 bye kite'9) Replace sequences made up of words separated by : or . by the last word of the sequence. Such sequences will end when : or . is not followed by a word character.
> let ip = 'wow:Good:2_two.five: hi-2 bye kite.777:water.'
// add your solution here
< 'five hi-2 bye water'10) Split the given input string on one or more repeated sequence of cat.
> let ip = 'firecatlioncatcatcatbearcatcatparrot'
// add your solution here
< ['fire', 'lion', 'bear', 'parrot']11) For the given input string, find all occurrences of digit sequences with at least one repeating sequence. For example, 232323 and 897897. If the repeats end prematurely, for example 12121, it should not be matched.
> let ip = '1234 2323 453545354535 9339 11 60260260'
> const pat2 = // add your solution here
// entire sequences in the output
// add your solution here
< ['2323', '453545354535', '11']
// only the unique sequence in the output
// add your solution here
< ['23', '4535', '1']12) Convert the comma separated strings to corresponding key-value pair mapping as shown below. The keys are name, maths and phy for the three fields in the input strings.
> let row1 = 'rohan,75,89'
> let row2 = 'rose,88,92'
> const pat3 = // add your solution here
// add your solution here for row1
< {name: 'rohan', maths: '75', phy: '89'}
// add your solution here for row2
< {name: 'rose', maths: '88', phy: '92'}13) Surround all whole words with (). Additionally, if the whole word is imp or ant, delete them. Can you do it with just a single substitution?
> let ip = 'tiger imp goat eagle ant important'
// add your solution here
< '(tiger) () (goat) (eagle) () (important)'
1) Replace all whole words with X unless it is preceded by a ( character.
> let ip = '(apple) guava berry) apple (mango) (grape'
// add your solution here
< '(apple) X X) X (mango) (grape'2) Replace all whole words with X unless it is followed by a ) character.
> let ip = '(apple) guava berry) apple (mango) (grape'
// add your solution here
< '(apple) X berry) X (mango) (X'3) Replace all whole words with X unless it is preceded by ( or followed by ) characters.
> let ip = '(apple) guava berry) apple (mango) (grape'
// add your solution here
< '(apple) X berry) X (mango) (grape'4) Extract all whole words that do not end with e or n.
> let ip = 'a_t row on Urn e note Dust n end a2-e|u'
// add your solution here
< ['a_t', 'row', 'Dust', 'end', 'a2', 'u']5) Extract all whole words that do not start with a or d or n.
> let ip = 'a_t row on Urn e note Dust n end a2-e|u'
// add your solution here
< ['row', 'on', 'Urn', 'e', 'Dust', 'end', 'e', 'u']6) Extract all whole words only if they are followed by : or , or -.
> let ip = 'Poke,on=-=so_good:ink.to/is(vast)ever2-sit'
// add your solution here
< ['Poke', 'so_good', 'ever2']7) Extract all whole words only if they are preceded by = or / or -.
> let ip = 'Poke,on=-=so_good:ink.to/is(vast)ever2-sit'
// add your solution here
< ['so_good', 'is', 'sit']8) Extract all whole words only if they are preceded by = or : and followed by : or ..
> let ip = 'Poke,on=-=so_good:ink.to/is(vast)ever2-sit'
// add your solution here
< ['so_good', 'ink']9) Extract all whole words only if they are preceded by = or : or . or ( or - and not followed by . or /.
> let ip = 'Poke,on=-=so_good:ink.to/is(vast)ever2-sit'
// add your solution here
< ['so_good', 'vast', 'sit']10) Remove the leading and trailing whitespaces from all the individual fields where , is the field separator.
> let csv1 = ' comma ,separated ,values \t\r '
> let csv2 = 'good bad,nice ice , 42 , , stall small'
> const trim_whitespace = // add your solution here
> csv1.replace(trim_whitespace, '')
< 'comma,separated,values'
> csv2.replace(trim_whitespace, '')
< 'good bad,nice ice,42,,stall small'11) Filter elements that satisfy all of these rules:
- should have at least two alphabets
- should have at least three digits
- should have at least one special character among
%or*or#or$ - should not end with a whitespace character
> let pwds = ['hunter2', 'F2h3u%9', '*X3Yz3.14\t', 'r2_d2_42', 'A $B C1234']
// add your solution here
< ['F2h3u%9', 'A $B C1234']12) For the given string, surround all whole words with {} except for whole words par and cat and apple.
> let ip = 'part; cat {super} rest_42 par scatter apple spar'
// add your solution here
< '{part}; cat {{super}} {rest_42} par {scatter} apple {spar}'13) Extract the integer portion of floating-point numbers for the given string. A number ending with . and no further digits should not be considered.
> let ip = '12 ab32.4 go 5 2. 46.42 5'
// add your solution here
< ['32', '46']14) For the given input strings, extract all overlapping two character sequences.
> let s1 = 'apple'
> let s2 = '1.2-3:4'
> const pat1 = // add your solution here
// add your solution here for s1
< ['ap', 'pp', 'pl', 'le']
// add your solution here for s2
< ['1.', '.2', '2-', '-3', '3:', ':4']15) The given input strings contain fields separated by the : character. Delete : and the last field if there is a digit character anywhere before the last field.
> let s1 = '42:cat'
> let s2 = 'twelve:a2b'
> let s3 = 'we:be:he:0:a:b:bother'
> let s4 = 'apple:banana-42:cherry:'
> let s5 = 'dragon:unicorn:centaur'
> const pat2 = // add your solution here
> s1.replace(pat2, '')
< '42'
> s2.replace(pat2, '')
< 'twelve:a2b'
> s3.replace(pat2, '')
< 'we:be:he:0:a:b'
> s4.replace(pat2, '')
< 'apple:banana-42:cherry'
> s5.replace(pat2, '')
< 'dragon:unicorn:centaur'16) Extract all whole words unless they are preceded by : or <=> or ---- or #.
> let ip = '::very--at<=>row|in.a_b#b2c=>lion----east'
// add your solution here
< ['at', 'in', 'a_b', 'lion']17) Match strings if it contains qty followed by price but not if there is any whitespace character or the string error between them.
> let str1 = '23,qty,price,42'
> let str2 = 'qty price,oh'
> let str3 = '3.14,qty,6,errors,9,price,3'
> let str4 = '42\nqty-6,apple-56,price-234,error'
> let str5 = '4,price,3.14,qty,4'
> let str6 = '(qtyprice) (hi-there)'
> const neg = // add your solution here
> neg.test(str1)
< true
> neg.test(str2)
< false
> neg.test(str3)
< false
> neg.test(str4)
< true
> neg.test(str5)
< false
> neg.test(str6)
< true18) Can you reason out why the following regular expressions behave differently?
> let ip = 'I have 12, he has 2!'
> ip.replace(/\b..\b/g, '{$&}')
< '{I }have {12}{, }{he} has{ 2}!'
> ip.replace(/(?<!\w)..(?!\w)/g, '{$&}')
< 'I have {12}, {he} has {2!}'19) Simulate string partitioning to get an array of three elements — string before the separator, portion matched by the separator and string after the separator. For the first case, split the given input string on the first occurrence of digits. For the second case, split based on the last occurrence of digits.
> let w2 = 'Sample123string42with777numbers'
// add your solution here for splitting based on the first occurrence
< ['Sample', '123', 'string42with777numbers']
// add your solution here for splitting based on the last occurrence
< ['Sample123string42with', '777', 'numbers']20) Find the starting index of the last occurrence of is or the or was or to for the given input strings using the search() method. Assume that there will be at least one match for each input string.
> let s1 = 'match after the last newline character'
> let s2 = 'and then you want to test'
> let s3 = 'this is good bye then'
> let s4 = 'who was there to see?'
> const pat3 = // add your solution here
> s1.search(pat3)
< 12
> s2.search(pat3)
< 18
> s3.search(pat3)
< 17
> s4.search(pat3)
< 141) Check if the given input strings are made up of ASCII characters only. Consider the input to be non-empty strings and any character that isn't part of the 7-bit ASCII set should result in false.
> let str1 = '123 × 456'
> let str2 = 'good fοοd'
> let str3 = 'happy learning!'
> const pat1 = // add your solution here
> pat1.test(str1)
< false
> pat1.test(str2)
< false
> pat1.test(str3)
< true2) Retain only the punctuation characters for the given string.
> let ip = '❨a❩❪1❫❬b❭❮2❯❰c❱❲3❳❴xyz❵⟅123⟆⟦⟧⟨like⟩⟪3.14⟫'
// add your solution here
< '❨❩❪❫❬❭❮❯❰❱❲❳❴❵⟅⟆⟦⟧⟨⟩⟪.⟫'3) Is the following code snippet showing the correct output?
> 'fox:αλεπού'.match(/\w+/g)
< ['fox']4) Name the set operations enabled by the v flag.
5) Extract all whole words from the given strings. However, do not match words if they contain any character present in the ignore variable.
> let s1 = 'match after the last new_line character A2'
> let s2 = 'and then you want to test'
> let ignore = 'aty'
> const ign1 = // add your solution here
> s1.match(ign1)
< ['new_line', 'A2']
> s2.match(ign1)
< null
> let ignore = 'esw'
// should be the same solution used above
> const ign2 = // add your solution here
> s1.match(ign2)
< ['match', 'A2']
> s2.match(ign2)
< ['and', 'you', 'to']