|
|
|
|
|
by kubanczyk
180 days ago
|
|
Off the top of my head, possible problems here might be: 1. To handle trees easily you have to understand recursion. Somebody with no CS experience (and no parser experience) might never ever used recursion in anger, even if they launched zillion commercial projects. 2. No Big-O notation. Interviewers usually ask questions about time/space complexity. And the elephant in the room is that leetcodes are getting trickier and trickier, that's LLM era for you. |
|
It sounds like leetcode problems require either memorization of a significant number of algorithm design patterns or seriously sharp algorithmic problem solving skills.