3 ms·
I agree with the complaints that esoteric competitive-programming stuff (suffix arrays, segment trees, Dinic's algorithm, etc.) should not tested in a coding in
by evouga 5y ago
I agree with the complaints that esoteric competitive-programming stuff (suffix arrays, segment trees, Dinic's algorithm, etc.) should not tested in a coding interview.
But most of the Leetcode problems cover basic algorithms like BFS/DFS, binary search, dynamic programming, and other Algorithms-class material, no? As long as you're given adequate time to think about and solve the problems, I don't really understand the negativity in the comments towards companies requiring coders to... actually code.
(By the way, if all of the monetization/engagement/social-media aspects of Leetcode turn you off as much as they do me, I recommend practicing on https://cses.fi/ https://cses.fi/ instead---the problems are higher-quality and better-taxonomized too).