Search Results

3 matches found for 'leetcode'

Tenets of Leetcode

Disclosure I'm a simple guy who did a handful of interviews at tech startups and enterprise companies until I landed an offer at FAANG. I'm also fairly involved with interview loops at my FAANG company.

January 27, 2021

Misconceptions of Software Engineer interviews at FAANG

There are already so many articles and Quora/Reddit/Blind posts out there on how to interview prep to get into big companies. So instead of covering that in detail, I want to focus more on the angle of common misconceptions.

August 15, 2020

Phone Number Mnemonics in Python

... \(O(n^2)\) operation with \(n\) recursive calls. Update 2: Here is the solution to the leetcode variation; the strategy is quite similar to above, but this one might be easier to read! def letterCombinations(self, digits: str) -> List[str]: """ - Recursive approach - In function, given current result, current digit - Base Case: - If digit value is 1, *, or #, exit - If current digit index is out of bounds, exit - Look up digit from map (3-4 possible letters) - Add current result with each possible letter - Make another call to self for the next digit - Outside of recursive function, join the combination lists into a string and add them all to one single list, then return - Track current digit with int index - Current result could just be a list, but we need to remember to add and remove elements after the recursive call.

September 21, 2017