SDE

General Quantitative Aptitude , + Computer Fundamentals question related to pseudo code , as well as OS , Data Structures , as well as Time Complexities.

Number Of MCQs - 45

You are given a string “S”. Your task is to rearrange the characters of a string “S”, such that it does not contain any two adjacent characters which are the same.

If it is possible to rearrange the string “S”, then print any possible arrangement. else, print “not possible” without quotes.

For Example:

For a string  “qaacde”, This string has two same adjacent characters.
So, one possible way to rearrange the string is “qacade”. Now, this string does not have two adjacent characters that are the same. 

Which language do u prefer to code?

Time complexities of various algorithms , searching , sorting and various approaches.

Introduce yourself.

Why do you want to join this company?

Are you okay with the location?