Master coding patterns through touch typing. Build muscle memory and improve your coding speed.
0
100%
0:00
0%
def two_sum(nums, target): left, right = 0, len(nums) - 1 while left < right: curr_sum = nums[left] + nums[right] if curr_sum == target: return [left, right] elif curr_sum < target: left += 1 else: right -= 1 return []
Two Pointers - Array Sum
Sliding Window - Max Sum
Binary Search - Basic
DFS - Tree Traversal
BFS - Level Order
Dynamic Programming - Fibonacci
DP - Climbing Stairs
Backtracking - Permutations
Graph DFS
Heap - Kth Largest
Trie Implementation
Union Find
Kadane's Algorithm
QuickSelect
Monotonic Stack
Spiral Matrix
Reverse Linked List
Merge Intervals
LRU Cache
Topological Sort
Count Bits
XOR Single Number
Jump Game
Interval Scheduling
Valid Palindrome
Valid Anagram
Longest Substring Without Repeating
Factorial
Power Function
Is Prime
Greatest Common Divisor
Sieve of Eratosthenes
Valid Parentheses
Min Stack
Queue Using Stacks
Two Sum - Return Indices
Group Anagrams
Tree Height
Is Balanced Tree
Lowest Common Ancestor
House Robber
Coin Change
Longest Increasing Subsequence
Generate Subsets
Combinations
N Queens
Dijkstra's Algorithm
Bellman-Ford Algorithm
Bubble Sort
Insertion Sort
Selection Sort
Heap Sort
No records yet
Be the first to set a record!