\$9.99
Minimum price
\$14.99
Suggested price

### The Algorithm Interview Guide

###### An interview guide with a detailed step-by-step explanation to the most commonly asked questions and patterns.

A comprehensive step-by-step approach for learning algorithms for coding interviews. 50 questions with well-explained solutions that cater to both the struggling and also experienced. All solutions are explained well in detail with the help of pseudocode and also with Java. The solutions also covers the common algorithmic patterns that are used.

• ### Categories

• Java
• Computer Science
• ### Feedback

Email the Author(s)

Rajesh Mohanan

Rajesh has been part of developing large scale software projects over the last 15 years.

• Introduction
• O(n) the Complexities
• Moving Zeroes
• The Majority Element
• Sub Array With the Maximum Sum Of Size k
• Longest Sequence With k Distinct Characters
• Sum of Pairs With Target Sum
• The Dutch National Flag Problem
• Remove Duplicates From a Linked List
• A brief Introduction to Recursion
• Is the Array a Palindrome
• Print the Perimeter of a Binary Tree
• Level Order Successor
• Lowest Common Ancestor of a Binary Search Tree
• Lowest Common Ancestor of a Binary Tree
• Sum of All Paths of a Binary Tree
• Top k Frequent Number
• Maximum Profit
• Longest Palindromic Subsequence
• Longest Common Subsequence
• Counting Negative numbers from a Sorted Matrix
• Valid Parenthesis Sequence
• Merging Intervals
• Check for Conflicting Intervals
• In-place sorting
• Find the Duplicate Number From an Array
• Finding Median
• Find All the Subsets
• Find all the Permutations
• Search in an Infinite Array
• Find the kth Smallest Number
• Find the Number of Islands
• Grouping Anagrams
• Search a rotated Array
• Sum of Deepest Node
• Longest Common Prefix
• Common Elements of 3 Arrays
• Flood Fill
• Find the Nth Highest number from a Binary Search Tree
• Evaluate an arithmetic expression
• Make a fully connected network
• Mirror a Binary Tree
• Starting and Ending index of an element in a Sorted Array
• Merge Two Sorted Arrays
• ZigZag String conversion
• Represent Number in words
• Construct Binary Tree from preorder and inorder traversal inputs
• Rotate Image
• Sort a given Array using Quick Sort
• Merge Sort

### The Leanpub 60 Day 100% Happiness Guarantee

Within 60 days of purchase you can get a 100% refund on any Leanpub purchase, in two clicks.

Now, this is technically risky for us, since you'll have the book or course files either way. But we're so confident in our products and services, and in our authors and readers, that we're happy to offer a full money back guarantee for everything we sell.

You can only find out how good something is by trying it, and because of our 100% money back guarantee there's literally no risk to do so!

So, there's no reason not to click the Add to Cart button, is there?

See full terms...

### 80% Royalties. Earn \$16 on a \$20 book.

#### We pay 80% royalties. That's not a typo: you earn \$16 on a \$20 sale. If we sell 5000 non-refunded copies of your book or course for \$20, you'll earn \$80,000.(Yes, some authors have already earned much more than that on Leanpub.)In fact, authors have earnedover \$13 millionwriting, publishing and selling on Leanpub.Learn more about writing on Leanpub

If you buy a Leanpub book, you get free updates for as long as the author updates the book! Many authors use Leanpub to publish their books in-progress, while they are writing them. All readers get free updates, regardless of when they bought the book or how much they paid (including free).

Most Leanpub books are available in PDF (for computers) and EPUB (for phones, tablets and Kindle). The formats that a book includes are shown at the top right corner of this page.

Finally, Leanpub books don't have any DRM copy-protection nonsense, so you can easily read them on any supported device.