Scribd
Upload
5 views1 page

LeetCode Array Week2

The document outlines a week-long LeetCode beginner array track, focusing on different topics each day. It includes specific problems to solve related to prefix sums, binary search, sorting, hashing, and greedy algorithms. The final day is dedicated to review and reattempting challenging problems, as well as exploring additional resources.

Uploaded by

aaru0000001
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
5 views1 page

LeetCode Array Week2

The document outlines a week-long LeetCode beginner array track, focusing on different topics each day. It includes specific problems to solve related to prefix sums, binary search, sorting, hashing, and greedy algorithms. The final day is dedicated to review and reattempting challenging problems, as well as exploring additional resources.

Uploaded by

aaru0000001
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

LeetCode Beginner Array Track (Week 2)

Day 1: Prefix Sums & Counts

- Running Sum of 1D Array (#1480)

- Find Pivot Index (#724)

Day 2: Binary Search + Arrays

- Binary Search (#704)

- Search Insert Position (#35)

Day 3: Sorting Applications

- Squares of a Sorted Array (#977)

- Relative Sort Array (#1122)

Day 4: More Hashing

- Two Sum II - Input Array Is Sorted (#167)

- Check If N and Its Double Exist (#1346)

Day 5: Greedy Basics

- Can Place Flowers (#605)

- Non-decreasing Array (#665)

Day 6: Medium-Level Logic

- Find All Numbers Disappeared in an Array (#448)

- Minimum Index Sum of Two Lists (#599)

Day 7: Review + Reattempt

- Revisit any 2 problems you found hard

- Try a new array problem of your choice (Easy-Medium)

- Explore discussions for best practices

You might also like