- 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
Sunday, March 22, 2020
Technical Interview Tips - Technical Interview with Python cheat sheet
Subscribe to:
Post Comments (Atom)
-
Can hack schools solve Silicon Valley's talent crunch? The truth about coding bootcamps and the students left behind http://t.co/xXNfqN...
-
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... -
This review is updated continuously throughout the program. Yay I just joined the Udacity Nanodegree for Digital Marketing! I am such an Uda...
No comments:
Post a Comment