Searching and sorting for coding interviews

Searching and sorting for coding interviews

Author: kamal rawat
Rs. 0

Searching and sorting is as much about algorithms as it is about their

Book Title Searching and sorting for coding interviews
Type Book
Date Published Sep 28, 2018

Searching and sorting is as much about algorithms as it is about their

applicability. Each algorithm should be understood in a much broader

perspective. For example, selection sort, an otherwise not-so-good

algorithm, is one of the best when write-to-memory is a costly operation.

Usually our understanding of algorithms is little shallow, mostly

limited to understanding the logic and its time and space complexities.

This is probably because we study each algorithm individually and that

too on only array data structure. Most language libraries mix multiple

algorithms in their implementations to sort a collection. They also

disconnect comparator logic from sorting logic providing the flexibility to

use same algorithm on different data types.

Interviewers do not ask logic of searching and sorting algorithms

directly, but almost certainly, you will be talking about one of these

algorithms. This books gives you lot of perspective to have an impressive

and informed point of view on each topic.

Hiring pattern of companies is changing rapidly. Even big companies

are hiring online thru coding platforms like hackerrank.com, codechef.

com, etc. We also talk about question pattern and approaches to answer

questions on such platforms.

With almost every company moving toward agile development and

self-managed teams, job of typical manager is becoming redundant.