GeeksforGeeks

Implement function to find needle from a haystack. Interviewer was looking for coding skills.

Given a stream of numbers, design a data structure to store the numbers in the stream along with their no. of occurrences

Implement auto calling functionality of the mobile phone(T9)

given an n*m matrix of letters and a dictionary find all the valid words from it.Implement the functions that you wud use on dictionary .Ex func like bool isValidWord(String) ..which you would use on dictionary

write a program to generate the Dyck Word from given string.??

A Dyck word is a string consisting of n X's and n Y's such that no initial segment of the string has more Y's than X's

how you will find the lowest common ancestor(LCA) in Binary Tree..its clear its Binary Tree not The4 Binary Search Tree ??

How to delete the duplicates in a Binary Tree?

Description:
eg. Tree
A
B C
D.C -.F
FH

output:
A
B C
D.H -.F

Here C & F are repeated. If a node value is duplicated, the duplicated value which comes later in the BFS of the tree should be eliminated, its left/right child should be linked to the deleted node's parent (if the children are not duplicated values).

What is the shortest single line in a C program which will take more than a google years to execute, but will eventually complete? You are permitted to have code before or after the line, but execution of the code must remain on that line, meaning no function calls, etc. Assume a processor which executes 1 billion operations a second.

Design a jigsaw puzzle?

Find the k-th Smallest Element in the Union of Two Sorted Arrays

Given a stack and any other data structure

write the code for push() , pop(), max_stack() in O(1) complexity.

Give a non recursive algorithm that performs an inorder traversal without using a stack or any extra space.

Design a data structure that supports integer of unlimited size.Assume that you have unlimited memory. Implement functions to support addition and subtraction.

What is the possible problem if Hash Table grows more than 30 gb (ignore problems like bad hash function)

Suggest the data structures for Notepad?

You are developing a component that requries parsing a lot of XML tags. You have abstracted the responsibility of finding the handler to a class named XMLElement Dictionary. Your will be invoking GetHandlerTag method of this class to find the corresponding handler method for a given element name (code snippet is shown below).

Typedef HRESULT(*PFNElementHandler)(IXMLAttribute* pAttributes, unsigned_int32nAttributes);

PFNElementHandler pfnElementHandler =( PFNElementHandler)
xmlEleme...

A mail server exposes an interface as mentioned below. When given a day in the calendar a user, it gets the meetings mentioned as slots in calendar with start and end time for each meeting.

CalendarSlot *GetMeetings(char[] username, unsigned int day);
typedef struct
{
unsigned int StartTime;
unsigned int endTime;
}CalendarSlot

The developer has implemented a mail client function as mentioned below. This function takes in a list of users, internally uses the GetMeetings mai...