GOOGLE interview books by Lin Quan | JOURNEY OF LIFE

GOOGLE interview books by Lin Quan | JOURNEY OF LIFE

1) Top 10 coding interview problems and solutions asked in Google

2) Top 20 coding interview problems and solutions asked in Google

Flipkart 

Amazon 

Top 10 coding interview problems asked in Google with solutions (English)

CONTENTS listed below

// referred from FLIPKART : 

Matching Nuts and Bolts Optimally

• Basic Analysis 
• Partitioning 
• STL Style Partitioning 
• std:partition 
• Quicksort
• STL Style Quicksort
• Quicksort Using stdxpartition
• Randomized Quicksort
• Deterministic Algorithm for Nuts n Bolts
• Remarks

Searching two-dimensional sorted array

• Basic Analysis 
• Precondition (Aka Input Assertion) 
• Postcondition (Aka Result Assertion) 
• Invariant 
• Contract the rectangular Region 
• Saddleback Search Algorithm 
• C++11 Implementation 
• Time Complexity 
• Variation 
• Find First Occurrence 
• Find All Occurrences
• Saddleback Count 
• Remarks

Lowest Common Ancestor(LCA) Problem

• Basic Analysis
• Simple Solution  
• C++ Implementation
• Tree Structure
• Compute LCA : C++ : Stack Based
• Compute LCA : C++ : Level Based
• Constant Time LCA
• Complete Binary Tree
• Path Number
• LCA Queries in Complete Bi - n wy Tree 
• The General LCA Algorithm

Max Sub-Array Problem

• Kadane's Algorithm
• C+-1-11 Implementation 
• Usage
• Find Indices of Max Subarray
• C++11 Implementation
• Usage
• Time Complexity
• Find Subarray with Sum Closest to zero  
• Find Subarray with Sum Closest to K  
• Maximum 2D Aubarray Problem
• K-Maximum Sub-Array Problem

Compute Next Higher Number

• Basic Analysis
• Algorithm
• C++ Implementation 
• std::next Permutation 
• Compute Previous lower Number

2D Binary Search

• Basic Analysis
• 1D Binary Search  
• Row Based 2D Binary Search  
• Time Complexity
• Diagonal Based 2D Binary Search

String Edit Distance

• Introduction 
• Edit Distance
• Levenshtein Edit distance
• Damerau Edit distance
• Dynamic Programming
• Recurrence : Computing the Levenshtein Edit Distance 
• C++ Implementation 
• Time Complexity 109
• Recurrence : Computing the Damerau
• Edit distance
• Space Optimization
• Properties
• Reduction to Single Source Shortest Path Problem

 Searching in Two Dimensional Sequence

• Basic Analysis 
• Precondition 
• Postcondition
• Invariant 
• Deducing-Conditional-Statement 
• Revisiting Postcondition
• Establishing Postcondition
• Complement of condition 
• Condition 
• 8.2 Internals 
• Putting together 
• C++11 Implementation 
• Usage 
• Alternative Program 
• Time Complexity 

Select Kth Smallest Element

• Basic Analysis 
• Simultaneous Min-Max Algorithm
• Generic Select 
• Randomized Quick Select Algorithm 
• Algorithm 
• C++11 Implementation 
• Iterative Version of Quick Select Algorithm

Searching in Possibly Empty Two Dimensional

• Sequence
• Basic Analysis 
• Input Assertion 
• Output Assertion 
• Invariant 
• Condition 
• C++11 Implementation 
• Usage 
• Time Complexity 
• Correctness

Top 20 coding interview problems asked in Google with solutions

1.  Matching Nuts and Bolts Optimally
2.  Searching Two - Dimensional Sorted Array
3.  Lowest Common Ancestor (LCA) Problem
4.  Max Sub - Array Problem
5.  Compute Next Higher Number
6.  2D Binary Search
7.  String Edit Distance
8.  Searching in Two Dimensional Sequence
9.  Select Kth Smallest Element
10. Searching in Possibly Empty Two Dimensional Sequence
11. The Celebrity Problem
12. Switch and Bulb Problem
13. Interpolation Search
14. The Majority Problem
15. The Plateau Problem
16. Segment Problems
17. Efficient Permutation
18. The Non - Crooks Problem
19. Median Search Problem
20. Missing Integer Problem

Read full article from GOOGLE interview books by Lin Quan | JOURNEY OF LIFE