{"version":1,"pages":[{"id":"99v99HBslQceVFYNrlJc","title":"1. Sort","pathname":"/","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Overview"}]},{"id":"ttj3TnFLZa7uX1wTOaV1","title":"Selection Sort","pathname":"/overview/readme/selection-sort","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Overview"},{"label":"1. Sort"}]},{"id":"BFb3Tk4sZ0uPCYLLM8Ci","title":"Bubble Sort","pathname":"/overview/readme/bubble-sort","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Overview"},{"label":"1. Sort"}]},{"id":"O3Q8vz8dDsHDNXKVCAlk","title":"Insertion Sort","pathname":"/overview/readme/insertion-sort","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Overview"},{"label":"1. Sort"}]},{"id":"0X3ry4vsNbqiGYySgHfv","title":"Insertion Sort:: singly linked list","pathname":"/overview/readme/insertion-sort/insertion-sort-singly-linked-list","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Overview"},{"label":"1. Sort"},{"label":"Insertion Sort"}]},{"id":"o2UVfsTQpretGlH1fYO5","title":"Recursive","pathname":"/overview/readme/insertion-sort/insertion-sort-singly-linked-list/recursive","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Overview"},{"label":"1. Sort"},{"label":"Insertion Sort"},{"label":"Insertion Sort:: singly linked list"}]},{"id":"nGEl2nGfGAb4JfzXnkLR","title":"Using Array O(N), O(N)","pathname":"/overview/readme/insertion-sort/insertion-sort-singly-linked-list/using-array-o-n-o-n","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Overview"},{"label":"1. Sort"},{"label":"Insertion Sort"},{"label":"Insertion Sort:: singly linked list"}]},{"id":"CzpP7uzsKY26o2qcmf5Y","title":"Using Iteration O(N), O(1)","pathname":"/overview/readme/insertion-sort/insertion-sort-singly-linked-list/using-iteration-o-n-o-1","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Overview"},{"label":"1. Sort"},{"label":"Insertion Sort"},{"label":"Insertion Sort:: singly linked list"}]},{"id":"TZT0VIs5uoRk1iW3IsGM","title":"Quick Sort","pathname":"/overview/readme/quick-sort","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Overview"},{"label":"1. Sort"}]},{"id":"7K8pGueExW7hVkdO9oCx","title":"Merge Sort","pathname":"/overview/readme/merge-sort","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Overview"},{"label":"1. Sort"}]},{"id":"EnlRPcWAVJKOpVpiYfAV","title":"Heap Sort","pathname":"/overview/readme/heap-sort","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Overview"},{"label":"1. Sort"}]},{"id":"Sh6OSS8e3VPAfZJJEl6N","title":"Counting Sort","pathname":"/overview/readme/counting-sort","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Overview"},{"label":"1. Sort"}]},{"id":"HCXviTDMxP5tErlKj3SG","title":"Counting Sort","pathname":"/overview/readme/counting-sort/counting-sort","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Overview"},{"label":"1. Sort"},{"label":"Counting Sort"}]},{"id":"dBRNW6ZJbEGvaipVsEEN","title":"Sort a String","pathname":"/overview/readme/counting-sort/counting-sort/sort-a-string","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Overview"},{"label":"1. Sort"},{"label":"Counting Sort"},{"label":"Counting Sort"}]},{"id":"CVSi7Z98gAaxmNg53vVi","title":"Bucket Sort","pathname":"/overview/readme/counting-sort/bucket-sort","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Overview"},{"label":"1. Sort"},{"label":"Counting Sort"}]},{"id":"zTKFUzpXDc5zQ3Smlb87","title":"Radix Sort","pathname":"/overview/readme/counting-sort/radix-sort","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Overview"},{"label":"1. Sort"},{"label":"Counting Sort"}]},{"id":"XpF3De1dPadmrtJOHMvL","title":"Topological Sort","pathname":"/overview/readme/topological-sort","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Overview"},{"label":"1. Sort"}]},{"id":"ycwofu8noXZzhF1TjrnX","title":"2. Data Structures","pathname":"/overview/2.-data-structures","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Overview"}]},{"id":"FxAXoS6yxMZZa5ccoHUV","title":"Array","pathname":"/overview/2.-data-structures/array","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Overview"},{"label":"2. Data Structures"}]},{"id":"XTt8gyhzKXwbsEBQu9cM","title":"Stack","pathname":"/overview/2.-data-structures/stack","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Overview"},{"label":"2. Data Structures"}]},{"id":"tkI17YxJ77Ea4lW2TAPg","title":"Queue","pathname":"/overview/2.-data-structures/queue","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Overview"},{"label":"2. Data Structures"}]},{"id":"Ud3mdt8eBjvv9ASsvISQ","title":"Tree","pathname":"/overview/2.-data-structures/tree","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Overview"},{"label":"2. Data Structures"}]},{"id":"lxXY9dWGzyCS5wtzrZm7","title":"PreOrder, InOrder, PostOrder","pathname":"/overview/2.-data-structures/tree/preorder-inorder-postorder","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Overview"},{"label":"2. Data Structures"},{"label":"Tree"}]},{"id":"dzy4IcxrtB7h2R5rXpBS","title":"Transfer between each","pathname":"/overview/2.-data-structures/tree/preorder-inorder-postorder/transfer-between-each","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Overview"},{"label":"2. Data Structures"},{"label":"Tree"},{"label":"PreOrder, InOrder, PostOrder"}]},{"id":"rqO7x44oucxVIbME57ey","title":"Traverse","pathname":"/overview/2.-data-structures/tree/preorder-inorder-postorder/traverse","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Overview"},{"label":"2. Data Structures"},{"label":"Tree"},{"label":"PreOrder, InOrder, PostOrder"}]},{"id":"H40cdW0QBuUMSSDLjxBE","title":"Binary Tree","pathname":"/overview/2.-data-structures/tree/binary-tree","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Overview"},{"label":"2. Data Structures"},{"label":"Tree"}]},{"id":"D2t8oK5FQReXemmkNCVn","title":"Binary Search Tree","pathname":"/overview/2.-data-structures/tree/binary-tree/binary-search-tree","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Overview"},{"label":"2. Data Structures"},{"label":"Tree"},{"label":"Binary Tree"}]},{"id":"boO0Xpeux8fyqoygaFT1","title":"Graph","pathname":"/overview/2.-data-structures/graph","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Overview"},{"label":"2. Data Structures"}]},{"id":"bqLKPNsCZHoGSZcEuIki","title":"Data Structure","pathname":"/overview/2.-data-structures/graph/data-structure","siteSpaceId":"sitesp_wgUof","description":"How to store Graph data in a code?","breadcrumbs":[{"label":"Overview"},{"label":"2. Data Structures"},{"label":"Graph"}]},{"id":"fL7GTTiDj6kgb65hdTPO","title":"Traverse Graph","pathname":"/overview/2.-data-structures/graph/traverse-graph","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Overview"},{"label":"2. Data Structures"},{"label":"Graph"}]},{"id":"lKgQxFBMK4lDKYi8zVMx","title":"Detect a cycle in a Graph","pathname":"/overview/2.-data-structures/graph/detect-a-cycle-in-a-graph","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Overview"},{"label":"2. Data Structures"},{"label":"Graph"}]},{"id":"cnUJAV4Qo2MfYxBQgOUL","title":"DFS *","pathname":"/overview/2.-data-structures/graph/detect-a-cycle-in-a-graph/dfs","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Overview"},{"label":"2. Data Structures"},{"label":"Graph"},{"label":"Detect a cycle in a Graph"}]},{"id":"I0XFzkl1F8WPj2xRtNt2","title":"undirected clean code","pathname":"/overview/2.-data-structures/graph/detect-a-cycle-in-a-graph/dfs/undirected-clean-code","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Overview"},{"label":"2. Data Structures"},{"label":"Graph"},{"label":"Detect a cycle in a Graph"},{"label":"DFS *"}]},{"id":"ihoCnmOM6yZu2BJ2lg4M","title":"Union Find","pathname":"/overview/2.-data-structures/graph/detect-a-cycle-in-a-graph/union-find","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Overview"},{"label":"2. Data Structures"},{"label":"Graph"},{"label":"Detect a cycle in a Graph"}]},{"id":"BbIWeOL0MsR1C9qZpmCj","title":"Count edges - undirected only","pathname":"/overview/2.-data-structures/graph/detect-a-cycle-in-a-graph/count-edges-undirected-only","siteSpaceId":"sitesp_wgUof","description":"Edges should have to be n - 1 where n is the number of vertexes","breadcrumbs":[{"label":"Overview"},{"label":"2. Data Structures"},{"label":"Graph"},{"label":"Detect a cycle in a Graph"}]},{"id":"BKSQAM8AxGsc2cPMmebh","title":"Linked List","pathname":"/overview/2.-data-structures/linked-list","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Overview"},{"label":"2. Data Structures"}]},{"id":"7jmwj3n5n4DjjUL5YBfl","title":"Trie","pathname":"/overview/2.-data-structures/trie","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Overview"},{"label":"2. Data Structures"}]},{"id":"EQMZF2AsA5tMHIGdmjtb","title":"Javascript","pathname":"/overview/2.-data-structures/trie/javascript","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Overview"},{"label":"2. Data Structures"},{"label":"Trie"}]},{"id":"kNVnSGG4vzABZMH8OuHX","title":"Java","pathname":"/overview/2.-data-structures/trie/java","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Overview"},{"label":"2. Data Structures"},{"label":"Trie"}]},{"id":"annvHsFJ7S6Q8pyclULj","title":"Union Find","pathname":"/overview/2.-data-structures/union-find","siteSpaceId":"sitesp_wgUof","description":"Disjoint-set: not sharing any element between two sets","breadcrumbs":[{"label":"Overview"},{"label":"2. Data Structures"}]},{"id":"6rbbao1udTye4IUXuf2c","title":"Detect Cycle with Disjoint-set Union Find","pathname":"/overview/2.-data-structures/union-find/detect-cycle-with-disjoint-set-union-find","siteSpaceId":"sitesp_wgUof","description":"use Union Find data structure to find a cycle","breadcrumbs":[{"label":"Overview"},{"label":"2. Data Structures"},{"label":"Union Find"}]},{"id":"ZdbaYopyJV2vCQ3M6jZh","title":"Kruskal Algorithm","pathname":"/overview/2.-data-structures/union-find/kruskal-algorithm","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Overview"},{"label":"2. Data Structures"},{"label":"Union Find"}]},{"id":"NTYDlxN9SAA9B7suggqo","title":"Heap","pathname":"/overview/2.-data-structures/heap","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Overview"},{"label":"2. Data Structures"}]},{"id":"HposuAwJzg7F4iUQqqtJ","title":"Matrix","pathname":"/overview/2.-data-structures/matrix","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Overview"},{"label":"2. Data Structures"}]},{"id":"ViXNfhzUaHRvR3X4KCbf","title":"Union Find: Disjoint Set","pathname":"/overview/2.-data-structures/union-find-disjoint-set","siteSpaceId":"sitesp_wgUof","description":"Tree, MST (Kruskal)","breadcrumbs":[{"label":"Overview"},{"label":"2. Data Structures"}]},{"id":"AtOtyYhrDXPPgqGVceaZ","title":"3. How to construct Algorithm? Paradigm","pathname":"/overview/3.-how-to-construct-algorithm-paradigm","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Overview"}]},{"id":"O96hKarVALz9AKguvnZj","title":"Greedy Algorithm","pathname":"/overview/3.-how-to-construct-algorithm-paradigm/greedy-algorithm","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Overview"},{"label":"3. How to construct Algorithm? Paradigm"}]},{"id":"aoM5F5bdPuS7JSEo5GyX","title":"Prim","pathname":"/overview/3.-how-to-construct-algorithm-paradigm/greedy-algorithm/prim","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Overview"},{"label":"3. How to construct Algorithm? Paradigm"},{"label":"Greedy Algorithm"}]},{"id":"cuZHuzCuZ5GCbBQFDU8T","title":"Dijkstra","pathname":"/overview/3.-how-to-construct-algorithm-paradigm/greedy-algorithm/dijkstra","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Overview"},{"label":"3. How to construct Algorithm? Paradigm"},{"label":"Greedy Algorithm"}]},{"id":"Pj7K3C17aFGi4ByuEgb3","title":"Prim vs Dijkstra","pathname":"/overview/3.-how-to-construct-algorithm-paradigm/greedy-algorithm/prim-vs-dijkstra","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Overview"},{"label":"3. How to construct Algorithm? Paradigm"},{"label":"Greedy Algorithm"}]},{"id":"EztxBYuGlZlzV9J3mX0C","title":"Dynamic Planning Techique","pathname":"/overview/3.-how-to-construct-algorithm-paradigm/dynamic-planning-techique","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Overview"},{"label":"3. How to construct Algorithm? Paradigm"}]},{"id":"xAq3OwzAKwKbk81loHbv","title":"Dynamic Planning","pathname":"/overview/3.-how-to-construct-algorithm-paradigm/dynamic-planning","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Overview"},{"label":"3. How to construct Algorithm? Paradigm"}]},{"id":"iIgA7iTzwZGWx9J9HPn1","title":"Divide And Conquer","pathname":"/overview/3.-how-to-construct-algorithm-paradigm/divide-and-conquer","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Overview"},{"label":"3. How to construct Algorithm? Paradigm"}]},{"id":"Rz4iwtA18TjkCmbXPlI7","title":"Brute force","pathname":"/overview/3.-how-to-construct-algorithm-paradigm/brute-force","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Overview"},{"label":"3. How to construct Algorithm? Paradigm"}]},{"id":"TR3G4ph1eeHcTzfPmwDU","title":"Shortest path","pathname":"/overview/3.-how-to-construct-algorithm-paradigm/shortest-path","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Overview"},{"label":"3. How to construct Algorithm? Paradigm"}]},{"id":"dNlLA4jhMiYaGtLxJXGL","title":"BFS","pathname":"/overview/3.-how-to-construct-algorithm-paradigm/shortest-path/bfs","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Overview"},{"label":"3. How to construct Algorithm? Paradigm"},{"label":"Shortest path"}]},{"id":"NwAXypz6qxdT08NvLb4l","title":"Dijkstra algorithm: directed, shortest path","pathname":"/overview/3.-how-to-construct-algorithm-paradigm/shortest-path/dijkstra-algorithm-directed-shortest-path","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Overview"},{"label":"3. How to construct Algorithm? Paradigm"},{"label":"Shortest path"}]},{"id":"CzuIKM05qVAGfVpViA3B","title":"MST (Minimum Spanning Tree)","pathname":"/overview/3.-how-to-construct-algorithm-paradigm/mst-minimum-spanning-tree","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Overview"},{"label":"3. How to construct Algorithm? Paradigm"}]},{"id":"Amy9tAOfgsBgbV4Ez5Bp","title":"Prim vs Digkstra","pathname":"/overview/3.-how-to-construct-algorithm-paradigm/mst-minimum-spanning-tree/prim-vs-digkstra","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Overview"},{"label":"3. How to construct Algorithm? Paradigm"},{"label":"MST (Minimum Spanning Tree)"}]},{"id":"Ek2ZPNCSArluuXgeANAm","title":"Prim, Kruskal Why? only undirected graph?","pathname":"/overview/3.-how-to-construct-algorithm-paradigm/mst-minimum-spanning-tree/prim-kruskal-why-only-undirected-graph","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Overview"},{"label":"3. How to construct Algorithm? Paradigm"},{"label":"MST (Minimum Spanning Tree)"}]},{"id":"OgV4xKPaptCdF2Af3RaH","title":"Kruskal's Algorithm: undirected","pathname":"/overview/3.-how-to-construct-algorithm-paradigm/mst-minimum-spanning-tree/kruskals-algorithm-undirected","siteSpaceId":"sitesp_wgUof","description":"Edge, Union Find","breadcrumbs":[{"label":"Overview"},{"label":"3. How to construct Algorithm? Paradigm"},{"label":"MST (Minimum Spanning Tree)"}]},{"id":"6DAXuMjtc98esHUbcNT5","title":"Prim's Algorithm: undirected","pathname":"/overview/3.-how-to-construct-algorithm-paradigm/mst-minimum-spanning-tree/prims-algorithm-undirected","siteSpaceId":"sitesp_wgUof","description":"Vertex, Priority Queue","breadcrumbs":[{"label":"Overview"},{"label":"3. How to construct Algorithm? Paradigm"},{"label":"MST (Minimum Spanning Tree)"}]},{"id":"B8hrQ1wPFOJs4XjX3rwU","title":"Problem Sources","pathname":"/algorithm-problems/problem-sources","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Algorithm Problems"}]},{"id":"veeUspp4ok5xUXcOeAay","title":"AlgoExpert","pathname":"/algorithm-problems/algoexpert","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Algorithm Problems"}]},{"id":"DRdHTjJFd58wqOJDqGKJ","title":"Hardest","pathname":"/algorithm-problems/algoexpert/hardest","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Algorithm Problems"},{"label":"AlgoExpert"}]},{"id":"P1WoIzyVn0zIncdmM5hx","title":"Merge Sort","pathname":"/algorithm-problems/algoexpert/hardest/merge-sort","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Algorithm Problems"},{"label":"AlgoExpert"},{"label":"Hardest"}]},{"id":"3MbIOyD5DhSJeu4O0XwL","title":"Hard","pathname":"/algorithm-problems/algoexpert/hard","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Algorithm Problems"},{"label":"AlgoExpert"}]},{"id":"H3r7QkVszGHJrT0LHAXi","title":"Prim’s Algorithm","pathname":"/algorithm-problems/algoexpert/hard/prims-algorithm","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Algorithm Problems"},{"label":"AlgoExpert"},{"label":"Hard"}]},{"id":"S2kSWOCnJ2KMZsoUywRp","title":"Dijkstra’s Algorithm","pathname":"/algorithm-problems/algoexpert/hard/dijkstras-algorithm","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Algorithm Problems"},{"label":"AlgoExpert"},{"label":"Hard"}]},{"id":"ZKtBB9XMJqZDJ9eB2jMF","title":"Kruskal’s algorithm vs Prim’s algorithm","pathname":"/algorithm-problems/algoexpert/hard/kruskals-algorithm-vs-prims-algorithm","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Algorithm Problems"},{"label":"AlgoExpert"},{"label":"Hard"}]},{"id":"fvYQ8gsE1MA4NA30jcRk","title":"Topological Sort","pathname":"/algorithm-problems/algoexpert/hard/topological-sort","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Algorithm Problems"},{"label":"AlgoExpert"},{"label":"Hard"}]},{"id":"PND2mBHwiQpkpm6lS8jW","title":"Max Sum Increasing Subsequence","pathname":"/algorithm-problems/algoexpert/hard/max-sum-increasing-subsequence","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Algorithm Problems"},{"label":"AlgoExpert"},{"label":"Hard"}]},{"id":"sEZgotAGvPljMM7EYegx","title":"Find Nodes Distance K","pathname":"/algorithm-problems/algoexpert/hard/find-nodes-distance-k","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Algorithm Problems"},{"label":"AlgoExpert"},{"label":"Hard"}]},{"id":"e9mN0idL61xnKCi0Jcfi","title":"Max Path Sum In Binary Tree","pathname":"/algorithm-problems/algoexpert/hard/max-path-sum-in-binary-tree","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Algorithm Problems"},{"label":"AlgoExpert"},{"label":"Hard"}]},{"id":"isigHVvPTMEgAY8HYZI9","title":"Validate Three Nodes","pathname":"/algorithm-problems/algoexpert/hard/validate-three-nodes","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Algorithm Problems"},{"label":"AlgoExpert"},{"label":"Hard"}]},{"id":"7AK6lAc1QYfq1EHG8koC","title":"Same BST ?","pathname":"/algorithm-problems/algoexpert/hard/same-bst","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Algorithm Problems"},{"label":"AlgoExpert"},{"label":"Hard"}]},{"id":"Or2cFFgqK8zoKBu9LBQe","title":"Zigzag Traverse","pathname":"/algorithm-problems/algoexpert/hard/zigzag-traverse","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Algorithm Problems"},{"label":"AlgoExpert"},{"label":"Hard"}]},{"id":"o5I8rcQvK3tO0rj7bAXg","title":"Min Rewards","pathname":"/algorithm-problems/algoexpert/hard/min-rewards","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Algorithm Problems"},{"label":"AlgoExpert"},{"label":"Hard"}]},{"id":"ue2SW3BethFFAS9yR42l","title":"Largest Range","pathname":"/algorithm-problems/algoexpert/hard/largest-range","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Algorithm Problems"},{"label":"AlgoExpert"},{"label":"Hard"}]},{"id":"tPJ9NbCQ69xWXpJVR85U","title":"Subarray Sort","pathname":"/algorithm-problems/algoexpert/hard/subarray-sort","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Algorithm Problems"},{"label":"AlgoExpert"},{"label":"Hard"}]},{"id":"8g2aCVahFp61LJR1Azvo","title":"Four Number Sum","pathname":"/algorithm-problems/algoexpert/hard/four-number-sum","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Algorithm Problems"},{"label":"AlgoExpert"},{"label":"Hard"}]},{"id":"tCHO3EHkVSH3y0TKJ5Nr","title":"Medium","pathname":"/algorithm-problems/algoexpert/medium","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Algorithm Problems"},{"label":"AlgoExpert"}]},{"id":"TSGKlcJ3QhMB7dCyBV7I","title":"Missing Numbers","pathname":"/algorithm-problems/algoexpert/medium/missing-numbers","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Algorithm Problems"},{"label":"AlgoExpert"},{"label":"Medium"}]},{"id":"5RZsBj2Df3BEMEfM66Qc","title":"Beat Seat","pathname":"/algorithm-problems/algoexpert/medium/beat-seat","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Algorithm Problems"},{"label":"AlgoExpert"},{"label":"Medium"}]},{"id":"HywEyUJwPCdse4a6sgk2","title":"Suffix Trie Construction","pathname":"/algorithm-problems/algoexpert/medium/suffix-trie-construction","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Algorithm Problems"},{"label":"AlgoExpert"},{"label":"Medium"}]},{"id":"QnNInmGe1h1t3zkIke8S","title":"One Edit","pathname":"/algorithm-problems/algoexpert/medium/one-edit","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Algorithm Problems"},{"label":"AlgoExpert"},{"label":"Medium"}]},{"id":"M6ikVy1C5ZLWq3AyueuC","title":"Minimum Characters For Words","pathname":"/algorithm-problems/algoexpert/medium/minimum-characters-for-words","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Algorithm Problems"},{"label":"AlgoExpert"},{"label":"Medium"}]},{"id":"GSnvbKqiAFiJRvfBwzuc","title":"Reverse Words in String","pathname":"/algorithm-problems/algoexpert/medium/reverse-words-in-string","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Algorithm Problems"},{"label":"AlgoExpert"},{"label":"Medium"}]},{"id":"X1GOtWLguBXcEX5FPqKF","title":"Valid IP Addresses","pathname":"/algorithm-problems/algoexpert/medium/valid-ip-addresses","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Algorithm Problems"},{"label":"AlgoExpert"},{"label":"Medium"}]},{"id":"A2XfBJJXSPW1UBlHhFTe","title":"Group Anagrams","pathname":"/algorithm-problems/algoexpert/medium/group-anagrams","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Algorithm Problems"},{"label":"AlgoExpert"},{"label":"Medium"}]},{"id":"PNHNB25DYFfl9bLv8nVc","title":"Longest Palindromic Substring","pathname":"/algorithm-problems/algoexpert/medium/longest-palindromic-substring","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Algorithm Problems"},{"label":"AlgoExpert"},{"label":"Medium"}]},{"id":"ng25qjOvVo5IZwwVTtvv","title":"Next Greater Element","pathname":"/algorithm-problems/algoexpert/medium/next-greater-element","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Algorithm Problems"},{"label":"AlgoExpert"},{"label":"Medium"}]},{"id":"dC3SuklhPIMj6ZqHucRw","title":"Sort Stack ⇒ recursive good -","pathname":"/algorithm-problems/algoexpert/medium/sort-stack-recursive-good","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Algorithm Problems"},{"label":"AlgoExpert"},{"label":"Medium"}]},{"id":"H2bympVMUnhND92vbKXa","title":"Sunset Views","pathname":"/algorithm-problems/algoexpert/medium/sunset-views","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Algorithm Problems"},{"label":"AlgoExpert"},{"label":"Medium"}]},{"id":"o4TRpmEE9wCCqIfcoUJk","title":"Balanced Brackets","pathname":"/algorithm-problems/algoexpert/medium/balanced-brackets","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Algorithm Problems"},{"label":"AlgoExpert"},{"label":"Medium"}]},{"id":"5qLhT5ltKBIUWnqI5e2n","title":"Min Max Stack Construction","pathname":"/algorithm-problems/algoexpert/medium/min-max-stack-construction","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Algorithm Problems"},{"label":"AlgoExpert"},{"label":"Medium"}]},{"id":"YXK4yCVtCiTIzKbvgtMh","title":"Three Number Sort ⇒ counting sort or radix sort ⇒ three pointer with in-place swap","pathname":"/algorithm-problems/algoexpert/medium/three-number-sort-counting-sort-or-radix-sort-three-pointer-with-in-place-swap","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Algorithm Problems"},{"label":"AlgoExpert"},{"label":"Medium"}]},{"id":"vGmUJjrnrVPcsnXUFrMF","title":"Staircase Traversal ⇒ it is like the number of ways to change","pathname":"/algorithm-problems/algoexpert/medium/staircase-traversal-it-is-like-the-number-of-ways-to-change","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Algorithm Problems"},{"label":"AlgoExpert"},{"label":"Medium"}]},{"id":"wI0A6iQMMkyhb9Uj0VlF","title":"Phone Number Mnemonics ⇒ can use word and index to create each case without concatenation","pathname":"/algorithm-problems/algoexpert/medium/phone-number-mnemonics-can-use-word-and-index-to-create-each-case-without-concatenation","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Algorithm Problems"},{"label":"AlgoExpert"},{"label":"Medium"}]},{"id":"eUg179h7MBMPCnTwNMqj","title":"Power Set","pathname":"/algorithm-problems/algoexpert/medium/power-set","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Algorithm Problems"},{"label":"AlgoExpert"},{"label":"Medium"}]},{"id":"qtAeHlfhr3Y9Ill6yclH","title":"Permutations -","pathname":"/algorithm-problems/algoexpert/medium/permutations","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Algorithm Problems"},{"label":"AlgoExpert"},{"label":"Medium"}]},{"id":"eDtdhE1iCMO1tkKKKOpb","title":"Merging LinkedLists","pathname":"/algorithm-problems/algoexpert/medium/merging-linkedlists","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Algorithm Problems"},{"label":"AlgoExpert"},{"label":"Medium"}]},{"id":"6RdVdmcl2yviTqw2hAC0","title":"Sum Of Linked Lists -","pathname":"/algorithm-problems/algoexpert/medium/sum-of-linked-lists","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Algorithm Problems"},{"label":"AlgoExpert"},{"label":"Medium"}]},{"id":"lGhrxPrLGW5huYsKNA2c","title":"Remove Kth Node From End -","pathname":"/algorithm-problems/algoexpert/medium/remove-kth-node-from-end","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Algorithm Problems"},{"label":"AlgoExpert"},{"label":"Medium"}]},{"id":"uo0MeZe0evam2EomZ20S","title":"Linked List Construction - Doubly Linked List ?","pathname":"/algorithm-problems/algoexpert/medium/linked-list-construction-doubly-linked-list","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Algorithm Problems"},{"label":"AlgoExpert"},{"label":"Medium"}]},{"id":"Q5vyRYiy1kDqIZnDebmt","title":"Min Heap Construction","pathname":"/algorithm-problems/algoexpert/medium/min-heap-construction","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Algorithm Problems"},{"label":"AlgoExpert"},{"label":"Medium"}]},{"id":"HqjvySQStvdAToVxkvqZ","title":"Valid Starting City","pathname":"/algorithm-problems/algoexpert/medium/valid-starting-city","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Algorithm Problems"},{"label":"AlgoExpert"},{"label":"Medium"}]},{"id":"h8bCRp5dJSuhX82Ay0X2","title":"Task Assignment - use two pointer","pathname":"/algorithm-problems/algoexpert/medium/task-assignment-use-two-pointer","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Algorithm Problems"},{"label":"AlgoExpert"},{"label":"Medium"}]},{"id":"4SRDlxknCAsvMKlj6jcw","title":"Two Colorable - Graph","pathname":"/algorithm-problems/algoexpert/medium/two-colorable-graph","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Algorithm Problems"},{"label":"AlgoExpert"},{"label":"Medium"}]},{"id":"kfNNLlAeS1bgyaTedPxA","title":"Minimum Passes Of Matrix","pathname":"/algorithm-problems/algoexpert/medium/minimum-passes-of-matrix","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Algorithm Problems"},{"label":"AlgoExpert"},{"label":"Medium"}]},{"id":"lgPoyo5PuQMPRqKsgbpu","title":"Cycle in Graph -","pathname":"/algorithm-problems/algoexpert/medium/cycle-in-graph","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Algorithm Problems"},{"label":"AlgoExpert"},{"label":"Medium"}]},{"id":"LRpa9W6pNBQcwDwZSK8N","title":"Remove Islands -","pathname":"/algorithm-problems/algoexpert/medium/remove-islands","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Algorithm Problems"},{"label":"AlgoExpert"},{"label":"Medium"}]},{"id":"2OIqBUrKYUPOTKWeXxny","title":"Youngest Common Ancestor","pathname":"/algorithm-problems/algoexpert/medium/youngest-common-ancestor","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Algorithm Problems"},{"label":"AlgoExpert"},{"label":"Medium"}]},{"id":"ge7UxyWhdRfPhpQBzrrK","title":"River Sizes -","pathname":"/algorithm-problems/algoexpert/medium/river-sizes","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Algorithm Problems"},{"label":"AlgoExpert"},{"label":"Medium"}]},{"id":"HZomaPloKlOCUsoO4nVN","title":"Breadth First Search","pathname":"/algorithm-problems/algoexpert/medium/breadth-first-search","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Algorithm Problems"},{"label":"AlgoExpert"},{"label":"Medium"}]},{"id":"iOlLdOfv6e3PZOwDQaAG","title":"Single Cycle Check","pathname":"/algorithm-problems/algoexpert/medium/single-cycle-check","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Algorithm Problems"},{"label":"AlgoExpert"},{"label":"Medium"}]},{"id":"2iqG7VAw1fdAEW9KEdPq","title":"Union Find","pathname":"/algorithm-problems/algoexpert/medium/union-find","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Algorithm Problems"},{"label":"AlgoExpert"},{"label":"Medium"}]},{"id":"PfPqwQifc8bpI76KuKJV","title":"Stable Internships","pathname":"/algorithm-problems/algoexpert/medium/stable-internships","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Algorithm Problems"},{"label":"AlgoExpert"},{"label":"Medium"}]},{"id":"hgyV0TeHoyEToKIoC4Ag","title":"Kadane’s Algorithm","pathname":"/algorithm-problems/algoexpert/medium/kadanes-algorithm","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Algorithm Problems"},{"label":"AlgoExpert"},{"label":"Medium"}]},{"id":"XzOQnAl5pi7hapAmVNC4","title":"Levenshtein Distance","pathname":"/algorithm-problems/algoexpert/medium/levenshtein-distance","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Algorithm Problems"},{"label":"AlgoExpert"},{"label":"Medium"}]},{"id":"vuinKyBQWeZglHG8I6hy","title":"Min Number Of Coins For Change","pathname":"/algorithm-problems/algoexpert/medium/min-number-of-coins-for-change","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Algorithm Problems"},{"label":"AlgoExpert"},{"label":"Medium"}]},{"id":"7a5qF27Ch56pnIyb1VuJ","title":"Number Of Ways To Make Change","pathname":"/algorithm-problems/algoexpert/medium/number-of-ways-to-make-change","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Algorithm Problems"},{"label":"AlgoExpert"},{"label":"Medium"}]},{"id":"7vHET07ctmNO4akLdx2q","title":"Number Of Ways To Traverse Graph","pathname":"/algorithm-problems/algoexpert/medium/number-of-ways-to-traverse-graph","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Algorithm Problems"},{"label":"AlgoExpert"},{"label":"Medium"}]},{"id":"L7VpvCCDOeCThXS7fGpd","title":"Max Subset Sum No Adjacent","pathname":"/algorithm-problems/algoexpert/medium/max-subset-sum-no-adjacent","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Algorithm Problems"},{"label":"AlgoExpert"},{"label":"Medium"}]},{"id":"hj5l2mTyFMqIr7aSt5JL","title":"Symmetrical Tree","pathname":"/algorithm-problems/algoexpert/medium/symmetrical-tree","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Algorithm Problems"},{"label":"AlgoExpert"},{"label":"Medium"}]},{"id":"PIbdO62W7zYGY1pKBzJG","title":"Merge Binary Trees","pathname":"/algorithm-problems/algoexpert/medium/merge-binary-trees","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Algorithm Problems"},{"label":"AlgoExpert"},{"label":"Medium"}]},{"id":"Wm135hdvNRnx1h0USqa5","title":"Height Balanced Binary Tree","pathname":"/algorithm-problems/algoexpert/medium/height-balanced-binary-tree","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Algorithm Problems"},{"label":"AlgoExpert"},{"label":"Medium"}]},{"id":"KoxrCECRYuhLfqhulAK1","title":"Find Successor","pathname":"/algorithm-problems/algoexpert/medium/find-successor","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Algorithm Problems"},{"label":"AlgoExpert"},{"label":"Medium"}]},{"id":"Es0fJ4OtKglKE9ajQKD1","title":"Binary Tree Diameter","pathname":"/algorithm-problems/algoexpert/medium/binary-tree-diameter","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Algorithm Problems"},{"label":"AlgoExpert"},{"label":"Medium"}]},{"id":"cE3iHObnotXR1am70WDu","title":"Invert Binary Tree","pathname":"/algorithm-problems/algoexpert/medium/invert-binary-tree","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Algorithm Problems"},{"label":"AlgoExpert"},{"label":"Medium"}]},{"id":"5NLFWlYQiGPfbX6erufp","title":"Reconstruct Bst","pathname":"/algorithm-problems/algoexpert/medium/reconstruct-bst","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Algorithm Problems"},{"label":"AlgoExpert"},{"label":"Medium"}]},{"id":"Scz4hwdqNpgRZFTtOvdt","title":"Find Kth Largest Value In Bst","pathname":"/algorithm-problems/algoexpert/medium/find-kth-largest-value-in-bst","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Algorithm Problems"},{"label":"AlgoExpert"},{"label":"Medium"}]},{"id":"bfhnjvYDtbN5JYcoZHvy","title":"Min Height BST","pathname":"/algorithm-problems/algoexpert/medium/min-height-bst","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Algorithm Problems"},{"label":"AlgoExpert"},{"label":"Medium"}]},{"id":"mG66ah6V6is7oSQo7kVf","title":"BST Traversal","pathname":"/algorithm-problems/algoexpert/medium/bst-traversal","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Algorithm Problems"},{"label":"AlgoExpert"},{"label":"Medium"}]},{"id":"6pgFkq8ORSxOjIUJMaS5","title":"Validate Bst","pathname":"/algorithm-problems/algoexpert/medium/validate-bst","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Algorithm Problems"},{"label":"AlgoExpert"},{"label":"Medium"}]},{"id":"TAp9ZqgrcBF6tgwIap38","title":"BST Construction","pathname":"/algorithm-problems/algoexpert/medium/bst-construction","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Algorithm Problems"},{"label":"AlgoExpert"},{"label":"Medium"}]},{"id":"iXeQeIiOXecsboASROEv","title":"Zero Sum Subarray + find indices of sub array","pathname":"/algorithm-problems/algoexpert/medium/zero-sum-subarray-+-find-indices-of-sub-array","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Algorithm Problems"},{"label":"AlgoExpert"},{"label":"Medium"}]},{"id":"uY4MHFn8rroGvD8vWszN","title":"Merge Overlapping Intervals","pathname":"/algorithm-problems/algoexpert/medium/merge-overlapping-intervals","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Algorithm Problems"},{"label":"AlgoExpert"},{"label":"Medium"}]},{"id":"pdzOIQ1rv9xGobQFGdIQ","title":"First Duplicate Number","pathname":"/algorithm-problems/algoexpert/medium/first-duplicate-number","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Algorithm Problems"},{"label":"AlgoExpert"},{"label":"Medium"}]},{"id":"IbloqlNQdsLbHaiWs2du","title":"Array of Products","pathname":"/algorithm-problems/algoexpert/medium/array-of-products","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Algorithm Problems"},{"label":"AlgoExpert"},{"label":"Medium"}]},{"id":"UcsjKxNQNB5uXA1TJ7Tj","title":"Longest Peak","pathname":"/algorithm-problems/algoexpert/medium/longest-peak","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Algorithm Problems"},{"label":"AlgoExpert"},{"label":"Medium"}]},{"id":"RDFuOHJb8kwpIRHCX0hh","title":"Spiral Traverse","pathname":"/algorithm-problems/algoexpert/medium/spiral-traverse","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Algorithm Problems"},{"label":"AlgoExpert"},{"label":"Medium"}]},{"id":"2pSOekrspMvKFghIROia","title":"Monotonic Array","pathname":"/algorithm-problems/algoexpert/medium/monotonic-array","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Algorithm Problems"},{"label":"AlgoExpert"},{"label":"Medium"}]},{"id":"Nm37GijQbhQhp2rSHBXC","title":"Move Element To End","pathname":"/algorithm-problems/algoexpert/medium/move-element-to-end","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Algorithm Problems"},{"label":"AlgoExpert"},{"label":"Medium"}]},{"id":"i9MRal6aXYJbU4B844Vj","title":"Smallest Difference","pathname":"/algorithm-problems/algoexpert/medium/smallest-difference","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Algorithm Problems"},{"label":"AlgoExpert"},{"label":"Medium"}]},{"id":"UdSlZ93xNiNcSA8YYGFj","title":"Three Number Sum","pathname":"/algorithm-problems/algoexpert/medium/three-number-sum","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Algorithm Problems"},{"label":"AlgoExpert"},{"label":"Medium"}]},{"id":"rLVC08wKd0Px8ZTT0qJY","title":"Easy","pathname":"/algorithm-problems/algoexpert/easy","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Algorithm Problems"},{"label":"AlgoExpert"}]},{"id":"QxAWV2GGASPvFrnxUJQw","title":"Middle Node","pathname":"/algorithm-problems/algoexpert/easy/middle-node","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Algorithm Problems"},{"label":"AlgoExpert"},{"label":"Easy"}]},{"id":"kSVwsBdNXtYysfBEWUyV","title":"Evaluate Expression Tree","pathname":"/algorithm-problems/algoexpert/easy/evaluate-expression-tree","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Algorithm Problems"},{"label":"AlgoExpert"},{"label":"Easy"}]},{"id":"6kTU1j5DMWWwNm5XOV0b","title":"Insertion Sort","pathname":"/algorithm-problems/algoexpert/easy/insertion-sort","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Algorithm Problems"},{"label":"AlgoExpert"},{"label":"Easy"}]},{"id":"uAZjzfYZW2XLRrT4o5qS","title":"Semordnilap","pathname":"/algorithm-problems/algoexpert/easy/semordnilap","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Algorithm Problems"},{"label":"AlgoExpert"},{"label":"Easy"}]},{"id":"MF7XvCckQbyArxcaNjWh","title":"First Non Repeating Character","pathname":"/algorithm-problems/algoexpert/easy/first-non-repeating-character","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Algorithm Problems"},{"label":"AlgoExpert"},{"label":"Easy"}]},{"id":"m3zqAVOn7KEvL6zx5AEl","title":"Generate Document","pathname":"/algorithm-problems/algoexpert/easy/generate-document","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Algorithm Problems"},{"label":"AlgoExpert"},{"label":"Easy"}]},{"id":"LpFH1BFYv4Tozo4gzlSD","title":"Run Length Encoding","pathname":"/algorithm-problems/algoexpert/easy/run-length-encoding","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Algorithm Problems"},{"label":"AlgoExpert"},{"label":"Easy"}]},{"id":"YPleB4OEz4DaP32R9BPF","title":"Caesar Cipher Encryptor","pathname":"/algorithm-problems/algoexpert/easy/caesar-cipher-encryptor","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Algorithm Problems"},{"label":"AlgoExpert"},{"label":"Easy"}]},{"id":"NthpYCoWL7vuyyTokNhH","title":"Palindrome Check","pathname":"/algorithm-problems/algoexpert/easy/palindrome-check","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Algorithm Problems"},{"label":"AlgoExpert"},{"label":"Easy"}]},{"id":"69tWYkuqOjNSMpcpj1ID","title":"Selection Sort","pathname":"/algorithm-problems/algoexpert/easy/selection-sort","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Algorithm Problems"},{"label":"AlgoExpert"},{"label":"Easy"}]},{"id":"v96i3Jfwx33da9yKghpR","title":"Bubble Sort","pathname":"/algorithm-problems/algoexpert/easy/bubble-sort","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Algorithm Problems"},{"label":"AlgoExpert"},{"label":"Easy"}]},{"id":"paAHtUAvQXAAfCGwoXj2","title":"Find Three Largest Sum","pathname":"/algorithm-problems/algoexpert/easy/find-three-largest-sum","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Algorithm Problems"},{"label":"AlgoExpert"},{"label":"Easy"}]},{"id":"cfrlwopBLkTaTEosHUEg","title":"Binary Search","pathname":"/algorithm-problems/algoexpert/easy/binary-search","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Algorithm Problems"},{"label":"AlgoExpert"},{"label":"Easy"}]},{"id":"5mWEycwEPZ1Aoopp6nk6","title":"Product Sum","pathname":"/algorithm-problems/algoexpert/easy/product-sum","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Algorithm Problems"},{"label":"AlgoExpert"},{"label":"Easy"}]},{"id":"92DJk5bsM2dZXrNWbPes","title":"Nth Fibonacci","pathname":"/algorithm-problems/algoexpert/easy/nth-fibonacci","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Algorithm Problems"},{"label":"AlgoExpert"},{"label":"Easy"}]},{"id":"TLwsACyB45mQlWbhvW1Q","title":"Remove Duplicates From LinkedList","pathname":"/algorithm-problems/algoexpert/easy/remove-duplicates-from-linkedlist","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Algorithm Problems"},{"label":"AlgoExpert"},{"label":"Easy"}]},{"id":"cSomEvafna6PKjbnmfgj","title":"Tandem Bicycle","pathname":"/algorithm-problems/algoexpert/easy/tandem-bicycle","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Algorithm Problems"},{"label":"AlgoExpert"},{"label":"Easy"}]},{"id":"VRMVD20eUFtnlD79q2WO","title":"Class Photos","pathname":"/algorithm-problems/algoexpert/easy/class-photos","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Algorithm Problems"},{"label":"AlgoExpert"},{"label":"Easy"}]},{"id":"Oqss5VmyA3KhcLSVcrPT","title":"Minimum Waiting Time","pathname":"/algorithm-problems/algoexpert/easy/minimum-waiting-time","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Algorithm Problems"},{"label":"AlgoExpert"},{"label":"Easy"}]},{"id":"w7nRXIZfGfSOeTU1t3pQ","title":"Depth-first Search","pathname":"/algorithm-problems/algoexpert/easy/depth-first-search","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Algorithm Problems"},{"label":"AlgoExpert"},{"label":"Easy"}]},{"id":"2I37a4jtRCOLEKsm47XI","title":"Node Depths","pathname":"/algorithm-problems/algoexpert/easy/node-depths","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Algorithm Problems"},{"label":"AlgoExpert"},{"label":"Easy"}]},{"id":"v2wsIAcSDzKBWpug0vfG","title":"Branch Sums","pathname":"/algorithm-problems/algoexpert/easy/branch-sums","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Algorithm Problems"},{"label":"AlgoExpert"},{"label":"Easy"}]},{"id":"6yvqz54eUf7tKH1YcDh4","title":"Find Closest Value In Bst","pathname":"/algorithm-problems/algoexpert/easy/find-closest-value-in-bst","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Algorithm Problems"},{"label":"AlgoExpert"},{"label":"Easy"}]},{"id":"DZvKi5UD3tigqJwPbxVx","title":"Non Constructible Change","pathname":"/algorithm-problems/algoexpert/easy/non-constructible-change","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Algorithm Problems"},{"label":"AlgoExpert"},{"label":"Easy"}]},{"id":"tfUZY90VbAMbXMEmJBhK","title":"Tournament Winner","pathname":"/algorithm-problems/algoexpert/easy/tournament-winner","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Algorithm Problems"},{"label":"AlgoExpert"},{"label":"Easy"}]},{"id":"9BCDqxnrmxtPuXiaLaBu","title":"Sorted Squared Array","pathname":"/algorithm-problems/algoexpert/easy/sorted-squared-array","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Algorithm Problems"},{"label":"AlgoExpert"},{"label":"Easy"}]},{"id":"AO1gfNaiSQvwyw4ve6Z2","title":"Validate Subsequences","pathname":"/algorithm-problems/algoexpert/easy/validate-subsequences","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Algorithm Problems"},{"label":"AlgoExpert"},{"label":"Easy"}]},{"id":"CL9EkNoMUt3phQ7mhQpL","title":"Two Number Sum","pathname":"/algorithm-problems/algoexpert/easy/two-number-sum","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Algorithm Problems"},{"label":"AlgoExpert"},{"label":"Easy"}]},{"id":"Oi2AUeyOl4sLF8ypb2UW","title":"Daily Algorithms","pathname":"/algorithm-problems/daily-algorithms","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Algorithm Problems"}]},{"id":"KvTRYqx79UEw80oxgEL7","title":"1. Topological Sort","pathname":"/algorithm-problems/daily-algorithms/1.-topological-sort","siteSpaceId":"sitesp_wgUof","description":"class prerequisites","breadcrumbs":[{"label":"Algorithm Problems"},{"label":"Daily Algorithms"}]},{"id":"F42nD9ddHhyuM3oBvvDX","title":"2. MST- Prim, Kruskal","pathname":"/algorithm-problems/daily-algorithms/2.-mst-prim-kruskal","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Algorithm Problems"},{"label":"Daily Algorithms"}]},{"id":"yF84SjofQC0vSoEE4KMU","title":"3. Cycle in a Graph","pathname":"/algorithm-problems/daily-algorithms/3.-cycle-in-a-graph","siteSpaceId":"sitesp_wgUof","description":"See Graph","breadcrumbs":[{"label":"Algorithm Problems"},{"label":"Daily Algorithms"}]},{"id":"BsrwXjQy13yVrpEhIHSx","title":"[Algo] Cycle in Graph (directed)","pathname":"/algorithm-problems/daily-algorithms/3.-cycle-in-a-graph/algo-cycle-in-graph-directed","siteSpaceId":"sitesp_wgUof","description":"check if there is a cycle in a directed graph","breadcrumbs":[{"label":"Algorithm Problems"},{"label":"Daily Algorithms"},{"label":"3. Cycle in a Graph"}]},{"id":"Kd4t7to10jWDrh2enwIO","title":"4. Maximum sub array sum","pathname":"/algorithm-problems/daily-algorithms/4.-maximum-sub-array-sum","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Algorithm Problems"},{"label":"Daily Algorithms"}]},{"id":"4kAih7AEhFfcHzbo3Owo","title":"Problem","pathname":"/algorithm-problems/daily-algorithms/4.-maximum-sub-array-sum/problem","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Algorithm Problems"},{"label":"Daily Algorithms"},{"label":"4. Maximum sub array sum"}]},{"id":"pNUUm4N46XEjYSkVUu9W","title":"Solutions","pathname":"/algorithm-problems/daily-algorithms/4.-maximum-sub-array-sum/solutions","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Algorithm Problems"},{"label":"Daily Algorithms"},{"label":"4. Maximum sub array sum"}]},{"id":"ovZ3eQ0l03f6OFaLC3u9","title":"Brute Force","pathname":"/algorithm-problems/daily-algorithms/4.-maximum-sub-array-sum/solutions/brute-force","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Algorithm Problems"},{"label":"Daily Algorithms"},{"label":"4. Maximum sub array sum"},{"label":"Solutions"}]},{"id":"xscZzqZYIVPWV0bHslLk","title":"Divide And Conquer","pathname":"/algorithm-problems/daily-algorithms/4.-maximum-sub-array-sum/solutions/divide-and-conquer","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Algorithm Problems"},{"label":"Daily Algorithms"},{"label":"4. Maximum sub array sum"},{"label":"Solutions"}]},{"id":"0JJcZVHuk0rlgkjHNSKV","title":"Kadane's Algorithm - Dynamic","pathname":"/algorithm-problems/daily-algorithms/4.-maximum-sub-array-sum/solutions/kadanes-algorithm-dynamic","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Algorithm Problems"},{"label":"Daily Algorithms"},{"label":"4. Maximum sub array sum"},{"label":"Solutions"}]},{"id":"tDle8GIvuuuTAqqNTXyS","title":"Empty Array allowed","pathname":"/algorithm-problems/daily-algorithms/4.-maximum-sub-array-sum/empty-array-allowed","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Algorithm Problems"},{"label":"Daily Algorithms"},{"label":"4. Maximum sub array sum"}]},{"id":"HWwlIehBpGF4dgHq2j0z","title":"Empty Array not allowed","pathname":"/algorithm-problems/daily-algorithms/4.-maximum-sub-array-sum/empty-array-not-allowed","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Algorithm Problems"},{"label":"Daily Algorithms"},{"label":"4. Maximum sub array sum"}]},{"id":"kDH6BXRzWUL0XSMy5l7m","title":"Empty Array Not Allowed + circular","pathname":"/algorithm-problems/daily-algorithms/4.-maximum-sub-array-sum/empty-array-not-allowed-+-circular","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Algorithm Problems"},{"label":"Daily Algorithms"},{"label":"4. Maximum sub array sum"}]},{"id":"w1NO0tZTXgvqFLdCpvRZ","title":"Double array:: O(N), O(N)","pathname":"/algorithm-problems/daily-algorithms/4.-maximum-sub-array-sum/empty-array-not-allowed-+-circular/double-array-o-n-o-n","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Algorithm Problems"},{"label":"Daily Algorithms"},{"label":"4. Maximum sub array sum"},{"label":"Empty Array Not Allowed + circular"}]},{"id":"1CR8iOLhlFJAoNtJWT2I","title":"minimum subarray:: O(N), O(1)","pathname":"/algorithm-problems/daily-algorithms/4.-maximum-sub-array-sum/empty-array-not-allowed-+-circular/minimum-subarray-o-n-o-1","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Algorithm Problems"},{"label":"Daily Algorithms"},{"label":"4. Maximum sub array sum"},{"label":"Empty Array Not Allowed + circular"}]},{"id":"DGab1OycaGD1rrSTZW99","title":"5. Detect a Cycle in a graph with a disjoint set (Union Find)","pathname":"/algorithm-problems/daily-algorithms/5.-detect-a-cycle-in-a-graph-with-a-disjoint-set-union-find","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Algorithm Problems"},{"label":"Daily Algorithms"}]},{"id":"zl8FAL6SwaGqh0N9shiI","title":"6. Kruskal's Algorithm - Union Find","pathname":"/algorithm-problems/daily-algorithms/6.-kruskals-algorithm-union-find","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Algorithm Problems"},{"label":"Daily Algorithms"}]},{"id":"QRyDf2K97Cuz7vYcf1uA","title":"7. Prim's Algorithm - Priority Queue","pathname":"/algorithm-problems/daily-algorithms/7.-prims-algorithm-priority-queue","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Algorithm Problems"},{"label":"Daily Algorithms"}]},{"id":"Pv3r5tOVh7MoBpMKR7Ph","title":"8. Sort Array nlogn","pathname":"/algorithm-problems/daily-algorithms/8.-sort-array-nlogn","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Algorithm Problems"},{"label":"Daily Algorithms"}]},{"id":"DbZ8SBWg85kL6fExhc0p","title":"9. Shortest path - BFS","pathname":"/algorithm-problems/daily-algorithms/9.-shortest-path-bfs","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Algorithm Problems"},{"label":"Daily Algorithms"}]},{"id":"Gr1HW2LndvGG128gcTQe","title":"10. Dijkstra algorithm","pathname":"/algorithm-problems/daily-algorithms/10.-dijkstra-algorithm","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Algorithm Problems"},{"label":"Daily Algorithms"}]},{"id":"ppTikV6AIQ2med1NFuIR","title":"11. Minimum spanning tree - points","pathname":"/algorithm-problems/daily-algorithms/11.-minimum-spanning-tree-points","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Algorithm Problems"},{"label":"Daily Algorithms"}]},{"id":"JQzqDE6u3N99exBGibmo","title":"12. Minimum depth in a binary tree","pathname":"/algorithm-problems/daily-algorithms/12.-minimum-depth-in-a-binary-tree","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Algorithm Problems"},{"label":"Daily Algorithms"}]},{"id":"y2S3XS8Vxk2b1VwLdrnc","title":"13. [Counting Sort]: H-index","pathname":"/algorithm-problems/daily-algorithms/13.-counting-sort-h-index","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Algorithm Problems"},{"label":"Daily Algorithms"}]},{"id":"TvZeppoY3p6QZHzauvYX","title":"14. [shortest path]: Floyd-Warshall","pathname":"/algorithm-problems/daily-algorithms/14.-shortest-path-floyd-warshall","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Algorithm Problems"},{"label":"Daily Algorithms"}]},{"id":"9jcL0pnWdN3YInzYZi8g","title":"15. [Linked List]: reverse list","pathname":"/algorithm-problems/daily-algorithms/15.-linked-list-reverse-list","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Algorithm Problems"},{"label":"Daily Algorithms"}]},{"id":"Rcc6bY5e9jvw78oRu6Qx","title":"16. [Linked List]: swap nodes in pairs","pathname":"/algorithm-problems/daily-algorithms/16.-linked-list-swap-nodes-in-pairs","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Algorithm Problems"},{"label":"Daily Algorithms"}]},{"id":"eYpVqnhJj3y0q1sSNCCU","title":"17.[Linked List]: Merge k Sorted Lists","pathname":"/algorithm-problems/daily-algorithms/17.-linked-list-merge-k-sorted-lists","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Algorithm Problems"},{"label":"Daily Algorithms"}]},{"id":"duqtcxGxk3PAHCLYh9T0","title":"18.[Linked list]:234. Palindrome Linked List","pathname":"/algorithm-problems/daily-algorithms/18.-linked-list-234.-palindrome-linked-list","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Algorithm Problems"},{"label":"Daily Algorithms"}]},{"id":"rABnCGbrhXzhI124WvcC","title":"19. [Linked List]: Linked List Cycle","pathname":"/algorithm-problems/daily-algorithms/19.-linked-list-linked-list-cycle","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Algorithm Problems"},{"label":"Daily Algorithms"}]},{"id":"941eAL2WU6rvaabzhhA0","title":"20. [Linked List] Reverse Linked List II","pathname":"/algorithm-problems/daily-algorithms/20.-linked-list-reverse-linked-list-ii","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Algorithm Problems"},{"label":"Daily Algorithms"}]},{"id":"82N7idUm5aD5PJyvInur","title":"21. [Linked List] sort a list - asc","pathname":"/algorithm-problems/daily-algorithms/21.-linked-list-sort-a-list-asc","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Algorithm Problems"},{"label":"Daily Algorithms"}]},{"id":"2uOk8FOgnQ8LzeNap4FV","title":"22. [Sort] Quick Sort","pathname":"/algorithm-problems/daily-algorithms/22.-sort-quick-sort","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Algorithm Problems"},{"label":"Daily Algorithms"}]},{"id":"wZuoHAhMNxhagPlHNHRS","title":"23. [matrix] Spiral Matrix","pathname":"/algorithm-problems/daily-algorithms/23.-matrix-spiral-matrix","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Algorithm Problems"},{"label":"Daily Algorithms"}]},{"id":"wpqciy4s82xgUrLJrXkw","title":"24. [matrix] Number of Islands","pathname":"/algorithm-problems/daily-algorithms/24.-matrix-number-of-islands","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Algorithm Problems"},{"label":"Daily Algorithms"}]},{"id":"yOqZl3xXn3ZFovo9ancY","title":"25. [matrix] Valid Sudoku","pathname":"/algorithm-problems/daily-algorithms/25.-matrix-valid-sudoku","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Algorithm Problems"},{"label":"Daily Algorithms"}]},{"id":"t7mVWsb1fTodMNUAgFnN","title":"26. [matrix] Sudoku Solver","pathname":"/algorithm-problems/daily-algorithms/26.-matrix-sudoku-solver","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Algorithm Problems"},{"label":"Daily Algorithms"}]},{"id":"TAfbZYyVnpt7yAkXGviC","title":"Source","pathname":"/top-75-leetcode-questions-to-save-your-time/source","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Top 75 LeetCode Questions to Save Your Time"}]},{"id":"l470Sl3CAFy0K51n5xz5","title":"Problems","pathname":"/top-75-leetcode-questions-to-save-your-time/problems","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Top 75 LeetCode Questions to Save Your Time"}]},{"id":"RVNwrljPtquRRM0LZlS9","title":"Interval","pathname":"/top-75-leetcode-questions-to-save-your-time/problems/interval","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Top 75 LeetCode Questions to Save Your Time"},{"label":"Problems"}]},{"id":"BQn9tpY7x8VOTqOnxihQ","title":"56. Merge Intervals","pathname":"/top-75-leetcode-questions-to-save-your-time/problems/interval/56.-merge-intervals","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Top 75 LeetCode Questions to Save Your Time"},{"label":"Problems"},{"label":"Interval"}]},{"id":"QUT7VYuJnBdKwqI2iwYl","title":"435. Non-overlapping Intervals","pathname":"/top-75-leetcode-questions-to-save-your-time/problems/interval/435.-non-overlapping-intervals","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Top 75 LeetCode Questions to Save Your Time"},{"label":"Problems"},{"label":"Interval"}]},{"id":"xQ5UfXj8eChcTTT1ez2d","title":"x 57. Insert Interval","pathname":"/top-75-leetcode-questions-to-save-your-time/problems/interval/x-57.-insert-interval","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Top 75 LeetCode Questions to Save Your Time"},{"label":"Problems"},{"label":"Interval"}]},{"id":"NxQEUBLU7bkDjZhXIBUE","title":"Heap","pathname":"/top-75-leetcode-questions-to-save-your-time/problems/heap","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Top 75 LeetCode Questions to Save Your Time"},{"label":"Problems"}]},{"id":"MnnFX1bYqEXfig5i7Xrq","title":"x 295. Find Median from Data Stream","pathname":"/top-75-leetcode-questions-to-save-your-time/problems/heap/x-295.-find-median-from-data-stream","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Top 75 LeetCode Questions to Save Your Time"},{"label":"Problems"},{"label":"Heap"}]},{"id":"GQ7ZypEhUT4JzLymiRBl","title":"347. Top K Frequent Elements","pathname":"/top-75-leetcode-questions-to-save-your-time/problems/heap/347.-top-k-frequent-elements","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Top 75 LeetCode Questions to Save Your Time"},{"label":"Problems"},{"label":"Heap"}]},{"id":"viCwDedszLDF9Yq8A3tm","title":"23. Merge k Sorted Lists","pathname":"/top-75-leetcode-questions-to-save-your-time/problems/heap/23.-merge-k-sorted-lists","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Top 75 LeetCode Questions to Save Your Time"},{"label":"Problems"},{"label":"Heap"}]},{"id":"dAmQpWDF8cgIjNxkBV6z","title":"Array","pathname":"/top-75-leetcode-questions-to-save-your-time/problems/array","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Top 75 LeetCode Questions to Save Your Time"},{"label":"Problems"}]},{"id":"gjV8HwrbJghQ0ThuEKvA","title":"Untitled","pathname":"/top-75-leetcode-questions-to-save-your-time/problems/array/untitled","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Top 75 LeetCode Questions to Save Your Time"},{"label":"Problems"},{"label":"Array"}]},{"id":"IYB4kLawOjaazILdXqZm","title":"10. 11. Container With Most Water","pathname":"/top-75-leetcode-questions-to-save-your-time/problems/array/10.-11.-container-with-most-water","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Top 75 LeetCode Questions to Save Your Time"},{"label":"Problems"},{"label":"Array"}]},{"id":"HH7g446ktsoXbhGCcm8F","title":"9. 15. 3Sum","pathname":"/top-75-leetcode-questions-to-save-your-time/problems/array/9.-15.-3sum","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Top 75 LeetCode Questions to Save Your Time"},{"label":"Problems"},{"label":"Array"}]},{"id":"WLxzrMVeVzQJi93KziSe","title":"8. 33. Search in Rotated Sorted Array","pathname":"/top-75-leetcode-questions-to-save-your-time/problems/array/8.-33.-search-in-rotated-sorted-array","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Top 75 LeetCode Questions to Save Your Time"},{"label":"Problems"},{"label":"Array"}]},{"id":"BU03VHBDjREOUJyi7U5J","title":"7. 153. Find Minimum in Rotated Sorted Array","pathname":"/top-75-leetcode-questions-to-save-your-time/problems/array/7.-153.-find-minimum-in-rotated-sorted-array","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Top 75 LeetCode Questions to Save Your Time"},{"label":"Problems"},{"label":"Array"}]},{"id":"8ONtk2JPOYHaKonhP5Cl","title":"x 6. 152. Maximum Product Subarray","pathname":"/top-75-leetcode-questions-to-save-your-time/problems/array/x-6.-152.-maximum-product-subarray","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Top 75 LeetCode Questions to Save Your Time"},{"label":"Problems"},{"label":"Array"}]},{"id":"0nUimW4mKIlfasIoT1sG","title":"5. 53. Maximum Subarray","pathname":"/top-75-leetcode-questions-to-save-your-time/problems/array/5.-53.-maximum-subarray","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Top 75 LeetCode Questions to Save Your Time"},{"label":"Problems"},{"label":"Array"}]},{"id":"NyvF6GdLECkNlOzA1SGy","title":"4. 238. Product of Array Except Self","pathname":"/top-75-leetcode-questions-to-save-your-time/problems/array/4.-238.-product-of-array-except-self","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Top 75 LeetCode Questions to Save Your Time"},{"label":"Problems"},{"label":"Array"}]},{"id":"3U0Of4inp7UbfkwRsCrA","title":"1. Two Sums","pathname":"/top-75-leetcode-questions-to-save-your-time/problems/array/1.-two-sums","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Top 75 LeetCode Questions to Save Your Time"},{"label":"Problems"},{"label":"Array"}]},{"id":"4V9r93YaedPLdZDYETjT","title":"2. Best Time to Buy and Sell Stock","pathname":"/top-75-leetcode-questions-to-save-your-time/problems/array/2.-best-time-to-buy-and-sell-stock","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Top 75 LeetCode Questions to Save Your Time"},{"label":"Problems"},{"label":"Array"}]},{"id":"UT7mAyIljWG7zEVliIi8","title":"3. Contains Duplicate","pathname":"/top-75-leetcode-questions-to-save-your-time/problems/array/3.-contains-duplicate","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Top 75 LeetCode Questions to Save Your Time"},{"label":"Problems"},{"label":"Array"}]},{"id":"6MTBmyILqRYhiSqqyGIN","title":"Binary","pathname":"/top-75-leetcode-questions-to-save-your-time/problems/binary","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Top 75 LeetCode Questions to Save Your Time"},{"label":"Problems"}]},{"id":"eXbveHe8UABOlK2V5Ogz","title":"190. Reverse Bits","pathname":"/top-75-leetcode-questions-to-save-your-time/problems/binary/190.-reverse-bits","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Top 75 LeetCode Questions to Save Your Time"},{"label":"Problems"},{"label":"Binary"}]},{"id":"703Fb5Oj6ubOTYNgnhTD","title":"268. Missing Number","pathname":"/top-75-leetcode-questions-to-save-your-time/problems/binary/268.-missing-number","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Top 75 LeetCode Questions to Save Your Time"},{"label":"Problems"},{"label":"Binary"}]},{"id":"fR9hq2bqVDkZzlhzOD6p","title":"x 338. Counting Bits","pathname":"/top-75-leetcode-questions-to-save-your-time/problems/binary/x-338.-counting-bits","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Top 75 LeetCode Questions to Save Your Time"},{"label":"Problems"},{"label":"Binary"}]},{"id":"23LIanu52CbLcLbJw5GI","title":"12. 191. Number of 1 Bits","pathname":"/top-75-leetcode-questions-to-save-your-time/problems/binary/12.-191.-number-of-1-bits","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Top 75 LeetCode Questions to Save Your Time"},{"label":"Problems"},{"label":"Binary"}]},{"id":"0qmaFKF2xx99QexBSDAi","title":"11. 371. Sum of Two Integers","pathname":"/top-75-leetcode-questions-to-save-your-time/problems/binary/11.-371.-sum-of-two-integers","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Top 75 LeetCode Questions to Save Your Time"},{"label":"Problems"},{"label":"Binary"}]},{"id":"sDFpGYQ1Sl3HQBDu1A7L","title":"Graph","pathname":"/top-75-leetcode-questions-to-save-your-time/problems/graph","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Top 75 LeetCode Questions to Save Your Time"},{"label":"Problems"}]},{"id":"szJzgpJjQtT3mhMW1dWQ","title":"x 417. Pacific Atlantic Water Flow","pathname":"/top-75-leetcode-questions-to-save-your-time/problems/graph/x-417.-pacific-atlantic-water-flow","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Top 75 LeetCode Questions to Save Your Time"},{"label":"Problems"},{"label":"Graph"}]},{"id":"AtWKZVeLzCWzxQ0ALjHq","title":"x 128. Longest Consecutive Sequence","pathname":"/top-75-leetcode-questions-to-save-your-time/problems/graph/x-128.-longest-consecutive-sequence","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Top 75 LeetCode Questions to Save Your Time"},{"label":"Problems"},{"label":"Graph"}]},{"id":"939Ta6Uni3kbRg6GcZVd","title":"207. Course Schedule","pathname":"/top-75-leetcode-questions-to-save-your-time/problems/graph/207.-course-schedule","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Top 75 LeetCode Questions to Save Your Time"},{"label":"Problems"},{"label":"Graph"}]},{"id":"aa2fV8nKHFj0BkSnnXrf","title":"133. Clone Graph","pathname":"/top-75-leetcode-questions-to-save-your-time/problems/graph/133.-clone-graph","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Top 75 LeetCode Questions to Save Your Time"},{"label":"Problems"},{"label":"Graph"}]},{"id":"OGlKqeRqhDFpNALe7dgx","title":"200. Number of Islands","pathname":"/top-75-leetcode-questions-to-save-your-time/problems/graph/200.-number-of-islands","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Top 75 LeetCode Questions to Save Your Time"},{"label":"Problems"},{"label":"Graph"}]},{"id":"72G4OINzApTF1KDIV8ah","title":"Tree","pathname":"/top-75-leetcode-questions-to-save-your-time/problems/tree","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Top 75 LeetCode Questions to Save Your Time"},{"label":"Problems"}]},{"id":"3AnVISEs1JTVeYLLsp3U","title":"x 297. Serialize and Deserialize Binary Tree","pathname":"/top-75-leetcode-questions-to-save-your-time/problems/tree/x-297.-serialize-and-deserialize-binary-tree","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Top 75 LeetCode Questions to Save Your Time"},{"label":"Problems"},{"label":"Tree"}]},{"id":"6C0xVJTunmaPBrKAWZjI","title":"x 105. Construct Binary Tree from Preorder and Inorder Traversal","pathname":"/top-75-leetcode-questions-to-save-your-time/problems/tree/x-105.-construct-binary-tree-from-preorder-and-inorder-traversal","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Top 75 LeetCode Questions to Save Your Time"},{"label":"Problems"},{"label":"Tree"}]},{"id":"HjxRODTTl0WRE6OvAKPv","title":"x 212. Word Search II","pathname":"/top-75-leetcode-questions-to-save-your-time/problems/tree/x-212.-word-search-ii","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Top 75 LeetCode Questions to Save Your Time"},{"label":"Problems"},{"label":"Tree"}]},{"id":"lrn7M4HntzM5qYnl7vi9","title":"211. Design Add and Search Words Data Structure","pathname":"/top-75-leetcode-questions-to-save-your-time/problems/tree/211.-design-add-and-search-words-data-structure","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Top 75 LeetCode Questions to Save Your Time"},{"label":"Problems"},{"label":"Tree"}]},{"id":"LDATZu7glqS5JMMrEnMq","title":"208. Implement Trie (Prefix Tree)","pathname":"/top-75-leetcode-questions-to-save-your-time/problems/tree/208.-implement-trie-prefix-tree","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Top 75 LeetCode Questions to Save Your Time"},{"label":"Problems"},{"label":"Tree"}]},{"id":"QyNIaw0nvAnstdxgsLTB","title":"235. Lowest Common Ancestor of a Binary Search Tree","pathname":"/top-75-leetcode-questions-to-save-your-time/problems/tree/235.-lowest-common-ancestor-of-a-binary-search-tree","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Top 75 LeetCode Questions to Save Your Time"},{"label":"Problems"},{"label":"Tree"}]},{"id":"Rqk4vwGUXaGo0mykCl7p","title":"230. Kth Smallest Element in a BST","pathname":"/top-75-leetcode-questions-to-save-your-time/problems/tree/230.-kth-smallest-element-in-a-bst","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Top 75 LeetCode Questions to Save Your Time"},{"label":"Problems"},{"label":"Tree"}]},{"id":"NS0IUie3WQ1gknWZbIVI","title":"98. Validate Binary Search Tree","pathname":"/top-75-leetcode-questions-to-save-your-time/problems/tree/98.-validate-binary-search-tree","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Top 75 LeetCode Questions to Save Your Time"},{"label":"Problems"},{"label":"Tree"}]},{"id":"nRhwDw4Y2DFCGlDxpT30","title":"572. Subtree of Another Tree","pathname":"/top-75-leetcode-questions-to-save-your-time/problems/tree/572.-subtree-of-another-tree","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Top 75 LeetCode Questions to Save Your Time"},{"label":"Problems"},{"label":"Tree"}]},{"id":"57ormVilgpib6nUbCvRg","title":"297. Serialize and Deserialize Binary Tree ?","pathname":"/top-75-leetcode-questions-to-save-your-time/problems/tree/297.-serialize-and-deserialize-binary-tree","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Top 75 LeetCode Questions to Save Your Time"},{"label":"Problems"},{"label":"Tree"}]},{"id":"0FzQWlpBuryY7HnMXxnJ","title":"102. Binary Tree Level Order Traversal","pathname":"/top-75-leetcode-questions-to-save-your-time/problems/tree/102.-binary-tree-level-order-traversal","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Top 75 LeetCode Questions to Save Your Time"},{"label":"Problems"},{"label":"Tree"}]},{"id":"6kjbN8oBExvUlAU1WfFG","title":"124. Binary Tree Maximum Path Sum","pathname":"/top-75-leetcode-questions-to-save-your-time/problems/tree/124.-binary-tree-maximum-path-sum","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Top 75 LeetCode Questions to Save Your Time"},{"label":"Problems"},{"label":"Tree"}]},{"id":"g37VxYqzTo6TKW23DUYo","title":"226. Invert Binary Tree","pathname":"/top-75-leetcode-questions-to-save-your-time/problems/tree/226.-invert-binary-tree","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Top 75 LeetCode Questions to Save Your Time"},{"label":"Problems"},{"label":"Tree"}]},{"id":"m5fG884dI1NttyjRz8Ux","title":"100. Same Tree","pathname":"/top-75-leetcode-questions-to-save-your-time/problems/tree/100.-same-tree","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Top 75 LeetCode Questions to Save Your Time"},{"label":"Problems"},{"label":"Tree"}]},{"id":"DXh4A9a1cL6azgW81T26","title":"104. Maximum Depth of Binary Tree","pathname":"/top-75-leetcode-questions-to-save-your-time/problems/tree/104.-maximum-depth-of-binary-tree","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Top 75 LeetCode Questions to Save Your Time"},{"label":"Problems"},{"label":"Tree"}]},{"id":"pXQFY5YA1oDygskqeIzq","title":"Dynamic Programming","pathname":"/top-75-leetcode-questions-to-save-your-time/problems/dynamic-programming","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Top 75 LeetCode Questions to Save Your Time"},{"label":"Problems"}]},{"id":"LzAJ5NfOBjjqPhsdOItL","title":"x 62. Unique Paths","pathname":"/top-75-leetcode-questions-to-save-your-time/problems/dynamic-programming/x-62.-unique-paths","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Top 75 LeetCode Questions to Save Your Time"},{"label":"Problems"},{"label":"Dynamic Programming"}]},{"id":"mm9zcbPisPXhO13Zoesh","title":"x91. Decode Ways","pathname":"/top-75-leetcode-questions-to-save-your-time/problems/dynamic-programming/x91.-decode-ways","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Top 75 LeetCode Questions to Save Your Time"},{"label":"Problems"},{"label":"Dynamic Programming"}]},{"id":"I341u9M2VlYs7njskdPw","title":"55. Jump Game","pathname":"/top-75-leetcode-questions-to-save-your-time/problems/dynamic-programming/55.-jump-game","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Top 75 LeetCode Questions to Save Your Time"},{"label":"Problems"},{"label":"Dynamic Programming"}]},{"id":"dhciaBL0sgIWxgowr5bm","title":"x 213. House Robber II","pathname":"/top-75-leetcode-questions-to-save-your-time/problems/dynamic-programming/x-213.-house-robber-ii","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Top 75 LeetCode Questions to Save Your Time"},{"label":"Problems"},{"label":"Dynamic Programming"}]},{"id":"bEHf9V1Xg5gQTIuNT3ft","title":"198. House Robber","pathname":"/top-75-leetcode-questions-to-save-your-time/problems/dynamic-programming/198.-house-robber","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Top 75 LeetCode Questions to Save Your Time"},{"label":"Problems"},{"label":"Dynamic Programming"}]},{"id":"cEXIxl8iwW3rpWMhnwfh","title":"377. Combination Sum IV","pathname":"/top-75-leetcode-questions-to-save-your-time/problems/dynamic-programming/377.-combination-sum-iv","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Top 75 LeetCode Questions to Save Your Time"},{"label":"Problems"},{"label":"Dynamic Programming"}]},{"id":"AEpvNwKLYONtItuTIuPh","title":"x 139. Word Break","pathname":"/top-75-leetcode-questions-to-save-your-time/problems/dynamic-programming/x-139.-word-break","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Top 75 LeetCode Questions to Save Your Time"},{"label":"Problems"},{"label":"Dynamic Programming"}]},{"id":"ZZIzGFwAGuiYFpq4VyBH","title":"1143. Longest Common Subsequence","pathname":"/top-75-leetcode-questions-to-save-your-time/problems/dynamic-programming/1143.-longest-common-subsequence","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Top 75 LeetCode Questions to Save Your Time"},{"label":"Problems"},{"label":"Dynamic Programming"}]},{"id":"d6iOKKkaOkWcFlCmNO4f","title":"300. Longest Increasing Subsequence","pathname":"/top-75-leetcode-questions-to-save-your-time/problems/dynamic-programming/300.-longest-increasing-subsequence","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Top 75 LeetCode Questions to Save Your Time"},{"label":"Problems"},{"label":"Dynamic Programming"}]},{"id":"KHWYech0yZgmREpZx52D","title":"322. Coin Change","pathname":"/top-75-leetcode-questions-to-save-your-time/problems/dynamic-programming/322.-coin-change","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Top 75 LeetCode Questions to Save Your Time"},{"label":"Problems"},{"label":"Dynamic Programming"}]},{"id":"QtnyNcpaScGqZsOB20NE","title":"70. Climbing Stairs","pathname":"/top-75-leetcode-questions-to-save-your-time/problems/dynamic-programming/70.-climbing-stairs","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Top 75 LeetCode Questions to Save Your Time"},{"label":"Problems"},{"label":"Dynamic Programming"}]},{"id":"YAc6GeusH8rwhpzoF2ya","title":"2023 0709 39. Combination Sum","pathname":"/top-75-leetcode-questions-to-save-your-time/problems/dynamic-programming/2023-0709-39.-combination-sum","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Top 75 LeetCode Questions to Save Your Time"},{"label":"Problems"},{"label":"Dynamic Programming"}]},{"id":"SGgeCFcraWKgWPpHcymo","title":"String","pathname":"/top-75-leetcode-questions-to-save-your-time/problems/string","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Top 75 LeetCode Questions to Save Your Time"},{"label":"Problems"}]},{"id":"JMCtyJkL7PZ3izZqLSIF","title":"x 76. Minimum Window Substring","pathname":"/top-75-leetcode-questions-to-save-your-time/problems/string/x-76.-minimum-window-substring","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Top 75 LeetCode Questions to Save Your Time"},{"label":"Problems"},{"label":"String"}]},{"id":"Ir7VAB2EiUexiuJBt8Bw","title":"647. Palindromic Substrings","pathname":"/top-75-leetcode-questions-to-save-your-time/problems/string/647.-palindromic-substrings","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Top 75 LeetCode Questions to Save Your Time"},{"label":"Problems"},{"label":"String"}]},{"id":"zSLybLkMWjHuK3xx7Ov3","title":"x 5. Longest Palindromic Substring","pathname":"/top-75-leetcode-questions-to-save-your-time/problems/string/x-5.-longest-palindromic-substring","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Top 75 LeetCode Questions to Save Your Time"},{"label":"Problems"},{"label":"String"}]},{"id":"Ir0QOGm3V8bv2exux5dt","title":"125. Valid Palindrome","pathname":"/top-75-leetcode-questions-to-save-your-time/problems/string/125.-valid-palindrome","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Top 75 LeetCode Questions to Save Your Time"},{"label":"Problems"},{"label":"String"}]},{"id":"oCGHXmarerzX6CstMWVL","title":"20. Valid Parentheses","pathname":"/top-75-leetcode-questions-to-save-your-time/problems/string/20.-valid-parentheses","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Top 75 LeetCode Questions to Save Your Time"},{"label":"Problems"},{"label":"String"}]},{"id":"ufeRyvj9V17FO8duC9Rm","title":"49. Group Anagrams","pathname":"/top-75-leetcode-questions-to-save-your-time/problems/string/49.-group-anagrams","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Top 75 LeetCode Questions to Save Your Time"},{"label":"Problems"},{"label":"String"}]},{"id":"UxLIXCJTK5bB9cX9nUys","title":"242. Valid Anagram","pathname":"/top-75-leetcode-questions-to-save-your-time/problems/string/242.-valid-anagram","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Top 75 LeetCode Questions to Save Your Time"},{"label":"Problems"},{"label":"String"}]},{"id":"cArc18920sUkaZfoa1bu","title":"5. Longest Palindromic Substring","pathname":"/top-75-leetcode-questions-to-save-your-time/problems/string/5.-longest-palindromic-substring","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Top 75 LeetCode Questions to Save Your Time"},{"label":"Problems"},{"label":"String"}]},{"id":"9uoxlOxcyDcbq249r5gl","title":"3. Longest Substring Without Repeating Characters","pathname":"/top-75-leetcode-questions-to-save-your-time/problems/string/3.-longest-substring-without-repeating-characters","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Top 75 LeetCode Questions to Save Your Time"},{"label":"Problems"},{"label":"String"}]},{"id":"wcvw4MWOJphs3U29ZWaX","title":"Matrix","pathname":"/top-75-leetcode-questions-to-save-your-time/problems/matrix","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Top 75 LeetCode Questions to Save Your Time"},{"label":"Problems"}]},{"id":"jmvHVlaDTXspvgxPCPeE","title":"x 48. Rotate Image","pathname":"/top-75-leetcode-questions-to-save-your-time/problems/matrix/x-48.-rotate-image","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Top 75 LeetCode Questions to Save Your Time"},{"label":"Problems"},{"label":"Matrix"}]},{"id":"3XMa6MlK8M3r0bjFxVwz","title":"79. Word Search","pathname":"/top-75-leetcode-questions-to-save-your-time/problems/matrix/79.-word-search","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Top 75 LeetCode Questions to Save Your Time"},{"label":"Problems"},{"label":"Matrix"}]},{"id":"iPGLzkRIg6dvYNG0rbmW","title":"x 73. Set Matrix Zeroes","pathname":"/top-75-leetcode-questions-to-save-your-time/problems/matrix/x-73.-set-matrix-zeroes","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Top 75 LeetCode Questions to Save Your Time"},{"label":"Problems"},{"label":"Matrix"}]},{"id":"NwgwYqnJDLjEnWPi1nua","title":"54. Spiral Matrix","pathname":"/top-75-leetcode-questions-to-save-your-time/problems/matrix/54.-spiral-matrix","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Top 75 LeetCode Questions to Save Your Time"},{"label":"Problems"},{"label":"Matrix"}]},{"id":"V1U9G4XCYCpW2FxekfQ4","title":"Linked List","pathname":"/top-75-leetcode-questions-to-save-your-time/problems/linked-list","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Top 75 LeetCode Questions to Save Your Time"},{"label":"Problems"}]},{"id":"tDQ0nKR8XQy7LnquZas2","title":"143. Reorder List","pathname":"/top-75-leetcode-questions-to-save-your-time/problems/linked-list/143.-reorder-list","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Top 75 LeetCode Questions to Save Your Time"},{"label":"Problems"},{"label":"Linked List"}]},{"id":"3BN8q7Imm3mHzBIHtGbe","title":"19. Remove Nth Node From End of List","pathname":"/top-75-leetcode-questions-to-save-your-time/problems/linked-list/19.-remove-nth-node-from-end-of-list","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Top 75 LeetCode Questions to Save Your Time"},{"label":"Problems"},{"label":"Linked List"}]},{"id":"w2CEkKqgS6IiTud8q1Po","title":"23. Merge k Sorted Lists","pathname":"/top-75-leetcode-questions-to-save-your-time/problems/linked-list/23.-merge-k-sorted-lists","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Top 75 LeetCode Questions to Save Your Time"},{"label":"Problems"},{"label":"Linked List"}]},{"id":"zbFolyu968MGPqW8lLn8","title":"21. Merge Two Sorted Lists","pathname":"/top-75-leetcode-questions-to-save-your-time/problems/linked-list/21.-merge-two-sorted-lists","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Top 75 LeetCode Questions to Save Your Time"},{"label":"Problems"},{"label":"Linked List"}]},{"id":"Yo937ZqlebSck8xq5s7U","title":"141. Linked List Cycle","pathname":"/top-75-leetcode-questions-to-save-your-time/problems/linked-list/141.-linked-list-cycle","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Top 75 LeetCode Questions to Save Your Time"},{"label":"Problems"},{"label":"Linked List"}]},{"id":"kLW5rp6VJRU2wFEAgNKl","title":"206. Reverse Linked List","pathname":"/top-75-leetcode-questions-to-save-your-time/problems/linked-list/206.-reverse-linked-list","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Top 75 LeetCode Questions to Save Your Time"},{"label":"Problems"},{"label":"Linked List"}]},{"id":"2aYRqIefZB4xSXqodr01","title":"Page 2","pathname":"/tip/page-2","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Tip"}]},{"id":"SqJrxrw2MneXfY9CIMj2","title":"LinkedList","pathname":"/tip/linkedlist","siteSpaceId":"sitesp_wgUof","description":"","breadcrumbs":[{"label":"Tip"}]}]}