> For the complete documentation index, see [llms.txt](https://blog.sunilgudivada.dev/notebook/llms.txt). Markdown versions of documentation pages are available by appending `.md` to page URLs; this page is available as [Markdown](https://blog.sunilgudivada.dev/notebook/interview-questions/google-interview-questions.md).

# Google Interview Questions

**One week Preparation tips:**

Try to solve cover topics listed below along with good understanding of all the Data Structures like Graph, tree, LL, String, Set, Stack, Queue, Binary tree, Trie etc:

1. Binary Search, Priority Queue, Sliding Window (These will be used to optimize the solution) - LogN
2. Prefix Sum (This concept will be used to optimize O(N^2) time to O(N) time)
3. DSU (Disjoint set union) : A graph concept mostly asked in interview.
4. DP (1D , 2D) : Recursive Approach to better optimal Solution
5. Brute Force: You should always aware of Brute Force Solution because thats why interview get tricky.