Write a function that outputs a string that shows pagination information for a website. The string must show the current page, lowest page index, highest page index, with some "padding" around the current page. Example output: "1 ... 4 5 (6) 7 8 ... 30" for a site with 30 pages where the user is on page 6 "1 (2) 3 4 ... 30" for a site with 30 pages where the user is on page 2
Which would be a better data structure for searching: a linked-list or an arraylist?
If memory is limited, which data structure is better: hashtable or binary tree?
List 5 words that describe you.
If there are 3 switches in one room and 1 lightbulb in another, and you can only go from the room with the switches to the room with the bulb once, how would you determine which switch turns on the bulb?
Tell me about a time you had to deal with a difficult team member
STAR style question around difficult management scenario I encountered.
There was a question on longest common subsequence (dynamic programming).
The question was pretty straightforward. Given a random number generator, and an array consists of M numbers, generate a number from 1 to N, but not in that array.
Given a list of lists, implement the iterator interface, and write code for next() and hasNext().
Viewing 631 - 640 interview questions