Free placement test across arrays, trees, graphs, DP, and more. Get a readiness score, see your weakest topics, then decide if you want to keep going.
What is the time complexity of the classic 0/1 knapsack problem solved with dynamic programming?
CODING DRILL COMPLETE
8 of 8 tests passed. That's 100%.
PASSED
8
FAILED
0
ELO
+161
STRENGTHS
O(n) hash map solution — identified the trade-off immediately.
TOP GAP
Watch edge cases with duplicate values in the input array.
6 cards per session, selected by the SM-2 algorithm from your weakest topics. DSA, system design, and behavioral — 5–10 minutes a day.
Write real code against test cases. An AI coach guides your approach before you write a line, then debriefs your solution after you submit.
Every topic has its own ELO rating. Always challenged, never overwhelmed. One number tracks your overall interview readiness.
Random grinding
grip.
Take the placement test free. Sign up after if you want to keep training.
START FREE PLACEMENT TEST →