Arrays, Time and Space Complexity notes with Saumya

Master one of the most important topics in DSA — Arrays — with these crisp, beginner-friendly notes. Designed to help you build strong fundamentals and understand time-space tradeoffs, these notes cover everything from the basics to frequently asked interview questions.

What’s Inside:

• Array Creation and Basics
• Linear Search Algorithm
• Time & Space Complexity Explained
• Vectors (STL)
• 2D Arrays
• Hash Maps (Basics + Use Cases)
• Important Interview & OA Questions (from LeetCode and other platforms)

Bonus:

To view the list of important questions included, visit:

• 🔗 cpp-dsa-sheet.vercel.app/sheet

These notes are used by many students to revise before interviews, online assessments, and coding rounds. They explain the logic clearly, focus on intuition + implementation, and include complexity analysis where needed.

If you're preparing for placements, building DSA basics, or need a go-to revision sheet, these notes are a must-have.