Scribd
Upload
6 views5 pages

Dsa Topics

The document outlines a comprehensive curriculum covering various topics in programming and algorithms, including core Java concepts, data structures like arrays, strings, linked lists, trees, and graphs, as well as advanced techniques in sorting, searching, recursion, and dynamic programming. It also addresses mathematical concepts, pattern matching algorithms, and game theory, along with company-specific practice problems from major tech firms. Each section includes both basic and advanced topics to provide a thorough understanding of the subject matter.

Uploaded by

vedikadixit13
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
6 views5 pages

Dsa Topics

The document outlines a comprehensive curriculum covering various topics in programming and algorithms, including core Java concepts, data structures like arrays, strings, linked lists, trees, and graphs, as well as advanced techniques in sorting, searching, recursion, and dynamic programming. It also addresses mathematical concepts, pattern matching algorithms, and game theory, along with company-specific practice problems from major tech firms. Each section includes both basic and advanced topics to provide a thorough understanding of the subject matter.

Uploaded by

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

1.

Core Java / Basics

- 18.OOP

- string

- bit manipulation

# 1.1 Bitwise Algorithms (Advanced Bit Manipulation)

- # Counting set bits

- # Power of two checks

- # XOR problems

- # Bitmasking problems

2. Arrays & Strings

- 16.array1

- 2d array

- Array part 2

# 2.1 Sliding Window & Two Pointers

- # Maximum sum subarray

- # Longest substring without repeating characters

- # Container with most water

3. Sorting & Searching

- sorting

- Find if a Number is

- 20.divide and conquer

4. Recursion & Backtracking

- 23.recursion basics1

- 24.recursion basics2
- 22.backtracking

5. Linked Lists

- 24.linkedlist1

- 22.linkedlist2

6. Stacks & Queues

- 31.stacks1

- 32.stacks2

- 27.queues

7. Trees & Binary Trees

- 29.binaryt1

- 30.binaryt2

- 31.binaryt3

- 32.bst1

- 33.bst2

- 49.segment trees

# 7.1 Advanced Trees

- # AVL Tree, Red-Black Tree (concepts)

- # Threaded Binary Tree

- # Morris Traversal

8. Heaps & Hashing

- 34.heaps

- 35.hashing

# 8.1 Trie (You have basic tries — add these advanced uses)
- 36.tries

- # Word Dictionary with Wildcards

- # Auto-complete / Prefix Search

- # XOR Maximum Subarray using Trie

9. Graphs

- 37.graphs2

- 38.graphs2

- 39.graphs3

- 40.graphs4

- 41.graph5

- 42.graphs suplemental

# 9.1 Graph Advanced

- # Topological Sort (Kahn’s & DFS)

- # Union-Find / DSU

- # Kruskal’s Algorithm

- # Articulation Points / Bridges

10. Greedy & Dynamic Programming

- 28.greedy

- 43.dp1

- 44.dp2

- 44.dp22

- 45.dp3

- 46.dp14

- 47.dp5

# 10.1 Advanced Dynamic Programming


- # DP on Trees

- # Bitmask DP

- # DP on Graphs

- # Digit DP

- # Matrix Chain Multiplication (MCM)

- # Unbounded Knapsack & Variants

# 10.2 Segment Tree Variants

- # Lazy Propagation

- # Merge Sort Tree

- # Persistent Segment Tree

- # Fenwick Tree / Binary Indexed Tree

11. Mathematics & Number Theory

- # GCD, LCM

- # Prime numbers (Sieve of Eratosthenes)

- # Modular arithmetic

- # Combinatorics (nCr, permutations)

12. Pattern Matching

- # KMP Algorithm

- # Rabin-Karp Algorithm

- # Z Algorithm

13. Matrix Problems

- # Flood fill / Island count

- # Spiral traversal

- # Matrix rotation

- # Shortest path in matrix (BFS in 2D)


14. Game Theory

- # Minimax Algorithm

- # Grundy Numbers

- # DP on Games

15. Company-specific Practice

- google easy

- google medium

- google hard

- amazon easy

- amazon medium

- amazpn hard

- microsoft easy

- microsoft medium

- microsoft hard

- goldman sachs easy

- goldman sachs medium

- atlassian easy

- atlassian medium

- atlassian hard

You might also like