GeeksforGeeks

Given any even length String eg. ABCD1234. Shuffle it so that it gets re-arranged to A1B2C3D4.
Require an O(N) Time Complexity & O(1) space solution

Other sample inputs
ABC123 => A1B2C3
ABCDEFGHIJ1234567890 => A1B2C3D4E5F6G7H8I9J0

given a string of the form a2b3 produce the string aabbb from it

You are given a maze filled with characters in which you can move either above or below or left or right. You have to search for words in this database

give an algorithm to find the largest palindrome in a string in linear time. for eg if the input is afaabacabaad
then o/p shd be aabacabaa..

Given a string, first remove all repeated consecutive substring with length 1, then delete substring of length 2 and so on...
Example : string is “abcabeccced”

After removing repeated substring of length 1: “abcababceccced” --> “abcababceced” (2 'c' are removed)
After removing repeated substring of length 2: “abcababceced” --> “abcabceced” (substring “ab” is removed)
and so on...

How do you find the largest repeating string and the number of times it repeats in a given string efficiently off-course !?

ex :
String : "abc fghi bc kl abcd lkm abcdefg"
Ans : "abcd" count = 2

Remove Repeated Characters in a string in a language of 2^40 characters

Write code to evaluate a string if it matches a regular expression A*BC+
eg:

Input: AAAABC
result: True

Input: BC
result: True

Input : AB
result: False

Input:AC
result:False

You are given two strings A and B, you have to find out whether all the characters of A are present in B or not?

Given all 26 characters, generate all strings of length 'n' which do not contain a given string as a substring.

there are two sub problems here

how will you generate all the strings of length n... are they talking about permutation

Let your thoughts pour in

You have a file containing lines of text and then each line has words.

a) Find out the maximum occurring word in the file.
b) Now you are given a starting line number and ending line number ls and le. Find out the most frequently occurring word in the paragraph.
c) Now we slide this window until the file is finished and u should be able to tell the most occurring word in that paragraph represented by the window. Basically the window is moved like by incrementing ls and le b...

Given a string *Str of ASCII characters, write the pseudocode to remove the duplicate elements present in them. For example, if the given string is "Potato", then, the output has to be "Pota". Additional constraint is, the algorithm has to be in-place( no extra data structures allowed) . Extend your algorithm to remove duplicates in the string which consisted of UNICODE characters.

Given a sentence ex:"I love Microsoft" reverse the string as "Microsoft love I".

Given a string *Str of ASCII characters, write the pseudocode to remove the duplicate elements present in them. For example, if the given string is "Potato", then, the output has to be "Pota". Additional constraint is, the algorithm has to be in-place( no extra data structures allowed) . Extend your algorithm to remove duplicates in the string which consisted of UNICODE characters.

WAP for inplace removal of vowels from a char string.

Given a string str1, find if another string str2 is circularly shifted version of str1. i.e if str1 is "abcd" then str2 can be "abcd", "bcda", "cdab", "dabc"

program to tokenize a given string