| title | description | sidebar_position | hide_table_of_contents | keywords | |||
|---|---|---|---|---|---|---|---|
LeetCode Summer Intensive |
Collections of LeetCode Summer Intensive Problems |
999 |
true |
|
The LeetCode Summer Intensive is a course that was held in the summer of 2022. The live section of the course lasted between 15 and 30 minutes, during which 1 - 2 problems were discussed. The course was hosted by @heiheihang.
export const week1Problems = [ { problemName: "0169 - Majority Element", difficulty: "Easy", leetCodeLink: "https://leetcode.com/problems/majority-element/", solutionLink: "../solutions/0100-0199/majority-element-easy", tags: "Hash Table", }, { problemName: "0217 - Contains Duplicate", difficulty: "Easy", leetCodeLink: "https://leetcode.com/problems/contains-duplicate/", solutionLink: "../solutions/0200-0299/contains-duplicate-easy#problem-statement", tags: "Hash Table", }, { problemName: "2032 - Two Out of Three", difficulty: "Easy", leetCodeLink: "https://leetcode.com/problems/two-out-of-three/", solutionLink: "../solutions/2000-2099/two-out-of-three-easy", tags: "Hash Table", }, { problemName: "1748 - Sum of Unique Elements", difficulty: "Easy", leetCodeLink: "https://leetcode.com/problems/sum-of-unique-elements/", solutionLink: "../solutions/1700-1799/sum-of-unique-elements-easy", tags: "Hash Table", }, { problemName: "0242 - Valid Anagram", difficulty: "Easy", leetCodeLink: "https://leetcode.com/problems/valid-anagram/", solutionLink: "../solutions/0200-0299/valid-anagram-easy", tags: "Hash Table", }, { problemName: "1347 - Minimum Number of Steps to Make Two Strings Anagram", difficulty: "Medium", leetCodeLink: "https://leetcode.com/problems/minimum-number-of-steps-to-make-two-strings-anagram/", solutionLink: "../solutions/1300-1399/minimum-number-of-steps-to-make-two-strings-anagram-medium", tags: "Hash Table", }, { problemName: "2225 - Find Players With Zero or One Losses", difficulty: "Medium", leetCodeLink: "https://leetcode.com/problems/find-players-with-zero-or-one-losses/", solutionLink: "../solutions/2200-2299/find-players-with-zero-or-one-losses-medium", tags: "Hash Table", }, { problemName: "0916 - Word Subsets", difficulty: "Medium", leetCodeLink: "https://leetcode.com/problems/word-subsets/", solutionLink: "", tags: "Hash Table", }, ];
export const week2Problems = [ { problemName: "1046 - Last Stone Weight", difficulty: "Easy", leetCodeLink: "https://leetcode.com/problems/last-stone-weight/", solutionLink: "", tags: "Heap (Priority Queue)", }, { problemName: "1337 - The K Weakest Rows in a Matrix", difficulty: "Easy", leetCodeLink: "https://leetcode.com/problems/the-k-weakest-rows-in-a-matrix/", solutionLink: "../solutions/1300-1399/the-k-weakest-rows-in-a-matrix-easy", tags: "Heap (Priority Queue)", }, { problemName: "0973 - K Closest Points to Origin", difficulty: "Medium", leetCodeLink: "https://leetcode.com/problems/k-closest-points-to-origin/", solutionLink: "../solutions/0900-0999/k-closest-points-to-origin-medium", tags: "Heap (Priority Queue)", }, { problemName: "2208 - Minimum Operations to Halve Array Sum", difficulty: "Medium", leetCodeLink: "https://leetcode.com/problems/minimum-operations-to-halve-array-sum/", solutionLink: "../solutions/2100-2199/minimum-operations-to-halve-array-sum-medium", tags: "Heap (Priority Queue)", }, { problemName: "2233 - Maximum Product After K Increments", difficulty: "Medium", leetCodeLink: "https://leetcode.com/problems/maximum-product-after-k-increments/", solutionLink: "../solutions/2200-2299/maximum-product-after-k-increments-medium", tags: "Heap (Priority Queue)", }, { problemName: "1642 - Furthest Building You Can Reach", difficulty: "Medium", leetCodeLink: "https://leetcode.com/problems/furthest-building-you-can-reach/", solutionLink: "", tags: "Heap (Priority Queue)", }, { problemName: "1859 - Sorting the Sentence", difficulty: "Easy", leetCodeLink: "https://leetcode.com/problems/sorting-the-sentence/", solutionLink: "../solutions/1800-1899/sorting-the-sentence-easy", tags: "Sorting", }, { problemName: "1365 - How Many Numbers Are Smaller Than the Current Number", difficulty: "Easy", leetCodeLink: "https://leetcode.com/problems/how-many-numbers-are-smaller-than-the-current-number/", solutionLink: "../solutions/1300-1399/how-many-numbers-are-smaller-than-the-current-number-easy", tags: "Sorting", }, { problemName: "1356 - Sort Integers by The Number of 1 Bits", difficulty: "Easy", leetCodeLink: "https://leetcode.com/problems/sort-integers-by-the-number-of-1-bits/", solutionLink: "../solutions/1300-1399/sort-integers-by-the-number-of-1-bits-easy", tags: "Sorting", }, { problemName: "1331 - Rank Transform of an Array", difficulty: "Easy", leetCodeLink: "https://leetcode.com/problems/rank-transform-of-an-array/", solutionLink: "../solutions/1300-1399/rank-transform-of-an-array-easy", tags: "Sorting", }, ];
export const week3Problems = [ { problemName: "1029 - Two City Scheduling", difficulty: "Medium", leetCodeLink: "https://leetcode.com/problems/two-city-scheduling/", solutionLink: "../solutions/1000-1099/two-city-scheduling-medium", tags: "Sorting", }, { problemName: "0049 - Group Anagrams", difficulty: "Medium", leetCodeLink: "https://leetcode.com/problems/group-anagrams/", solutionLink: "../solutions/0000-0099/group-anagrams-medium", tags: "Sorting", }, { problemName: "0658 - Find K Closest Elements", difficulty: "Medium", leetCodeLink: "https://leetcode.com/problems/find-k-closest-elements/", solutionLink: "", tags: "Sorting", }, { problemName: "0791 - Custom Sort String", difficulty: "Medium", leetCodeLink: "https://leetcode.com/problems/custom-sort-string/", solutionLink: "", tags: "Sorting", }, { problemName: "0067 - Add Binary", difficulty: "Easy", leetCodeLink: "https://leetcode.com/problems/add-binary/", solutionLink: "../solutions/0000-0099/add-binary-easy", tags: "Bit Manipulation", }, { problemName: "0231 - Power of Two", difficulty: "Easy", leetCodeLink: "https://leetcode.com/problems/power-of-two/", solutionLink: "../solutions/0200-0299/power-of-two-easy", tags: "Bit Manipulation", }, { problemName: "2220 - Minimum Bit Flips to Convert Number", difficulty: "Easy", leetCodeLink: "https://leetcode.com/problems/minimum-bit-flips-to-convert-number/", solutionLink: "", tags: "Bit Manipulation", }, { problemName: "0476 - Number Complement", difficulty: "Easy", leetCodeLink: "https://leetcode.com/problems/number-complement/", solutionLink: "", tags: "Bit Manipulation", }, { problemName: "0704 - Binary Search", difficulty: "Easy", leetCodeLink: "https://leetcode.com/problems/binary-search/", solutionLink: "../solutions/0700-0799/binary-search-easy", tags: "Binary Search", }, ];
export const week4Problems = [ { problemName: "0704 - Binary Search", difficulty: "Easy", leetCodeLink: "https://leetcode.com/problems/binary-search/", solutionLink: "../solutions/0700-0799/binary-search-easy", tags: "Binary Search", }, { problemName: "0278 - First Bad Version", difficulty: "Easy", leetCodeLink: "https://leetcode.com/problems/first-bad-version/", solutionLink: "../solutions/0200-0299/first-bad-version-easy", tags: "Binary Search", }, { problemName: "0367 - Valid Perfect Square", difficulty: "Easy", leetCodeLink: "https://leetcode.com/problems/valid-perfect-square/", solutionLink: "../solutions/0300-0399/valid-perfect-square-easy", tags: "Binary Search", }, { problemName: "0540 - Single Element in a Sorted Array", difficulty: "Easy", leetCodeLink: "https://leetcode.com/problems/single-element-in-a-sorted-array/", solutionLink: "../solutions/0500-0599/single-element-in-a-sorted-array-medium", tags: "Binary Search", }, { problemName: "1760 - Minimum Limit of Balls in a Bag", difficulty: "Medium", leetCodeLink: "https://leetcode.com/problems/minimum-limit-of-balls-in-a-bag/", solutionLink: "", tags: "Binary Search", }, { problemName: "0875 - Koko Eating Bananas", difficulty: "Medium", leetCodeLink: "https://leetcode.com/problems/koko-eating-bananas/", solutionLink: "", tags: "Binary Search", }, ];
export const week5Problems = [ { problemName: "1004 - Max Consecutive Ones III", difficulty: "Medium", leetCodeLink: "https://leetcode.com/problems/max-consecutive-ones-iii/", solutionLink: "../solutions/1000-1099/max-consecutive-ones-iii-medium", tags: "Binary Search", }, { problemName: "1011 - Capacity To Ship Packages Within D Days", difficulty: "Medium", leetCodeLink: "https://leetcode.com/problems/capacity-to-ship-packages-within-d-days/", solutionLink: "../solutions/1000-1099/capacity-to-ship-packages-within-d-days-medium", tags: "Binary Search", }, { problemName: "0034 - Find First and Last Position of Element in Sorted Array", difficulty: "Medium", leetCodeLink: "https://leetcode.com/problems/find-first-and-last-position-of-element-in-sorted-array/", solutionLink: "../solutions/0000-0099/find-first-and-last-position-of-element-in-sorted-array-medium", tags: "Binary Search", }, { problemName: "0209 - Minimum Size Subarray Sum", difficulty: "Medium", leetCodeLink: "https://leetcode.com/problems/minimum-size-subarray-sum/", solutionLink: "", tags: "Binary Search", }, { problemName: "0219 - Contains Duplicate II", difficulty: "Easy", leetCodeLink: "https://leetcode.com/problems/contains-duplicate-ii/", solutionLink: "../solutions/0200-0299/contains-duplicate-ii-easy", tags: "Sliding Window", }, { problemName: "1876 - Substrings of Size Three with Distinct Characters", difficulty: "Easy", leetCodeLink: "https://leetcode.com/problems/substrings-of-size-three-with-distinct-characters/", solutionLink: "", tags: "Sliding Window", }, { problemName: "1248 - Count Number of Nice Subarrays", difficulty: "Medium", leetCodeLink: "https://leetcode.com/problems/count-number-of-nice-subarrays/", solutionLink: "", tags: "Sliding Window", }, { problemName: "1695 - Maximum Erasure Value", difficulty: "Medium", leetCodeLink: "https://leetcode.com/problems/maximum-erasure-value/", solutionLink: "", tags: "Sliding Window", }, { problemName: "0438 - Find All Anagrams in a String", difficulty: "Medium", leetCodeLink: "https://leetcode.com/problems/find-all-anagrams-in-a-string/", solutionLink: "../solutions/0400-0499/find-all-anagrams-in-a-string-medium", tags: "Sliding Window", }, { problemName: "0567 - Permutation in String", difficulty: "Medium", leetCodeLink: "https://leetcode.com/problems/permutation-in-string//", solutionLink: "../solutions/0500-0599/permutation-in-string-medium", tags: "Sliding Window", }, ];
export const week6Problems = [ { problemName: "0303 - Range Sum Query - Immutable", difficulty: "Easy", leetCodeLink: "https://leetcode.com/problems/range-sum-query-immutable/", solutionLink: "", tags: "Prefix Sum", }, { problemName: "0724 - Find Pivot Index", difficulty: "Easy", leetCodeLink: " https://leetcode.com/problems/find-pivot-index/", solutionLink: "../solutions/0700-0799/find-pivot-index-easy", tags: "Prefix Sum", }, { problemName: "1588 - Sum of All Odd Length Subarrays", difficulty: "Easy", leetCodeLink: " https://leetcode.com/problems/sum-of-all-odd-length-subarrays/", solutionLink: "../solutions/1500-1599/sum-of-all-odd-length-subarrays-easy", tags: "Prefix Sum", }, ];
export const week7Problems = [ { problemName: "0525 - Contiguous Array", difficulty: "Medium", leetCodeLink: "https://leetcode.com/problems/contiguous-array/", solutionLink: "../solutions/0500-0599/contiguous-array-medium", tags: "Prefix Sum", }, { problemName: "0304 - Range Sum Query 2D - Immutable", difficulty: "Medium", leetCodeLink: "https://leetcode.com/problems/range-sum-query-2d-immutable/", solutionLink: "", tags: "Prefix Sum", }, { problemName: "0974 - Subarray Sums Divisible by K", difficulty: "Medium", leetCodeLink: "https://leetcode.com/problems/subarray-sums-divisible-by-k/", solutionLink: "../solutions/0900-0999/subarray-sums-divisible-by-k-medium", tags: "Prefix Sum", }, { problemName: "2055 - Plates Between Candles", difficulty: "Medium", leetCodeLink: "https://leetcode.com/problems/plates-between-candles/", solutionLink: "", tags: "Prefix Sum", }, ];
export const week8Problems = [ { problemName: "0104 - Maximum Depth of Binary Tree", difficulty: "Easy", leetCodeLink: "https://leetcode.com/problems/maximum-depth-of-binary-tree/", solutionLink: "../solutions/0100-0199/maximum-depth-of-binary-tree-easy", tags: "BFS,Binary Tree", }, { problemName: "0637 - Average of Levels in Binary Tree", difficulty: "Easy", leetCodeLink: "https://leetcode.com/problems/average-of-levels-in-binary-tree/", solutionLink: "../solutions/0600-0699/average-of-levels-in-binary-tree-medium", tags: "BFS,Binary Tree", }, { problemName: "0100 - Same Tree", difficulty: "Easy", leetCodeLink: "https://leetcode.com/problems/same-tree/", solutionLink: "../solutions/0100-0199/same-tree-easy", tags: "BFS,Binary Tree", }, { problemName: "0112 - Path Sum", difficulty: "Easy", leetCodeLink: "https://leetcode.com/problems/path-sum/", solutionLink: "../solutions/0100-0199/path-sum-easy", tags: "BFS,Binary Tree", }, { problemName: "0103 - Binary Tree Zigzag Level Order Traversal", difficulty: "Medium", leetCodeLink: "https://leetcode.com/problems/binary-tree-zigzag-level-order-traversal/", solutionLink: "../solutions/0100-0199/binary-tree-zigzag-level-order-traversal-medium", tags: "BFS,Binary Tree", }, { problemName: "0752 - Open the Lock", difficulty: "Medium", leetCodeLink: "https://leetcode.com/problems/open-the-lock/", solutionLink: "", tags: "BFS,Binary Tree", }, ];
export const week9Problems = [ { problemName: "0094 - Binary Tree Inorder Traversal", difficulty: "Easy", leetCodeLink: "https://leetcode.com/problems/binary-tree-inorder-traversal/", solutionLink: "../solutions/0000-0099/binary-tree-inorder-traversal-easy", tags: "DFS,Binary Tree", }, { problemName: "0111 - Minimum Depth of Binary Tree", difficulty: "Easy", leetCodeLink: "https://leetcode.com/problems/minimum-depth-of-binary-tree/", solutionLink: "", tags: "DFS,Binary Tree", }, { problemName: "0543 - Diameter of Binary Tree", difficulty: "Easy", leetCodeLink: "https://leetcode.com/problems/diameter-of-binary-tree/", solutionLink: "../solutions/0500-0599/diameter-of-binary-tree-easy", tags: "DFS,Binary Tree", }, { problemName: "0226 - Invert Binary Tree", difficulty: "Easy", leetCodeLink: "https://leetcode.com/problems/invert-binary-tree/", solutionLink: "../solutions/0200-0299/invert-binary-tree-easy", tags: "DFS,Binary Tree", }, { problemName: "0236 - Lowest Common Ancestor of a Binary Tree", difficulty: "Medium", leetCodeLink: "https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree/", solutionLink: "", tags: "DFS,Binary Tree", }, { problemName: "0695. Max Area of Island", difficulty: "Medium", leetCodeLink: "https://leetcode.com/problems/max-area-of-island/", solutionLink: "../solutions/0600-0699/max-area-of-island-medium", tags: "DFS", }, ];
export const week10Problems = [ { problemName: "0934 - Shortest Bridge", difficulty: "Medium", leetCodeLink: "https://leetcode.com/problems/shortest-bridge/", solutionLink: "", tags: "DFS", }, { problemName: "1020 - Number of Enclaves", difficulty: "Medium", leetCodeLink: "https://leetcode.com/problems/number-of-enclaves/", solutionLink: "", tags: "DFS", }, ];