Google Interview Preparation
Here, you can find all the technical resources (articles, coding problems, subjective problems, video tutorials and interview experiences) that are helpful in preparing for "Google Interview" !!
Popular Articles
- Sum of bit differences among all pairs
- Modular Exponentiation (Power in Modular Arithmetic)
- Sum of bit differences among all pairs
- Inplace rotate square matrix by 90 degrees | Set 1
- Backtracking | Set 7 (Sudoku)
- Meta Strings (Check if two strings can become same after a swap in one string)
- Find largest word in dictionary by deleting some characters of given string
- Count of strings that can be formed using a, b and c under given constraints
- Count BST nodes that lie in a given range
- Sum of all the numbers that are formed from root to leaf paths
- Merge two BSTs with limited extra space
- Find all triplets with zero sum
- The Celebrity Problem
- Dynamic Programming | Set 31 (Optimal Strategy for a Game)
- Given a sorted dictionary of an alien language, find order of characters
- Check if a Binary Tree contains duplicate subtrees of size 2 or more
- Show All Articles
Popular Subjective Problems
- What is output of printf("\5");
- Predict Output and have Fun at Google
- Thrashing in OS
- Why are manhole covers round?
- Mutual exclusion and race condition
- Preprocessor Directive "pragma" in C
- Big Endian Vs Little Endian
- Design data structures for a very large social network like Facebook or Linkedln?
- Preemption of programs
- Show All Subjective Problems
Popular Coding Problems
- Subarray with given sum
- Maximum Index
- Find median in a stream
- Finding the numbers
- Word Boggle
- Connect Nodes at Same Level
- The Celebrity Problem
- LRU Cache
- Count BST nodes that lie in a given range
- Find triplets with zero sum
- Show All Coding Problems
Popular Video Tutorials
Recent Interview Experiences
- The Google Foo Bar Challenge
- Ways of transforming one string to other by removing 0 or more characters
- Alphanumeric Abbreviations of a String
- Longest Possible Chunked Palindrome
- Paper Cut into Minimum Number of Squares | Set 2
- Find median of BST in O(n) time and O(1) space
- Sum of bit differences among all pairs
- Minimum number of swaps required for arranging pairs adjacent to each other
- Google Interview Experience | Set 5 (for Java Position)
- Find the longest substring with k unique characters in a given string
- Show All Interview Experiences
