GeeksforGeeks

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

Print each character and no. of consecutive repetitions of that character in a string
for eg. input: aabbcbaeeez
ouput : a2b2cbae3z

Give a regular expression to validate the input in a textarea (in javascript) such that:
1. there should be minimum 3 characters
2. the first character is always /
3. the entire string shouldnot match the exact string '/abc' and '/xyz' but it can be anyother like /abce or /abcmn etc...

Anyone can give a hint? Thanks.

Given a string consisting of a,b and c's, we can perform the following operation: Take any two adjacent distinct characters and replace it with the third character. For example, if 'a' and 'c' are adjacent, they can replaced with 'b'. What is the smallest string which can result by applying this operation repeatedly?

Input:
The first line contains the number of test cases T. T test cases follow. Each case contains the string you start with.<...

The basic idea is to sort both the strings and then to compare each letter in the character array.

int IsAnagram(char *a, char *b)
{
    int len1=strlen(a);
    int len2=strlen(b);
    if (len1 != len2)
    {
        return false;
    }
    int *array_a = malloc(sizeof(int)*(len1+1));
    int *array_b = malloc(sizeof(int)*(len2+1));
    for (int i = 0; i < len1; i++)
    {
        array_a[i] = a[i] - '0';
        array_b[i] = b[i] - '0';
    }

    m_sort(array_a, 0,len1);
    m_s...

Three strings say A,B,C are given to you. Check weather 3rd string is interleaved from string A and B.

Ex: A="abcd" B="xyz" C="axybczd". answer is yes.

Given two strings find the combination of strings which can be interleave
i/p: if "AB" and "CD" are two strings
o/p:
ABCD
ACBD
ACDB
ACBD
CABD
CDAB

how to implement it in C..

Print all the substrings of a given string. Is there any solution better than O(2^n).

Eg: abc the possible substrings are {"a","b","c","ab","bc","abc}

This is a Question asked by Amazon during Written test....

The Question is like you have to print all possible combination of a given length let's say 'k' of a string in lexicographic order.
for Example:- input String=az k=2;
output
aa

az

za

zz..

thanks to vivek providing this solution
char op[k];
void printllex(char *s, int k,int n)
{

  int i;
  for(i=0;i<strlen(s);i++)
  {
        op[n]=s[i]
        if(n==k)
...

You are given a function printMostFrequentWords which takes in an array of strings. You are required to print a list of all the letters that occurred with the highest frequency in each line of the array, followed by the frequency.
The list of letters should be an alphabetical list of upper case letters followed by an alphabetical list of lower case letters.
Sample Test Cases:

Input #00:
When riding your bicycle backwards down a one-way street, if the
wheel fall...

How to find all the permutations of a string such that two equal permutations appear only once.
That is all permutations should be unique

Given a string in hex, convert it into int. Write test cases for the same.

Given a string containing multiple words such that spaces between words is missing. Also, you have a dictionary containing valid words.

Ex. "Thatwouldbefantastic"

Output a string with proper spaces inserted.

Output - "That would be fantastic"

The case of words like bandwidth present can be discounted.

Write a function to check if the two passed strings are anagrams of each other.

Given a string consisting of a, b and c's, we can perform the following operation: Take any two adjacent distinct characters and replace it with the third character. For example, if 'a' and 'c' are adjacent, they can replaced with 'b'.

What is the smallest string which can result by applying this operation repeatedly?

We want to implement the functions allocstring, freestring, concatestring, and stringlength. We need to optimize the functions in this order : stringlength, allocstring, freestring, concatestring, with stringlength requiring the most optimizations. We are also given that the memory consists of a buffer of fixed size. We have to design and describe a data structure which would enable the above operations to be performed in an efficient manner.

c program for sting statement reversing order to display.

ex.
input:
have a nice day.
output:
day nice a have.