- Time complexity
- Big O Exponential 2**n
- Worst case, Big O
- Best scenario
- 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
Sunday, March 22, 2020
Technical Interview Tips - Technical Interview with Python cheat sheet
Features: here are some features that may be offered Automatic visualization: Automatically generate visualizations Machine learning interpr...
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...
Can hack schools solve Silicon Valley's talent crunch? The truth about coding bootcamps and the students left behind http://t.co/xXNfqN...
This review is updated continuously throughout the program. Yay I just joined the Udacity Nanodegree for Digital Marketing! I am such an Uda...