AI 요약관련 정보

The NeetCode 150 is the most important LeetCode problems you need to master, selected to cover all major algorithmic patterns that top tech companies test for. Course by ‪@DestinationFAANG‬ ❤️ Try interactive Algorithms courses in your browser: https://scrimba.com/freeCodeCamp-Algo... (Made possible by a grant from our friends at Scrimba) Most Asked Technical Interview Questions: http://docs.google.com/spreadsheets/d... Solutions: https://github.com/DestinationFAANG/D... Neetcode 150 list: https://neetcode.io/practice 00:00:00 Into 00:02:09 1 Contains Duplicate, 2 Valid Anagram 00:18:30 3 Two Sum, 4 Group Anagrams 00:41:05 5 Top K Frequent Elements, 6 Product of Array Except Self 01:08:33 7 Valid Sudoku, 8 Encode and Decode Strings 01:35:31 9 Longest Consecutive Sequence, 10 Valid Palindrome 02:08:13 11 Two Sum II Input Array Is Sorted, 12 3Sum 02:40:58 13 Container With Most Water, 14 Trapping Rain Water 03:22:29 15 Best Time to Buy And Sell Stock, 16 Longest Substring w/out Repeating Characters 03:43:04 17 Longest Repeating Character Replacement, 18 Permutation In String 04:17:11 19 Minimum Window Substring, 20 Sliding Window Maximum 04:59:44 21 Valid Parentheses, 22 Min Stack 05:20:33 23 Evaluate Reverse Polish Notation, 24 Generate Parentheses 05:45:54 25 Daily Temperatures, 26 Car Fleet 06:19:22 27 Largest Rectangle In Histogram, 28 Binary Search 06:46:23 29 Search a 2D Matrix, 30 Koko Eating Bananas 07:11:21 31 Find Minimum In Rotated Sorted Array, 32 Search In Rotated Sorted Array 07:37:45 33 Time Based Key Value Store, 34 Median of Two Sorted Arrays 08:22:13 35 Reverse Linked List, 36 Merge Two Sorted Lists 08:41:04 37 Reorder List, 38 Remove Nth Node From End of List 09:07:21 39 Copy List With Random Pointer, 40 Add Two Numbers 09:33:40 41 Linked List Cycle, 42 Find The Duplicate Number 09:59:00 43 LRU Cache, 44 Merge K Sorted Lists 10:33:35 45 Reverse Nodes In K Group, 46 Invert Binary Tree 10:58:05 47 Maximum Depth of Binary Tree, 48 Diameter of Binary Tree 11:12:42 49 Balanced Binary Tree, 50 Same Tree 11:28:36 51 Subtree of Another Tree, 52 Lowest Common Ancestor of a Binary Search Tree 11:47:38 53 Binary Tree Level Order Traversal, 54 Binary Tree Right Side View 12:09:32 55 Count Good Nodes In Binary Tree, 56 Validate Binary Search Tree 12:30:28 57 Kth Smallest Element In a Bst, 58 Construct Binary Tree 12:53:46 59 Binary Tree Maximum Path Sum, 60 Serialize And Deserialize Binary Tree 13:20:24 61 Implement Trie Prefix Tree, 62 Design Add And Search Words 14:01:28 63 Word Search II, 64 Kth Largest Element In a Stream 14:30:37 65 Last Stone Weight, 66 K Closest Points to Origin 14:50:44 67 Kth Largest Element In Array, 68 Task Scheduler 15:19:56 69 Design Twitter, 70 Find Median From Data Stream 16:15:43 71 Subsets, 72 Combination Sum 16:15:43 73 Permutations, 74 Subsets II 16:49:54 75 Combination Sum II, 76 Word Search 17:16:03 77 Palindrome Partitioning, 78 Letter Combinations of a Phone 17:44:08 79 N Queens, 80 Number of Islands 18:12:44 81 Clone Graph, 82 Max Area of Island 18:54:05 83 Pacific Atlantic Water Flow, 84 Surrounded Regions 19:21:28 85 Rotting 🍊, 86 Walls And Gates 19:55:23 87 Course Schedule, 88 Course Schedule II 20:24:16 89 Redundant Connection, 90 Number of Connected Components 21:11:23 91 Graph Valid Tree, 92 Word Ladder 21:42:50 93 Reconstruct Itinerary, 94 Min Cost to Connect All Points 22:34:37 95 Network Delay Time, 96 🏊 23:14:40 97 Alien Dictionary, 98 Cheapest Flights Within K Stops 23:46:50 99 Climbing Stairs, 100 Min Cost Climbing Stairs 24:50:25 101 House Robber, 102 House Robber II 25:11:04 103 Longest Palindromic Substring, 104 Palindromic Substrings 25:39:56 105 Decode Ways, 106 Coin Change 26:10:23 107 Maximum Product Subarray, 108 Word Break 27:07:00 109 Longest Increasing Subsequence, 110 Partition Equal Subset Sum 28:45:52 111 Unique Paths, 112 Longest Common Subsequence 29:14:46 113 Best Time to Buy And Sell Stock, 114 Coin Change II 29:50:06 115 Target Sum, 116 Interleaving String 30:33:26 117 Longest Increasing Path In a Matrix, 118 Distinct Subsequences 31:11:49 119 Edit Distance, 120 Burst Balloons 31:54:37 121 Regular Expression Matching, 122 Maximum Subarray 32:31:46 123 Jump Game, 124 Jump Game II 33:07:02 125 ⛽, 126 Hand of Straights 33:34:15 127 Merge Triplets to Form Target Triplet, 128 Partition Labels 33:55:28 129 Valid Parenthesis String, 130 Insert Interval 34:27:14 131 Merge Intervals, 132 Non Overlapping Intervals 35:00:49 133 Meeting Rooms, 134 Meeting Rooms II 35:26:18 135 Minimum Interval to Include Each Query, 136 Rotate Image 36:00:31 137 Spiral Matrix, 138 Set Matrix Zeroes 36:37:33 139 Happy Number, 140 Plus One 36:52:25 141 Pow(x, n), 142 Multiply Strings 37:11:53 143 Detect Squares, 144 Single Number 37:41:02 145 Number of 1 Bits, 146 Counting Bits 38:07:23 147 Reverse Bits, 148 Missing Number 38:35:03 149 Sum of Two Integers, 150 Reverse Integer