Please enable JavaScript.
Coggle requires JavaScript to display documents.
Master Coding Interview ZTM - Coggle Diagram
Master Coding Interview ZTM
Steps/Process
FAANG
Facebook
Apple
Amazon
Netflix
Google
Type of problems
Arrays
Strings
LinkedList
Stacks
Queues
Binary Trees
Graphs
Recursion
Dynamic programing
Sorting
Concepts
Big O
It's about scalable code
How long does take the algorithm to run?
Notations
O(n) = Linear Time
O(1) = Constant Time
What is good code?
Scalable
Time Complexity: Speed = How fast is the code or run the operations?
Space Complexity: Memory = How much memory is using?
Readable and maintanable
4 Rules to detect Big O
Look for the worst case
Remove Constants
Different terms for inputs
Drop non dominants