Professional

Multi-armed Bandit

ML Templates

Count the Number of K-Big Indices Hard
Maximum Strong Pair XOR II Hard
Bus Routes Hard
Count Number of Teams Medium
Count of Range Sum Hard
Last Moment Before All Ants Fall Out of a Plank Medium
Get Biggest Three Rhombus Sums in a Grid Medium
Rotating the Box Medium
Count Primes Medium
Build an Array With Stack Operations Medium
Count Nodes Equal to Average of Subtree Medium
Count Nodes Equal to Average of Subtree Medium
Longest Increasing Path in a Matrix Hard
Serialize and Deserialize Binary Tree Hard
Number of Squareful Arrays Hard
Word Search II Hard
LRU Cache Medium
Two City Scheduling Medium
Parallel Courses III Hard
Balance a Binary Search Tree Medium
Stickers to Spell Word Hard
Sliding Window Median Hard
Minimum Number of Steps to Make Two Strings Anagram Medium
Construct Product Matrix Medium
Integer Replacement Medium
Number of Ways to Stay in the Same Place After Some Steps Hard
Longest Unequal Adjacent Groups Subsequence I Medium
Longest Unequal Adjacent Groups Subsequence II Medium
Word Break Medium
Candy Crush Medium
Invalid Transactions Medium
Max Dot Product of Two Subsequences Hard
Build Array Where You Can Find The Maximum Exactly K Comparisons Hard
Implement Trie II (Prefix Tree) Medium
Count Strictly Increasing Subarrays Medium
Time Taken to Cross the Door Hard
Number of Valid Subarrays Hard
Minimum Array Length After Pair Removals Medium
Reconstruct Itinerary Hard
Finding the Number of Visible Mountains Medium
Frog Jump Hard
Minimum Costs Using the Train Line Hard
Minimum ASCII Delete Sum for Two Strings Medium
Shortest String That Contains Three Strings Medium
Ternary Expression Parser Medium
Smallest Sufficient Team Hard
Longest Arithmetic Subsequence of Given Difference Medium
Longest Subarray of 1's After Deleting One Element Medium
Sum of Imbalance Numbers of All Subarrays Hard
Optimal Account Balancing Hard
Optimal Account Balancing Hard
Robot Collisions Hard
Longest Arithmetic Subsequence Medium
Make Array Strictly Increasing Hard
Equal Row and Column Pairs Medium
Sum of Matrix After Queries Medium
Design Underground System Medium
Text Justification Hard
Minimum Cost to Make All Characters Equal Medium
Design Tic-Tac-Toe Medium
Maximum Strictly Increasing Cells in a Matrix Hard
Greatest Common Divisor Traversal Hard
Minimum Cost to Cut a Stick Hard
Maximize Score After N Operations Hard
Count Ways To Build Good Strings Medium
Binary Tree Upside Down Medium
Similar String Groups Hard
Bulb Switcher Medium
Smallest Number in Infinite Set Medium
Restore The Array Hard
Minimum Number of Operations to Make All Array Elements Equal to 1 Medium
Minimum Window Subsequence Hard
Profitable Schemes Hard
Minimize the Total Price of the Trips Hard
The Most Similar Path in a Graph Hard
Maximum Value of K Coins From Piles Hard
Number of Enclaves Medium
Successful Pairs of Spells and Potions Medium
Clone Binary Tree With Random Pointer Medium
Construct Quad Tree Medium
Wiggle Sort Medium
Naming a Company Hard
Game of Nim Medium
Restore IP Addresses Medium
Cycle Length Queries in a Tree Hard
Minimum Score of a Path Between Two Cities Medium
Divide Nodes Into the Maximum Number of Groups Hard
Divide Nodes Into the Maximum Number of Groups Hard
Minimum Score of a Path Between Two Cities Medium
Rectangle Area Medium
Minimum Difficulty of a Job Schedule Hard
Height of Binary Tree After Subtree Removal Queries Hard
Top K Frequent Words Medium
My Calendar III Hard
Lonely Pixel I Medium
Reordered Power of 2 Medium
Split Array into Consecutive Subsequences Medium
Non-negative Integers without Consecutive Ones Hard
Validate Binary Search Tree Medium
Binary Trees With Factors Medium
Longest Ideal Subsequence Medium
Count Vowels Permutation Hard
My Calendar I Medium
Move Pieces to Obtain a String Medium
Longest Consecutive Sequence Medium
Redundant Connection II Hard
Freedom Trail Hard
Minimum Height Trees Medium
Daily Temperatures Medium
Maximum Subarray Sum After One Operation Medium
Verbal Arithmetic Puzzle Hard
Distinct Subsequences Hard
Expression Add Operators Hard
Max Points on a Line Hard
Number of Distinct Substrings in a String Medium
Substring with Concatenation of All Words Hard
Longest Uncommon Subsequence II Medium
Verify Preorder Serialization of a Binary Tree Medium
Map Sum Pairs Medium
Non-negative Integers without Consecutive Ones Hard
K Empty Slots Hard
Divide Two Integers Medium
Greatest Sum Divisible by Three Medium

Skills

Certificates

Blog Posts

Meetups

Libraries

LC Solutions