Goals¶
- Practice time and space complexity analysis
- Get comfortable with problem identification
- Review linked lists, hash table, stacks, queues, heaps problems
Wednesday¶
Thursday¶
Read time complexity articles:
- Big O Complexity Analysis · codepath/compsci_guides Wiki
- Big O Notation | Interview Cake
- Logarithms for algorithmic coding interviews | Interview Cake
Saturday¶
Work through the time complexity problems from Interview Bit. Do as many problems as you can in these sections:
- basic primer
- math
- compare functions
After that, we will work through the following problems using UMPIRE
Talk through problems - Select one person to code the solution and rotate for the next question. The other person should work with the coder to come up with a solution. This isn’t just about getting a correct solution but also effective communication.
- Come up with a few new example input/ outputs
- Talk about the edge cases
- Talk about different approaches
- Pseudocode
- Code the solution (talk throughout this segment!)
- Test your solution
- After completing a problem, scroll down to the bottom of this tab to find the solution links and discuss/compare your solution with the solution given. Is the one you’ve developed less efficient or less concise? Repeat this and work through the exercises below.