Learning Path
Blogs
Premium
Login
Send
Hide Index
Array
0% completed
Introduction
Memory model
What's the problem
A possible solution
Supported operations
Internal working
Multi dimension array
What's the problem
A possible solution
Supported operations
Internal working
Row major order
Row major traversal
Column major order
Column major traversal
Pattern: Two Pointers
Palindrome checker
Flip characters
Reverse segments
Vowel exchange
Ascending squares
Reverse words
Reverse word order
K rotations
Largest container
Quadratic array sorting
Pattern: Two sum
Two sum
Duplicate aware two sum
Target limited two sum
Three sum
Approximate three sum
Four sum
Pattern: Simultaneous Traversal
Subsequence checker
Merge sorted arrays
Unique intersections
Repeated intersections
Pattern: Sliding Window
Subarray size equals K
K subarray average
Kadane's algorithm
Largest product subarray
Targeted sum subarray
Subarray sum equals k
Targeted sum subarray II
Product conundrum
Consecutive ones
Consecutive ones with one flip
Consecutive ones with K flips
Pattern: Intervals
Remove intervals
Overlap reduction
Verify schedule
Minimum meeting rooms
Pattern: Design
Design a dynamic array
Assessments
Assessment 1
Assessment 2
Certificate
Certificate