- Time complexity
- Big O Exponential 2**n
- Worst case, Big O
- Best scenario
- Average
- Data structure & algorithms
- Test case: ZeroDivisionError
- Implement function from scratch
- Tree algorithms
- Use pointers while lo < hi : do xyz lo = 0th index hi = len(input)-1
- Language: Java, Python slightly preferred
- Exponential
Ad
Sunday, March 22, 2020
Technical Interview Tips - Technical Interview with Python cheat sheet
Subscribe to:
Post Comments (Atom)
Debug Google Cloud Error - Failed to enable API please make sure you have the IAM permission to enable API
If you are not expecting this message, and think you have the permission to enable API read on. Before using Google Cloud services, genera...
-
Can hack schools solve Silicon Valley's talent crunch? The truth about coding bootcamps and the students left behind http://t.co/xXNfqN...
-
In this downtown startup work space design the designers used fat boy bean bags and an extra wide step tiered staircase to create work space... -
The bogus request from P2PU to hunt for HTML tags in real life has yielded a lot of good thoughts. My first impression was that this is stup...
No comments:
Post a Comment