Scribd
Upload
30 views4 pages

Crio DevSprint DSA Syllabus

The document outlines an 8-week syllabus for a Crio DevSprint Style Data Structures and Algorithms (DSA) course. Each week focuses on specific topics such as Arrays, Hashing, Recursion, and Graphs, along with key concepts and sample problems for practice. The curriculum is designed to build foundational skills in data structures and algorithms progressively.

Uploaded by

ralayi8577
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
30 views4 pages

Crio DevSprint DSA Syllabus

The document outlines an 8-week syllabus for a Crio DevSprint Style Data Structures and Algorithms (DSA) course. Each week focuses on specific topics such as Arrays, Hashing, Recursion, and Graphs, along with key concepts and sample problems for practice. The curriculum is designed to build foundational skills in data structures and algorithms progressively.

Uploaded by

ralayi8577
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/ 4

Crio DevSprint Style DSA Syllabus (8-Week Plan)

Week 1: Arrays & Strings


Key Concepts:
- Array Basics & Traversal
- Prefix Sum Technique
- Kadane's Algorithm
- Two Pointer Basics
- String Manipulations
Sample Problems:
- Two Sum
- Best Time to Buy & Sell Stock
- Product of Array Except Self
- Maximum Subarray (Kadane's)
- Rotate Array
- Longest Common Prefix

Week 2: Hashing & Sliding Window


Key Concepts:
- HashMap & HashSet usage
- Frequency Counter Pattern
- Fixed and Variable Sliding Window
Sample Problems:
- Contains Duplicate
- Group Anagrams
- Valid Anagram
- Longest Substring Without Repeating Characters
- Minimum Window Substring

Week 3: Two Pointers & Binary Search


Key Concepts:
- Two Pointer Technique
- Fast & Slow Pointers
- Binary Search on Sorted Arrays
- Search Space Reduction
Sample Problems:
- 3Sum
- Container With Most Water
- Search in Rotated Sorted Array
- Find Minimum in Rotated Sorted Array
- Find Peak Element

Week 4: Recursion & Backtracking


Key Concepts:
- Recursive Thinking
- Backtracking Template
- State-space Tree
- Bitmasking in Backtracking
Sample Problems:
- Subsets
- Permutations
- Combination Sum
- Rat in a Maze
- N-Queens

Week 5: Stacks & Queues


Key Concepts:
- Stack Operations
- Monotonic Stack
- Queue & Deque Basics
- Next Greater Element Pattern
Sample Problems:
- Valid Parentheses
- Min Stack
- Next Greater Element I
- Daily Temperatures
- Sliding Window Maximum
Week 6: Linked List & Heap
Key Concepts:
- Singly & Doubly Linked List
- Fast and Slow Pointers
- Heap (PriorityQueue)
- Min-Heap vs Max-Heap
Sample Problems:
- Reverse Linked List
- Merge Two Sorted Lists
- Detect Cycle in a Linked List
- Merge K Sorted Lists
- Top K Frequent Elements

Week 7: Trees & Tries


Key Concepts:
- Binary Tree Traversals
- Binary Search Tree Operations
- Trie Construction & Queries
Sample Problems:
- Invert Binary Tree
- Diameter of Binary Tree
- Lowest Common Ancestor of BST
- Serialize and Deserialize Binary Tree
- Implement Trie (Prefix Tree)

Week 8: Graphs, DP & Final Revision


Key Concepts:
- Graph Representations (Adj List)
- DFS & BFS
- Topological Sort
- Dynamic Programming Patterns
- Greedy Choice Property
Sample Problems:
- Number of Islands
- Course Schedule
- House Robber
- Longest Increasing Subsequence
- Trapping Rain Water

You might also like