# Coding Interview Patterns

## Coding Interview Patterns

- [Coding Interview Patterns](https://dvpr.gitbook.io/coding-interview-patterns/readme.md)
- [1. Pattern: Sliding Window](https://dvpr.gitbook.io/coding-interview-patterns/1.-pattern-sliding-window.md)
- [1.0 Introduction](https://dvpr.gitbook.io/coding-interview-patterns/1.-pattern-sliding-window/1.0-introduction.md)
- [1.1 Maximum Sum Subarray of Size K (easy)](https://dvpr.gitbook.io/coding-interview-patterns/1.-pattern-sliding-window/1.1-maximum-sum-subarray-of-size-k-easy.md)
- [1.2 Smallest Subarray with a given sum (easy)](https://dvpr.gitbook.io/coding-interview-patterns/1.-pattern-sliding-window/1.2-smallest-subarray-with-a-given-sum-easy.md)
- [1.3 Longest Substring with K Distinct Characters (medium)](https://dvpr.gitbook.io/coding-interview-patterns/1.-pattern-sliding-window/1.3-longest-substring-with-k-distinct-characters-medium.md)
- [1.4 Fruits into Baskets (medium)](https://dvpr.gitbook.io/coding-interview-patterns/1.-pattern-sliding-window/1.4-fruits-into-baskets-medium.md)
- [1.5 No-repeat Substring (hard)](https://dvpr.gitbook.io/coding-interview-patterns/1.-pattern-sliding-window/1.5-no-repeat-substring-hard.md)
- [1.6 Longest Substring with Same Letters after Replacement (hard)](https://dvpr.gitbook.io/coding-interview-patterns/1.-pattern-sliding-window/1.6-longest-substring-with-same-letters-after-replacement-hard.md)
- [1.7 Longest Subarray with Ones after Replacement (hard)](https://dvpr.gitbook.io/coding-interview-patterns/1.-pattern-sliding-window/1.7-longest-subarray-with-ones-after-replacement-hard.md)
- [1.8 - Permutation in a String (hard)](https://dvpr.gitbook.io/coding-interview-patterns/1.-pattern-sliding-window/1.8-permutation-in-a-string-hard.md)
- [1.9 String Anagrams (hard)](https://dvpr.gitbook.io/coding-interview-patterns/1.-pattern-sliding-window/1.9-string-anagrams-hard.md)
- [1.10 Smallest Window containing Substring (hard)](https://dvpr.gitbook.io/coding-interview-patterns/1.-pattern-sliding-window/1.10-smallest-window-containing-substring-hard.md)
- [1.11 Words Concatenation (hard)](https://dvpr.gitbook.io/coding-interview-patterns/1.-pattern-sliding-window/1.11-words-concatenation-hard.md)
- [2. Pattern: Two Pointers](https://dvpr.gitbook.io/coding-interview-patterns/2.-pattern-two-pointers.md)
- [2.0 Introduction](https://dvpr.gitbook.io/coding-interview-patterns/2.-pattern-two-pointers/2.0-introduction.md)
- [2.1 Pair with Target Sum (easy)](https://dvpr.gitbook.io/coding-interview-patterns/2.-pattern-two-pointers/2.1-pair-with-target-sum-easy.md)
- [2.2 Remove Duplicates (easy)](https://dvpr.gitbook.io/coding-interview-patterns/2.-pattern-two-pointers/2.2-remove-duplicates-easy.md)
- [2.3 Squaring a Sorted Array (easy)](https://dvpr.gitbook.io/coding-interview-patterns/2.-pattern-two-pointers/2.3-squaring-a-sorted-array-easy.md)
- [2.4 Triplet Sum to Zero (medium)](https://dvpr.gitbook.io/coding-interview-patterns/2.-pattern-two-pointers/2.4-triplet-sum-to-zero-medium.md)
- [2.5 Triplet Sum Close to Target (medium)](https://dvpr.gitbook.io/coding-interview-patterns/2.-pattern-two-pointers/2.5-triplet-sum-close-to-target-medium.md)
- [2.6 Triplets with Smaller Sum (medium)](https://dvpr.gitbook.io/coding-interview-patterns/2.-pattern-two-pointers/2.6-triplets-with-smaller-sum-medium.md)
- [2.7 Subarrays with Product Less than a Target (medium)](https://dvpr.gitbook.io/coding-interview-patterns/2.-pattern-two-pointers/2.7-subarrays-with-product-less-than-a-target-medium.md)
- [2.8 Dutch National Flag Problem (medium)](https://dvpr.gitbook.io/coding-interview-patterns/2.-pattern-two-pointers/2.8-dutch-national-flag-problem-medium.md)
- [2.9 Comparing Strings containing Backspaces (medium)](https://dvpr.gitbook.io/coding-interview-patterns/2.-pattern-two-pointers/2.9-comparing-strings-containing-backspaces-medium.md)
- [2.10 Minimum Window Sort (medium)](https://dvpr.gitbook.io/coding-interview-patterns/2.-pattern-two-pointers/2.10-minimum-window-sort-medium.md)
- [7. Pattern: Tree Breadth First Search](https://dvpr.gitbook.io/coding-interview-patterns/untitled.md)
- [7.0 Introduction](https://dvpr.gitbook.io/coding-interview-patterns/untitled/7.0-introduction.md)
- [7.1 Binary Tree Level Order Traversal (easy)](https://dvpr.gitbook.io/coding-interview-patterns/untitled/7.1-binary-tree-level-order-traversal-easy.md)
- [7.2 Reverse Level Order Traversal (easy)](https://dvpr.gitbook.io/coding-interview-patterns/untitled/7.2-reverse-level-order-traversal-easy.md)
- [7.3 Zigzag Traversal (medium)](https://dvpr.gitbook.io/coding-interview-patterns/untitled/7.3-zigzag-traversal-medium.md)
- [7.4 Level Averages in a Binary Tree (easy)](https://dvpr.gitbook.io/coding-interview-patterns/untitled/7.4-level-averages-in-a-binary-tree-easy.md)
- [7.5 Minimum Depth of a Binary Tree (easy)](https://dvpr.gitbook.io/coding-interview-patterns/untitled/7.5-minimum-depth-of-a-binary-tree-easy.md)
- [7.6 Maximum Depth of Binary Tree (easy)](https://dvpr.gitbook.io/coding-interview-patterns/untitled/7.6-maximum-depth-of-binary-tree-easy.md)
- [7.7 Level Order Successor (easy)](https://dvpr.gitbook.io/coding-interview-patterns/untitled/7.7-level-order-successor-easy.md)
- [7.8 Connect Level Order Siblings (medium)](https://dvpr.gitbook.io/coding-interview-patterns/untitled/7.8-connect-level-order-siblings-medium.md)
- [7.9 Problem Challenge 1 - Connect All Level Order Siblings (medium)](https://dvpr.gitbook.io/coding-interview-patterns/untitled/7.9-problem-challenge-1-connect-all-level-order-siblings-medium.md)
- [7.10 Problem Challenge 2 - Right View of a Binary Tree (easy)](https://dvpr.gitbook.io/coding-interview-patterns/untitled/7.10-problem-challenge-2-right-view-of-a-binary-tree-easy.md)
- [11. Pattern: Modified Binary Search](https://dvpr.gitbook.io/coding-interview-patterns/11.-pattern-modified-binary-search.md)
- [11.1 Introduction](https://dvpr.gitbook.io/coding-interview-patterns/11.-pattern-modified-binary-search/11.1-introduction.md)
- [11.2 Order-agnostic Binary Search (easy)](https://dvpr.gitbook.io/coding-interview-patterns/11.-pattern-modified-binary-search/11.2-order-agnostic-binary-search-easy.md)
- [11.3](https://dvpr.gitbook.io/coding-interview-patterns/11.-pattern-modified-binary-search/11.3.md)
- [16. Pattern: Topological Sort (Graph)](https://dvpr.gitbook.io/coding-interview-patterns/16.-pattern-topological-sort-graph.md)
- [16.1 Introduction](https://dvpr.gitbook.io/coding-interview-patterns/16.-pattern-topological-sort-graph/16.1-introduction.md)
- [16.2 Topological Sort (medium)](https://dvpr.gitbook.io/coding-interview-patterns/16.-pattern-topological-sort-graph/16.2-topological-sort-medium.md)
- [16.3 Tasks Scheduling (medium)](https://dvpr.gitbook.io/coding-interview-patterns/16.-pattern-topological-sort-graph/16.3-tasks-scheduling-medium.md)
- [16.4 Tasks Scheduling Order (medium)](https://dvpr.gitbook.io/coding-interview-patterns/16.-pattern-topological-sort-graph/16.4-tasks-scheduling-order-medium.md)
- [Contributor Covenant Code of Conduct](https://dvpr.gitbook.io/coding-interview-patterns/code_of_conduct.md)
- [Page 1](https://dvpr.gitbook.io/coding-interview-patterns/page-1.md)


---

# Agent Instructions
This documentation is published with GitBook. GitBook is the documentation platform designed so that both humans and AI agents can read, navigate, and reason over technical content effectively. Learn more at gitbook.com.

## Querying This Documentation
If you need additional information, you can query the documentation dynamically by asking a question.
Perform an HTTP GET request on a page URL with the `ask` query parameter:
```
GET https://dvpr.gitbook.io/coding-interview-patterns/readme.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.