# 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.


---

# Agent Instructions: Querying This Documentation

If you need additional information that is not directly available in this page, you can query the documentation dynamically by asking a question.

Perform an HTTP GET request on the current page URL with the `ask` query parameter:

```
GET https://blog.sunilgudivada.dev/notebook/interview-questions/google-interview-questions.md?ask=<question>
```

The question should be specific, self-contained, and written in natural language.
The response will contain a direct answer to the question and relevant excerpts and sources from the documentation.

Use this mechanism when the answer is not explicitly present in the current page, you need clarification or additional context, or you want to retrieve related documentation sections.