frexiona / leetcode

Most Tedious | Most Rewarding

Leetcode

Most Tedious | Most Rewarding

Tree

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)

Dynamic Programming

Key Concept: convert problem to sub-problem

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)

Linked List

Difficulty	Title	Solution	Time	Space
🟢	Reverse Linked List	reverse_linked_list.py	O(N)	O(1)

Sliding Window

Difficulty	Title	Solution	Time	Space
🟡	Longest Substring Without Repeating Characters	longest_substring_without_repeating_characters.py	O(N)	O(1)