blind_75.csv

Leetcode Number,Leetcode title (With Link as Hyperlink),Tags,Difficulty,Blind 75 (Yes/No),Notes,Python Solution,Java Solution
1,"=HYPERLINK(""https://leetcode.com/problems/two-sum/"",""Two Sum"")","Array, HashMap",Easy,Yes,"HashMap complement lookup.","=HYPERLINK(""https://github.com/Iamsdt/Problem-Solving/blob/master/LeetCode/p1.py"",""p1.py"")","=HYPERLINK(""https://github.com/Iamsdt/Problem-Solving/blob/master/LeetCode-Java/p1.java"",""p1.java"")"
121,"=HYPERLINK(""https://leetcode.com/problems/best-time-to-buy-and-sell-stock/"",""Best Time to Buy and Sell Stock"")","Array, Greedy",Easy,Yes,"Track min price and best profit.","=HYPERLINK(""https://github.com/Iamsdt/Problem-Solving/blob/master/LeetCode/p121.py"",""p121.py"")","=HYPERLINK(""https://github.com/Iamsdt/Problem-Solving/blob/master/LeetCode-Java/p121.java"",""p121.java"")"
217,"=HYPERLINK(""https://leetcode.com/problems/contains-duplicate/"",""Contains Duplicate"")","Array, HashSet",Easy,Yes,"HashSet check for repeats.","=HYPERLINK(""https://github.com/Iamsdt/Problem-Solving/blob/master/LeetCode/p217.py"",""p217.py"")","=HYPERLINK(""https://github.com/Iamsdt/Problem-Solving/blob/master/LeetCode-Java/p217.java"",""p217.java"")"
53,"=HYPERLINK(""https://leetcode.com/problems/maximum-subarray/"",""Maximum Subarray"")","Array, DP",Medium,Yes,"Kadane's algorithm.","=HYPERLINK(""https://github.com/Iamsdt/Problem-Solving/blob/master/LeetCode/p53.py"",""p53.py"")","=HYPERLINK(""https://github.com/Iamsdt/Problem-Solving/blob/master/LeetCode-Java/p53.java"",""p53.java"")"
238,"=HYPERLINK(""https://leetcode.com/problems/product-of-array-except-self/"",""Product of Array Except Self"")","Array",Medium,Yes,"Prefix/suffix products.","=HYPERLINK(""https://github.com/Iamsdt/Problem-Solving/blob/master/LeetCode/p238.py"",""p238.py"")","=HYPERLINK(""https://github.com/Iamsdt/Problem-Solving/blob/master/LeetCode-Java/p238.java"",""p238.java"")"
152,"=HYPERLINK(""https://leetcode.com/problems/maximum-product-subarray/"",""Maximum Product Subarray"")","Array, DP",Medium,Yes,"Track max and min products.","=HYPERLINK(""https://github.com/Iamsdt/Problem-Solving/blob/master/LeetCode/p152.py"",""p152.py"")","=HYPERLINK(""https://github.com/Iamsdt/Problem-Solving/blob/master/LeetCode-Java/p152.java"",""p152.java"")"
153,"=HYPERLINK(""https://leetcode.com/problems/find-minimum-in-rotated-sorted-array/"",""Find Minimum in Rotated Sorted Array"")","Binary Search",Medium,Yes,"Binary search on the pivot.","",
33,"=HYPERLINK(""https://leetcode.com/problems/search-in-rotated-sorted-array/"",""Search in Rotated Sorted Array"")","Binary Search",Medium,Yes,"Identify sorted half each step.","=HYPERLINK(""https://github.com/Iamsdt/Problem-Solving/blob/master/LeetCode/p33.py"",""p33.py"")","=HYPERLINK(""https://github.com/Iamsdt/Problem-Solving/blob/master/LeetCode-Java/p33.java"",""p33.java"")"
15,"=HYPERLINK(""https://leetcode.com/problems/3sum/"",""3Sum"")","Array, Two Pointers",Medium,Yes,"Sort, then two pointers; skip dupes.","=HYPERLINK(""https://github.com/Iamsdt/Problem-Solving/blob/master/LeetCode/p15.py"",""p15.py"")","=HYPERLINK(""https://github.com/Iamsdt/Problem-Solving/blob/master/LeetCode-Java/p15.java"",""p15.java"")"
11,"=HYPERLINK(""https://leetcode.com/problems/container-with-most-water/"",""Container With Most Water"")","Two Pointers",Medium,Yes,"Move shorter side inward.","=HYPERLINK(""https://github.com/Iamsdt/Problem-Solving/blob/master/LeetCode/p11.py"",""p11.py"")","=HYPERLINK(""https://github.com/Iamsdt/Problem-Solving/blob/master/LeetCode-Java/p11.java"",""p11.java"")"
371,"=HYPERLINK(""https://leetcode.com/problems/sum-of-two-integers/"",""Sum of Two Integers"")","Bit Manipulation, Math",Easy,Yes,"Use XOR and carry.","",
191,"=HYPERLINK(""https://leetcode.com/problems/number-of-1-bits/"",""Number of 1 Bits"")","Bit Manipulation",Easy,Yes,"Count set bits.","=HYPERLINK(""https://github.com/Iamsdt/Problem-Solving/blob/master/LeetCode/p191.py"",""p191.py"")","=HYPERLINK(""https://github.com/Iamsdt/Problem-Solving/blob/master/LeetCode-Java/p191.java"",""p191.java"")"
338,"=HYPERLINK(""https://leetcode.com/problems/counting-bits/"",""Counting Bits"")","DP, Bit Manipulation",Easy,Yes,"Reuse earlier bit counts.","",
268,"=HYPERLINK(""https://leetcode.com/problems/missing-number/"",""Missing Number"")","Array, Math",Easy,Yes,"Use sum or XOR gap.","",
190,"=HYPERLINK(""https://leetcode.com/problems/reverse-bits/"",""Reverse Bits"")","Bit Manipulation",Easy,Yes,"Shift and rebuild reversed bits.","",
70,"=HYPERLINK(""https://leetcode.com/problems/climbing-stairs/"",""Climbing Stairs"")","DP",Easy,Yes,"Fibonacci-style DP.","=HYPERLINK(""https://github.com/Iamsdt/Problem-Solving/blob/master/LeetCode/p70.py"",""p70.py"")","=HYPERLINK(""https://github.com/Iamsdt/Problem-Solving/blob/master/LeetCode-Java/p70.java"",""p70.java"")"
322,"=HYPERLINK(""https://leetcode.com/problems/coin-change/"",""Coin Change"")","DP",Medium,Yes,"Unbounded knapsack min coins.","=HYPERLINK(""https://github.com/Iamsdt/Problem-Solving/blob/master/LeetCode/p322.py"",""p322.py"")","=HYPERLINK(""https://github.com/Iamsdt/Problem-Solving/blob/master/LeetCode-Java/p322.java"",""p322.java"")"
300,"=HYPERLINK(""https://leetcode.com/problems/longest-increasing-subsequence/"",""Longest Increasing Subsequence"")","DP, Binary Search",Medium,Yes,"Patience sorting tails.","",
1143,"=HYPERLINK(""https://leetcode.com/problems/longest-common-subsequence/"",""Longest Common Subsequence"")","DP, String",Medium,Yes,"2D DP table.","=HYPERLINK(""https://github.com/Iamsdt/Problem-Solving/blob/master/LeetCode/p1143.py"",""p1143.py"")","=HYPERLINK(""https://github.com/Iamsdt/Problem-Solving/blob/master/LeetCode-Java/p1143.java"",""p1143.java"")"
139,"=HYPERLINK(""https://leetcode.com/problems/word-break/"",""Word Break"")","DP, String",Medium,Yes,"DP on string prefixes.","",
377,"=HYPERLINK(""https://leetcode.com/problems/combination-sum-iv/"",""Combination Sum IV"")","DP",Medium,Yes,"Order-sensitive count DP.","",
62,"=HYPERLINK(""https://leetcode.com/problems/unique-paths/"",""Unique Paths"")","DP",Medium,Yes,"Grid DP from start to finish.","",
55,"=HYPERLINK(""https://leetcode.com/problems/jump-game/"",""Jump Game"")","Greedy",Medium,Yes,"Track farthest reachable index.","",
133,"=HYPERLINK(""https://leetcode.com/problems/clone-graph/"",""Clone Graph"")","Graph, DFS/BFS",Medium,Yes,"Clone with old-new map.","",
207,"=HYPERLINK(""https://leetcode.com/problems/course-schedule/"",""Course Schedule"")","Graph, Topological Sort",Medium,Yes,"Detect cycle with topo/DFS.","",
417,"=HYPERLINK(""https://leetcode.com/problems/pacific-atlantic-water-flow/"",""Pacific Atlantic Water Flow"")","Graph, DFS",Medium,Yes,"Reverse DFS from ocean borders.","",
200,"=HYPERLINK(""https://leetcode.com/problems/number-of-islands/"",""Number of Islands"")","Graph, DFS/BFS",Medium,Yes,"Flood-fill each island.","=HYPERLINK(""https://github.com/Iamsdt/Problem-Solving/blob/master/LeetCode/p200.py"",""p200.py"")","=HYPERLINK(""https://github.com/Iamsdt/Problem-Solving/blob/master/LeetCode-Java/p200.java"",""p200.java"")"
128,"=HYPERLINK(""https://leetcode.com/problems/longest-consecutive-sequence/"",""Longest Consecutive Sequence"")","HashSet, Array",Medium,Yes,"Start from sequence heads.","",
269,"=HYPERLINK(""https://leetcode.com/problems/alien-dictionary/"",""Alien Dictionary"")","Graph, Topological Sort",Hard,Yes,"Build char-order graph.","",
261,"=HYPERLINK(""https://leetcode.com/problems/graph-valid-tree/"",""Graph Valid Tree"")","Graph, DFS",Medium,Yes,"Check connected and acyclic.","",
297,"=HYPERLINK(""https://leetcode.com/problems/serialize-and-deserialize-binary-tree/"",""Serialize and Deserialize Binary Tree"")","Tree, BFS/DFS",Hard,Yes,"Encode/decode tree traversal.","",
226,"=HYPERLINK(""https://leetcode.com/problems/invert-binary-tree/"",""Invert Binary Tree"")","Tree, DFS",Easy,Yes,"Swap children recursively.","=HYPERLINK(""https://github.com/Iamsdt/Problem-Solving/blob/master/LeetCode/p226.py"",""p226.py"")","=HYPERLINK(""https://github.com/Iamsdt/Problem-Solving/blob/master/LeetCode-Java/p226.java"",""p226.java"")"
104,"=HYPERLINK(""https://leetcode.com/problems/maximum-depth-of-binary-tree/"",""Maximum Depth of Binary Tree"")","Tree, DFS",Easy,Yes,"1 + max child depth.","=HYPERLINK(""https://github.com/Iamsdt/Problem-Solving/blob/master/LeetCode/p104.py"",""p104.py"")","=HYPERLINK(""https://github.com/Iamsdt/Problem-Solving/blob/master/LeetCode-Java/p104.java"",""p104.java"")"
543,"=HYPERLINK(""https://leetcode.com/problems/diameter-of-binary-tree/"",""Diameter of Binary Tree"")","Tree, DFS",Easy,Yes,"Track longest left+right path.","=HYPERLINK(""https://github.com/Iamsdt/Problem-Solving/blob/master/LeetCode/p543.py"",""p543.py"")","=HYPERLINK(""https://github.com/Iamsdt/Problem-Solving/blob/master/LeetCode-Java/p543.java"",""p543.java"")"
110,"=HYPERLINK(""https://leetcode.com/problems/balanced-binary-tree/"",""Balanced Binary Tree"")","Tree, DFS",Easy,Yes,"Return height or -1.","=HYPERLINK(""https://github.com/Iamsdt/Problem-Solving/blob/master/LeetCode/p110.py"",""p110.py"")","=HYPERLINK(""https://github.com/Iamsdt/Problem-Solving/blob/master/LeetCode-Java/p110.java"",""p110.java"")"
100,"=HYPERLINK(""https://leetcode.com/problems/same-tree/"",""Same Tree"")","Tree, DFS",Easy,Yes,"Compare nodes recursively.","=HYPERLINK(""https://github.com/Iamsdt/Problem-Solving/blob/master/LeetCode/p100.py"",""p100.py"")","=HYPERLINK(""https://github.com/Iamsdt/Problem-Solving/blob/master/LeetCode-Java/p100.java"",""p100.java"")"
572,"=HYPERLINK(""https://leetcode.com/problems/subtree-of-another-tree/"",""Subtree of Another Tree"")","Tree, DFS",Easy,Yes,"Reuse same-tree check.","=HYPERLINK(""https://github.com/Iamsdt/Problem-Solving/blob/master/LeetCode/p572.py"",""p572.py"")","=HYPERLINK(""https://github.com/Iamsdt/Problem-Solving/blob/master/LeetCode-Java/p572.java"",""p572.java"")"
235,"=HYPERLINK(""https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-search-tree/"",""Lowest Common Ancestor of BST"")","Tree, BST",Medium,Yes,"Walk until split point.","=HYPERLINK(""https://github.com/Iamsdt/Problem-Solving/blob/master/LeetCode/p235.py"",""p235.py"")","=HYPERLINK(""https://github.com/Iamsdt/Problem-Solving/blob/master/LeetCode-Java/p235.java"",""p235.java"")"
102,"=HYPERLINK(""https://leetcode.com/problems/binary-tree-level-order-traversal/"",""Binary Tree Level Order Traversal"")","Tree, BFS",Medium,Yes,"Level-by-level queue.","=HYPERLINK(""https://github.com/Iamsdt/Problem-Solving/blob/master/LeetCode/p102.py"",""p102.py"")","=HYPERLINK(""https://github.com/Iamsdt/Problem-Solving/blob/master/LeetCode-Java/p102.java"",""p102.java"")"
199,"=HYPERLINK(""https://leetcode.com/problems/binary-tree-right-side-view/"",""Binary Tree Right Side View"")","Tree, BFS",Medium,Yes,"Capture the rightmost node per level.","=HYPERLINK(""https://github.com/Iamsdt/Problem-Solving/blob/master/LeetCode/p199.py"",""p199.py"")","=HYPERLINK(""https://github.com/Iamsdt/Problem-Solving/blob/master/LeetCode-Java/p199.java"",""p199.java"")"
1448,"=HYPERLINK(""https://leetcode.com/problems/count-good-nodes-in-binary-tree/"",""Count Good Nodes in Binary Tree"")","Tree, DFS",Medium,Yes,"Track path max.","=HYPERLINK(""https://github.com/Iamsdt/Problem-Solving/blob/master/LeetCode/p1448.py"",""p1448.py"")","=HYPERLINK(""https://github.com/Iamsdt/Problem-Solving/blob/master/LeetCode-Java/p1448.java"",""p1448.java"")"
98,"=HYPERLINK(""https://leetcode.com/problems/validate-binary-search-tree/"",""Validate Binary Search Tree"")","Tree, DFS",Medium,Yes,"Use min/max bounds.","=HYPERLINK(""https://github.com/Iamsdt/Problem-Solving/blob/master/LeetCode/p98.py"",""p98.py"")","=HYPERLINK(""https://github.com/Iamsdt/Problem-Solving/blob/master/LeetCode-Java/p98.java"",""p98.java"")"
230,"=HYPERLINK(""https://leetcode.com/problems/kth-smallest-element-in-a-bst/"",""Kth Smallest Element in BST"")","Tree, Inorder",Medium,Yes,"Inorder gives sorted order.","=HYPERLINK(""https://github.com/Iamsdt/Problem-Solving/blob/master/LeetCode/p230.py"",""p230.py"")","=HYPERLINK(""https://github.com/Iamsdt/Problem-Solving/blob/master/LeetCode-Java/p230.java"",""p230.java"")"
105,"=HYPERLINK(""https://leetcode.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal/"",""Construct Binary Tree from Preorder and Inorder Traversal"")","Tree, DFS",Medium,Yes,"Split inorder around root.","=HYPERLINK(""https://github.com/Iamsdt/Problem-Solving/blob/master/LeetCode/p105.py"",""p105.py"")","=HYPERLINK(""https://github.com/Iamsdt/Problem-Solving/blob/master/LeetCode-Java/p105.java"",""p105.java"")"
124,"=HYPERLINK(""https://leetcode.com/problems/binary-tree-maximum-path-sum/"",""Binary Tree Maximum Path Sum"")","Tree, DFS",Hard,Yes,"Global max from left+right gains.","=HYPERLINK(""https://github.com/Iamsdt/Problem-Solving/blob/master/LeetCode/p124.py"",""p124.py"")","=HYPERLINK(""https://github.com/Iamsdt/Problem-Solving/blob/master/LeetCode-Java/p124.java"",""p124.java"")"
208,"=HYPERLINK(""https://leetcode.com/problems/implement-trie-prefix-tree/"",""Implement Trie (Prefix Tree)"")","Trie",Medium,Yes,"26-way trie nodes.","",
211,"=HYPERLINK(""https://leetcode.com/problems/design-add-and-search-words-data-structure/"",""Design Add and Search Words Data Structure"")","Trie, DFS",Medium,Yes,"Wildcard DFS on trie.","",
212,"=HYPERLINK(""https://leetcode.com/problems/word-search-ii/"",""Word Search II"")","Trie, DFS/Backtracking",Hard,Yes,"Trie prune during board DFS.","",
23,"=HYPERLINK(""https://leetcode.com/problems/merge-k-sorted-lists/"",""Merge K Sorted Lists"")","Linked List, Heap",Hard,Yes,"Min-heap over list heads.","=HYPERLINK(""https://github.com/Iamsdt/Problem-Solving/blob/master/LeetCode/p23.py"",""p23.py"")","=HYPERLINK(""https://github.com/Iamsdt/Problem-Solving/blob/master/LeetCode-Java/p23.java"",""p23.java"")"
21,"=HYPERLINK(""https://leetcode.com/problems/merge-two-sorted-lists/"",""Merge Two Sorted Lists"")","Linked List",Easy,Yes,"Two pointers with dummy node.","=HYPERLINK(""https://github.com/Iamsdt/Problem-Solving/blob/master/LeetCode/p21.py"",""p21.py"")","=HYPERLINK(""https://github.com/Iamsdt/Problem-Solving/blob/master/LeetCode-Java/p21.java"",""p21.java"")"
143,"=HYPERLINK(""https://leetcode.com/problems/reorder-list/"",""Reorder List"")","Linked List",Medium,Yes,"Split, reverse second half, merge.","=HYPERLINK(""https://github.com/Iamsdt/Problem-Solving/blob/master/LeetCode/p143.py"",""p143.py"")","=HYPERLINK(""https://github.com/Iamsdt/Problem-Solving/blob/master/LeetCode-Java/p143.java"",""p143.java"")"
19,"=HYPERLINK(""https://leetcode.com/problems/remove-nth-node-from-end-of-list/"",""Remove Nth Node From End of List"")","Linked List, Two Pointers",Medium,Yes,"Fast/slow gap.","=HYPERLINK(""https://github.com/Iamsdt/Problem-Solving/blob/master/LeetCode/p19.py"",""p19.py"")","=HYPERLINK(""https://github.com/Iamsdt/Problem-Solving/blob/master/LeetCode-Java/p19.java"",""p19.java"")"
141,"=HYPERLINK(""https://leetcode.com/problems/linked-list-cycle/"",""Linked List Cycle"")","Linked List, Two Pointers",Easy,Yes,"Floyd cycle detection.","=HYPERLINK(""https://github.com/Iamsdt/Problem-Solving/blob/master/LeetCode/p141.py"",""p141.py"")","=HYPERLINK(""https://github.com/Iamsdt/Problem-Solving/blob/master/LeetCode-Java/p141.java"",""p141.java"")"
206,"=HYPERLINK(""https://leetcode.com/problems/reverse-linked-list/"",""Reverse Linked List"")","Linked List",Easy,Yes,"Iterative pointer reversal.","=HYPERLINK(""https://github.com/Iamsdt/Problem-Solving/blob/master/LeetCode/p206.py"",""p206.py"")","=HYPERLINK(""https://github.com/Iamsdt/Problem-Solving/blob/master/LeetCode-Java/p206.java"",""p206.java"")"
142,"=HYPERLINK(""https://leetcode.com/problems/linked-list-cycle-ii/"",""Linked List Cycle II"")","Linked List, Two Pointers",Medium,Yes,"Find cycle entry after detection.","",
146,"=HYPERLINK(""https://leetcode.com/problems/lru-cache/"",""LRU Cache"")","Design, HashMap, Doubly Linked List",Medium,Yes,"Map + DLL for O(1).","",
155,"=HYPERLINK(""https://leetcode.com/problems/min-stack/"",""Min Stack"")","Stack, Design",Easy,Yes,"Track running minimum.","=HYPERLINK(""https://github.com/Iamsdt/Problem-Solving/blob/master/LeetCode/p155.py"",""p155.py"")","=HYPERLINK(""https://github.com/Iamsdt/Problem-Solving/blob/master/LeetCode-Java/p155.java"",""p155.java"")"
20,"=HYPERLINK(""https://leetcode.com/problems/valid-parentheses/"",""Valid Parentheses"")","Stack",Easy,Yes,"Match brackets with a stack.","=HYPERLINK(""https://github.com/Iamsdt/Problem-Solving/blob/master/LeetCode/p20.py"",""p20.py"")","=HYPERLINK(""https://github.com/Iamsdt/Problem-Solving/blob/master/LeetCode-Java/p20.java"",""p20.java"")"
22,"=HYPERLINK(""https://leetcode.com/problems/generate-parentheses/"",""Generate Parentheses"")","Backtracking",Medium,Yes,"Add only valid parentheses.","",
739,"=HYPERLINK(""https://leetcode.com/problems/daily-temperatures/"",""Daily Temperatures"")","Stack, Monotonic Stack",Medium,Yes,"Pop when a warmer day appears.","",
853,"=HYPERLINK(""https://leetcode.com/problems/car-fleet/"",""Car Fleet"")","Stack, Greedy",Medium,Yes,"Sort by position and time.","",
150,"=HYPERLINK(""https://leetcode.com/problems/evaluate-reverse-polish-notation/"",""Evaluate Reverse Polish Notation"")","Stack",Medium,Yes,"Pop two operands per operator.","=HYPERLINK(""https://github.com/Iamsdt/Problem-Solving/blob/master/LeetCode/p150.py"",""p150.py"")","=HYPERLINK(""https://github.com/Iamsdt/Problem-Solving/blob/master/LeetCode-Java/p150.java"",""p150.java"")"
232,"=HYPERLINK(""https://leetcode.com/problems/implement-queue-using-stacks/"",""Implement Queue using Stacks"")","Stack, Design",Easy,Yes,"Two stacks with lazy transfer.","=HYPERLINK(""https://github.com/Iamsdt/Problem-Solving/blob/master/LeetCode/p232.py"",""p232.py"")","=HYPERLINK(""https://github.com/Iamsdt/Problem-Solving/blob/master/LeetCode-Java/p232.java"",""p232.java"")"
225,"=HYPERLINK(""https://leetcode.com/problems/implement-stack-using-queues/"",""Implement Stack using Queues"")","Queue, Design",Easy,Yes,"Rotate queue after push.","=HYPERLINK(""https://github.com/Iamsdt/Problem-Solving/blob/master/LeetCode/p225.py"",""p225.py"")","=HYPERLINK(""https://github.com/Iamsdt/Problem-Solving/blob/master/LeetCode-Java/p225.java"",""p225.java"")"
355,"=HYPERLINK(""https://leetcode.com/problems/design-twitter/"",""Design Twitter"")","Design, Heap, HashMap",Medium,Yes,"Store tweets/follows; heap merge feed.","",
295,"=HYPERLINK(""https://leetcode.com/problems/find-median-from-data-stream/"",""Find Median from Data Stream"")","Heap",Hard,Yes,"Two heaps balanced by size.","=HYPERLINK(""https://github.com/Iamsdt/Problem-Solving/blob/master/LeetCode/p295.py"",""p295.py"")","=HYPERLINK(""https://github.com/Iamsdt/Problem-Solving/blob/master/LeetCode-Java/p295.java"",""p295.java"")"
703,"=HYPERLINK(""https://leetcode.com/problems/kth-largest-element-in-a-stream/"",""Kth Largest Element in a Stream"")","Heap",Easy,Yes,"Keep a size-k min-heap.","",
347,"=HYPERLINK(""https://leetcode.com/problems/top-k-frequent-elements/"",""Top K Frequent Elements"")","Heap, HashMap",Medium,Yes,"Frequency map + top-k heap.","",
973,"=HYPERLINK(""https://leetcode.com/problems/k-closest-points-to-origin/"",""K Closest Points to Origin"")","Heap, Math",Medium,Yes,"Keep k smallest distances.","",
252,"=HYPERLINK(""https://leetcode.com/problems/meeting-rooms/"",""Meeting Rooms"")","Intervals, Sorting",Easy,Yes,"Sort by start and compare ends.","",
253,"=HYPERLINK(""https://leetcode.com/problems/meeting-rooms-ii/"",""Meeting Rooms II"")","Intervals, Heap",Medium,Yes,"Min-heap of end times.","",
435,"=HYPERLINK(""https://leetcode.com/problems/non-overlapping-intervals/"",""Non-overlapping Intervals"")","Intervals, Greedy",Medium,Yes,"Keep earliest-ending intervals.","=HYPERLINK(""https://github.com/Iamsdt/Problem-Solving/blob/master/LeetCode/p435.py"",""p435.py"")","=HYPERLINK(""https://github.com/Iamsdt/Problem-Solving/blob/master/LeetCode-Java/p435.java"",""p435.java"")"
57,"=HYPERLINK(""https://leetcode.com/problems/insert-interval/"",""Insert Interval"")","Intervals",Medium,Yes,"Merge overlaps around new interval.","",
56,"=HYPERLINK(""https://leetcode.com/problems/merge-intervals/"",""Merge Intervals"")","Intervals, Sorting",Medium,Yes,"Sort and merge overlaps.","=HYPERLINK(""https://github.com/Iamsdt/Problem-Solving/blob/master/LeetCode/p56.py"",""p56.py"")","=HYPERLINK(""https://github.com/Iamsdt/Problem-Solving/blob/master/LeetCode-Java/p56.java"",""p56.java"")"
283,"=HYPERLINK(""https://leetcode.com/problems/move-zeroes/"",""Move Zeroes"")","Array, Two Pointers",Easy,Yes,"Compact nonzeros, then fill zeros.","=HYPERLINK(""https://github.com/Iamsdt/Problem-Solving/blob/master/LeetCode/p283.py"",""p283.py"")","=HYPERLINK(""https://github.com/Iamsdt/Problem-Solving/blob/master/LeetCode-Java/p283.java"",""p283.java"")"