A good algorithm usually comes together with a set of good data structures that allow the algorithm to manipulate the data efficiently. Choosing the right algorithm and data structure to solve a problem can have huge implications on the performance of an application.
Choosing the right data structure to solve a problem can have huge implications on the performance of an application. Knowing when to use a specific data structure is one of the most important skills for a programmer.
A queue is a collection of items that are maintained in a sequence and can be modified by the addition of entities at one end of the sequence and removal from the other end of the sequence. It is the collection to be used when first-in-first-out (FIFO) collection is needed.
A stack is dynamic data container that follows the Last In First Out (LIFO) principle. Developers should use stack when the last item to be inserted into a container is the first one to be deleted from it.
Public questions (free account) are common interview questions. They are great for practicing, or if you want to filter candidates using the classic problems.
Since we’re all biased and we use incorrect proxies, why not just outsource hiring to experts or recruitment agencies? After all, they’ve been screening people for many years, so they must know how to do it right?
Not really. I was surprised to discover that many experts disagree with each other. Everybody praises their pet method and criticizes the others. Many of these methods look legitimate, but are based on...