Medium
🔍 Searching
Binary Search
Har step par search space ko aadha karein. Sorted input zaroori. O(log n) ko live hote dekhein.
Time: O(log n)
Space: O(1)
12 min
000
PyAnimateIntermediate
Intermediate
Saare tracks
Track
Intermediate
Scripts aur apps banane wale builders
Apne logic toolkit ko upgrade karein. Hum dictionaries, stacks, queues aur classic search algorithms me deep dive karenge. Ye aapke har production backend ke building blocks hain.
Data structures
Searching algorithms
OOP foundations
10 is track mein algorithms
Shuru karein
Medium
🔀 Sorting
Selection Sort
Har pass mein minimum dhundhein aur front mein move karein. n passes ko sorted array produce karte dekhein.
Time: O(n²)
Space: O(1)
12 min
000
Medium
🔀 Sorting
Insertion Sort
Har element ko already-sorted prefix mein sahi position par insert karein. Nearly sorted data ke liye efficient.
Time: O(n²) worst, O(n) best
Space: O(1)
12 min
000
Medium
Array
Two Pointers
O(n²) double loop ki jagah do edge indexes ek doosre ki taraf chalao. Array problems ko linear time mein solve karo — bina extra memory kharach kiye.
Time: O(n)
Space: O(1)
10 min
000
Medium
Hash Maps
Hash Map Counting
O(1) per lookup mein count karne ke liye dictionary use karein. Kai frequency problems ki foundation.
Time: O(n)
Space: O(k)
10 min
000
Medium
📦 Data Structures
Stack Operations
LIFO action mein. List par stack ke roop mein push, pop, aur peek animate hote dekhein.
Time: O(1) per op
Space: O(n)
10 min
000
Medium
📦 Data Structures
Queue Operations
FIFO action mein. Enqueue aur dequeue animate hote dekhein aur samjhein ki deque list se better kyun hai.
Time: O(1) per op
Space: O(n)
8 min
000
Medium
Strings
Anagram Check
Kya do strings ek dusre ki rearrangements hain? O(n) mein character counting se solve karte dekhein.
Time: O(n)
Space: O(k) — k = unique chars
8 min
000
Medium
Array
Sliding Window Max Sum
Size k ki har window mein maximum sum dhundhein. Window ko array par slide karte dekhein.
Time: O(n)
Space: O(1)
8 min
000
Medium
🔀 Sorting
Merge Sorted Arrays
Do sorted arrays ko ek mein combine karein. Merge sort ke peeche ka core operation.
Time: O(m + n)
Space: O(m + n)
8 min
000