{"version":1,"pages":[{"id":"J5eKArkIv21JOlJCw0hN","title":"CS Theory And Problems","pathname":"/cs-theory-and-problems","siteSpaceId":"sitesp_1ytHE","description":"My space for notes and solutions to computer science algorithms, data structures and interview questions."},{"id":"9BU6BBEyNInqZ6KmAtK9","title":"Big O Notation","pathname":"/cs-theory-and-problems/big-o/big-o-notation","siteSpaceId":"sitesp_1ytHE","description":"","breadcrumbs":[{"label":"Big O"}]},{"id":"EqGpMRr346GCAYRda7Jr","title":"Binary Search","pathname":"/cs-theory-and-problems/algorithms/binary-search","siteSpaceId":"sitesp_1ytHE","description":"","breadcrumbs":[{"label":"Algorithms"}]},{"id":"lau7MagQCEBsOW3S37bQ","title":"Breadth First Search (BFS)","pathname":"/cs-theory-and-problems/algorithms/breadth-first-search-bfs","siteSpaceId":"sitesp_1ytHE","description":"","breadcrumbs":[{"label":"Algorithms"}]},{"id":"gELpfdpzFz0dDCrRtpzS","title":"Depth First Search (DFS)","pathname":"/cs-theory-and-problems/algorithms/depth-first-search-dfs","siteSpaceId":"sitesp_1ytHE","description":"","breadcrumbs":[{"label":"Algorithms"}]},{"id":"b4SplAgp5pQHGu7HQ3ci","title":"Dynamic Programming","pathname":"/cs-theory-and-problems/algorithms/dynamic-programming","siteSpaceId":"sitesp_1ytHE","description":"","breadcrumbs":[{"label":"Algorithms"}]},{"id":"oY5loRdIv1i09uafIXpY","title":"Kadane's Algorithm","pathname":"/cs-theory-and-problems/algorithms/kadanes-algorithm","siteSpaceId":"sitesp_1ytHE","description":"","breadcrumbs":[{"label":"Algorithms"}]},{"id":"e8FnpY3O0Kkb1hNeriEs","title":"Kahn's Algorithm","pathname":"/cs-theory-and-problems/algorithms/kahns-algorithm","siteSpaceId":"sitesp_1ytHE","description":"","breadcrumbs":[{"label":"Algorithms"}]},{"id":"embzgK2LHyheJG1IyYfH","title":"Quickselect","pathname":"/cs-theory-and-problems/algorithms/quickselect","siteSpaceId":"sitesp_1ytHE","description":"","breadcrumbs":[{"label":"Algorithms"}]},{"id":"pl4FJ8j4AxkgVd8PWgpw","title":"Recursion","pathname":"/cs-theory-and-problems/algorithms/recursion","siteSpaceId":"sitesp_1ytHE","description":"","breadcrumbs":[{"label":"Algorithms"}]},{"id":"d0JK1YBdb8j4CSYUcolB","title":"Sorting Algorithms","pathname":"/cs-theory-and-problems/algorithms/sorting-algorithms","siteSpaceId":"sitesp_1ytHE","description":"","breadcrumbs":[{"label":"Algorithms"}]},{"id":"qMFKHEHnfBKBZeMLCUWt","title":"Sliding Window","pathname":"/cs-theory-and-problems/algorithms/sliding-window","siteSpaceId":"sitesp_1ytHE","description":"","breadcrumbs":[{"label":"Algorithms"}]},{"id":"Q7Mum3s5naOa9Q7R76gk","title":"Binary Heap","pathname":"/cs-theory-and-problems/data-structures/binary-heap","siteSpaceId":"sitesp_1ytHE","description":"","breadcrumbs":[{"label":"Data Structures"}]},{"id":"Wh6KdtXQEHBQTGWFymey","title":"Graph","pathname":"/cs-theory-and-problems/data-structures/graph","siteSpaceId":"sitesp_1ytHE","description":"","breadcrumbs":[{"label":"Data Structures"}]},{"id":"8Jm2dQwhuh78gtkweFbU","title":"Linked List","pathname":"/cs-theory-and-problems/data-structures/linked-list","siteSpaceId":"sitesp_1ytHE","description":"","breadcrumbs":[{"label":"Data Structures"}]},{"id":"Il7wy2aMddYcQFDFhEOJ","title":"Trees","pathname":"/cs-theory-and-problems/data-structures/trees","siteSpaceId":"sitesp_1ytHE","description":"","breadcrumbs":[{"label":"Data Structures"}]},{"id":"7xZJaMDUsYOniSN4no64","title":"LeetCode","pathname":"/cs-theory-and-problems/problems/leetcode","siteSpaceId":"sitesp_1ytHE","description":"","breadcrumbs":[{"label":"Problems"}]},{"id":"3OOFqcx7T7cmqGVDXgB3","title":"1. Two Sum","pathname":"/cs-theory-and-problems/problems/leetcode/1.-two-sum","siteSpaceId":"sitesp_1ytHE","description":"","breadcrumbs":[{"label":"Problems"},{"label":"LeetCode"}]},{"id":"24wMr4bhBwia6lwieGYQ","title":"3. Longest Substring Without Repeating Characters","pathname":"/cs-theory-and-problems/problems/leetcode/3.-longest-substring-without-repeating-characters","siteSpaceId":"sitesp_1ytHE","description":"","breadcrumbs":[{"label":"Problems"},{"label":"LeetCode"}]},{"id":"6T2lOq4HkK7k9NQ6DcaJ","title":"5. Longest Palindromic Substring","pathname":"/cs-theory-and-problems/problems/leetcode/5.-longest-palindromic-substring","siteSpaceId":"sitesp_1ytHE","description":"","breadcrumbs":[{"label":"Problems"},{"label":"LeetCode"}]},{"id":"2bTwqbTdRnRmyMwhAoos","title":"11. Container With Most Water","pathname":"/cs-theory-and-problems/problems/leetcode/11.-container-with-most-water","siteSpaceId":"sitesp_1ytHE","description":"","breadcrumbs":[{"label":"Problems"},{"label":"LeetCode"}]},{"id":"CG2aeD0mfi8EIZy5YZAf","title":"15. 3 Sum","pathname":"/cs-theory-and-problems/problems/leetcode/15.-3-sum","siteSpaceId":"sitesp_1ytHE","description":"","breadcrumbs":[{"label":"Problems"},{"label":"LeetCode"}]},{"id":"ybPsuWXDVlMTO38QCs8j","title":"19. Remove Nth Node From End of List","pathname":"/cs-theory-and-problems/problems/leetcode/19.-remove-nth-node-from-end-of-list","siteSpaceId":"sitesp_1ytHE","description":"","breadcrumbs":[{"label":"Problems"},{"label":"LeetCode"}]},{"id":"jzfVhFdvoNJLzaJw6OCj","title":"20. Valid Parentheses","pathname":"/cs-theory-and-problems/problems/leetcode/20.-valid-parentheses","siteSpaceId":"sitesp_1ytHE","description":"","breadcrumbs":[{"label":"Problems"},{"label":"LeetCode"}]},{"id":"tsxL83GiG4V9xzmloNoq","title":"33. Search in Rotated Sorted Array","pathname":"/cs-theory-and-problems/problems/leetcode/33.-search-in-rotated-sorted-array","siteSpaceId":"sitesp_1ytHE","description":"","breadcrumbs":[{"label":"Problems"},{"label":"LeetCode"}]},{"id":"VauUeEs7hB5713FjrlX9","title":"49. Group Anagrams","pathname":"/cs-theory-and-problems/problems/leetcode/49.-group-anagrams","siteSpaceId":"sitesp_1ytHE","description":"","breadcrumbs":[{"label":"Problems"},{"label":"LeetCode"}]},{"id":"n0noK4S8BZDvfzy4OAwg","title":"53. Maximum Subarray","pathname":"/cs-theory-and-problems/problems/leetcode/53.-maximum-subarray","siteSpaceId":"sitesp_1ytHE","description":"","breadcrumbs":[{"label":"Problems"},{"label":"LeetCode"}]},{"id":"Ht0vjTKFzNMG7aG5MMyL","title":"55. Jump Game","pathname":"/cs-theory-and-problems/problems/leetcode/55.-jump-game","siteSpaceId":"sitesp_1ytHE","breadcrumbs":[{"label":"Problems"},{"label":"LeetCode"}]},{"id":"nBrXrvJ16mlzj9O4gItg","title":"56. Merge Intervals","pathname":"/cs-theory-and-problems/problems/leetcode/56.-merge-intervals","siteSpaceId":"sitesp_1ytHE","description":"","breadcrumbs":[{"label":"Problems"},{"label":"LeetCode"}]},{"id":"5r9nRgLpG6yprSvuNwfE","title":"76. Minimum Window Substring","pathname":"/cs-theory-and-problems/problems/leetcode/76.-minimum-window-substring","siteSpaceId":"sitesp_1ytHE","description":"","breadcrumbs":[{"label":"Problems"},{"label":"LeetCode"}]},{"id":"QKJpTyCDB5FDvMOOf4Bp","title":"98. Validate Binary Search Tree","pathname":"/cs-theory-and-problems/problems/leetcode/98.-validate-binary-search-tree","siteSpaceId":"sitesp_1ytHE","description":"","breadcrumbs":[{"label":"Problems"},{"label":"LeetCode"}]},{"id":"ekKPrNLQ0jENJVyzZWjL","title":"105. Construct Binary Tree from Preorder and Inorder Traversal","pathname":"/cs-theory-and-problems/problems/leetcode/105.-construct-binary-tree-from-preorder-and-inorder-traversal","siteSpaceId":"sitesp_1ytHE","description":"","breadcrumbs":[{"label":"Problems"},{"label":"LeetCode"}]},{"id":"1rwoDwedo6YleuA3lvZr","title":"121. Best Time to Buy and Sell Stock","pathname":"/cs-theory-and-problems/problems/leetcode/121.-best-time-to-buy-and-sell-stock","siteSpaceId":"sitesp_1ytHE","description":"","breadcrumbs":[{"label":"Problems"},{"label":"LeetCode"}]},{"id":"RhGmBaGKUqpuEhoZE8GD","title":"133. Clone Graph","pathname":"/cs-theory-and-problems/problems/leetcode/133.-clone-graph","siteSpaceId":"sitesp_1ytHE","description":"","breadcrumbs":[{"label":"Problems"},{"label":"LeetCode"}]},{"id":"sRnPmk71MDegKXY0VeA1","title":"141. Linked List Cycle","pathname":"/cs-theory-and-problems/problems/leetcode/141.-linked-list-cycle","siteSpaceId":"sitesp_1ytHE","description":"","breadcrumbs":[{"label":"Problems"},{"label":"LeetCode"}]},{"id":"Nvw7h048LWK0s7JJG62k","title":"152. Maximum Product Subarray","pathname":"/cs-theory-and-problems/problems/leetcode/152.-maximum-product-subarray","siteSpaceId":"sitesp_1ytHE","description":"","breadcrumbs":[{"label":"Problems"},{"label":"LeetCode"}]},{"id":"o66wwlygMYUJS9FZwX18","title":"153. Find Minimum in Rotated Sorted Array","pathname":"/cs-theory-and-problems/problems/leetcode/153.-find-minimum-in-rotated-sorted-array","siteSpaceId":"sitesp_1ytHE","description":"","breadcrumbs":[{"label":"Problems"},{"label":"LeetCode"}]},{"id":"G3XKstek1a3sV9Yi5D1k","title":"200. Number of Islands","pathname":"/cs-theory-and-problems/problems/leetcode/200.-number-of-islands","siteSpaceId":"sitesp_1ytHE","description":"","breadcrumbs":[{"label":"Problems"},{"label":"LeetCode"}]},{"id":"9EgNHq7iFZKIW4rZhuVz","title":"206. Reverse Linked List","pathname":"/cs-theory-and-problems/problems/leetcode/206.-reverse-linked-list","siteSpaceId":"sitesp_1ytHE","description":"","breadcrumbs":[{"label":"Problems"},{"label":"LeetCode"}]},{"id":"XucBYKaL1hKDMMYzlNNy","title":"207. Course Schedule","pathname":"/cs-theory-and-problems/problems/leetcode/207.-course-schedule","siteSpaceId":"sitesp_1ytHE","description":"","breadcrumbs":[{"label":"Problems"},{"label":"LeetCode"}]},{"id":"9fHytM439QfwGg2hNTW8","title":"217. Contains Duplicate","pathname":"/cs-theory-and-problems/problems/leetcode/217.-contains-duplicate","siteSpaceId":"sitesp_1ytHE","description":"","breadcrumbs":[{"label":"Problems"},{"label":"LeetCode"}]},{"id":"rm3yJC6PkVqpLVL2Khh0","title":"226. Invert Binary Tree","pathname":"/cs-theory-and-problems/problems/leetcode/226.-invert-binary-tree","siteSpaceId":"sitesp_1ytHE","description":"","breadcrumbs":[{"label":"Problems"},{"label":"LeetCode"}]},{"id":"ZcGi8vDvBXPM2CGYzzj0","title":"238. Product of Array Except Self","pathname":"/cs-theory-and-problems/problems/leetcode/238.-product-of-array-except-self","siteSpaceId":"sitesp_1ytHE","description":"","breadcrumbs":[{"label":"Problems"},{"label":"LeetCode"}]},{"id":"LrqNArGykH0d61ZKOBFu","title":"242. Valid Anagram","pathname":"/cs-theory-and-problems/problems/leetcode/242.-valid-anagram","siteSpaceId":"sitesp_1ytHE","description":"","breadcrumbs":[{"label":"Problems"},{"label":"LeetCode"}]},{"id":"8YPfDcThRwb7mX3hDKyH","title":"297. Serialize and Deserialize Binary Tree","pathname":"/cs-theory-and-problems/problems/leetcode/297.-serialize-and-deserialize-binary-tree","siteSpaceId":"sitesp_1ytHE","description":"","breadcrumbs":[{"label":"Problems"},{"label":"LeetCode"}]},{"id":"yM1DnODUHMbT4wfv4NbD","title":"347. Top K Frequent Elements","pathname":"/cs-theory-and-problems/problems/leetcode/347.-top-k-frequent-elements","siteSpaceId":"sitesp_1ytHE","description":"","breadcrumbs":[{"label":"Problems"},{"label":"LeetCode"}]},{"id":"8hpKvbTMHiATk7cfAgVG","title":"417. Pacific Atlantic Water Flow","pathname":"/cs-theory-and-problems/problems/leetcode/417.-pacific-atlantic-water-flow","siteSpaceId":"sitesp_1ytHE","description":"","breadcrumbs":[{"label":"Problems"},{"label":"LeetCode"}]},{"id":"RvK7quF9SG9q3WzA1Vpr","title":"424. Longest Repeating Character Replacement","pathname":"/cs-theory-and-problems/problems/leetcode/424.-longest-repeating-character-replacement","siteSpaceId":"sitesp_1ytHE","description":"","breadcrumbs":[{"label":"Problems"},{"label":"LeetCode"}]},{"id":"WerHXJaDXlo2LnQ11AvK","title":"435. Non-overlapping Intervals","pathname":"/cs-theory-and-problems/problems/leetcode/435.-non-overlapping-intervals","siteSpaceId":"sitesp_1ytHE","description":"","breadcrumbs":[{"label":"Problems"},{"label":"LeetCode"}]},{"id":"hhIW61yTk7Vy8uHtosNh","title":"647. Palindromic Substrings","pathname":"/cs-theory-and-problems/problems/leetcode/647.-palindromic-substrings","siteSpaceId":"sitesp_1ytHE","description":"","breadcrumbs":[{"label":"Problems"},{"label":"LeetCode"}]}]}