Most Tedious | Most Rewarding
Difficulty | Title | Solution | Time | Space |
---|---|---|---|---|
๐ข | Balanced Binary Tree | balanced_binary_tree.py | O(N) | O(h) |
๐ข | Path Sum | path_sum.py | O(N) | O(h) |
๐ข | Same Tree | same_tree.py | O(N) | O(1) |
๐ข | Symmetric Tree | symmetric_tree.py | O(N) | O(1) |
๐ข | Maximum Depth of Binary Tree | maximum_depth_of_binary_tree.py | O(N) | O(1) |
๐ข ๐คฏ | Convert Sorted Array to Binary Search Tree | convert_sorted_array_to_binary_search_tree.py | O(N) | O(N) |
๐ข | Minimum Depth of Binary Tree | minimum_depth_of_binary_tree.py | O(N) | O(1) |
๐ข | Lowest Common Ancestor of a Binary Search Tree | lowest_common_ancestor_of_a_binary_search_tree.py | O(N) | O(1) |
๐ข ๐คฏ | Invert Binary Tree | invert_binary_tree.py | O(N) | O(1) |
๐ก | Binary Tree Level Order Traversal II | binary_tree_level_order_traversal_ii.py | O(N) | O(h) |
Difficulty | Title | Solution | Time | Space |
---|---|---|---|---|
๐ข | Climbing Stairs | climbing_stairs.py | O(N) | O(1) |
๐ข | Maximum Subarray | maximum_subarray.py | O(N) | O(1) |
๐ก | House Robber | house_robber.py | O(N) | O(N) |
๐ก | Minimum Path Sum | minimum_path_sum.py | O(N^2) | O(M*N) |
๐ก | Unique Paths | unique_paths.py | O(N^2) | O(M*N) |
๐ก | Jump Game | jump_game.py | O(N) | O(1) |
๐ก | Jump Game II | jump_game_ii.py | O(N) | O(1) |
๐ก | Longest Increasing Subsequence | longest_increasing_subsequence.py | O(N^2) | O(1) |
Difficulty | Title | Solution | Time | Space |
---|---|---|---|---|
๐ข | Reverse Linked List | reverse_linked_list.py | O(N) | O(1) |
Difficulty | Title | Solution | Time | Space |
---|---|---|---|---|
๐ก | Longest Substring Without Repeating Characters | longest_substring_without_repeating_characters.py | O(N) | O(1) |