I can usually spot the candidates who are leetcode junkies. This is why I direct our interviews to be as pragmatic as possible. Most of our question bank comes from actual code one of our devs had to implement. I'm fairly confident that if you've studied hard enough to solve these problems easier the studying just paid off by making you a better developer.
> I can usually spot the candidates who are leetcode junkies. what are some of the tells ?
2. Know various approaches more than ordinary people. "Ah we can solve this in various approaches. We can sort this one, and the problem will be log N, or we can use Heap and make it log K. We can use stack but does it get counted as space in the space complexity? Oh I can use deque here but let me just use Python list because Python list is very versatile, it can be anything, it can be array, can be queue, can be stack"
3. Know the solution right away even the non obvious ones. One example is the problem of next permutation. Given a number 1, 3, 2, 4, 5. Find the next permutation in O(n) time and O(1) space. This solution is easy but if you have never done it before there is no way you can come up with a solution complete with code. Another problem, given preorder and inorder list, construct the binary tree. There are many non obvious problems like this.