6d ago · 2 min read · Yesterday, I was recognized at my company. Today, I faced my fourth unsuccessful attempt at Amazon's SDE position. People often say Amazon is the easiest company to crack among all FAANG companies. He
Join discussion
May 28 · 5 min read · You can write recursive inorder in your sleep. Three lines and a base case. Then an interviewer asks for the iterative version, and the clean recursion you leaned on becomes a puzzle about when to pus
Join discussion
May 26 · 4 min read · If you’ve solved DSA problems before, chances are you’ve come across questions like: Longest Substring Without Repeating Characters Maximum Sum Subarray of Size K Minimum Window Substring At firs
Join discussion
May 25 · 10 min read · You learn that a binary search tree gives you O(log n) search, insertion, and deletion. Then you feed it a sorted array of timestamps from a log and the tree degenerates into a linked list. Every sear
Join discussion
