Write a program to reverse a singly linked list? Modify that program to reverse a doubly linked list.
Ruby Data Structures Interview Questions
What is a hashtable? Give an example of a type of problem that a hashtable is useful for.
For the data structures: Array and Linked List explain:
- Where you might use them
- Operations that are commonly supported (add, insert etc)
Write a function to take the following list and return one list of odd numbers and one list of even numbers:
ints = [1,21,53,84,50,66,7,38,9]
Discuss an algorithm to traverse a tree, depth first.
Write a function to efficiently determine the result of a game of Tic Tac Toe.
The function takes as input the game and the sign (x or o) of the player. The function returns if this player has won the game or not.
Carefully consider both the data structure and the algorithm for your answer.
Express the following table as a static structure, and write a function,
find_routes(source, destination) that efficiently outputs all possible routes.
Source | Dest ~~~~~~ ~~~~ Seattle | LA LA | Florida LA | Maine Florida | Seattle Seattle | Florida
The solution for
find_routes('Seattle', 'Florida') should be
[Seattle -> Florida, Seattle -> LA -> Florida]
Write function that takes a binary tree and efficiently returns the Nth smallest element.
For example, if N=4, and the tree looks like:
3 / \ 2 5 / / \ 1 4 6
The function should return 4.
Write a function that takes as input a binary tree, and prints out each level of the tree on a newline. For example:
a / \ b c / / \ d e f
a b c d e f