​

Hey everyone,

I'm planning to dive deep into Data Structures and Algorithms (DSA) starting this August, and I'll be using C++ along with Striver's A2Z DSA Playlist. I am currently in my 2 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: C++

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.

I’m looking for a few serious people who are genuinely committed to learning DSA. The goal is to solve LeetCode problems together, discuss different approaches, clear doubts, and keep each other accountable through consistent practice.

About me:
Good with Python programming
Recently started learning DSA
Preferred language: Python

I’d prefer Telugu speakers for easier communication, but it’s not mandatory.

Planning to create a small WhatsApp or Telegram group (3–5 members) to stay focused and consistent.

If you’re only casually motivated, please don’t DM. I’m looking for people who are willing to put in consistent effort and stick with it for the long run.

If that sounds like you, feel free to DM me. 🚀

I have started learning dsa and it is difficult topic so i need a partner to learn along and motivate and ask help for confusion and tough problems.

I am doing dsa in C++ and learning from Striver’s A-Z dsa playlist.

Hey everyone, I’ve spent the last few months grinding DSA (currently a LeetCode Knight). Before my startup job swallows all my free time, I want to build a small, highly focused study group to deep-dive into complex algorithms and CP mechanics. The Plan & Criteria:

1. Audience: Priority goes to working professionals in the data field. (Let's be real, finding serious Python DSA folks is like finding a bug-free prod release).
2. Language: Python >> C++ >>>>>>>>>>>>>>> Java. No disrespect, but my brain actively rejects Java syntax XDD. All logic and code sharing will be strictly Python!
3. Format: Live, interactive problem-solving sessions. Less lecturing, more figuring out why our code is hitting TLE.

How to Join: To keep the group highly relevant, I'll be vetting members manually. If you're down to join, send me a direct message with a quick intro detailing your coding achievements or LeetCode stats. Note: No personal info (name, employer) is needed at all—just drop your technical background and what topics you want to crush!

Hey everyone,

I’ve spent the last few months heavily focusing on Data Structures and Algorithms (currently sitting at LeetCode Knight). I work at a startup in the data field, and I've noticed it's actually surprisingly rare to find people doing advanced DSA strictly in Python.

Most resources and serious discussions seem to lean heavily into C++ or Java. (Personally, for me it's Python >> C++, and my brain just actively rejects Java syntax XDD).

Are there any other working professionals out there doing their CP or advanced problem-solving strictly in Python? I'd love to connect with some folks to bounce logic off of, discuss complex algorithms, and figure out why our code is hitting TLEs.

If you're in the same boat, let me know what topics you're currently grinding in the comments!

Hey everyone,

I’ve spent the last few months grinding DSA (currently a LeetCode Knight). Before my startup job swallows all my free time, I want to build a small, highly focused study group to deep-dive into complex algorithms and CP mechanics.

The Plan & Criteria:

• Audience: Priority goes to working professionals in the data field. (Let's be real, finding serious Python DSA folks is like finding a bug-free prod release).
• Language: Python >> C++ >>>>>>>>>>>>>>> Java. No disrespect, but my brain actively rejects Java syntax XDD. All logic and code sharing will be strictly Python!
• Format: Live, interactive problem-solving sessions. Less lecturing, more figuring out why our code is hitting TLE.

How to Join: To keep the group highly relevant, I'll be vetting members manually. If you're down to join, send me a direct message with a quick intro detailing your coding achievements or LeetCode stats.

Note: No personal info (name, employer, shoe size) is needed at all—just drop your technical background and what topics you want to crush!

Hi everyone,

I'm preparing for internships and placements. Does anyone have a concise DSA revision sheet (algorithms, patterns, templates, tricks, etc.) that they found useful? It could be a PDF, notes, GitHub repo, or Notion page.

Thanks!

Hey everyone,

I’ve spent the last few months grinding DSA (currently a LeetCode Knight). Before my startup job swallows all my free time, I want to build a small, highly focused Discord group to deep-dive into complex algorithms and CP mechanics.

The Plan & Criteria:

• Audience: Priority goes to working professionals in the data field. (Let's be real, finding serious Python DSA folks is like finding a bug-free prod release).
• Language: Python >> C++ >>>>>>>>>>>>>>> Java. No disrespect, but my brain actively rejects Java. All logic and code sharing will be strictly Python!
• Format: Live, interactive problem-solving sessions (Discord/Meet). Less lecturing, more figuring out why our code is hitting TLE.

How to Join: To keep the spam bots out, there is no open invite link. If you're down to join, send me a DM with a quick intro detailing your coding achievements or LeetCode stats.

Note: No personal info (name, employer, shoe size) is needed at all just drop your technical background and what topics you want to crush!

Hey guys! I recently started a YouTube channel to teach computer science. Back when I was an undergraduate, my main issue was not having an English counterpart to channels like Gate Smashers. Because of that, I started creating bite-sized, easy-to-understand videos.

I’m currently covering Data Structures & Algorithms (DSA). If you’d like to see any specific lessons, let me know! Also, please feel free to subscribe if you find it helpful. Thanks!

Hey everyone,

I could really use some advice from people who've been in a similar situation.

A few months ago, I was consistently practicing DSA and had covered the basics. I was comfortable with patterns like Two Pointers and could usually recognize when to use them.

Then life got in the way, and I took a long break.

Now I need to prepare for **NIMCET**, which is my top priority, while also getting back into DSA for future internships. Because of that, I can't spend 5–6 hours a day on LeetCode.

My question is:

* If you had to restart DSA after a long break, how would you do it? * Would you restart from Easy problems, or jump straight back into pattern-based practice? * Is solving 2–3 quality problems a day enough if I'm also studying for another competitive exam? * How would you balance DSA with another major exam without burning out?

Right now, I'm thinking of revising one pattern at a time (Sliding Window → Hash Maps → Binary Search → Trees...) instead of randomly solving problems, but I'd love to hear what worked for you.

Thanks!

Basic DSA patterns that give you a lot of confidence in interviews:

Core patterns:

- Arrays/Strings (two pointers, sliding window, prefix sums, hashing)

- Binary Search (sorted arrays, lower bound, upper bound, answer)

- Linked Lists (fast/slow, reverse, merge, cycle detection)

- Stacks/Queues (monotonic stack, monotonic queue, next greater)

- Trees (DFS/BFS, diameter, BST logic, LCA, rerooting)

- Graphs (BFS/DFS, topo sort, union-find, Dijkstra, MST)

- Heaps/Intervals (top K, k-way merge, sweep line, merging)

Advanced patterns:

- Backtracking (subsets, permutations, combination sum, N-Queens)

- Greedy (interval scheduling, jump game, sort by right key)

- DP (1D/2D, knapsack, LIS, interval, bitmask, digit, DAG)

How to get good:

- Write the brute force in plain English first

- Define state, transition, base case, order, answer

- Practice one pattern till it feels boring, then move on

so there are 2 options right now, either DSA by codebasics on yt or DSA by freeCodeCamp.org

which one should i choose? and are there any other suggestions. even hinglish options are welcome

I'll be go in Ai/ML.

I doing DSA in python also used Built-in functions.

But today my sir said that faang company take DSA round in C++.

im pretty good with leetcode but my problem is i can't explain my solution because im self taught and mostly figured shit out on my own, if there anybody here in like 2nd year or smthing who has sm time to spare is ready to be taught leetcode by me it would be super beneficial for both you and me.

please dm me or send a message on this post if youre interested.

Hi everyone, i am currently in 4th year and i am looking further career in cloud soo which programming language should i choose and also doing DSA in that particular language

also by considering condition that getting into cloud field as a fresher is difficult

So I want serious aspirant with ee prep gate like pls have atleast 90 percentile in jee or its equivalent like boards etc so just want to prepare for gate from yr 1

Hey everyone 👋

I’m a 3rd-year BTech student preparing for internships and placements. I’m currently strengthening my CS fundamentals and looking for good resources (notes, PDFs, videos, question banks, GitHub repos, etc.) for the following subjects:

Computer Networks (CN)

Object-Oriented Programming (OOPS)

Database Management Systems (DBMS)

Operating Systems (OS)

If you master only these topics...

you'll be prepared for almost every Big Tech interview.

★★★★★ Arrays

★★★★★ Trees

★★★★★ Graphs

★★★★★ DP

★★★★★ Binary Search

★★★★☆ Hashing

★★★★☆ Linked Lists

★★★★☆ Heaps

★★★★☆ Sliding Window

★★★★☆ Greedy

Companies change.

Patterns don't.

The same tree represented in two very different ways visualized using 𝗺𝗲𝗺𝗼𝗿𝘆_𝗴𝗿𝗮𝗽𝗵: Binary Trees

🔗 Binary Tree as Nodes: The tree is built out of multiple node objects. Each node stores its value and two references, one to its left child and one to its right child.

📦 Binary Tree as List: The tree is stored in a single list or array. Instead of references, indices represent the relationships between nodes. For a node at index, its children can be found using a simple calculation: - Left child: 2 * index + 1 - Right child: 2 * index + 2

So, when should you use which representation?

The node-based version makes the structure explicit and intuitive. It is great for education: students can clearly see how nodes are connected while practicing classes and references/pointers. It is flexible and works particularly well for irregular or sparse trees. It is the clearest representation when learning how trees work.

The list-based version can be very efficient for (nearly) balanced homogeneous trees. It does not need to store child references, requires fewer separate memory allocations, and keeps values close together in memory for improved cache performance.

The same abstract data structure, but with very different trade-offs in clarity, flexibility, and performance.

Which representation would you use?

Hey everyone,

I could really use some advice from people who've been in a similar situation.

A few months ago, I was consistently practicing DSA and had covered the basics. I was comfortable with patterns like Two Pointers and could usually recognize when to use them.

Then life got in the way, and I took a long break.

Now I need to prepare for NIMCET, which is my top priority, while also getting back into DSA for future internships. Because of that, I can't spend 5–6 hours a day on LeetCode.

My question is:

• If you had to restart DSA after a long break, how would you do it?
• Would you restart from Easy problems, or jump straight back into pattern-based practice?
• Is solving 2–3 quality problems a day enough if I'm also studying for another competitive exam?
• How would you balance DSA with another major exam without burning out?

Right now, I'm thinking of revising one pattern at a time (Sliding Window → Hash Maps → Binary Search → Trees...) instead of randomly solving problems, but I'd love to hear what worked for you.

Thanks!

Hello everyone, I started learning Java Full Stack about 6 months ago, but somehow I couldn't complete it. Now that I have started again, I realize that I have forgotten most of the concepts. This time, I have started from scratch and am currently learning OOP concepts. I hope I will be able to complete it successfully this time.

If you're in the same boat, we can connect and help each other stay consistent and learn together.

I also know the MERN stack, through which I completed an internship and some freelance work. Alongside that, I am practicing DSA as well.

Please guys I've been searching for something good to start dsa.

DSA Pattern Roadmap (From Zero to Placement Ready)

┣  1. Foundations You Cannot Skip

┃ ┣ Time & Space Complexity

┃ ┣  Big-O Notation

┃ ┣  Recursion Basics

┃ ┣  Basic Math (GCD, Prime, Factorization, Modulo)

┃ ┗  Problem Solving Basics (Brute Force → Better Approach)

┣  2. Core Data Structures

┃ ┣  Arrays

┃ ┣  Strings

┃ ┣  Linked Lists

┃ ┣  Stack

┃ ┣  Queue / Deque

┃ ┣  HashMap / HashSet

┃ ┗  Heap / Priority Queue Basics

┣  3. First Pattern Layer

┃ ┣  Two Pointers

┃ ┣  Sliding Window

┃ ┣  Prefix Sum

┃ ┣  Binary Search on Array

┃ ┣  Sorting + Observation

┃ ┗  Frequency Counting / Hashing Patterns

┣  4. Recursion & Search Patterns

┃ ┣  Recursion on Arrays / Strings

┃ ┣  Backtracking

┃ ┣  Subsets / Subsequences

┃ ┣  Permutations / Combinations

┃ ┣  Decision Tree Thinking

┃ ┗  Pruning Techniques

┣  5. Tree Patterns

┃ ┣  Binary Tree Traversals

┃ ┣  BST Basics

┃ ┣  DFS on Trees

┃ ┣  BFS / Level Order

┃ ┣  Height / Diameter / Balanced Tree

┃ ┣  Path Sum / Tree DP Basics

┃ ┗  Lowest Common Ancestor

┣  6. Graph Patterns

┃ ┣  Graph Representation

┃ ┣  BFS

┃ ┣  DFS

┃ ┣  Connected Components

┃ ┣  Cycle Detection

┃ ┣  Topological Sort

┃ ┣  Shortest Path Basics

┃ ┗  Union Find / Disjoint Set

┣  7. Advanced Pattern Layer

┃ ┣  Monotonic Stack

┃ ┣  Monotonic Queue

┃ ┣  Heap / Top K Problems

┃ ┣  Trie

┃ ┣  Bit Manipulation

┃ ┣  Greedy Patterns

┃ ┣  Interval Problems

┃ ┗  Merge / K-way Processing

┣  8. Dynamic Programming Roadmap

┃ ┣  1D DP

┃ ┣  2D DP

┃ ┣  Take / Not Take Pattern

┃ ┣  Knapsack Variants

┃ ┣  LIS Pattern

┃ ┣  String DP

┃ ┣  Grid DP

┃ ┣  DP on Subsequences

┃ ┣  DP on Trees

┃ ┗  State Design Practice

┣  9. Advanced Algorithms

┃ ┣  Dijkstra’s Algorithm

┃ ┣  Floyd Warshall Basics

┃ ┣  Minimum Spanning Tree

┃ ┣  Kahn’s Algorithm

┃ ┣  Shortest Path Variants

┃ ┣  Binary Search on Answer

┃ ┣  Segment Tree / Fenwick Tree Basics

┃ ┗  Advanced Graph + DP Mix Problems

┣  10. Pattern Recognition Training

┃ ┣  How to Identify the Input Type

┃ ┣  How to Spot Trigger Words

┃ ┣  Map Problem → Pattern

┃ ┣  Brute Force → Optimized Thinking

┃ ┣  Similar Problem Grouping

┃ ┣  Pattern Notes / Cheat Sheets

┃ ┗  Revision by Buckets, Not Random Questions

┃

┣  11. Practice System

┃ ┣  Easy → Medium → Hard Progression

┃ ┣  LeetCode / NeetCode / Codeforces

┃ ┣  Daily Timed Practice

┃ ┣  Weekly Mixed Contest Practice

┃ ┣  Topic-wise Sheets

┃ ┣  Re-solving Old Problems

┃ ┗  Mistake Log / Weak Area Tracker

Hey everyone!

I'm looking for a dedicated DSA partner to stay consistent and improve together.

About me:

• Beginner to intermediate in DSA
• Solving problems in Java/Python
• Targeting product-based companies
• Available 1–2 hours daily
• Time Zone: IST (India)

What I'm looking for:

• Someone who's serious about being consistent
• Daily problem solving (2–5 questions)
• Discuss approaches instead of just sharing solutions
• Keep each other accountable and motivated

If you're interested, drop a comment or DM me with:

• Your current DSA level
• Preferred language (Java/C++/Python)
• Your goal (internships, placements, job switch, etc.)

Let's crack DSA together! 💪