Scribd
Upload
4 views1 page

DSA & Competitive Programming Notes

The document provides quick notes on DSA and competitive programming, focusing on time complexity and common complexities such as O(1) and O(n^2). It introduces core techniques like Prefix Sum and Sliding Window for optimizing algorithms. Additionally, it covers searching methods like Binary Search and the principles of Dynamic Programming for solving overlapping subproblems.

Uploaded by

unnoticeable1257037
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
4 views1 page

DSA & Competitive Programming Notes

The document provides quick notes on DSA and competitive programming, focusing on time complexity and common complexities such as O(1) and O(n^2). It introduces core techniques like Prefix Sum and Sliding Window for optimizing algorithms. Additionally, it covers searching methods like Binary Search and the principles of Dynamic Programming for solving overlapping subproblems.

Uploaded by

unnoticeable1257037
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

DSA & Competitive Programming – Quick Notes

Complexity Basics

Time complexity measures how an algorithm scales with input size.

Common complexities: O(1), O(log n), O(n), O(n log n), O(n^2).

Core Techniques

Prefix Sum: Precompute cumulative sums for fast range queries.

Sliding Window: Maintain a window to optimize subarray problems.

Searching & DP

Binary Search applies on monotonic functions.

Dynamic Programming solves overlapping subproblems with optimal substructure.

You might also like