Can someone who went from being average at solving LC, to being able to flash them in five or ten minutes (or under 20) answer this - was there any specific thing that helped you. Should I be taking notes when I solve a problem or just keep moving tldr: share secrets to crack any algorithmic interview and collect good karma points. TC 123k
You have used this service ? If yes , any reviews ?
No, I coach there. You can schedule a free coaching call from the website.
I took 2 pages per problem. 1 page for notes and 1 for the actual code. It took me 3.5 months to crack Google.
You always code on paper?
Appreciate your inputs - how many problems did you solve? ( I am assuming google tagged problems ?) . Also how difficult was google interview compared to others?
just doing a lot of them
Brute force 🤷♂️
I always apply bruteforce and reach nowhere lol.
Deutsche Bank location? 123 seems low even fresh out of college.
Do some introspection after you solve a bunch and pay attention to the areas that trip you up and leave you taking too long to debug the problem. For me, for instance, it was off by one errors. I started putting a bit more upfront effort into making sure they were correct, and I started nailing them.
Keep practicing and do lots of interviews! Practice on real companies before the companies you really care about.
>Since then I have cleared one of the FANG onsite you passed the FANG onsite or you got the FANG onsite? Either way that is pretty good with only 75 LC done
How many have you done? Come back to us at 100+ and you'll probably be fine.
I am at 75 - mostly focusing on graphs as my dream is google! DP is my nemesis - I try to workaround by converting an obvious DP into a graph problem 🙁
the fuck? DP is the easiest topic of all. You obviously havent faced any of those bullshit array and string questions
Drawing on a mini whiteboard helped me. Visualizing tree traversal/recursion tree etc.
Yes I do this - any advice for handling DP and backtracking ?
DP: draw a table, remember the base case is sometimes “off-by-one-column/row”, e.g. DP for edit distance starts with empty strings, not string of index 0 (where length is one). You can sometimes derive the algorithm by filling in the bottom right corner first: find an easy example, come up with an answer by eyes, then fill the grid way back to the base case. Use another piece of paper to cover up a row/column to visualize what the “previous answer” mean. For backtracking, look up “backtracking blueprint” by Back to Back SWE on YouTube
$35/mo subscription and going through the explore tab accelerated my learning
Thank you - did you already clear the onsites or have those lined up ?