QA Intern

UI testing automation.

You are given a string 'STR'. The string contains [a-z] [A-Z] [0-9] [special characters]. You have to find the reverse of the string.

For example:

 If the given string is: STR = "abcde". You have to print the string "edcba".

follow up:

Try to solve the problem in O(1) space complexity. 

You are given a string STR of length N. Your task is to remove all the vowels present in that string and print the modified string.

English alphabets ‘a’, ‘e’, ‘i’, ‘o’, ‘u’ are termed as vowels. All other alphabets are called consonants.

Note: You have to only remove vowels from the string. There will be no change in the relative position of all other alphabets.

For example:

(i)  If the input string is 'CodeGeek', the output should be CdGk after removing ‘o’ and ‘e’.

(ii) If the input string is 'Odinson', the output should be 'dnsn' after removing ‘o’ and ‘i’. 

The problem of finding the longest common substring (LCS) without repetition involves identifying the longest contiguous string of characters that appears in two or more given strings, with the added restriction that the substring cannot repeat in either string.

• How does Java compile? (Learn)
• Explain Runtime polymorphism vs Compile time polymorphism. (Learn)
• Explain the Access modifiers in Java. (Learn)

How to reverse a string in JavaScript? (Learn)

• Explain SQL Joins. (Learn)
• How is data managed in MongoDB? (Learn)