# Data Structures and Algorithms

## CS Theory And Problems

- [CS Theory And Problems](https://monica-granbois.gitbook.io/cs-theory-and-problems/cs-theory-and-problems.md): My space for notes and solutions to computer science algorithms, data structures and interview questions.
- [Big O Notation](https://monica-granbois.gitbook.io/cs-theory-and-problems/big-o/big-o-notation.md)
- [Binary Search](https://monica-granbois.gitbook.io/cs-theory-and-problems/algorithms/binary-search.md)
- [Breadth First Search (BFS)](https://monica-granbois.gitbook.io/cs-theory-and-problems/algorithms/breadth-first-search-bfs.md)
- [Depth First Search (DFS)](https://monica-granbois.gitbook.io/cs-theory-and-problems/algorithms/depth-first-search-dfs.md)
- [Dynamic Programming](https://monica-granbois.gitbook.io/cs-theory-and-problems/algorithms/dynamic-programming.md)
- [Kadane's Algorithm](https://monica-granbois.gitbook.io/cs-theory-and-problems/algorithms/kadanes-algorithm.md)
- [Kahn's Algorithm](https://monica-granbois.gitbook.io/cs-theory-and-problems/algorithms/kahns-algorithm.md)
- [Quickselect](https://monica-granbois.gitbook.io/cs-theory-and-problems/algorithms/quickselect.md)
- [Recursion](https://monica-granbois.gitbook.io/cs-theory-and-problems/algorithms/recursion.md)
- [Sorting Algorithms](https://monica-granbois.gitbook.io/cs-theory-and-problems/algorithms/sorting-algorithms.md)
- [Sliding Window](https://monica-granbois.gitbook.io/cs-theory-and-problems/algorithms/sliding-window.md)
- [Binary Heap](https://monica-granbois.gitbook.io/cs-theory-and-problems/data-structures/binary-heap.md)
- [Graph](https://monica-granbois.gitbook.io/cs-theory-and-problems/data-structures/graph.md)
- [Linked List](https://monica-granbois.gitbook.io/cs-theory-and-problems/data-structures/linked-list.md)
- [Trees](https://monica-granbois.gitbook.io/cs-theory-and-problems/data-structures/trees.md)
- [LeetCode](https://monica-granbois.gitbook.io/cs-theory-and-problems/problems/leetcode.md)
- [1. Two Sum](https://monica-granbois.gitbook.io/cs-theory-and-problems/problems/leetcode/1.-two-sum.md)
- [3. Longest Substring Without Repeating Characters](https://monica-granbois.gitbook.io/cs-theory-and-problems/problems/leetcode/3.-longest-substring-without-repeating-characters.md)
- [5. Longest Palindromic Substring](https://monica-granbois.gitbook.io/cs-theory-and-problems/problems/leetcode/5.-longest-palindromic-substring.md)
- [11. Container With Most Water](https://monica-granbois.gitbook.io/cs-theory-and-problems/problems/leetcode/11.-container-with-most-water.md)
- [15. 3 Sum](https://monica-granbois.gitbook.io/cs-theory-and-problems/problems/leetcode/15.-3-sum.md)
- [19. Remove Nth Node From End of List](https://monica-granbois.gitbook.io/cs-theory-and-problems/problems/leetcode/19.-remove-nth-node-from-end-of-list.md)
- [20. Valid Parentheses](https://monica-granbois.gitbook.io/cs-theory-and-problems/problems/leetcode/20.-valid-parentheses.md)
- [33. Search in Rotated Sorted Array](https://monica-granbois.gitbook.io/cs-theory-and-problems/problems/leetcode/33.-search-in-rotated-sorted-array.md)
- [49. Group Anagrams](https://monica-granbois.gitbook.io/cs-theory-and-problems/problems/leetcode/49.-group-anagrams.md)
- [53. Maximum Subarray](https://monica-granbois.gitbook.io/cs-theory-and-problems/problems/leetcode/53.-maximum-subarray.md)
- [55. Jump Game](https://monica-granbois.gitbook.io/cs-theory-and-problems/problems/leetcode/55.-jump-game.md)
- [56. Merge Intervals](https://monica-granbois.gitbook.io/cs-theory-and-problems/problems/leetcode/56.-merge-intervals.md)
- [76. Minimum Window Substring](https://monica-granbois.gitbook.io/cs-theory-and-problems/problems/leetcode/76.-minimum-window-substring.md)
- [98. Validate Binary Search Tree](https://monica-granbois.gitbook.io/cs-theory-and-problems/problems/leetcode/98.-validate-binary-search-tree.md)
- [105. Construct Binary Tree from Preorder and Inorder Traversal](https://monica-granbois.gitbook.io/cs-theory-and-problems/problems/leetcode/105.-construct-binary-tree-from-preorder-and-inorder-traversal.md)
- [121. Best Time to Buy and Sell Stock](https://monica-granbois.gitbook.io/cs-theory-and-problems/problems/leetcode/121.-best-time-to-buy-and-sell-stock.md)
- [133. Clone Graph](https://monica-granbois.gitbook.io/cs-theory-and-problems/problems/leetcode/133.-clone-graph.md)
- [141. Linked List Cycle](https://monica-granbois.gitbook.io/cs-theory-and-problems/problems/leetcode/141.-linked-list-cycle.md)
- [152. Maximum Product Subarray](https://monica-granbois.gitbook.io/cs-theory-and-problems/problems/leetcode/152.-maximum-product-subarray.md)
- [153. Find Minimum in Rotated Sorted Array](https://monica-granbois.gitbook.io/cs-theory-and-problems/problems/leetcode/153.-find-minimum-in-rotated-sorted-array.md)
- [200. Number of Islands](https://monica-granbois.gitbook.io/cs-theory-and-problems/problems/leetcode/200.-number-of-islands.md)
- [206. Reverse Linked List](https://monica-granbois.gitbook.io/cs-theory-and-problems/problems/leetcode/206.-reverse-linked-list.md)
- [207. Course Schedule](https://monica-granbois.gitbook.io/cs-theory-and-problems/problems/leetcode/207.-course-schedule.md)
- [217. Contains Duplicate](https://monica-granbois.gitbook.io/cs-theory-and-problems/problems/leetcode/217.-contains-duplicate.md)
- [226. Invert Binary Tree](https://monica-granbois.gitbook.io/cs-theory-and-problems/problems/leetcode/226.-invert-binary-tree.md)
- [238. Product of Array Except Self](https://monica-granbois.gitbook.io/cs-theory-and-problems/problems/leetcode/238.-product-of-array-except-self.md)
- [242. Valid Anagram](https://monica-granbois.gitbook.io/cs-theory-and-problems/problems/leetcode/242.-valid-anagram.md)
- [297. Serialize and Deserialize Binary Tree](https://monica-granbois.gitbook.io/cs-theory-and-problems/problems/leetcode/297.-serialize-and-deserialize-binary-tree.md)
- [347. Top K Frequent Elements](https://monica-granbois.gitbook.io/cs-theory-and-problems/problems/leetcode/347.-top-k-frequent-elements.md)
- [417. Pacific Atlantic Water Flow](https://monica-granbois.gitbook.io/cs-theory-and-problems/problems/leetcode/417.-pacific-atlantic-water-flow.md)
- [424. Longest Repeating Character Replacement](https://monica-granbois.gitbook.io/cs-theory-and-problems/problems/leetcode/424.-longest-repeating-character-replacement.md)
- [435. Non-overlapping Intervals](https://monica-granbois.gitbook.io/cs-theory-and-problems/problems/leetcode/435.-non-overlapping-intervals.md)
- [647. Palindromic Substrings](https://monica-granbois.gitbook.io/cs-theory-and-problems/problems/leetcode/647.-palindromic-substrings.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://monica-granbois.gitbook.io/cs-theory-and-problems/cs-theory-and-problems.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.