Learning Path
Blogs
Premium
Login
Send
Hide Index
Array
0% completed
Introduction to arrays
Understanding the memory model
Understanding the problem
Exploring a possible solution
Overview of supported operations
Internal mechanics of arrays
Working example
Multidimensional arrays
Understanding the problem
Defining dimensions for arrays
Exploring a possible solution
Overview of supported operations
Internal mechanics of multidimensional arrays
Understanding row major order
Example of row major order
Row major traversal
Understanding column major order
Example of column major
Column major traversal
Pattern: Two Pointers
Understanding the two pointer pattern
Identifying direct application
Palindrome checker
Flip characters
Reverse segments
Vowel exchange
Ascending squares
Reverse words
Reverse word order
Identifying two pointer reduction
Two sum
Duplicate aware two sum
Target limited two sum
Largest container
Quadratic array sorting
Identifying two pointer subproblem
K rotations
Three sum
Approximate three sum
Four sum
Pattern: Simultaneous Traversal
Subsequence checker
Merge sorted arrays
Unique intersections
Repeated intersections
Pattern: Sliding Window
Understanding the fixed sized sliding window pattern
Identifying the fixed sized sliding window pattern
K subarray average
Subarray size equals K
Understanding the variable sized sliding window pattern
Identifying the variable sized sliding window pattern
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
Verify schedule
Overlap reduction
Minimum meeting rooms
Remove intervals
Pattern: Design
Design a dynamic array
Assessments
Assessment 1
Assessment 2
Certificate
Certificate