Interview Note - Binary Tree
1. Binary Tree DFS Traversal 1.1 Recursion This method will cost O(n) time with no extra space. The space is assigned by system(which could be O(1) or O(h), h is the height of the tree). ` java...
Category: English
Page 2 of 2 • 14 total posts
Interview Note - Binary Search & Sorted Array
Binary Search For a given sorted array (ascending order) and a target number, find the first index of this number in O(log n) time complexity. If the target number does not exist in the array, return...
Interview Note - Intro
Coding Style 1. Leave blank space around each operations 2. Give meaningful names to parameters 3. Add space line between two logic blocks For example, Implement strStr(): ` java public class...
Markdown Reference
2 minutes read
This template is used for later markdown reference. Fonts: ` bash Italics Bold Italics and Bold ~~Scratch~~ It also works if you change the star(*) into underline(_). ` Italics, Bold, Italics and...