Skip to content
BranchesTags
 
 

Latest commit

 

History

7 Commits

Folders and files

NameName
Last commit message
Last commit date
DSA by Shradha Didi & Aman Bhaiya.xlsx
DSA by Shradha Didi & Aman Bhaiya.xlsx
 
 
DSA_Master_90_Days.xlsx
DSA_Master_90_Days.xlsx
 
 
LOVE BABBER.xlsx
LOVE BABBER.xlsx
 
 
README.md
README.md
 
 

Repository files navigation

📌 Roadmaps & Resource Overview

🧩 Data Structures & Algorithms (DSA)

🔥 Core High-Priority DSA Topics

  1. 🟩 Arrays
  2. 🟨 Strings
  3. 🟩 Linked Lists
  4. 🟨 Stack
  5. 🟩 Queue
  6. 🟨 HashMap / Hashing

📹 Video Course Trackers

1. Data Structures & Algorithms (DSA)

Provider Course Playlist Link Status Notes
Striver (takeUforward) DSA Playlist ⏳ In Progress Master sheets companion
Apna College DSA Course ⏳ In Progress Core concepts & foundations
Kunal Kushwaha DSA + Interview BootCamp ⏳ In Progress Java focus & deep-dives

2. Technical Interview Preparation & Core CS

Domain Content Provider Resource Link Status
System Design Piyush Garg Playlist ⬜ Not Started
System Design Engineering Digest Playlist ⬜ Not Started
Database Management Systems (DBMS) Comprehensive Guide Watch Video ⬜ Not Started
Computer Networks (CN) Complete Networking Crash Course Watch Video ⬜ Not Started
Operating Systems (OS) Love Babbar / CodeHelp Playlist ⬜ Not Started
DSA Bootcamp Integration Kunal Kushwaha Playlist ⬜ Not Started

If you want to create a GitHub Repository for the Ultimate DSA Placement Sheet, use the structure below.

Repository Name

ultimate-dsa-placement-sheet

README.md

🚀 Ultimate DSA Placement Sheet

A comprehensive DSA preparation repository combining the best questions from:

  • Striver A2Z DSA Sheet
  • Love Babbar 450 DSA Sheet
  • NeetCode 150
  • Fraz DSA Sheet
  • Apna College 375 DSA Sheet
  • Arsh DSA Sheet
  • AlgoPrep 151 Problems

This repository is designed for:

  • Product-Based Companies
  • SDE Internships
  • On-Campus Placements
  • Off-Campus Placements
  • FAANG Preparation
  • Competitive Programming

📚 DSA Sheets

Striver A2Z Sheet

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

Love Babbar 450

https://drive.google.com/file/d/1FMdN_OCfOI0iAeDlqswCiC2DZzD4nPsb/view

NeetCode 150

https://neetcode.io/practice

Fraz DSA Sheet

https://docs.google.com/spreadsheets/u/0/d/1-wKcV99KtO91dXdPkwmXGTdtyxAfk1mbPXQg81R9sFE/htmlview

Apna College 375

https://docs.google.com/spreadsheets/u/0/d/1hXserPuxVoWMG9Hs7y8wVdRCJTcj3xMBAEYUOXQ5Xag/htmlview

Arsh DSA Sheet

https://docs.google.com/spreadsheets/d/1MGVBJ8HkRbCnU6EQASjJKCqQE8BWng4qgL0n3vCVOxE/edit

AlgoPrep 151

https://docs.google.com/spreadsheets/d/1kyHfGGaLTzWspcqMUUS5Httmip7t8LJB0P-uPrRLGos/edit

🧠 DSA Pattern Recognition Guide

Sorted Array

  • Binary Search
  • Two Pointers

Permutations / Subsets

  • Backtracking

Trees

  • DFS
  • BFS

Graphs

  • DFS
  • BFS
  • Union Find
  • Topological Sort

Linked List

  • Slow Fast Pointer
  • Two Pointers

Maximum / Minimum Problems

  • Dynamic Programming
  • Kadane Algorithm

Top K Problems

  • Heap
  • Quick Select

String Matching

  • Hash Map
  • Trie
  • KMP

🔥 Interview Keywords

Greedy

  • Minimum operations
  • Maximum profit
  • Choose best option

Dynamic Programming

  • Number of ways
  • Minimum cost
  • Maximum sum
  • Subsequence

Sliding Window

  • Longest substring
  • Subarray with

Binary Search

  • Kth smallest
  • Search in sorted
  • Minimize maximum

Graph

  • Network
  • Connections
  • Path

📂 Repository Structure

ultimate-dsa-placement-sheet/
│
├── Arrays/
├── Strings/
├── LinkedList/
├── Stack/
├── Queue/
├── Recursion/
├── Backtracking/
├── BinarySearch/
├── Trees/
├── BST/
├── Heap/
├── Graph/
├── DynamicProgramming/
├── Greedy/
├── Trie/
├── SegmentTree/
├── BitManipulation/
├── SlidingWindow/
├── TwoPointers/
├── Math/
├── CP-Templates/
│
├── Common-Questions/
├── NeetCode150/
├── StriverA2Z/
├── LoveBabbar450/
├── ApnaCollege375/
├── ArshSheet/
├── AlgoPrep151/
│
└── README.md

🎯 Placement Roadmap

Phase 1

Arrays + Strings

Phase 2

Linked List + Stack + Queue

Phase 3

Binary Search + Recursion

Phase 4

Trees + BST + Heap

Phase 5

Graphs

Phase 6

Dynamic Programming

Phase 7

Greedy + Trie

Phase 8

Mixed Interview Questions

💻 Languages Supported

  • C++
  • Java
  • Python

⭐ Goal

Complete:

  • 300+ Questions → Internship Ready
  • 500+ Questions → Product Companies
  • 700+ Questions → SDE-1 Ready
  • 1000+ Questions → FAANG Ready

Happy Coding 🚀

Git Commands

mkdir ultimate-dsa-placement-sheet
cd ultimate-dsa-placement-sheet

git init

touch README.md

git add .
git commit -m "Initial Commit - Ultimate DSA Placement Sheet"

git branch -M main

git remote add origin https://github.com/nirmaltodwal7/Roadmaps-Resource-Overview.git

git push -u origin main

Since your GitHub username is nirmaltodwal7, I recommend:

  • ultimate-dsa-placement-sheet
  • dsa-placement-prep
  • faang-dsa-roadmap
  • complete-dsa-sheet
  • nirmal-dsa-preparation

as repository names.

📁 DSA 6 Month Complete Roadmap

DSA-Complete-Roadmap/
│
├── README.md
├── 0-Getting-Started/
│   ├── How-to-Start.md
│   ├── Mindset.md
│
├── 1-Basics/
│   ├── Arrays.md
│   ├── Strings.md
│
├── 2-Intermediate/
│   ├── LinkedList.md
│   ├── Stack-Queue.md
│   ├── Recursion.md
│
├── 3-Advanced/
│   ├── Trees.md
│   ├── Graphs.md
│   ├── Heap.md
│   ├── Greedy.md
│   ├── DP.md
│
├── 4-Patterns/
│   ├── SlidingWindow.md
│   ├── TwoPointers.md
│   ├── BinarySearch.md
│
├── 5-Interview-Prep/
│   ├── Revision.md
│   ├── Mock-Interviews.md
│
└── Daily-Tracker/
    ├── 180-Days-Plan.md

🚀 DSA Complete Roadmap (Beginner → Advanced in 6 Months)

If you're preparing for placements / product-based companies, this roadmap will take you from zero → strong DSA problem solver.

🎯 Goal

  • Crack coding interviews 💼
  • Build strong problem-solving skills 🧠
  • Become consistent ⚡

🗓️ 6-Month Roadmap (180 Days Plan)

📅 Phase 1 (Day 1–30) — Fundamentals

Topics:

  • Arrays
  • Strings
  • Basic Math
  • Time & Space Complexity

Daily Plan:

  • ⏱️ 2–3 hours
  • 📌 5 problems/day

Focus:

  • Brute force → Better → Optimal
  • Learn complexity analysis

📅 Phase 2 (Day 31–60) — Core Data Structures

Topics:

  • Linked List
  • Stack
  • Queue
  • Recursion

Focus:

  • Dry run every problem
  • Understand recursion tree

📅 Phase 3 (Day 61–90) — Patterns + Searching

Topics:

  • Sliding Window
  • Two Pointers
  • Binary Search

Focus:

  • Recognize patterns instantly
  • Solve without hints

📅 Phase 4 (Day 91–120) — Trees & Heaps

Topics:

  • Binary Trees
  • BST
  • Heap / Priority Queue

Focus:

  • Traversals (DFS, BFS)
  • Tree-based recursion

📅 Phase 5 (Day 121–150) — Graph + Greedy

Topics:

  • Graphs (DFS, BFS)
  • Shortest Path
  • Greedy Algorithms

📅 Phase 6 (Day 151–180) — Dynamic Programming

Topics:

  • DP Basics
  • Memoization
  • Tabulation
  • Advanced DP Patterns

🔥 Daily Routine (Must Follow)

1. Revise previous concepts (30 min)
2. Solve 3–5 problems
3. Analyze solutions
4. Write notes
5. Re-solve tough questions

🧩 How to Solve Any DSA Problem

Step-by-Step Approach:

  1. Understand problem
  2. Think brute force
  3. Optimize step by step
  4. Write pseudo-code
  5. Code
  6. Dry run
  7. Optimize further

⚡ Golden Rules

  • ❌ Don’t jump topics randomly
  • ✅ Stick to roadmap
  • 🔁 Revision is MUST
  • 📌 Solve same question again after 2–3 days

🧠 Problem Solving Strategy

Levels:

  • Easy → Build logic
  • Medium → Interview level
  • Hard → Thinking level

📊 Weekly Strategy

  • 5 days → Practice
  • 1 day → Revision
  • 1 day → Mock test

🧾 Best Resources

  • LeetCode
  • GeeksforGeeks
  • Striver Sheet
  • Love Babbar Sheet

📅 Daily Tracker (Example)

Day 1:
- Arrays Basics (5 Questions)

Day 2:
- Arrays Medium (5 Questions)

Day 3:
- Strings Basics

(Continue till Day 180)

💪 Consistency Formula

Consistency > Motivation

Even 2 hours daily for 180 days = Massive Result

🎯 Final Goal

By end of 6 months:

  • ✅ Solve 400–600 problems
  • ✅ Strong in patterns
  • ✅ Ready for interviews

🔥 Bonus Tips

  • Don’t just solve → Understand WHY
  • Maintain error notebook
  • Focus on patterns, not just questions
  • Mock interviews are MUST

🏁 Final Message

"DSA is not about coding… it's about thinking."

Stay consistent and trust the process 🚀

🛤️ 3-Month Logic-Building & Problem-Solving Roadmap.

Week Focus Area Daily Breakdown Checkpoints
Week 1 Foundation: Basics of Programming Day 1-2: Learn variables, data types, loops (for, while).
Day 3-4: Conditionals, functions.
Day 5-6: Arrays & Strings basics.
Day 7: Solve 10 simple pattern-building questions (stars, triangles).		 ✅ Understand basic syntax and concepts.
✅ Solve 10 pattern-building problems.
Week 2 Introduction to Problem Solving Day 1-2: Learn dry-run and pseudocode.
Day 3-5: Solve 10 simple DSA problems (easy level, e.g., reverse array, Fibonacci).
Day 6-7: Build Mini Project 1: Calculator App.		 ✅ Solve 10 DSA problems.
✅ Complete Mini Project 1: Calculator App.
Week 3 Level Up: Arrays & Logic Thinking Day 1-2: Advanced array techniques (sliding window, prefix sum).
Day 3-6: Solve 15 array-based problems (medium level).
Day 7: Build Mini Project 2: Tic-Tac-Toe Game.		 ✅ Solve 25 total DSA problems (15 new).
✅ Complete Mini Project 2: Tic-Tac-Toe Game.
Week 4 Strings & Problem-Solving Practice Day 1-2: String manipulation (reversal, palindromes, substrings).
Day 3-5: Solve 15 string-based problems (easy-medium).
Day 6-7: Build Mini Project 3: Text Manipulation Tool (e.g., Uppercase, Reverse).		 ✅ Solve 40 total DSA problems (15 new).
✅ Complete Mini Project 3: Text Tool.
Week 5 Recursion & Logic Expansion Day 1-2: Learn recursion basics (factorial, Fibonacci).
Day 3-5: Solve 10 recursion-based problems (medium level).
Day 6-7: Build Mini Project 4: Recursive Maze Solver.		 ✅ Solve 50 total DSA problems (10 new).
✅ Complete Mini Project 4: Recursive Maze Solver.
Week 6 Data Structures: Stacks & Queues Day 1-2: Learn stacks and queues basics.
Day 3-6: Solve 15 problems (balanced parentheses, queue reversal).
Day 7: Work on Mini Project 5: Browser History Tracker (using stack).		 ✅ Solve 65 total DSA problems (15 new).
✅ Complete Mini Project 5: Browser History Tracker.
Week 7 Dynamic Programming Introduction Day 1-3: Learn DP basics (knapsack, Fibonacci with memoization).
Day 4-6: Solve 10 DP problems (easy-medium).
Day 7: Revise all past concepts/projects.		 ✅ Solve 75 total DSA problems (10 new).
✅ Master basic DP problems.
Week 8 Advanced Problem Solving (Graph) Day 1-2: Learn graph representation (adjacency list/matrix).
Day 3-5: Solve 10 graph-based problems (BFS/DFS).
Day 6-7: Build a Mini Project: Path Finder Visualizer.		 ✅ Solve 85 total DSA problems (10 new).
✅ Complete Graph-Based Mini Project.
Week 9 Advanced DSA (Sorting/Greedy) Day 1-2: Learn sorting algorithms (merge sort, quicksort).
Day 3-5: Solve 15 problems on sorting/greedy (e.g., activity selection, job scheduling).		 ✅ Solve 100 DSA problems (15 new).
Week 10-11 Integration: Complex Projects Day 1-7: Brainstorm and build Project 1: Expense Tracker with Charts.
Next 7 days: Build Project 2: Multiplayer Rock-Paper-Scissors Game (WebSockets, if possible).		 ✅ Integrate past knowledge into real-world projects.
✅ Master real-world application-building.
Week 12 Final Touches and Mock Practice Day 1-3: Revise all concepts learned.
Day 4-6: Solve 10 problems from past mistakes or blindspots.
Day 7: Build a final project of your choice integrating at least one complex DSA concept.		 ✅ Complete final project.
✅ Feel confident in solving beginner-intermediate DSA problems.

💡 How to Think of Logic

  1. Break Down the Problem: Read the question twice. Identify inputs, outputs, and constraints.
  2. Start with Examples: Create test cases manually and simulate the solution step-by-step.
  3. Write Pseudocode: Draft a high-level plan before coding.
  4. Ask “Why?” at Every Step: Understand each operation; don’t memorize solutions.
  5. Visualize: Use diagrams or dry-run tables to debug.
  6. Optimize Gradually: Start with brute force; iterate to optimize for efficiency.

📚 100 DSA Questions for Logic Building

Category Question Name Platform Link
Basics & Warm-Up Print a pattern of stars (triangle, pyramid) GeeksforGeeks Link
Reverse a number GeeksforGeeks Link
Check if a number is palindrome GeeksforGeeks Link
Count digits in a number GeeksforGeeks Link
Find factorial of a number HackerRank Link
Arrays Reverse an array LeetCode Link
Find the maximum and minimum of an array GeeksforGeeks Link
Rotate an array by K steps LeetCode Link
Move all zeroes to the end LeetCode Link
Kadane's Algorithm (Maximum Subarray Sum) LeetCode Link
Strings Reverse a string LeetCode Link
Check if two strings are anagrams LeetCode Link
Longest Common Prefix LeetCode Link
Check if a string is a palindrome LeetCode Link
Count and say LeetCode Link
Recursion Fibonacci series using recursion GeeksforGeeks Link
Tower of Hanoi GeeksforGeeks Link
Factorial using recursion LeetCode Link
Reverse a linked list using recursion LeetCode Link
Permutations of a string GeeksforGeeks Link
Sorting Bubble sort GeeksforGeeks Link
Selection sort GeeksforGeeks Link
Merge sort GeeksforGeeks Link
Quick sort GeeksforGeeks Link
Insertion sort GeeksforGeeks Link
Searching Binary search LeetCode Link
Linear search GeeksforGeeks Link
Search in a rotated sorted array LeetCode Link
First and last position in a sorted array LeetCode Link
Square root of a number (using binary search) LeetCode Link
Linked List Reverse a linked list LeetCode Link
Detect a cycle in a linked list LeetCode Link
Merge two sorted linked lists LeetCode Link
Remove Nth node from the end LeetCode Link
Find the middle of a linked list LeetCode Link
Stacks & Queues Implement a stack using arrays LeetCode Link
Evaluate postfix expression GeeksforGeeks Link
Balanced parentheses LeetCode Link
Next greater element LeetCode Link
Implement a queue using stacks LeetCode Link
Dynamic Programming 0/1 Knapsack problem GeeksforGeeks Link
Fibonacci using dynamic programming LeetCode Link
Longest common subsequence LeetCode Link
Longest increasing subsequence LeetCode Link
Minimum steps to reach the end LeetCode Link
Graphs BFS traversal GeeksforGeeks Link
DFS traversal GeeksforGeeks Link
Detect cycle in an undirected graph GeeksforGeeks Link
Shortest path in a graph (Dijkstra’s) GeeksforGeeks Link
Topological sort GeeksforGeeks Link

50 tricks to identify DSA Patterns Link: https://drive.google.com/drive/folders/1Da_v5uHIvBscWcRRgMsYGq-hJ00dQL9Y

Company Name DSA Problem Link Tricks for Solving Patterns
Google Google DSA Problems Focus on backtracking and dynamic programming.
Microsoft Microsoft DSA Problems Practice binary search, greedy algorithms.
Amazon Amazon DSA Problems Work on sliding window, heap, and DFS/BFS.
Facebook Facebook DSA Problems Master recursion, graphs, and bit manipulation.
Apple Apple DSA Problems Prioritize dynamic programming and divide and conquer.
Adobe Adobe DSA Problems Practice sorting and searching techniques.
Goldman Sachs Goldman Sachs DSA Problems Focus on arrays, hashing, and string manipulation.
Uber Uber DSA Problems Work on graphs, BFS/DFS, and Dijkstra's algorithm.
LinkedIn LinkedIn DSA Problems Focus on two-pointer and sliding window techniques.
Netflix Netflix DSA Problems Prioritize dynamic programming and DP on trees.
Twitter Twitter DSA Problems Work on greedy algorithms and interval problems.
Dropbox Dropbox DSA Problems Master recursion and binary search on sorted arrays.
Airbnb Airbnb DSA Problems Practice graph traversal and backtracking.
Salesforce Salesforce DSA Problems Work on greedy algorithms and dynamic programming.
Oracle Oracle DSA Problems Focus on matrix traversal and dynamic programming.
PayPal PayPal DSA Problems Prioritize binary search and sorting problems.
Walmart Walmart DSA Problems Focus on hashing, prefix sums, and arrays.
Expedia Expedia DSA Problems Practice stack-based problems and recursion.
Snap Snap DSA Problems Focus on graphs and dynamic programming.
Yahoo Yahoo DSA Problems Work on linked lists and recursion.
DoorDash DoorDash DSA Problems Master binary trees and backtracking.
Stripe Stripe DSA Problems Practice greedy algorithms and string manipulation.
Lyft Lyft DSA Problems Focus on two-pointer and sliding window techniques.
Intuit Intuit DSA Problems Work on backtracking and dynamic programming.
IBM IBM DSA Problems Master dynamic programming and recursion problems.
Atlassian Atlassian DSA Problems Focus on graph traversal and dynamic programming.
Reddit Reddit DSA Problems Work on hashing and bit manipulation.
Pinterest Pinterest DSA Problems Master recursion and divide and conquer techniques.
Spotify Spotify DSA Problems Focus on sorting, searching, and heaps.
Bloomberg Bloomberg DSA Problems Work on arrays, dynamic programming, and graphs.
Cisco Cisco DSA Problems Focus on linked lists and dynamic programming.
ByteDance ByteDance DSA Problems Master sorting algorithms and binary search.
Tesla Tesla DSA Problems Work on graph traversal and dynamic programming.
TikTok TikTok DSA Problems Prioritize dynamic programming and recursion.
Nvidia Nvidia DSA Problems Practice bit manipulation and backtracking.

About

No description, website, or topics provided.

Resources

Readme
Activity

Stars

0 stars

Watchers

0 watching

Forks

0 forks
Report repository

Releases

Packages

Contributors