GeeksforGeeks

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

implementing stacks and queues using inheritance from linked list???

Predict the Output:

#include<stdio.h>
void main()
{
        char ch1[]="hello", ch2[]="hello";
        if (ch1==ch2)
                printf("Equal\n");
        else
                printf("Unequal\n");
}

I executed this on Linux terminal and got the answer as Unequal. Can anyone please explain how this is happening?

What is the difference between an ORDERED and UNORDERED data structure?

How do you partition an array into 2 parts such that the two parts have equal average?...each partition may contain elements that are non-contiguous in the array....

Please suggest a good book for practicing problems on Data Structures. I need to work very hard in this area.

Suppose you are a search engine owner and want to show adv to make money. How will you filter the advertisements to be shown when users searches for something. Take into consideration that advertisers will not be interested in showing adds to all geographical locations and some types of add may be banned in some locations.
For eg : There is a alcohol selling company. Now alcohol adv is banned in india so this advertisement should not be shown. Also an adv in India might not want to show...

Implement a Queue using a Stack ADT. He told me to write “tight” code for this as well. He wanted optimized methods for this, and asked me to enumerate different ways of optimizing this data structure, and to analyze each one. After I did that, he asked me whether my code would handle multiple simultaneous access to the data structure, and asked to handle that case as well.

Design a data structure which will support the following operation : given a seven letter word, return all valid words which are anagrams of this word. He wanted a data structure which would be optimized for space, and another one optimized for time.
Write the code to implement the aforementioned function given the data structure.

data structure TO use to design a phonebook. What is time complexity for retrieving, adding etc

Given 2 trees A and B find if tree B is a subtree of Tree A or not. Provide the most optimized solution that you can think of.

Predic the output of the following code snippet.

main()
{
char *ch1 = "Rajesh";
char *ch2;
ch2 = (char *)malloc (20);
memset (ch2.0.20);
while (*ch2++ = *ch1++)
printf("%s\n",ch2);
}

The answer is empty output or no output. I executed this on Linux terminal but it shows a few blank lines followed by the Prompt.

Can anyone please explain what this function is trying to do and why do we get a few blank l...

Given a Binary Tree and its depth d find the number of leaf nodes in that tree.

Note - In Geeks for Geeks the solution given for this problem is a recursive one without using any depth, but here in this question we need to make use of the depth d in some way to give the solution.

Given The Linked List remove the all duplicates elements from it while order should be maintained i mean 3-1-2-1-2 so o/p should be 3-2-1 e.g order of linked list shouldn't be broken & we have to
return the original linked list without duplication

Only O(N) or strictly less then O(N^2) Solution Required.

find the longest repeated substring given an input string. eg. given "banana" you should find "anana"

Given a string, find the length of the longest substring without repeating characters. For example, the longest substring without repeating letters for “abcabcbb” is “abc”, which the length is 3. For “bbbbb” the longest substring is “b”, with the length of 1.

hope example is correct??

Design a data structure that can be used instead of an array and avoids the "high-cost" (i.e. O(n)) of initializing the array. the data structure ought to holds n items and supports the following operations in O(1) time:
* Init – Initializes the data structure to empty.
* Set(i, x) – Sets item x at index i in the data structure.
* Get(i) – Gets the item stored in index i (or 'empty' if nothing is there).
Remark: the data structure should use O(n) space.