We help IT Professionals succeed at work.

We've partnered with Certified Experts, Carl Webster and Richard Faulkner, to bring you a podcast all about Citrix Workspace, moving to the cloud, and analytics & intelligence. Episode 2 coming soon!Listen Now


Data Structure Puzzle

Medium Priority
Last Modified: 2009-07-11
Hi Expert's

        Can Any one send me liunk for Data Structure Puzzle's and Problem So that i can try to solve it

Watch Question

Top Expert 2006

Hi avinash_takale,

1) Given an singly linked list and poisition "n", we have to remove the nth item from end.
2) Remove the duplicates in an array.
3) Find if there is a loop in a linked list
4) Shift ahead a block of elements in an array
5) Implement two stacks in one array
6) find first common ancestor for any two nodes in a tree
7) Given an array of characters which form a sentence of words, give an efficient algorithm to reverse the order of the words (not characters) in it.
8) Reverse a linked list.
9) Extracting unique elements from a sorted list
10) Given a singly linked list, print out its contents in reverse order.
11) Given a singly linked list, find the middle of the list.
12) How do you represent an n-ary tree? Write a program to print the nodes of such a tree in breadth first order.

Top Expert 2006
Hi avinash_takale,

Few more --
- sort a linked list.
- wild card string matching
- routines to read and write a bounded buffer.
- routines to manage a heap using an existing array


Not the solution you were looking for? Getting a personalized solution is easy.

Ask the Experts
Few additions

* Implement "tail" command of unix.
Note: tail prints n number of lines from end of the file.... i.e. last n lines

* You have given a stack library. using that library implement queue.

* Find offset of a member variable in a structure.
Hi Avinash,
If you have an idea about sockets, do the above work as a cliant-server app.
client sends the request and server sends back the response to the client.

Prashant Sabnekar
Access more of Experts Exchange with a free account
Thanks for using Experts Exchange.

Create a free account to continue.

Limited access with a free account allows you to:

  • View three pieces of content (articles, solutions, posts, and videos)
  • Ask the experts questions (counted toward content limit)
  • Customize your dashboard and profile

*This site is protected by reCAPTCHA and the Google Privacy Policy and Terms of Service apply.


Please enter a first name

Please enter a last name

8+ characters (letters, numbers, and a symbol)

By clicking, you agree to the Terms of Use and Privacy Policy.