Scribd
Upload
125 views2 pages

DSA

Uploaded by

sipogox426
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
125 views2 pages

DSA

Uploaded by

sipogox426
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/ 2

Sheet:

https://takeuforward.org/strivers-a2z-dsa-course/strivers-a2z-dsa-course-sheet-2

YouTube:

https://www.youtube.com/watch?v=0bHoB32fuj0&list=PLgUwDviBIf0oF6QL8m22w1hIDC1vJ_BHz

Week 1:

• Learn basic programming concepts (syntax, loops, conditions, functions).

• Understand object-oriented programming (classes, objects, inheritance).

• Start solving basic problems on platforms like LeetCode, HackerRank.

Week 2:

• Study arrays and lists, and practice array manipulations (insert, delete, update, search).

• Learn string manipulations and basic string algorithms.

• Solve problems related to arrays and strings.

Week 3:

• Learn linked lists (singly, doubly, circular).

• Understand linked list operations (insertion, deletion, traversal, reversal).

• Solve linked list problems.

Week 4:

• Study stacks and queues, understand their implementations using arrays and linked lists.

• Solve problems using stack and queue operations.

Week 5:

• Study trees (binary trees, binary search trees).

• Learn tree traversal algorithms (in-order, pre-order, post-order).

• Practice tree-related problems.

Week 6:

• Learn about heaps and priority queues.

• Solve problems using heaps, such as kth largest element, heap sort.

• Understand their real-world applications.

Week 7:

• Study hash tables (hash maps).


• Implement and solve problems using hash maps.

• Practice hash map-related problems.

Week 8:

• Learn graph fundamentals (representation using adjacency matrix/list).

• Understand graph traversal algorithms (BFS, DFS).

• Solve basic graph problems.

Week 9:

• Study sorting algorithms (quick sort, merge sort, bubble sort, selection sort).

• Understand searching algorithms (binary search).

• Solve sorting and searching problems.

Week 10:

• Introduction to dynamic programming (DP).

• Study basic DP problems (Fibonacci, knapsack, longest common subsequence).

• Solve DP problems.

Week 11:

• Study greedy algorithms and their use cases.

• Solve problems related to greedy algorithms (interval scheduling, activity selection).

• Learn and practice divide-and-conquer algorithms (merge sort, quicksort).

Week 12:

• Learn advanced graph algorithms (Dijkstra's algorithm, Floyd-Warshall).

• Practice backtracking algorithms (N-Queens problem, Sudoku solver).

• Focus on solving complex problems integrating multiple techniques.

You might also like