GeeksforGeeks

implement a func node *(char *word){}
wich returns a link list of words dat are anagrams with the input word..if no anagrams found return NULL and add that word to the link list

given structure of list as
struct node {
struct node *next;
char val[101];
};

Given numbers 1 to 1000, suggest a data structure to store them such that following operations can be executed in constant time:
1- insertion,
2- deletion,
3- searching,
4- get_any_number (means return any number if present in the data-structure otherwise return -1).

NOTE: Numbers are unique in the data structure.

for a given file(80 column and 100 lines) find in how many lines a word occur. the answer is like:

"the" in line 5,8,23.
"name" in line 45,23...

for all the words.

Given two arrays, one is 1D array and other is 2D array. U need to find out whether 2D array contains the subset of 1D array. The elements of 1D array not neccessary present in the same row it can be either on the up or down but should be continuous in the 2D array.

Perform inplace(we cant create new node)merge of two sorted linked lists.

What kind a data structure will you use to implement an Instant Search feature.

Running time as faster as you can. Logarithmic time expected !!

Do not use in built log function or __builtin_clz

Given an array-based heap on n elements and a real number x, efficiently determine whether the kth smallest element in the heap is greater than or equal to x. Your algorithm should be O(k) in the worst-case, independent of the size of the heap.

write an algorithm finding the no.of one bits from 1 to n,for given any n value.
complexity should be good
example:
1=1
2=10
3=11
4=100
5=101
6=110
.
.
if n=3 then ur answer is 4
if n=6 then ur answer is 9

Interviewer is looking for an algo in O(log n)time complexity

Get the depth of a tree without using recursion

You are given a linked list. Apart from the normal "Next" pointer, there is one more pointer(random ptr) in each node which points to some random node of the list. How will you create a clone of such a list? (In less than O(n^2))

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

Given an array (length n), we need to find the subarray (length k) such that the sum of the first j elements of the subarray equals the sum of the remaining (k-j) elements of the subarray.
For e.g.
Array: 2,2,13,4,7,3,8,12,9,1,5
Output: 4,7,3,8,12,9,1 [4+7+3+8=12+9+1]
Could this be done with a complexity better than O(n^3)

What is the complexity of an algorithm to check whether a binary tree is symmetric or not. No need to check the data only the structure needs to be verified.

Find least jumps to reach end of the array:
Given an array of Integers,if u are on ith element u can make max arr jumps. If i am at an element with value zero, i cannot move forward.find the least selection to reach end of the array.
ex: 1 3 5 8 9 2 6 7 6 8 9 starting with arr[0] i can only make one jump to 3, from 3 i can jump either 1 step 0r 2 steps 0r 3 steps.
my solution is 1 to 3 to 8, 3 selection and i am done.
Device an algo for this

given an array. find all the elements
which repeats more than once.

gave O(n) solution using hash, but
wants a better solution.

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