"Section 4: Arrays — Easy/Medium"

📚 Vanakkam DSA Course (24 sections) · Hope AI — ML & DS Course

Overview

Foundational array problems covering common patterns such as two-pointer, sliding window, and in-place operations.

Lessons

#Lesson NameDurationNotes
1Remove Duplicates45m 5s
2Remove Element22m 46s
3Reverse String26m 45s
4Best Time to Buy & Sell Stocks28m 16s
5Merge Sorted Arrays41m 33s
6Move Zeros26m 31s
7Max Consecutive Ones16m 29s
8Missing Number16m 55s
9Single Number19m 22s

Lesson Checklist

  • [ ] Remove Duplicates (45m 5s)
  • [ ] Remove Element (22m 46s)
  • [ ] Reverse String (26m 45s)
  • [ ] Best Time to Buy & Sell Stocks (28m 16s)
  • [ ] Merge Sorted Arrays (41m 33s)
  • [ ] Move Zeros (26m 31s)
  • [ ] Max Consecutive Ones (16m 29s)
  • [ ] Missing Number (16m 55s)
  • [ ] Single Number (19m 22s)

My Notes

Add your personal notes, key takeaways, and insights here as you progress through the section.

Key Patterns

  • Two Pointer:
  • In-place modification:
  • Bit manipulation (XOR for Single Number):

Problem Notes

Remove Duplicates

Best Time to Buy & Sell Stocks

Merge Sorted Arrays

Missing Number

Single Number

← S3 — Time/Space ComplexityS5 — Recursion →