lilyjiang0/leetcode

Leetcode

Complexity

Time complexity

is the time taken by the algorithm to execute each set of instructions. It is always better to select the most efficient algorithm when a simple problem can solve with different methods.

Space complexity

is usually referred to as the amount of memory consumed by the algorithm. It is composed of two different spaces; Auxiliary space and Input space.

Readings: (https://towardsdatascience.com/space-and-time-complexity-in-computer-algorithms-a7fffe9e4683) (https://www.youtube.com/watch?v=__vX2sjlpXU&ab_channel=MichaelSambol) (https://www.interviewcake.com/article/java/big-o-notation-time-and-space-complexity)

Testing

Black Box Testing

• normal function
• boundary case
• cases outside requirements

White Box Testing

• code coverage
• boundary cases based on code