Leetcode solutions for 🚀 NeetCode.io

This repo hosts the solutions found on NeetCode.io including the solutions shown on the NeetCode YouTube channel. The site will periodically be updated with new solutions from this repo!

Solutions from these languages will be linked from NeetCode.io:

Python, Java, JavaScript, C++, Go, Swift, C#, TypeScript, Rust, Kotlin, Ruby, C, Scala and Dart

Solutions are also welcome for any other supported language on leetcode.com!

Contributing

Please read the contributing guidlines before opening a PR

To contribute, please fork this repo and open a PR adding a missing solution from the supported languages.

If you would like to have collaborator permissions on the repo to merge your own PRs or review others' PRs please let me know.

Credits

Missing Solutions

Arrays & Hashing

_Problem	_C	_C++	_C#	_Dart	_GO	_Java	_JS	_Kotlin	_Python	_Ruby	_Rust	_Scala	_Swift	_TS
_{0217 - Contains Duplicate}	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️
_{0242 - Valid Anagram}	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️
_{1929 - Concatenation of Array}	_✔️	_✔️	_❌	_❌	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_✔️	_❌	_❌	_❌
_{1299 - Replace Elements With Greatest Element On Right Side}	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_✔️	_❌	_❌	_✔️
_{0392 - Is Subsequence}	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_✔️	_❌	_✔️	_✔️
_{0058 - Length of Last Word}	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_✔️	_✔️
_{0001 - Two Sum}	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️
_{0014 - Longest Common Prefix}	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_✔️	_❌	_❌	_✔️
_{0049 - Group Anagrams}	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️
_{0118 - Pascals Triangle}	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_✔️	_❌	_❌	_✔️
_{0027 - Remove Element}	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_✔️	_❌	_✔️	_✔️
_{0929 - Unique Email Addresses}	_✔️	_✔️	_✔️	_❌	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_✔️	_❌	_✔️	_✔️
_{0205 - Isomorphic Strings}	_✔️	_✔️	_✔️	_❌	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_✔️	_❌	_✔️	_✔️
_{0605 - Can Place Flowers}	_✔️	_✔️	_✔️	_❌	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_✔️	_❌	_✔️	_✔️
_{0169 - Majority Element}	_✔️	_✔️	_✔️	_❌	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_✔️	_❌	_✔️	_✔️
_{0496 - Next Greater Element I}	_✔️	_✔️	_✔️	_❌	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_✔️	_❌	_❌	_✔️
_{0724 - Find Pivot Index}	_✔️	_✔️	_✔️	_❌	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_✔️	_❌	_✔️	_✔️
_{0303 - Range Sum Query - Immutable}	_✔️	_✔️	_❌	_❌	_❌	_✔️	_✔️	_✔️	_✔️	_❌	_✔️	_❌	_❌	_❌
_{0448 - Find All Numbers Disappeared in An Array}	_✔️	_✔️	_✔️	_❌	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_✔️	_❌	_❌	_✔️
_{1189 - Maximum Number of Balloons}	_✔️	_✔️	_✔️	_❌	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_✔️	_❌	_❌	_✔️
_{0290 - Word Pattern}	_✔️	_✔️	_✔️	_❌	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_✔️	_❌	_❌	_✔️
_{0705 - Design HashSet}	_❌	_❌	_❌	_❌	_❌	_❌	_✔️	_✔️	_❌	_❌	_✔️	_❌	_❌	_❌
_{0706 - Design HashMap}	_✔️	_✔️	_❌	_❌	_❌	_✔️	_✔️	_✔️	_✔️	_❌	_✔️	_❌	_❌	_❌
_{0912 - Sort an Array}	_❌	_❌	_❌	_❌	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_❌	_❌	_❌	_❌
_{0347 - Top K Frequent Elements}	_✔️	_✔️	_✔️	_❌	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️
_{0238 - Product of Array Except Self}	_✔️	_✔️	_✔️	_❌	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_✔️	_✔️
_{0036 - Valid Sudoku}	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_✔️
_{0271 - Encode and Decode Strings}	_❌	_✔️	_✔️	_❌	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_✔️	_✔️
_{0128 - Longest Consecutive Sequence}	_✔️	_✔️	_✔️	_❌	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_✔️	_✔️
_{0075 - Sort Colors}	_✔️	_✔️	_✔️	_❌	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_✔️	_❌	_✔️	_✔️
_{0535 - Encode and Decode TinyURL}	_✔️	_✔️	_❌	_❌	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_✔️	_❌	_✔️	_✔️
_{0554 - Brick Wall}	_✔️	_✔️	_❌	_❌	_❌	_✔️	_✔️	_❌	_✔️	_❌	_✔️	_❌	_❌	_✔️
_{0122 - Best Time to Buy And Sell Stock II}	_✔️	_✔️	_❌	_❌	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_✔️	_❌	_❌	_❌
_{0560 - Subarray Sum Equals K}	_✔️	_✔️	_❌	_❌	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_✔️	_❌	_❌	_✔️
_{1930 - Unique Length 3 Palindromic Subsequences}	_✔️	_✔️	_❌	_❌	_❌	_✔️	_✔️	_✔️	_✔️	_❌	_✔️	_❌	_❌	_✔️
_{1963 - Minimum Number of Swaps to Make The String Balanced}	_✔️	_✔️	_❌	_❌	_❌	_✔️	_✔️	_✔️	_✔️	_❌	_❌	_❌	_❌	_❌
_{2001 - Number of Pairs of Interchangeable Rectangles}	_✔️	_✔️	_❌	_❌	_❌	_✔️	_✔️	_❌	_✔️	_❌	_✔️	_❌	_❌	_❌
_{2002 - Maximum Product of The Length of Two Palindromic Subsequences}	_✔️	_✔️	_✔️	_❌	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_✔️	_❌	_❌	_✔️
_{2017 - Grid Game}	_❌	_✔️	_❌	_❌	_❌	_❌	_❌	_✔️	_✔️	_❌	_❌	_❌	_❌	_❌
_{0438 - Find All Anagrams in a String}	_✔️	_✔️	_✔️	_❌	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_❌	_❌	_❌	_❌
_{0028 - Find The Index of The First Occurrence in a String}	_✔️	_✔️	_❌	_❌	_✔️	_✔️	_❌	_✔️	_✔️	_❌	_❌	_❌	_❌	_❌
_{0280 - Wiggle Sort}	_❌	_✔️	_❌	_❌	_❌	_❌	_❌	_✔️	_✔️	_❌	_❌	_❌	_❌	_❌
_{0179 - Largest Number}	_✔️	_✔️	_✔️	_❌	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️
_{0523 - Continuous Subarray Sum}	_✔️	_✔️	_❌	_❌	_❌	_✔️	_✔️	_✔️	_✔️	_❌	_❌	_❌	_❌	_❌
_{0838 - Push Dominoes}	_❌	_✔️	_❌	_❌	_❌	_✔️	_❌	_✔️	_✔️	_❌	_❌	_❌	_❌	_✔️
_{0187 - Repeated DNA Sequences}	_❌	_✔️	_❌	_❌	_❌	_✔️	_✔️	_✔️	_✔️	_❌	_❌	_❌	_❌	_✔️
_{0380 - Insert Delete Get Random O(1)}	_❌	_✔️	_❌	_❌	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_❌	_❌	_✔️	_✔️
_{1461 - Check if a String Contains all Binary Codes of Size K}	_❌	_✔️	_❌	_❌	_❌	_❌	_✔️	_✔️	_✔️	_❌	_❌	_❌	_❌	_❌
_{0304 - Range Sum Query 2D Immutable}	_❌	_✔️	_❌	_❌	_❌	_❌	_✔️	_✔️	_✔️	_❌	_❌	_❌	_❌	_❌
_{0665 - Non Decreasing Array}	_❌	_✔️	_❌	_❌	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_❌	_✔️	_❌	_✔️
_{0041 - First Missing Positive}	_❌	_✔️	_❌	_❌	_✔️	_✔️	_❌	_✔️	_✔️	_❌	_❌	_❌	_❌	_✔️
_{1822 - Sign of An Array}	_❌	_❌	_❌	_❌	_❌	_❌	_✔️	_❌	_✔️	_❌	_❌	_❌	_❌	_✔️
_{2215 - Find the Difference of Two Arrays}	_❌	_✔️	_❌	_❌	_❌	_❌	_✔️	_✔️	_✔️	_❌	_❌	_❌	_❌	_✔️
_{1603 - Design Parking System}	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_✔️	_❌	_❌	_❌	_❌	_❌	_❌
_{2348 - Number of Zero-Filled Subarrays}	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_✔️	_❌	_❌	_❌	_❌	_❌	_❌
_{2405 - Optimal Partition of String}	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_✔️	_❌	_❌	_❌	_❌	_❌	_❌
_{1396 - Design Underground System}	_❌	_❌	_❌	_❌	_❌	_❌	_✔️	_✔️	_❌	_❌	_❌	_❌	_❌	_❌
_{2306 - Naming a Company}	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_✔️	_❌	_❌	_❌	_❌	_❌	_❌

Two Pointers

_Problem	_C	_C++	_C#	_Dart	_GO	_Java	_JS	_Kotlin	_Python	_Ruby	_Rust	_Scala	_Swift	_TS
_{0125 - Valid Palindrome}	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️
_{0680 - Valid Palindrome II}	_✔️	_✔️	_✔️	_❌	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_✔️	_❌	_❌	_✔️
_{1984 - Minimum Difference Between Highest And Lowest of K Scores}	_❌	_✔️	_❌	_❌	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_✔️	_❌	_❌	_✔️
_{1768 - Merge Strings Alternately}	_❌	_✔️	_❌	_❌	_❌	_✔️	_✔️	_✔️	_✔️	_❌	_❌	_❌	_❌	_✔️
_{0344 - Reverse String}	_✔️	_✔️	_❌	_❌	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_✔️	_❌	_✔️	_✔️
_{0088 - Merge Sorted Array}	_✔️	_✔️	_❌	_❌	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_✔️	_❌	_❌	_✔️
_{0283 - Move Zeroes}	_✔️	_✔️	_✔️	_❌	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_✔️	_❌	_✔️	_✔️
_{0026 - Remove Duplicates From Sorted Array}	_❌	_✔️	_❌	_❌	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_✔️	_❌	_✔️	_✔️
_{0080 - Remove Duplicates From Sorted Array II}	_❌	_❌	_❌	_❌	_❌	_❌	_✔️	_✔️	_✔️	_❌	_❌	_❌	_❌	_❌
_{0167 - Two Sum II Input Array Is Sorted}	_✔️	_✔️	_✔️	_❌	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️
_{0015 - 3Sum}	_✔️	_✔️	_✔️	_❌	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️
_{0018 - 4Sum}	_❌	_✔️	_❌	_❌	_✔️	_❌	_✔️	_✔️	_✔️	_❌	_❌	_❌	_❌	_✔️
_{0011 - Container With Most Water}	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️
_{1498 - Number of Subsequences That Satisfy The Given Sum Condition}	_❌	_✔️	_❌	_❌	_❌	_❌	_❌	_✔️	_✔️	_❌	_❌	_❌	_❌	_❌
_{0189 - Rotate Array}	_❌	_✔️	_❌	_❌	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_❌	_❌	_❌	_✔️
_{1968 - Array With Elements Not Equal to Average of Neighbors}	_✔️	_✔️	_❌	_❌	_❌	_❌	_❌	_✔️	_❌	_❌	_❌	_❌	_❌	_❌
_{0881 - Boats to Save People}	_✔️	_✔️	_❌	_❌	_❌	_❌	_✔️	_✔️	_✔️	_❌	_❌	_❌	_❌	_✔️
_{0042 - Trapping Rain Water}	_✔️	_✔️	_✔️	_❌	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_✔️	_✔️

Sliding Window

_Problem	_C	_C++	_C#	_Dart	_GO	_Java	_JS	_Kotlin	_Python	_Ruby	_Rust	_Scala	_Swift	_TS
_{0121 - Best Time to Buy And Sell Stock}	_✔️	_✔️	_✔️	_❌	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_✔️	_✔️
_{0219 - Contains Duplicate II}	_❌	_✔️	_❌	_❌	_❌	_✔️	_✔️	_✔️	_✔️	_❌	_❌	_❌	_❌	_❌
_{1343 - Number of Sub Arrays of Size K and Avg Greater than or Equal to Threshold}	_❌	_✔️	_❌	_❌	_❌	_❌	_✔️	_✔️	_✔️	_❌	_❌	_❌	_❌	_❌
_{0003 - Longest Substring Without Repeating Characters}	_✔️	_✔️	_✔️	_❌	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️
_{0424 - Longest Repeating Character Replacement}	_✔️	_✔️	_✔️	_❌	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_✔️	_✔️
_{0567 - Permutation In String}	_✔️	_✔️	_✔️	_❌	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_✔️	_❌	_❌	_✔️
_{1838 - Frequency of The Most Frequent Element}	_✔️	_✔️	_✔️	_❌	_✔️	_❌	_✔️	_✔️	_❌	_❌	_✔️	_❌	_❌	_✔️
_{0904 - Fruits into Basket}	_❌	_❌	_❌	_❌	_✔️	_❌	_✔️	_✔️	_❌	_❌	_✔️	_❌	_❌	_✔️
_{1456 - Maximum Number of Vowels in a Substring of Given Length}	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_✔️	_❌	_❌	_❌	_❌	_❌	_❌
_{1888 - Minimum Number of Flips to Make The Binary String Alternating}	_❌	_❌	_❌	_❌	_❌	_❌	_✔️	_✔️	_❌	_❌	_❌	_❌	_❌	_✔️
_{0209 - Minimum Size Subarray Sum}	_✔️	_✔️	_❌	_❌	_✔️	_✔️	_✔️	_✔️	_❌	_❌	_❌	_❌	_❌	_❌
_{0658 - Find K Closest Elements}	_❌	_❌	_❌	_❌	_❌	_❌	_✔️	_✔️	_✔️	_❌	_❌	_❌	_❌	_✔️
_{0076 - Minimum Window Substring}	_✔️	_✔️	_✔️	_❌	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_✔️	_✔️
_{0239 - Sliding Window Maximum}	_❌	_✔️	_✔️	_❌	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_❌	_✔️

Stack

_Problem	_C	_C++	_C#	_Dart	_GO	_Java	_JS	_Kotlin	_Python	_Ruby	_Rust	_Scala	_Swift	_TS
_{0020 - Valid Parentheses}	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_✔️	_✔️
_{0682 - Baseball Game}	_✔️	_✔️	_✔️	_❌	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_✔️	_❌	_✔️	_✔️
_{0225 - Implement Stack Using Queues}	_✔️	_✔️	_❌	_❌	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_✔️	_❌	_❌	_✔️
_{0155 - Min Stack}	_✔️	_✔️	_✔️	_❌	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_✔️	_✔️
_{0150 - Evaluate Reverse Polish Notation}	_✔️	_✔️	_✔️	_❌	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_✔️	_✔️
_{2390 - Removing Stars From a String}	_❌	_❌	_❌	_❌	_❌	_❌	_✔️	_✔️	_❌	_❌	_❌	_❌	_❌	_❌
_{0946 - Validate Stack Sequences}	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_✔️	_✔️	_❌	_❌	_❌	_❌	_❌
_{0022 - Generate Parentheses}	_✔️	_✔️	_✔️	_❌	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_✔️	_✔️
_{0735 - Asteroid Collision}	_❌	_✔️	_❌	_❌	_❌	_✔️	_✔️	_✔️	_✔️	_❌	_✔️	_❌	_❌	_✔️
_{0739 - Daily Temperatures}	_✔️	_✔️	_✔️	_❌	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_✔️	_✔️
_{0901 - Online Stock Span}	_❌	_✔️	_❌	_❌	_❌	_✔️	_✔️	_❌	_✔️	_❌	_✔️	_❌	_❌	_✔️
_{0853 - Car Fleet}	_❌	_✔️	_✔️	_❌	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_❌	_✔️
_{0071 - Simplify Path}	_❌	_❌	_❌	_❌	_❌	_✔️	_✔️	_✔️	_✔️	_❌	_✔️	_❌	_❌	_✔️
_{0394 - Decode String}	_❌	_❌	_❌	_❌	_❌	_✔️	_❌	_❌	_✔️	_❌	_✔️	_✔️	_❌	_✔️
_{0402 - Remove K Digits}	_❌	_✔️	_❌	_❌	_❌	_❌	_✔️	_✔️	_✔️	_❌	_✔️	_❌	_❌	_✔️
_{1209 - Remove All Adjacent Duplicates In String II}	_❌	_✔️	_❌	_❌	_❌	_❌	_✔️	_❌	_✔️	_❌	_✔️	_❌	_❌	_✔️
_{0132 - 132 Pattern}	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌
_{0895 - Maximum Frequency Stack}	_❌	_❌	_❌	_❌	_❌	_❌	_✔️	_✔️	_❌	_❌	_✔️	_❌	_❌	_✔️
_{0084 - Largest Rectangle In Histogram}	_✔️	_✔️	_✔️	_❌	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_✔️	_❌	_❌	_✔️

Binary Search

_Problem	_C	_C++	_C#	_Dart	_GO	_Java	_JS	_Kotlin	_Python	_Ruby	_Rust	_Scala	_Swift	_TS
_{0704 - Binary Search}	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_✔️	_✔️
_{0035 - Search Insert Position}	_✔️	_✔️	_✔️	_❌	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_✔️	_❌	_✔️	_✔️
_{0374 - Guess Number Higher Or Lower}	_✔️	_✔️	_❌	_❌	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_❌	_❌	_✔️	_❌
_{0441 - Arranging Coins}	_❌	_✔️	_❌	_❌	_❌	_✔️	_❌	_✔️	_✔️	_❌	_❌	_❌	_❌	_❌
_{0977 - Squares of a Sorted Array}	_❌	_✔️	_❌	_❌	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_❌	_❌	_❌	_✔️
_{0367 - Valid Perfect Square}	_❌	_✔️	_❌	_❌	_❌	_✔️	_✔️	_❌	_✔️	_❌	_❌	_❌	_✔️	_❌
_{0069 - Sqrt(x)}	_❌	_❌	_❌	_❌	_❌	_❌	_✔️	_✔️	_✔️	_❌	_❌	_❌	_❌	_❌
_{0540 - Single Element in a Sorted Array}	_❌	_✔️	_❌	_❌	_❌	_❌	_✔️	_✔️	_✔️	_❌	_❌	_❌	_❌	_✔️
_{1011 - Capacity to Ship Packages}	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_✔️	_❌	_❌	_❌	_❌	_❌	_❌
_{0162 - Find Peak Element}	_❌	_❌	_❌	_❌	_❌	_❌	_✔️	_✔️	_✔️	_❌	_❌	_❌	_❌	_❌
_{2300 - Successful Pairs of Spells and Potions}	_❌	_✔️	_❌	_❌	_❌	_❌	_❌	_✔️	_❌	_❌	_❌	_❌	_❌	_❌
_{0074 - Search a 2D Matrix}	_✔️	_✔️	_✔️	_❌	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_✔️	_✔️
_{0875 - Koko Eating Bananas}	_✔️	_✔️	_✔️	_❌	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_✔️	_✔️
_{0153 - Find Minimum In Rotated Sorted Array}	_✔️	_✔️	_✔️	_❌	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️
_{0033 - Search In Rotated Sorted Array}	_✔️	_✔️	_✔️	_❌	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_✔️	_✔️	_✔️	_✔️
_{0981 - Time Based Key Value Store}	_❌	_✔️	_✔️	_❌	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_❌	_✔️
_{0034 - Find First And Last Position of Element In Sorted Array}	_❌	_✔️	_✔️	_❌	_❌	_✔️	_❌	_✔️	_✔️	_❌	_❌	_❌	_✔️	_❌
_{1898 - Maximum Number of Removable Characters}	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌
_{0116 - Populating Next Right Pointers In Each Node}	_❌	_❌	_❌	_❌	_✔️	_❌	_✔️	_❌	_❌	_❌	_❌	_❌	_❌	_❌
_{1268 - Search Suggestions System}	_❌	_❌	_❌	_❌	_❌	_✔️	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌
_{0410 - Split Array Largest Sum}	_❌	_❌	_❌	_❌	_❌	_❌	_✔️	_❌	_✔️	_❌	_❌	_❌	_❌	_❌
_{0004 - Median of Two Sorted Arrays}	_✔️	_✔️	_✔️	_❌	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_❌	_❌	_❌	_✔️

Linked List

_Problem	_C	_C++	_C#	_Dart	_GO	_Java	_JS	_Kotlin	_Python	_Ruby	_Rust	_Scala	_Swift	_TS
_{0206 - Reverse Linked List}	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️
_{0021 - Merge Two Sorted Lists}	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️
_{0234 - Palindrome Linked List}	_✔️	_✔️	_❌	_❌	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_❌	_❌	_❌	_❌
_{0203 - Remove Linked List Elements}	_❌	_✔️	_❌	_❌	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_❌	_❌	_❌	_✔️
_{0083 - Remove Duplicates From Sorted List}	_✔️	_✔️	_❌	_❌	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_❌	_❌	_❌	_❌
_{0876 - Middle of the Linked List}	_✔️	_✔️	_✔️	_❌	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_✔️	_❌	_❌	_✔️
_{0160 - Intersection of Two Linked Lists}	_✔️	_✔️	_❌	_❌	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_❌	_❌	_❌	_❌
_{0143 - Reorder List}	_✔️	_✔️	_✔️	_❌	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_❌	_❌	_❌	_✔️
_{2130 - Maximum Twin Sum Of A Linked List}	_❌	_✔️	_❌	_❌	_❌	_✔️	_❌	_✔️	_✔️	_❌	_❌	_❌	_❌	_❌
_{0019 - Remove Nth Node From End of List}	_✔️	_✔️	_✔️	_❌	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_✔️	_❌	_✔️	_✔️
_{1721 - Swapping Nodes in a Linked List}	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_✔️	_✔️	_❌	_❌	_❌	_❌	_❌
_{0460 - LFU Cache}	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌
_{0138 - Copy List With Random Pointer}	_✔️	_✔️	_✔️	_❌	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_❌	_✔️	_✔️
_{0707 - Design Linked List}	_✔️	_❌	_❌	_❌	_✔️	_✔️	_❌	_✔️	_✔️	_❌	_❌	_❌	_❌	_❌
_{1472 - Design Browser History}	_❌	_❌	_❌	_❌	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_✔️	_❌	_❌	_✔️
_{0002 - Add Two Numbers}	_✔️	_✔️	_✔️	_❌	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️
_{0141 - Linked List Cycle}	_✔️	_✔️	_✔️	_❌	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_✔️	_✔️	_✔️
_{0287 - Find The Duplicate Number}	_✔️	_✔️	_✔️	_❌	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_✔️	_✔️
_{0024 - Swap Nodes In Pairs}	_❌	_❌	_❌	_❌	_✔️	_✔️	_❌	_✔️	_✔️	_❌	_❌	_❌	_❌	_❌
_{0148 - Sort List}	_✔️	_❌	_❌	_❌	_❌	_✔️	_❌	_❌	_✔️	_❌	_❌	_❌	_❌	_❌
_{0086 - Partition List}	_❌	_❌	_❌	_❌	_❌	_✔️	_❌	_❌	_✔️	_❌	_❌	_❌	_❌	_❌
_{0061 - Rotate List}	_❌	_✔️	_❌	_❌	_❌	_✔️	_❌	_❌	_✔️	_❌	_❌	_❌	_❌	_❌
_{0092 - Reverse Linked List II}	_❌	_✔️	_❌	_❌	_❌	_✔️	_✔️	_❌	_✔️	_❌	_❌	_❌	_❌	_❌
_{0622 - Design Circular Queue}	_❌	_❌	_❌	_❌	_✔️	_❌	_❌	_✔️	_✔️	_❌	_❌	_❌	_❌	_❌
_{0147 - Insertion Sort List}	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_✔️	_❌	_❌	_❌	_❌	_❌
_{0146 - LRU Cache}	_✔️	_✔️	_✔️	_❌	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_❌	_❌	_❌
_{0023 - Merge K Sorted Lists}	_✔️	_✔️	_✔️	_❌	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_✔️	_❌	_❌	_✔️
_{0025 - Reverse Nodes In K Group}	_✔️	_✔️	_✔️	_❌	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_❌	_❌	_❌	_✔️

Trees

_Problem	_C	_C++	_C#	_Dart	_GO	_Java	_JS	_Kotlin	_Python	_Ruby	_Rust	_Scala	_Swift	_TS
_{0094 - Binary Tree Inorder Traversal}	_✔️	_✔️	_✔️	_❌	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_✔️	_✔️
_{0144 - Binary Tree Preorder Traversal}	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_✔️	_❌	_❌	_❌	_❌	_✔️
_{0145 - Binary Tree Postorder Traversal}	_❌	_❌	_❌	_❌	_❌	_✔️	_❌	_❌	_✔️	_❌	_❌	_❌	_❌	_✔️
_{0226 - Invert Binary Tree}	_✔️	_✔️	_✔️	_❌	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_❌	_✔️	_✔️
_{0104 - Maximum Depth of Binary Tree}	_✔️	_✔️	_✔️	_❌	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_✔️	_✔️
_{0543 - Diameter of Binary Tree}	_✔️	_✔️	_✔️	_❌	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_✔️	_✔️
_{0110 - Balanced Binary Tree}	_✔️	_✔️	_✔️	_❌	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_✔️	_✔️
_{0100 - Same Tree}	_✔️	_✔️	_✔️	_❌	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_✔️	_✔️
_{0572 - Subtree of Another Tree}	_✔️	_✔️	_✔️	_❌	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️
_{0108 - Convert Sorted Array to Binary Search Tree}	_✔️	_❌	_❌	_❌	_✔️	_✔️	_✔️	_✔️	_❌	_❌	_❌	_❌	_❌	_❌
_{0617 - Merge Two Binary Trees}	_✔️	_❌	_❌	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_❌	_❌	_❌	_❌
_{0112 - Path Sum}	_✔️	_❌	_✔️	_❌	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_❌	_❌	_✔️	_❌
_{0606 - Construct String From Binary Tree}	_❌	_❌	_❌	_❌	_❌	_✔️	_❌	_❌	_✔️	_❌	_❌	_❌	_❌	_❌
_{0235 - Lowest Common Ancestor of a Binary Search Tree}	_✔️	_✔️	_✔️	_❌	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_✔️	_✔️	_✔️
_{0701 - Insert into a Binary Search Tree}	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_✔️	_✔️	_❌	_❌	_❌	_❌	_✔️
_{0450 - Delete Node in a BST}	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_✔️	_✔️	_❌	_❌	_❌	_❌	_✔️
_{0102 - Binary Tree Level Order Traversal}	_✔️	_✔️	_✔️	_❌	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_✔️	_✔️
_{0199 - Binary Tree Right Side View}	_✔️	_✔️	_✔️	_❌	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_✔️	_❌	_✔️	_✔️
_{0783 - Minimum Distance between BST Nodes}	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_✔️	_✔️	_❌	_❌	_❌	_❌	_❌
_{0101 - Symmetric Tree}	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_✔️	_❌	_❌	_❌	_❌	_❌	_❌
_{1443 - Minimum Time to Collect All Apples in a Tree}	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_✔️	_❌	_❌	_❌
_{0103 - Binary Tree Zigzag Level Order Traversal}	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_✔️	_❌	_❌	_❌	_❌	_❌	_❌
_{0427 - Construct Quad Tree}	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_✔️	_❌	_❌	_❌	_❌	_❌	_❌
_{0652 - Find Duplicate Subtrees}	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_✔️	_❌	_❌	_❌	_❌	_❌	_❌
_{0958 - Check Completeness of a Binary Tree}	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_✔️	_❌	_❌	_❌	_❌	_❌	_❌
_{0106 - Construct Binary Tree from Inorder and Postorder Traversal}	_❌	_❌	_❌	_❌	_❌	_✔️	_❌	_✔️	_❌	_❌	_❌	_❌	_❌	_❌
_{0662 - Maximum Width of Binary Tree}	_❌	_❌	_❌	_❌	_❌	_✔️	_❌	_✔️	_❌	_❌	_❌	_❌	_❌	_❌
_{1376 - Time Needed to Inform All Employees}	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌
_{1448 - Count Good Nodes In Binary Tree}	_✔️	_✔️	_✔️	_❌	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_✔️	_❌	_✔️	_✔️
_{0098 - Validate Binary Search Tree}	_✔️	_✔️	_✔️	_❌	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_✔️	_❌	_✔️	_✔️
_{0230 - Kth Smallest Element In a Bst}	_✔️	_✔️	_✔️	_❌	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_✔️	_✔️	_✔️	_✔️
_{0105 - Construct Binary Tree From Preorder And Inorder Traversal}	_✔️	_✔️	_✔️	_❌	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_❌	_❌	_❌	_✔️
_{0096 - Unique Binary Search Trees}	_✔️	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌
_{0129 - Sum Root to Leaf Numbers}	_✔️	_✔️	_❌	_❌	_❌	_✔️	_❌	_✔️	_❌	_❌	_❌	_❌	_❌	_❌
_{0337 - House Robber III}	_❌	_❌	_❌	_❌	_❌	_✔️	_❌	_✔️	_❌	_❌	_❌	_❌	_❌	_❌
_{0951 - Flip Equivalent Binary Trees}	_❌	_❌	_❌	_❌	_❌	_✔️	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌
_{1993 - Operations On Tree}	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌
_{0894 - All Possible Full Binary Trees}	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_✔️	_❌	_❌	_❌	_❌	_❌
_{0513 - Find Bottom Left Tree Value}	_❌	_❌	_❌	_❌	_❌	_✔️	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌
_{0669 - Trim a Binary Search Tree}	_❌	_❌	_❌	_❌	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_❌	_❌	_❌	_✔️
_{0173 - Binary Search Tree Iterator}	_❌	_❌	_❌	_❌	_❌	_✔️	_✔️	_❌	_❌	_❌	_❌	_❌	_❌	_❌
_{0538 - Convert Bst to Greater Tree}	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌
_{0124 - Binary Tree Maximum Path Sum}	_✔️	_✔️	_✔️	_❌	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_✔️	_❌	_✔️	_✔️
_{0297 - Serialize And Deserialize Binary Tree}	_✔️	_✔️	_✔️	_❌	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_❌	_❌	_❌	_❌

Tries

_Problem	_C	_C++	_C#	_Dart	_GO	_Java	_JS	_Kotlin	_Python	_Ruby	_Rust	_Scala	_Swift	_TS
_{0208 - Implement Trie Prefix Tree}	_✔️	_✔️	_✔️	_❌	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️
_{0211 - Design Add And Search Words Data Structure}	_✔️	_✔️	_✔️	_❌	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_✔️
_{0212 - Word Search II}	_❌	_✔️	_✔️	_❌	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_✔️	_❌	_✔️	_❌

Heap / Priority Queue

_Problem	_C	_C++	_C#	_Dart	_GO	_Java	_JS	_Kotlin	_Python	_Ruby	_Rust	_Scala	_Swift	_TS
_{0703 - Kth Largest Element In a Stream}	_✔️	_✔️	_✔️	_❌	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_✔️	_❌
_{1046 - Last Stone Weight}	_❌	_✔️	_✔️	_❌	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_❌	_✔️
_{0973 - K Closest Points to Origin}	_❌	_✔️	_✔️	_❌	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_✔️	_❌	_❌	_❌
_{0215 - Kth Largest Element In An Array}	_❌	_✔️	_✔️	_❌	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_❌	_✔️	_❌	_✔️
_{0621 - Task Scheduler}	_❌	_✔️	_✔️	_❌	_❌	_✔️	_✔️	_✔️	_✔️	_❌	_✔️	_❌	_❌	_✔️
_{0355 - Design Twitter}	_❌	_✔️	_✔️	_❌	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_❌	_❌	_❌	_❌
_{1675 - Minimize Deviation in Array}	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_✔️	_❌	_❌	_❌	_❌	_❌	_❌
_{2542 - Maximum Subsequence Score}	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_✔️	_❌	_❌	_❌	_❌	_❌	_❌
_{1834 - Single Threaded Cpu}	_❌	_❌	_❌	_❌	_❌	_✔️	_✔️	_✔️	_✔️	_❌	_✔️	_❌	_❌	_❌
_{1845 - Seat Reservation Manager}	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_✔️	_❌	_❌	_❌	_❌	_❌
_{1882 - Process Tasks Using Servers}	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌
_{1985 - Find The Kth Largest Integer In The Array}	_❌	_✔️	_❌	_❌	_✔️	_✔️	_❌	_✔️	_✔️	_❌	_❌	_❌	_✔️	_❌
_{0767 - Reorganize String}	_❌	_❌	_❌	_❌	_❌	_✔️	_❌	_❌	_✔️	_❌	_❌	_❌	_❌	_❌
_{1405 - Longest Happy String}	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_✔️	_❌	_❌	_❌	_❌	_❌	_❌
_{1094 - Car Pooling}	_❌	_❌	_✔️	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌
_{0295 - Find Median From Data Stream}	_❌	_✔️	_✔️	_❌	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_❌	_❌	_❌	_✔️
_{1383 - Maximum Performance of a Team}	_❌	_❌	_✔️	_❌	_❌	_❌	_❌	_❌	_✔️	_❌	_❌	_❌	_❌	_❌
_{0502 - IPO}	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_✔️	_✔️	_❌	_❌	_❌	_❌	_❌

Backtracking

_Problem	_C	_C++	_C#	_Dart	_GO	_Java	_JS	_Kotlin	_Python	_Ruby	_Rust	_Scala	_Swift	_TS
_{0078 - Subsets}	_✔️	_✔️	_✔️	_❌	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_✔️	_✔️
_{0039 - Combination Sum}	_✔️	_✔️	_✔️	_❌	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_❌	_✔️
_{0077 - Combinations}	_❌	_❌	_❌	_❌	_✔️	_❌	_❌	_✔️	_✔️	_❌	_❌	_❌	_❌	_❌
_{0046 - Permutations}	_❌	_✔️	_✔️	_❌	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_✔️	_✔️
_{0090 - Subsets II}	_❌	_✔️	_✔️	_❌	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_❌	_✔️
_{0040 - Combination Sum II}	_❌	_✔️	_✔️	_❌	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_❌	_❌	_✔️
_{0047 - Permutations II}	_❌	_❌	_❌	_❌	_✔️	_❌	_❌	_✔️	_✔️	_❌	_❌	_❌	_❌	_❌
_{0079 - Word Search}	_✔️	_✔️	_✔️	_❌	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_✔️	_❌
_{0131 - Palindrome Partitioning}	_❌	_✔️	_✔️	_❌	_✔️	_✔️	_✔️	_❌	_✔️	_✔️	_✔️	_❌	_❌	_✔️
_{0093 - Restore IP Addresses}	_❌	_❌	_❌	_❌	_✔️	_❌	_✔️	_❌	_❌	_❌	_✔️	_❌	_❌	_✔️
_{0017 - Letter Combinations of a Phone Number}	_❌	_✔️	_✔️	_❌	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_❌	_✔️
_{0473 - Matchsticks to Square}	_❌	_✔️	_❌	_❌	_❌	_❌	_✔️	_❌	_✔️	_❌	_❌	_❌	_❌	_❌
_{1849 - Splitting a String Into Descending Consecutive Values}	_❌	_✔️	_❌	_❌	_❌	_❌	_❌	_❌	_✔️	_❌	_❌	_❌	_❌	_❌
_{1980 - Find Unique Binary String}	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_✔️	_✔️	_❌	_❌	_❌	_❌	_❌
_{1239 - Maximum Length of a Concatenated String With Unique Characters}	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_✔️	_❌	_❌	_❌	_❌	_❌
_{0698 - Partition to K Equal Sum Subsets}	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_✔️	_✔️	_❌	_❌	_❌	_❌	_❌
_{0051 - N Queens}	_✔️	_✔️	_✔️	_❌	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_✔️	_❌	_❌	_✔️
_{0052 - N Queens II}	_✔️	_✔️	_❌	_❌	_❌	_❌	_✔️	_✔️	_✔️	_❌	_❌	_❌	_❌	_❌

Graphs

_Problem	_C	_C++	_C#	_Dart	_GO	_Java	_JS	_Kotlin	_Python	_Ruby	_Rust	_Scala	_Swift	_TS
_{0463 - Island Perimeter}	_✔️	_✔️	_✔️	_❌	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_❌	_❌	_❌	_❌
_{0953 - Verifying An Alien Dictionary}	_✔️	_✔️	_❌	_❌	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_✔️	_❌	_❌	_❌
_{0200 - Number of Islands}	_✔️	_✔️	_✔️	_❌	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_❌	_✔️	_✔️
_{0133 - Clone Graph}	_✔️	_✔️	_✔️	_❌	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_❌	_✔️	_✔️
_{0695 - Max Area of Island}	_✔️	_✔️	_✔️	_❌	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_❌	_❌	_❌	_✔️
_{1905 - Count Sub Islands}	_✔️	_✔️	_✔️	_❌	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_❌	_❌	_❌	_❌
_{0417 - Pacific Atlantic Water Flow}	_✔️	_✔️	_✔️	_❌	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_❌	_❌	_❌	_✔️
_{0130 - Surrounded Regions}	_✔️	_✔️	_✔️	_❌	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_❌	_❌	_✔️	_✔️
_{1466 - Reorder Routes to Make All Paths Lead to The City Zero}	_❌	_✔️	_✔️	_❌	_❌	_❌	_❌	_✔️	_❌	_❌	_❌	_❌	_❌	_❌
_{0994 - Rotting Oranges}	_✔️	_✔️	_✔️	_❌	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_❌	_❌	_❌	_✔️
_{0286 - Walls And Gates}	_❌	_✔️	_✔️	_❌	_❌	_✔️	_✔️	_❌	_✔️	_❌	_❌	_❌	_❌	_❌
_{0909 - Snakes And Ladders}	_❌	_❌	_✔️	_❌	_❌	_✔️	_❌	_❌	_✔️	_❌	_❌	_❌	_❌	_❌
_{0752 - Open The Lock}	_❌	_❌	_✔️	_❌	_❌	_✔️	_❌	_✔️	_✔️	_❌	_❌	_❌	_❌	_❌
_{0802 - Find Eventual Safe States}	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_✔️	_❌	_❌	_❌	_❌	_❌	_❌
_{0207 - Course Schedule}	_❌	_✔️	_✔️	_❌	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_❌	_❌	_✔️	_✔️
_{0210 - Course Schedule II}	_❌	_✔️	_✔️	_❌	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_❌	_❌	_❌	_✔️
_{1462 - Course Schedule IV}	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_✔️	_✔️	_❌	_❌	_❌	_❌	_❌
_{1958 - Check if Move Is Legal}	_❌	_✔️	_❌	_❌	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_❌	_❌	_❌	_❌
_{0934 - Shortest Bridge}	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_✔️	_❌	_❌	_❌	_❌	_❌	_❌
_{1091 - Shortest Path in Binary Matrix}	_❌	_❌	_❌	_❌	_❌	_✔️	_❌	_✔️	_✔️	_❌	_❌	_❌	_❌	_❌
_{0684 - Redundant Connection}	_✔️	_✔️	_✔️	_❌	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_✔️	_❌	_❌	_✔️
_{0323 - Number of Connected Components In An Undirected Graph}	_❌	_✔️	_✔️	_❌	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_❌	_❌	_✔️	_❌
_{0261 - Graph Valid Tree}	_❌	_✔️	_✔️	_❌	_❌	_✔️	_✔️	_❌	_✔️	_❌	_❌	_❌	_✔️	_✔️
_{0721 - Accounts Merge}	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_✔️	_✔️	_❌	_❌	_❌	_❌	_❌
_{2359 - Find Closest Node to Given Two Nodes}	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌
_{1091 - Shortest Path in a Binary Matrix}	_❌	_❌	_❌	_❌	_❌	_✔️	_❌	_✔️	_✔️	_❌	_❌	_❌	_❌	_❌
_{1162 - As Far from Land as Possible}	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_✔️	_❌	_❌	_❌	_❌	_❌	_❌
_{1129 - Shortest Path with Alternating Colors}	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_✔️	_❌	_❌	_❌	_❌	_❌	_❌
_{2477 - Minimum Fuel Cost to Report to the Capital}	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_✔️	_❌	_❌	_❌	_❌	_❌	_❌
_{2492 - Minimum Score of a Path Between Two Cities}	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_✔️	_❌	_❌	_❌	_❌	_❌	_❌
_{1254 - Number of Closed Islands}	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_✔️	_❌	_❌	_❌	_❌	_❌	_❌
_{1020 - Number of Enclaves}	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_✔️	_❌	_❌	_❌	_❌	_❌	_❌
_{1557 - Minimum Number of Vertices to Reach all Nodes}	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌
_{0785 - Is Graph Bipartite?}	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_✔️	_❌	_❌	_❌	_❌	_❌	_❌
_{0399 - Evaluate Division}	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_✔️	_❌	_❌	_❌	_❌	_❌	_❌
_{2101 - Detonate the Maximum Bombs}	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_✔️	_❌	_❌	_❌	_❌	_❌	_❌
_{1857 - Largest Color Value in a Directed Graph}	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_✔️	_❌	_❌	_❌	_❌	_❌	_❌
_{1553 - Minimum Number of Days to Eat N Oranges}	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌
_{0127 - Word Ladder}	_❌	_✔️	_✔️	_❌	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_✔️	_❌	_❌	_✔️

Advanced Graphs

_Problem	_C	_C++	_C#	_Dart	_GO	_Java	_JS	_Kotlin	_Python	_Ruby	_Rust	_Scala	_Swift	_TS
_{0332 - Reconstruct Itinerary}	_❌	_✔️	_✔️	_❌	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_❌	_❌	_❌	_❌
_{1584 - Min Cost to Connect All Points}	_❌	_✔️	_✔️	_❌	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_❌	_✔️	_❌
_{0743 - Network Delay Time}	_❌	_✔️	_✔️	_❌	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_❌	_❌	_❌	_❌
_{1514 - Path with Maximum Probability}	_❌	_❌	_❌	_❌	_❌	_✔️	_✔️	_✔️	_✔️	_❌	_❌	_❌	_❌	_❌
_{0778 - Swim In Rising Water}	_❌	_✔️	_✔️	_❌	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_❌	_❌	_❌	_❌
_{0269 - Alien Dictionary}	_❌	_✔️	_✔️	_❌	_❌	_✔️	_✔️	_❌	_✔️	_❌	_❌	_❌	_❌	_❌
_{0787 - Cheapest Flights Within K Stops}	_❌	_✔️	_✔️	_❌	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_❌	_❌	_❌	_✔️
_{2421 - Number of Good Paths}	_❌	_❌	_❌	_❌	_✔️	_❌	_✔️	_❌	_❌	_❌	_✔️	_❌	_❌	_✔️
_{1579 - Remove Max Number of Edges to Keep Graph Fully Traversable}	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_✔️	_❌	_❌	_❌	_❌	_❌	_❌

1-D Dynamic Programming

_Problem	_C	_C++	_C#	_Dart	_GO	_Java	_JS	_Kotlin	_Python	_Ruby	_Rust	_Scala	_Swift	_TS
_{0070 - Climbing Stairs}	_✔️	_✔️	_✔️	_❌	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_✔️	_✔️
_{0746 - Min Cost Climbing Stairs}	_✔️	_✔️	_✔️	_❌	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️
_{0198 - House Robber}	_✔️	_✔️	_✔️	_❌	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️
_{0213 - House Robber II}	_✔️	_✔️	_✔️	_❌	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️
_{0005 - Longest Palindromic Substring}	_✔️	_✔️	_✔️	_❌	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_✔️	_❌	_❌	_✔️
_{0647 - Palindromic Substrings}	_✔️	_✔️	_✔️	_❌	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_✔️	_❌	_❌	_✔️
_{0091 - Decode Ways}	_✔️	_✔️	_✔️	_❌	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_❌	_✔️	_❌	_✔️
_{0322 - Coin Change}	_✔️	_✔️	_✔️	_❌	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_✔️	_✔️	_❌	_✔️
_{0152 - Maximum Product Subarray}	_✔️	_✔️	_✔️	_❌	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_✔️	_✔️
_{0139 - Word Break}	_❌	_✔️	_✔️	_❌	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_❌	_❌	_❌	_✔️
_{0300 - Longest Increasing Subsequence}	_✔️	_✔️	_✔️	_❌	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_❌	_❌	_❌	_✔️
_{0416 - Partition Equal Subset Sum}	_❌	_✔️	_✔️	_❌	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_❌	_❌	_❌	_❌
_{0120 - Triangle}	_❌	_✔️	_❌	_❌	_❌	_✔️	_❌	_✔️	_✔️	_❌	_❌	_❌	_❌	_❌
_{0740 - Delete And Earn}	_❌	_❌	_❌	_❌	_✔️	_❌	_❌	_✔️	_✔️	_❌	_❌	_❌	_❌	_❌
_{0256 - Paint House}	_❌	_❌	_✔️	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌
_{0377 - Combination Sum IV}	_❌	_✔️	_❌	_❌	_❌	_❌	_❌	_✔️	_✔️	_❌	_❌	_❌	_❌	_❌
_{0279 - Perfect Squares}	_❌	_✔️	_❌	_❌	_✔️	_✔️	_❌	_✔️	_❌	_❌	_❌	_❌	_❌	_❌
_{1856 - Maximum Subarray Min Product}	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_✔️	_❌	_❌	_❌	_❌	_❌	_❌
_{0983 - Minimum Cost For Tickets}	_❌	_✔️	_❌	_❌	_❌	_❌	_❌	_✔️	_❌	_❌	_❌	_❌	_❌	_❌
_{0343 - Integer Break}	_❌	_✔️	_❌	_❌	_❌	_❌	_❌	_✔️	_❌	_❌	_❌	_❌	_❌	_❌
_{0673 - Number of Longest Increasing Subsequence}	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_✔️	_✔️	_❌	_❌	_❌	_❌	_❌
_{0691 - Stickers to Spell Word}	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌
_{1137 - N-th Tribonacci Number}	_❌	_❌	_❌	_❌	_✔️	_❌	_✔️	_✔️	_✔️	_❌	_✔️	_❌	_❌	_✔️
_{1035 - Uncrossed Lines}	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_✔️	_❌	_❌	_❌	_❌	_❌	_❌
_{2140 - Solving Questions With Brainpower}	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_✔️	_❌	_❌	_❌	_❌	_❌	_❌
_{2466 - Count Ways to Build Good Strings}	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_✔️	_❌	_❌	_❌	_❌	_❌	_❌
_{0837 - New 21 Game}	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_✔️	_❌	_❌	_❌	_❌	_❌	_❌
_{1626 - Best Team with no Conflicts}	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌
_{1406 - Stone Game III}	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_✔️	_❌	_❌	_❌	_❌	_❌	_❌
_{0472 - Concatenated Words}	_❌	_❌	_❌	_❌	_✔️	_❌	_✔️	_❌	_❌	_❌	_✔️	_❌	_❌	_✔️
_{1799 - Maximize Score after N Operations}	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_✔️	_❌	_❌	_❌	_❌	_❌	_❌
_{1964 - Find the Longest Valid Obstacle Course at Each Position}	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_✔️	_❌	_❌	_❌	_❌	_❌	_❌

2-D Dynamic Programming

_Problem	_C	_C++	_C#	_Dart	_GO	_Java	_JS	_Kotlin	_Python	_Ruby	_Rust	_Scala	_Swift	_TS
_{0062 - Unique Paths}	_✔️	_✔️	_✔️	_❌	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_✔️	_❌	_❌	_✔️
_{0063 - Unique Paths II}	_❌	_✔️	_❌	_❌	_✔️	_✔️	_❌	_✔️	_✔️	_❌	_❌	_❌	_❌	_❌
_{1143 - Longest Common Subsequence}	_❌	_✔️	_✔️	_❌	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_✔️	_❌	_✔️	_✔️
_{0516 - Longest Palindromic Subsequence}	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_✔️	_✔️	_❌	_❌	_❌	_❌	_❌
_{1049 - Last Stone Weight II}	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_✔️	_❌	_❌	_❌	_❌	_❌
_{0309 - Best Time to Buy And Sell Stock With Cooldown}	_✔️	_✔️	_✔️	_❌	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_✔️	_❌	_✔️	_✔️
_{0518 - Coin Change II}	_✔️	_✔️	_✔️	_❌	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_❌	_❌	_❌	_✔️
_{0494 - Target Sum}	_❌	_✔️	_✔️	_❌	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_❌	_❌	_❌	_✔️
_{0097 - Interleaving String}	_❌	_✔️	_✔️	_❌	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_❌	_✔️	_❌	_✔️
_{0877 - Stone Game}	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_✔️	_❌	_❌	_❌	_❌	_❌	_❌
_{0064 - Minimum Path Sum}	_❌	_✔️	_❌	_❌	_❌	_✔️	_❌	_✔️	_✔️	_❌	_❌	_❌	_❌	_❌
_{0329 - Longest Increasing Path In a Matrix}	_✔️	_✔️	_✔️	_❌	_❌	_✔️	_✔️	_✔️	_✔️	_❌	_✔️	_❌	_❌	_❌
_{0221 - Maximal Square}	_❌	_❌	_❌	_❌	_❌	_✔️	_❌	_✔️	_✔️	_❌	_❌	_❌	_❌	_❌
_{0474 - Ones and Zeroes}	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_✔️	_✔️	_❌	_❌	_❌	_❌	_❌
_{5782 - Maximum Alternating Subsequence Sum}	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌
_{0115 - Distinct Subsequences}	_❌	_✔️	_✔️	_❌	_❌	_✔️	_✔️	_✔️	_✔️	_❌	_❌	_❌	_❌	_✔️
_{0072 - Edit Distance}	_❌	_✔️	_✔️	_❌	_❌	_✔️	_✔️	_✔️	_✔️	_❌	_❌	_✔️	_✔️	_❌
_{1220 - Count Vowels Permutation}	_❌	_✔️	_❌	_❌	_✔️	_✔️	_❌	_❌	_✔️	_❌	_❌	_❌	_❌	_❌
_{0312 - Burst Balloons}	_❌	_✔️	_✔️	_❌	_❌	_✔️	_✔️	_✔️	_✔️	_❌	_❌	_❌	_❌	_✔️
_{1866 - Number of Ways to Rearrange Sticks With K Sticks Visible}	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌
_{0010 - Regular Expression Matching}	_❌	_✔️	_✔️	_❌	_✔️	_✔️	_✔️	_❌	_✔️	_❌	_❌	_❌	_❌	_✔️
_{1140 - Stone Game II}	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_✔️	_❌	_❌	_❌	_❌	_❌	_❌
_{0926 - Flip String to Monotone Increasing}	_❌	_❌	_❌	_❌	_✔️	_❌	_✔️	_✔️	_❌	_❌	_✔️	_❌	_❌	_✔️
_{2218 - Maximum Value of K Coins from Piles}	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_✔️	_❌	_❌	_❌	_❌	_❌	_❌
_{1639 - Number of Ways to Form a Target String Given a Dictionary}	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_✔️	_❌	_❌	_❌	_❌	_❌	_❌
_{0879 - Profitable Schemes}	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_✔️	_❌	_❌	_❌	_❌	_❌	_❌
_{1547 - Minimum Cost to Cut a Stick}	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_✔️	_❌	_❌	_❌	_❌	_❌	_❌

Greedy

_Problem	_C	_C++	_C#	_Dart	_GO	_Java	_JS	_Kotlin	_Python	_Ruby	_Rust	_Scala	_Swift	_TS
_{0053 - Maximum Subarray}	_✔️	_✔️	_✔️	_❌	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_✔️	_✔️
_{0918 - Maximum Sum Circular Subarray}	_❌	_❌	_❌	_❌	_✔️	_❌	_✔️	_✔️	_✔️	_❌	_✔️	_❌	_❌	_✔️
_{0978 - Longest Turbulent Array}	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_✔️	_✔️	_❌	_❌	_❌	_❌	_❌
_{0055 - Jump Game}	_✔️	_✔️	_✔️	_❌	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_✔️	_❌	_✔️	_✔️
_{0045 - Jump Game II}	_✔️	_✔️	_✔️	_❌	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_❌	_✔️	_✔️
_{1871 - Jump Game VII}	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_✔️	_❌	_❌	_❌	_❌	_❌	_❌
_{0134 - Gas Station}	_✔️	_✔️	_✔️	_❌	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_❌	_✔️	_✔️
_{0846 - Hand of Straights}	_❌	_✔️	_✔️	_❌	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_❌	_❌	_✔️
_{2439 - Minimize Maximum of Array}	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_✔️	_❌	_❌	_❌	_❌	_❌	_❌
_{0649 - Dota2 Senate}	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_✔️	_❌	_❌	_❌	_❌	_❌	_❌
_{1423 - Maximum Points You Can Obtain From Cards}	_❌	_❌	_✔️	_❌	_❌	_❌	_❌	_✔️	_❌	_❌	_❌	_❌	_❌	_❌
_{1899 - Merge Triplets to Form Target Triplet}	_❌	_✔️	_✔️	_❌	_❌	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_❌	_✔️	_✔️
_{0763 - Partition Labels}	_❌	_✔️	_✔️	_❌	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_❌	_❌	_❌
_{0678 - Valid Parenthesis String}	_✔️	_✔️	_✔️	_❌	_❌	_✔️	_✔️	_✔️	_✔️	_❌	_❌	_❌	_❌	_✔️
_{1921 - Eliminate Maximum Number of Monsters}	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌
_{1029 - Two City Scheduling}	_❌	_❌	_❌	_❌	_✔️	_✔️	_✔️	_❌	_✔️	_❌	_✔️	_❌	_❌	_✔️

Intervals

_Problem	_C	_C++	_C#	_Dart	_GO	_Java	_JS	_Kotlin	_Python	_Ruby	_Rust	_Scala	_Swift	_TS
_{0057 - Insert Interval}	_❌	_✔️	_✔️	_❌	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_✔️	_❌	_✔️	_✔️
_{0056 - Merge Intervals}	_❌	_✔️	_✔️	_❌	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_❌	_✔️	_❌	_✔️
_{0435 - Non Overlapping Intervals}	_❌	_✔️	_✔️	_❌	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_❌	_✔️	_❌	_✔️
_{0252 - Meeting Rooms}	_❌	_✔️	_✔️	_❌	_❌	_✔️	_✔️	_✔️	_✔️	_❌	_❌	_❌	_❌	_❌
_{0253 - Meeting Rooms II}	_❌	_✔️	_✔️	_❌	_❌	_✔️	_✔️	_✔️	_✔️	_❌	_✔️	_❌	_❌	_❌
_{1288 - Remove Covered Intervals}	_✔️	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌
_{1851 - Minimum Interval to Include Each Query}	_❌	_✔️	_✔️	_❌	_❌	_✔️	_❌	_❌	_✔️	_❌	_❌	_❌	_❌	_❌
_{0352 - Data Stream as Disjoint Intervals}	_❌	_❌	_❌	_❌	_✔️	_❌	_✔️	_❌	_❌	_❌	_✔️	_❌	_❌	_✔️

Math & Geometry

_Problem	_C	_C++	_C#	_Dart	_GO	_Java	_JS	_Kotlin	_Python	_Ruby	_Rust	_Scala	_Swift	_TS
_{1071 - Greatest Common Divisor of Strings}	_❌	_❌	_❌	_❌	_✔️	_❌	_✔️	_✔️	_❌	_❌	_✔️	_❌	_❌	_✔️
_{1523 - Count Odd Numbers in an Interval Range}	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_✔️	_❌	_❌	_❌	_❌	_❌	_❌
_{1572 - Matrix Diagonal Sum}	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_✔️	_❌	_❌	_❌	_❌	_❌	_❌
_{0149 - Maximum Points on a Line}	_❌	_❌	_❌	_❌	_❌	_❌	_✔️	_❌	_✔️	_❌	_✔️	_❌	_❌	_✔️
_{0048 - Rotate Image}	_✔️	_✔️	_✔️	_❌	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_✔️	_✔️
_{0054 - Spiral Matrix}	_❌	_✔️	_✔️	_❌	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_❌	_❌	_✔️
_{0059 - Spiral Matrix II}	_❌	_❌	_❌	_❌	_❌	_❌	_✔️	_✔️	_❌	_❌	_❌	_❌	_❌	_❌
_{0073 - Set Matrix Zeroes}	_✔️	_✔️	_✔️	_❌	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_❌	_❌	_✔️
_{0202 - Happy Number}	_✔️	_✔️	_✔️	_❌	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_✔️	_✔️
_{0066 - Plus One}	_✔️	_✔️	_✔️	_❌	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_✔️	_✔️
_{0009 - Palindrome Number}	_✔️	_✔️	_❌	_❌	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_✔️	_❌	_✔️	_✔️
_{0263 - Ugly Number}	_✔️	_✔️	_❌	_❌	_✔️	_✔️	_✔️	_❌	_✔️	_❌	_✔️	_❌	_✔️	_✔️
_{1260 - Shift 2D Grid}	_❌	_✔️	_❌	_❌	_❌	_✔️	_✔️	_❌	_✔️	_❌	_❌	_❌	_❌	_❌
_{0013 - Roman to Integer}	_❌	_❌	_❌	_❌	_✔️	_✔️	_✔️	_❌	_✔️	_❌	_✔️	_❌	_❌	_✔️
_{0012 - Integer to Roman}	_❌	_❌	_❌	_❌	_✔️	_❌	_✔️	_❌	_✔️	_❌	_✔️	_❌	_❌	_✔️
_{0050 - Pow(x, n)}	_✔️	_✔️	_✔️	_❌	_❌	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_❌	_✔️	_✔️
_{0043 - Multiply Strings}	_❌	_✔️	_✔️	_❌	_❌	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_❌	_✔️	_✔️
_{2013 - Detect Squares}	_❌	_✔️	_✔️	_❌	_❌	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_❌	_❌
_{1041 - Robot Bounded In Circle}	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌
_{0006 - Zigzag Conversion}	_❌	_✔️	_❌	_❌	_✔️	_✔️	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌
_{2028 - Find Missing Observations}	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌

Bit Manipulation

_Problem	_C	_C++	_C#	_Dart	_GO	_Java	_JS	_Kotlin	_Python	_Ruby	_Rust	_Scala	_Swift	_TS
_{0136 - Single Number}	_✔️	_✔️	_✔️	_❌	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_✔️	_✔️
_{0191 - Number of 1 Bits}	_✔️	_✔️	_✔️	_❌	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_✔️	_✔️
_{0338 - Counting Bits}	_✔️	_✔️	_✔️	_❌	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_✔️	_✔️
_{0190 - Reverse Bits}	_✔️	_✔️	_✔️	_❌	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_✔️	_✔️
_{0268 - Missing Number}	_✔️	_✔️	_✔️	_❌	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_✔️	_✔️
_{1470 - Shuffle the Array}	_❌	_❌	_❌	_❌	_✔️	_❌	_✔️	_✔️	_❌	_❌	_✔️	_❌	_❌	_✔️
_{0989 - Add to Array-Form of Integer}	_❌	_❌	_❌	_❌	_✔️	_❌	_✔️	_✔️	_❌	_❌	_✔️	_❌	_❌	_✔️
_{0371 - Sum of Two Integers}	_✔️	_✔️	_✔️	_❌	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_❌	_✔️	_✔️
_{0007 - Reverse Integer}	_✔️	_✔️	_✔️	_❌	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️	_✔️
_{0067 - Add Binary}	_✔️	_✔️	_❌	_❌	_❌	_✔️	_❌	_✔️	_✔️	_❌	_✔️	_❌	_❌	_❌

JavaScript

_Problem	_C	_C++	_C#	_Dart	_GO	_Java	_JS	_Kotlin	_Python	_Ruby	_Rust	_Scala	_Swift	_TS
_{2667 - Create Hello World Function (Closure - Day1)}	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌
_{2620 - Counter (Closure - Day2)}	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌
_{2665 - Counter (Closure - Day3)}	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌
_{2635 - Apply Transform over each Element in Array (Transform)}	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌
_{2634 - Filter Elements from Array (Transforms)}	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌
_{2626 - Array Reduce Transformation (Transforms)}	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌
_{2629 - Function Composition}	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌
_{2666 - Allow One Function Call}	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌
_{2623 - Memoize}	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌
_{2632 - Curry}	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌
_{2621 - Sleep}	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌
_{2637 - Promise Time Limit}	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌
_{2636 - Promise Pool}	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌
_{2622 - Cache With Time Limit}	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌
_{2627 - Debounce}	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌
_{2676 - Throttle}	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌
_{2628 - JSON Deep Equal}	_❌	_❌	_❌	_❌	_❌	_❌	_✔️	_❌	_❌	_❌	_❌	_❌	_❌	_❌
_{2633 - Convert Object to JSON String}	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌
_{2675 - Array of Objects to Matrix}	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌
_{2700 - Difference Between Two Objects}	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌
_{2677 - Chunk Array}	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌
_{2625 - Flatten Deeply Nested Array}	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌
_{2619 - Array Prototype Last}	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌
_{2631 - Group By}	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌
_{2618 - Check if Object Instance of Class}	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌
_{2693 - Call Function with Custom Context}	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌
_{2694 - Event Emitter}	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌
_{2695 - Array Wrapper}	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌
_{2648 - Generate Fibonacci Sequence}	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌
_{2649 - Nested Array Generator}	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌	_❌

_{Need to update the README? Update the template instead.}

License

iknowcode/leetcode

About

Resources

License

Uh oh!

Stars

Watchers

Forks

Releases

Packages 0

Languages

Packages