Assume that you are given the head and tail pointers of a doubly linked list where each node can also have a single child pointer to another similar doubly linked list. There are no cycles in this structure outside of the traditional double links. Write a procedure in C++ that flattens this structure into a single list.
Division without divide operator
Given a race track with 5 lanes, 25 bunnies, and no timer, how many races are required to find the top 3 fastest bunnies?
How will you check to see if two integer arrays have any common elements?
How would you find a duplicate number in a very large unsorted array of ints.
1. find-all-anagrams-in-a-string 2. find common ancestor for a n-ary tree These two questions have to use JAVA to solve.
If you were a hostess at a restaurant, how would you implement a data structure to organize the reservations given x number of people per table, y number of tables, reservation time intervals of 30 minutes from 6pm-11pm, and time durations of parties at a table being one hour?
2nd largest number in an array
Write breadth-first search in a matrix
Can we use the final keyword with the constructor?
Affichage de 1 - 10 questions d’entretien