Algorithms (LeetCode, HackerRank, Codility, CTCI - Cracking The Coding Interview & Miscellaneous studies & solutions)

| Problem Tags | |---| |Binary Search | |Binary Tree | |Breadth First Search (BFS) (Both BSTs and Graphs) | |Depth First Search (DFS) (Both BSTs and Graphs) | |Divide and Conquer | |Dynamic Programming | |Graph | |Greedy | |Interactive | |Linked List | |Minimum Spanning Tree - MST | |Notes | |Shortest Path | |Sliding Window | |Sorting | |Tree | |Trie |

| Common Pitfalls & Notes | |---| |Integer.MAX_VALUE and Integer.MIN_VALUE usages |

LeetCode

| PROBLEM DESCR. | SOLUTION | DIFFICULTY | RELATED TOPICS | ADDITIONAL INFO | |---:|:---|:---|:---|:---| | LeetCode | 1. Two Sum | :green_circle:Easy | Array, Hash Table | Problem Set / Algorithms | | LeetCode | 3. Longest Substring Without Repeating Characters | :orange_circle:Medium | Sliding Window, Hash Table, Two Pointers, String | Problem Set / Algorithms | | LeetCode | 35. Search Insert Position | :green_circle:Easy | Array, Binary Search | Problem Set / Algorithms | | LeetCode | 53. Maximum Subarray | :green_circle:Easy | Array, Divide and Conquer, Dynamic Programming | Problem Set / Algorithms | | LeetCode | 62. Unique Paths | :orange_circle:Medium | Array, Dynamic Programming | Problem Set / Algorithms | | LeetCode | 64. Minimum Path Sum | :orange_circle:Medium | Array, Dynamic Programming | Problem Set / Algorithms | | LeetCode | 70. Climbing Stairs | :green_circle:Easy | Math, Dynamic Programming, Memoization | Problem Set / Algorithms | | LeetCode | 74. Search a 2D Matrix | :orange_circle:Medium | Array, Binary Search, Matrix | Problem Set / Algorithms | | LeetCode | 94. Binary Tree Inorder Traversal | :orange_circle:Medium | Hash Table, Stack, Tree | Problem Set / Algorithms | | LeetCode | 98. Validate Binary Search Tree | :orange_circle:Medium | Tree, Depth-first Search | Problem Set / Algorithms | | LeetCode | 101. Symmetric Tree | :green_circle:Easy | Tree, Depth-first Search, Breadth-first Search | Problem Set / Algorithms | | LeetCode | 102. Binary Tree Level Order Traversal | :orange_circle:Medium | Tree, Breadth-first Search | Problem Set / Algorithms | | LeetCode | 104. Maximum Depth of Binary Tree | :green_circle:Easy | Tree, Depth-first Search | Problem Set / Algorithms | | LeetCode | 107. Binary Tree Level Order Traversal II | :green_circle:Easy | Tree, Breadth-first Search | Problem Set / Algorithms | | LeetCode | 111. Minimum Depth of Binary Tree | :green_circle:Easy | Tree, Depth-first Search, Breadth-first Search | Problem Set / Algorithms | | LeetCode | 118. Pascal's Triangle | :green_circle:Easy | Array, Dynamic Programming | Problem Set / Algorithms | | LeetCode | 121. Best Time to Buy and Sell Stock | :green_circle:Easy | Array, Dynamic Programming | Problem Set / Algorithms | | LeetCode | 122. Best Time to Buy and Sell Stock II | :green_circle:Easy | Array, Greedy | Problem Set / Algorithms | | LeetCode | 124. Binary Tree Maximum Path Sum | :red_circle:Hard | Dynamic Programming, Tree, Depth-first Search, Binary Tree | Problem Set / Algorithms | | LeetCode | 130. Surrounded Regions | :ora