Print all permutations of a string *using no extra memory\data structures* (pointer variables are ok) + after i solved that it became tougher - handle duplicates (E.g aaab permutation should not print duplicates)
Development Engineer Interview Questions
37,123 development engineer interview questions shared by candidates
how to reverse words in a string preserving the formatting
Consider n people with random birthdays. How large does n need to be before there is at least a 50% chance that two people have the same birthday?
Describe a data structure for which getValue(int index), setValue(int index, int value), and setAllValues(int value) are all O(1).
N people are sitting in a circle labelled 1 through n. They being counting 1,2,3,.... in a clockwise manner and every person that gets a number divisible by 3 is eliminated. Write a program to figure out which numbered person will remain. What's the time and space complexity?
Implement the fibonacci sequence
Reverse the individual words in a string (words are delimited by spaces). Example - "Hello world" becomes "olleH dlrow".
Find the max int in an onordered binary tree.
Diagonally flip a two dimensional array.
Given the root of a binary search tree, link all the nodes at the same level, by using an additional Node* level.
Viewing 681 - 690 interview questions