GeeksforGeeks

How to find the largest palindrome in the string??

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.

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)
...

Given a sentence, count the palindromes inside the sentence. Do not consider the palindromes inside a palindrome. Write test cases.

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.

Given a file, return the list of all the words which occurs exactly n times in the file

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.

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 a word, convert it into a Palindrome with minimum addition of letters to it. letters can be added anywhere in the word. for eg if hello is given, result should be hellolleh

write a method to find the smallest angle between two hands when the time is given as input???

removing all the repeated character of string in O(1) space given all
would be in [A-Z a-z]

(i) If A is be replaced by B, B is replaced by D and C is replaced by F & goes to the end with same scenario. Write a program to get the replaced value of “ SMART “

(ii) Write a Program to Mix your First Name & Surname’s character’s alternatively.
eg: For “ AMIT KUMAR” result would be “ AKMUIMTAR”