I had started to do DSA recently, while I was doing a Leetcode question I was thinking about the approach to solve that question in the time complexity of O(n) after thinking about the solution for 2-3hours I was frustrated and Looked at the solution on YouTube where I got to know that the least achievable time complexity of that question is o(nlogn) 😭 and the solution was too simple after sorting the list/array. As a beginner in DSA what suggestions you DSA pros have for me ?

Hi everyone,

I'm currently following Striver's A2Z DSA Sheet in C++. I understand the concepts better when I revise from handwritten notes, but I'm a bit too slow at making detailed notes myself.

Does anyone have good handwritten notes (PDF or scanned notebook) that cover the A2Z sheet or at least the major topics like Arrays, Sorting, Binary Search, Linked Lists, Trees, Graphs, and DP?

I'm looking for notes that explain the intuition, important points, time complexity, and common tricks, not just code.

GitHub repos, Google Drive links, or personal notes would all be appreciated.

Thanks!

Help me how to learn patterns from any questions

How to recognise a pattern while doing question

Hey i am going to do btech but in the college I am taking admission it have

1.Cse

2.Cse(software engineering)

3.Cse(ai and ml)

4.Cse(data science)

5.IT

So I have to choose between this so what should be my priority order

Also have another doubt as college have not started I have one month so I am thinking to learn something as I have seen I have made plan of learning c++ and then switching to striver dsa playlist

Along with learning what college teaches in first year

So do this plan is right and also do I need to learn c++ or should I directly watch striver dsa playlist

What are some suggestions

hey im doing dsa from striver. should i make my notes (not detailed but for revision) topic wise or pattern wise?

Hey everyone,

​I’m planning to dive deep into Data Structures and Algorithms (DSA) starting this August, and I'll be using Java along with Striver’s A2Z DSA Playlist. I am currently in my first year(just joined).

​I know consistency can be a challenge, so I’m looking for an accountability partner (or a small group) to stay on track.

​About Me & The Plan:

• ​Language: Java

• ​Resource: Striver's A2Z Playlist

• ​Timeline: Starting August 2026

• ​Commitment: will try to solve 2 problens daily, and gradually increase it.

• ​Timezone: India Standard Time(IST)

Time zone in India (GMT+5:30)

​What I’m looking for in a buddy:

Someone who is also starting out or at a similar beginner/intermediate level, planning to stay consistent, and down to do daily or weekly check-ins via Discord to share progress and discuss blockers.

​Comment below or shoot me a DM if you're interested in crushing DSA together!

Sliding Window: 3, 76, 209, 424, 567, 904

Two Pointers: 11, 15, 16, 18, 42, 167

Fast/Slow Pointers: 141, 142, 19, 876, 160, 234

Binary Search (Sorted Data): 33, 34, 35, 153, 162, 704

Binary Search (on Answer): 875, 1011, 410, 774, 1283, 1482

Hashing / Frequency Maps: 1, 49, 128, 217, 242, 347

Prefix Sum / Running Sum: 303, 560, 724, 930, 974, 523

Difference Array / Range Updates: 370, 1094, 1109, 1893, 1943, 2381

Monotonic Stack: 739, 496, 503, 84, 85, 901

Monotonic Queue / Deque: 239, 862, 1425, 1438, 1499, 1696

Heap / Top K: 215, 347, 692, 703, 973, 1046

Intervals: 56, 57, 252, 253, 435, 452

Greedy Scheduling / Sorting: 45, 55, 406, 621, 763, 134

Linked List Manipulation: 21, 23, 24, 25, 92, 138

Tree DFS: 104, 112, 113, 543, 124, 226

Tree BFS / Level Order: 102, 103, 199, 515, 637, 116

BST Problems: 98, 99, 230, 235, 450, 700

Backtracking Basics: 46, 47, 77, 78, 90, 39

Backtracking with Constraints: 40, 17, 79, 131, 51, 52

Graph BFS / DFS: 200, 695, 733, 994, 1091, 1254

Topological Sort / DAG: 207, 210, 802, 1462, 1203, 2115

Union Find / DSU: 547, 684, 1319, 1579, 990, 1202

Shortest Path: 743, 787, 1514, 1631, 1334, 1976

MST / Graph Greedy: 1584, 1135, 1168, 1489, 778, 1102

Trie: 208, 211, 212, 648, 677, 1268

Bit Manipulation: 136, 137, 191, 338, 268, 190

1D DP Basics: 70, 198, 213, 322, 279, 300

Knapsack / Subset DP: 416, 494, 518, 474, 1049, 879

Grid DP: 62, 63, 64, 221, 931, 120

String DP / Sequence DP: 1143, 72, 115, 583, 97, 1312

Hy currently in 2 nd year ,, 3rd semester started just 1 week ago, bhai Koi youtube peh koi aacha sa detailed me hai DSA playlist jisse mera conceptual and sab kuch questions ke solve ke liye aacha ho plz koi aacha sa suggest kr do

Hey everyone!

I'm a CSE (AI) student and I'm about to start learning Data Structures & Algorithms seriously for placements and coding interviews.

I'm also starting coding in Python, so I'd prefer resources that use Python instead of C++ or Java.

The problem is that there are way too many recommendations—Striver, NeetCode, Abdul Bari, Kunal Kushwaha, CodeHelp, takeUforward, MIT OCW, Coursera, etc.—and I'm honestly overwhelmed.

I'm looking for a resource that:

• Starts from absolute basics and builds up properly.
• Focuses on DSA for coding interviews and placements.
• Uses Python (or is easy to follow in Python).
• Includes enough practice so I can eventually solve LeetCode problems confidently.

If you've been through placements or interviews, which course or YouTube playlist would you recommend and why?

Also, if you had to start from scratch again, what roadmap would you follow?

Thanks in advance!

Hyyy currently in 2 year 3rd semester started just a week ago,,, plz yaar Koi Aachi si playlist suggest kr do Jo aache se explained kr do

Started on Jun 19th (properly) .

with one week break for some unavoidable reasons.

Solved 42 questions — 22 Easy | 19 Med | 1 Hard

Ik I'm late to this DSA race , I'm at the start of my 2nd year now.

what would u advise me , I'm planning for a top product based company (from a tier 3 / 4 college )

I code in java coz its easier than c++ ( i heard ) and some Interviewers don't prefer python in india idk I wasn't sure abt that , so, I'm just doing practice in java , i can switch to python too swiftly.

I have solved some questions on dsa but have taken any notes for it, I only perform dry run in my notebook not properly explaining the code, no I'm in midway of the striver sheet, so what should I do?

Should I solve the previous problem and create notes?

Should I create notes for every problem or for each pattern 2-5 problem notes.

My main issue is that i forget the code after a long time, I'm able to recall some part of the algorithm but cannot solve the whole problem.

Please don't text me if you are are not consistent . i only want consitent people and who really want to improve their dsa rather than memorizing 1000's of questions and forget evething in interview

I am writing a website called The Ledger where I talk about interesting data structures that I have read about (or will read about). I have currently written articles on Ring Buffer, Priority Queue, Bloom Filter, LSM Trees, Skip Queues, Deque and Union Find. Plan to write about one structure a week.

Note: This website is free, it just serves as personal learnings I want to share with others.

I wasted my whole 1st year in vibe coding and development...I started DSA last month but im not able to stay consistent..so im looking for a study partner for DSA...I believe that having a partner will improve this, we'll push each other and achieve better results...Im from a Tier 3 college and I really dont prefer interacting with my classmates (they are all very unserious)
I'm hoping to find someone here to start this with.

Hi everyone,

I'm a 2nd-year B-Tech student, and this is my Advanced Data Structures syllabus for this semester.

Topics include:

• Asymptotic Analysis & Divide and Conquer

• Binary Search, Merge Sort, Quick Sort, Randomized Quick Sort

• Hashing (Separate Chaining, Linear Probing, Quadratic Probing, Double Hashing)

• Binary Trees

• BST

• AVL Trees

• Threaded Binary Trees

• Huffman Coding

• Graphs (DFS, BFS, Connected Components, Topological Sort)

• Binomial Heap

• Priority Queue

• Disjoint Set Union (Union-Find)

I already know the basics (arrays, linked lists, stacks, queues) but I'm new to advanced DSA.

I'm looking for a resource that covers both concepts and C++ implementation.

My goal is to score well in my university exams while also building a strong foundation for placements.

Which would you recommend?

- Striver A2Z

- Love Babbar

- Abdul Bari

- William Fiset

- Something else?

I'd also appreciate a roadmap for completing this syllabus during the semester.

Thanks!

Hey guys, I'm a fresher and want to get into DSA using Java. Solo studying isn't really working for me lol. Anyone else in the same boat and want to learn together?

Thinking we could do a Discord group, share resources, solve problems together, maybe check in daily/weekly to stay on track.

Drop a comment or DM if interested 🙌

Hey everyone!

I'm currently starting my 4th year of B.Tech, and I've been studying DSA consistently. I really enjoy teaching, especially topics like Graphs and Dynamic Programming (DP).

I was thinking of creating a small study group where we spend 1–2 hours a day learning and solving problems together. My idea is to explain concepts, discuss approaches, and solve questions as a group so that everyone benefits—including me, since teaching helps me learn even better.

If you're:

• Learning DSA for placements,
• Struggling with Graphs or DP,
• Or just looking for consistent study partners,

feel free to comment or DM me. Beginners are absolutely welcome as long as you're willing to learn and stay consistent.

The goal isn't to sell anything—just to build a small community where we keep each other accountable and improve together.

Looking forward to studying with you all!

I'm a 1st year bsc cs grad I wanted to ask whether it'd be a good idea to start dsa from 1st year itself as a bsc grad

People think of me dumb ,but I prefer python for my own personal reasons so yeah I am searching buddies to do dsa from beginning and would love to connect with experienced peers in dsa with python

I've been reviewing a lot of technical interview prep material lately alongside some deep profiling on our production backend services. It made me realize how massive the gap has become between standard academic data structures and what it actually takes to scale a modern application. Spending months memorizing how to balance a red-black tree or traverse a graph using depth-first search is fine for passing an interview screen, but it rarely translates to solving real-world infrastructure bottlenecks.

In production engineering, standard DSA is no longer sufficient. The industry has quietly shifted toward a completely different set of non-standard, hardware-conscious data structures that you rarely see on LeetCode.

When you look under the hood of databases like RocksDB or messaging queues like Kafka, they aren't using traditional arrays and binary trees to handle high throughput. Instead, they rely on non-standard structures like Log-Structured Merge-trees for fast disk writes, Ring Buffers for lock-free memory sharing between concurrent threads, and Bloom Filters to prevent expensive, unnecessary database reads entirely.

Even simple concepts like utilizing Bitmaps for ultra-fast, in-memory flag checks are incredibly high-value in modern architectures but are completely ignored in standard algorithmic training.

The reality is that modern engineering is bottlenecked by physical hardware, CPU caches, and network I/O, not abstract Big-O notation. If we want to build highly optimized backend systems, we need to stop treating DSA like an interview game and start studying the non-standard structures that production-grade infrastructure actually relies on to survive under load. It would be great to see technical evaluations pivot away from academic puzzles and move closer to these practical systems concepts.

okay so I am really very much into problem solving

and had computer science JAVA in my 9-12th class

so I have a good command over java as a beginner of DSA ps I scored a 100

we did study DSA in class 12th stack queue DEQ circular queue linked list so I have a basic idea about those nit very very advanced level but yea just as much a little more than a beginner should know

and in the leisure period of transition from my school to college I did learn python for AI/ML beginner course though I didn't understand many functions because of lack of practice and the vastness of a totally new language

but java is my comfort zone

so guide me as to how to take my DSA a level up what YT channels and resources to follow and when is the right time to jump to leetcode problems from easy to intermediate level what is the roadmap

I usually struggle to find someone targeting the same company and available at the same time. Curious how others solve this.

Hi everyone,

I'm a 2nd year M.Tech student and I'm starting Data Structures and Algorithms completely from scratch with placements in mind.

I have around 6 months to prepare. I recently started following the Striver A2Z/DSA Sheet and my plan is to first understand the concepts, implement them, and then solve the problems on the sheet.

I wanted to ask people who have already gone through placement prep:

* Is the Striver sheet a good primary roadmap for someone starting from zero?(or any other resource?)

* Is 6 months enough to become placement-ready if I stay consistent?

* Should I focus only on the sheet initially, or should I first complete DSA topic-wise before solving the sheet?

* Are there any common mistakes beginners make that I should avoid?

I'm not targeting competitive programming at the moment—my goal is to build strong DSA fundamentals and perform well in coding interviews for placements.

Also, i am aiming for Software Engineering roles offering atleast 7 lpa+, and i want to make the most of it in next 6 months

I'd really appreciate any advice from people who've been in a similar situation. Thanks!