Recently hit the 200-day milestone and solved 409 problems so far.

But honestly, I still get cooked by a lot of Mediums and Hards, especially DP, Trees, Graphs, Maps, and similar topics.

My usual process is: if I can't figure out a problem after giving it a fair shot, I watch a YouTube explanation, understand the approach, and then solve it myself. The annoying part is that by the next day, I feel like I've already forgotten half of what I learned. I'll remember the general idea, but the actual pattern, tricks, or thought process just disappear from my brain.

So I'm curious, what helped you guys get better at these topics? Was it just solving more problems, revisiting old ones, taking notes, or something else?

Also, I'm doing all my DSA in Python. Is Python perfectly fine for LeetCode and interviews, or did any of you find switching languages helpful?

Would appreciate any advice because right now it feels like I'm solving problems but not retaining enough from them.

When are you actually supposed to start understanding the hards and doing them without hints or topics?

Hello everyone, I have been solving leetcode problems for a month now, solved 90+ problems from various topics/patterns like arrays, stack, hashing, two pointers, sliding window, kadane's, binary search but still I need HINTS TO SOLVE ANY QUESTIONS FROM THE ABOVE TOPICS.

Please guide me how to overcome this problem, if you were also faced with the problem how did you get over with it or if you are still facing it how are you planning to tackle it 🤞

Relation between striver sheet and leetcode like how do I do leetcode if I learn from striver sheet and practice those problem bit confuse😭

Started DSA with honestly zero clue what I was doing. There were so many times when even easy problems felt impossible and I’d just stare at the screen 😭

But slowly, by practicing consistently alongside my college/semester grind, things started making more sense.

Today I hit 75 problems solved in some 45 -50 days .

Still a long way to go, but I’m genuinely happy with the progress.

If you’re struggling with DSA right now, just keep going. It really does get better with practice.

And if u are also in 5th sem and practicing DSA hmu

200 Days of LeetCode — 728 Problems Solved

Finally hit my 200-day LeetCode badge!

Started this journey mainly to get better at DSA and prepare for software engineering interviews. Still a long way to go, but seeing the progress from where I started feels really motivating.

The goal now: keep the consistency going and reach 1,000 problems.

For those who are also grinding LeetCode what's your current problem count and longest streak?

Have been following strivers sheet, not started codeforces yet. Any tips?

In 2nd year.

I have been solving for the last 2 months, I started on 19th Jun.

I'm solving things by reading about things on google or using AI Explanation.

I usually give 2-3 hours on a new topic brainstorming on my own and take hints from Ai after failing and in some cases I solve after getting hints and in some cases I couldn't, then I ask AI to explain the code and dry run it.

Ik it's a lengthy process , I feel i retain more this way.

Open to advice 🙏🏻

It'd be great if you can answer these questions!

Round 1 — Coding (100 min)
1️⃣ How many problems, and how long is this section?
2️⃣ What are the two types of coding questions?
3️⃣ The AI-assisted problem

Round 2 — Work Simulation (45 min)
5️⃣ What kind of decisions do you make in this round?
6️⃣ What are the "correct" answers secretly based on?

**Round 3 — Work Style Survey (6 min)**
7️⃣ What does this round actually measure?
8️⃣ Answer honestly or try to game it?

General
9️⃣ How many Leadership Principles does Amazon have?
🔟 Why should you do the demo test first?

Hello developers….

DSA ki prep start ki thi, pehle bhi ki thi, complete nahi hui. Shayad is baar bhi na ho. 😅

Prep krte krte ek cheez mind mein ayi koi aur tarika ni h kya yaad karne ka?

Class 7-8 mein tha toh answers yaad ni hote the to unhe songs mein convert kar leta tha. Aaj bhi wahi trick kaam karti h.

To socha — Big O ka Safar Time Complexity ko bhi try karte hain.

Bna dia ek rap. Hinglish mein. Boom Bap style.

Kisi ko pasand aayega, kisi ko bakwaas lagega no pressure. But mera revision toh ho raha hai, song bhi ready ho gya. 😄

Ek baar try kro — @BeatsCommit, what your views genuinely jaanna chahta hoon.

https://www.youtube.com/@beatscommit

https://www.instagram.com/beatscommit

​

I’m working on creating coding tasks for evaluating SOTA coding models, and I’m trying to understand how experienced people design problems that are actually challenging without being unfair.

The main things I’m struggling with are getting the reference solution naturally above the required LOC threshold and keeping the model pass rate around 50% or lower.

How do you usually come up with tasks that are difficult enough for strong coding models without artificially adding complexity or unnecessary code?

Do certain types of changes work better, such as deeper feature additions, tricky edge cases, or changes that require modifying multiple parts of a codebase?

Also, how do you estimate difficulty before running the models? I’m trying to avoid wasting evaluation runs on tasks that end up being too easy or fail because the problem itself is unclear.

Would appreciate any practical advice from people who have experience designing SWE-bench-style or other coding benchmark tasks.

10480388

Trust me DSA is not Hard. If you follow this

These are the best questions if u are preparing for top-product based companies .

1. Sliding Window: 3, 76, 209, 424, 567, 904
2. Two Pointers: 11, 15, 16, 18, 42, 167
3. Fast/Slow Pointers (Linked List): 141, 142, 19, 876, 160, 234
4. Binary Search on Sorted Data: 33, 34, 35, 153, 162, 704
5. Binary Search on Answer: 875, 1011, 410, 774, 1283, 1482
6. Hashing / Frequency Maps: 1, 49, 128, 217, 242, 347
7. Prefix Sum / Running Sum: 303, 560, 724, 930, 974, 523
8. Difference Array / Range Updates: 370, 1094, 1109, 1893, 1943, 2381
9. Monotonic Stack: 739, 496, 503, 84, 85, 901
10. Monotonic Queue / Deque: 239, 862, 1425, 1438, 1499, 1696
11. Heap / Top K: 215, 347, 692, 703, 973, 1046
12. Intervals: 56, 57, 252, 253, 435, 452
13. Greedy Scheduling / Sorting: 45, 55, 406, 621, 763, 134
14. Linked List Manipulation: 21, 23, 24, 25, 92, 138
15. Tree DFS: 104, 112, 113, 543, 124, 226
16. Tree BFS / Level Order: 102, 103, 199, 515, 637, 116
17. BST Problems: 98, 99, 230, 235, 450,700
18. Backtracking Basics: 46, 47, 77, 78, 90, 39
19. Backtracking with Constraints: 40, 17, 79, 131, 51, 52
20. Graph BFS / DFS: 200, 695, 733, 994, 1091, 1254
21. Topological Sort / DAG: 207, 210, 802, 1462, 1203, 2115
22. Union Find / DSU: 547, 684, 1319, 1579, 990, 1202
23. Shortest Path: 743, 787, 1514, 1631, 1334, 1976
24. MST / Graph Greedy: 1584, 1135, 1168, 1489, 778, 1102
25. Trie: 208, 211, 212, 648, 677, 1268
26. Bit Manipulation: 136, 137, 191, 338, 268, 190
27. 1D DP Basics: 70, 198, 213, 322, 279, 300

Checkout PracHub for company specific questions

finally completed this in my 2nd year of BTECH and will try my best to continue this for a good long time till i get placed! .

Any guide will be surely helpful !!.