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?
In a file, find the number of times a word shows up
There were no unreasonably tough questions.
There are 25 Netware workstations on a rack, attached to one Netware server. You can only get 20 to see the network at a time. What steps do you take to troubleshoot this?
where do you want to work?
"What's your favorite data structure?"
How does a jet engine work?
Not the actual question, I've modified a bit: Find the element(s) in an integer array such that if it's removed, the rest of the array can be divided into 2 sub-arrays of equal sums. The sub-arrays need not contain contiguous elements. There may be 0 or more answers.
Viewing 291 - 300 interview questions