Course Detail

Data Structure and Algorithm for React Native Developers

Back to All Courses Enroll

FREE

Lectures

Time and Space Complexity Fundamentals

12 min

Pattern: Hashmap

15 min

Pattern: Two Pointers

15 min

Pattern: Sliding Window

15 min

Pattern: Binary Search

15 min

Pattern: Recursion and DFS

15 min

Problem 1: Two Sum

20 min

Problem 2: Best Time to Buy and Sell Stock

20 min

Problem 3: Contains Duplicate

20 min

Problem 4: Valid Anagram

20 min

Problem 5: Valid Palindrome

20 min

Problem 6: Maximum Subarray (Kadane's Algorithm)

20 min

Problem 7: Product of Array Except Self

20 min

Problem 8: 3Sum

20 min

Problem 9: Container With Most Water

20 min

Problem 10: Group Anagrams

20 min

Problem 11: Top K Frequent Elements

20 min

Problem 12: Valid Parentheses

20 min

Problem 13: Longest Consecutive Sequence

20 min

Problem 14: Longest Substring Without Repeating Characters

20 min

Problem 15: Minimum Size Subarray Sum

20 min

Problem 16: Permutation in String

20 min

Problem 17: Binary Search

20 min

Problem 18: Search in Rotated Sorted Array

20 min

Problem 19: Find Minimum in Rotated Sorted Array

20 min

Problem 20: Koko Eating Bananas

20 min

Problem 21: Maximum Depth of Binary Tree

20 min

Problem 22: Invert Binary Tree

20 min

Problem 23: Diameter of Binary Tree

20 min

Problem 24: Lowest Common Ancestor of a BST

20 min

Problem 25: Binary Tree Level Order Traversal

20 min

Problem 26: Reverse Linked List

20 min

Problem 27: Merge Two Sorted Lists

20 min

Problem 28: Linked List Cycle

20 min

Problem 29: Debounce

20 min

Problem 30: Throttle

20 min

Problem 31: Memoize

20 min

Problem 32: Curry

20 min

Problem 33: Promise.all Polyfill

20 min

Problem 34: Event Emitter

20 min

Problem 35: Flatten Deeply Nested Array

20 min

Overview

The 5 Patterns That Cover 80% of Problems

Study these patterns, not individual problems. Once you recognise the pattern the solution follows naturally.

Pattern	Trigger Words	Problems
Hashmap	"two sum", "count", "frequency", "seen before"	1, 4, 10, 11
Two Pointers	"sorted array", "pair", "palindrome", "container"	5, 8, 9
Sliding Window	"subarray", "substring", "longest", "minimum length"	14, 15, 16
Binary Search	"sorted", "find minimum/maximum speed/capacity"	17, 18, 19, 20
Recursion/DFS	"tree", "depth", "path", "nested"	21, 22, 23, 24

Your Study Schedule

Week	Problems	Focus
Week 1	1–10	Arrays + Strings. Do each twice.
Week 2	11–16	Hashmaps + Sliding Window
Week 3	17–25	Binary Search + Trees
Week 4	26–35	Linked Lists + JS Specific
Week 5–6	All 35 again	Timed — 20 min per problem

Daily commitment: 45 minutes. 5 days a week. That is all you need.