Kacy Codes
Just a hero for fun.
LeetCode 1438. Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit
LeetCode 2040. Kth Smallest Product of Two Sorted Arrays
LeetCode 2055. Plates Between Candles - O(n + q)
LeetCode 300. Longest Increasing Subsequence - O(n log n)
LeetCode 300. Longest Increasing Subsequence (Bottom Up DP)
LeetCode 300. Longest Increasing Subsequence (Top Down DP)
LeetCode 225. Implement Stack using Queues (2 queues & 1 queue)
LeetCode 1135. Connecting Cities With Minimum Cost
LeetCode 2104. Sum of Subarray Ranges
LeetCode 818. Race Car - BFS - O( target * log(target) )
LeetCode 1152. Analyze User Website Visit Pattern
LeetCode 1192. Critical Connections in a Network
LeetCode 4. Median of Two Sorted Arrays - O( log(min(n,m)) )
K-th element of two sorted Arrays - O( log(min(n, m)) )
CTCI 4.9 BST Sequences - Java
LeetCode 236. Lowest Common Ancestor of a Binary Tree
LeetCode 269. Alien Dictionary (Kahn/BFS - Java)
LeetCode 269. Alien Dictionary (DFS - Java)
LeetCode 370. Range Addition
LeetCode 630. Course Schedule III
LeetCode 210. Course Schedule II - (Kahn's Algorithm / BFS)
LeetCode 210. Course Schedule II - (DFS)
LeetCode 207. Course Schedule I - (DFS)
LeetCode 207. Course Schedule I - (Kahn's Algorithm / BFS)
LeetCode 79. Word Search
LeetCode 208. Implement Trie (Prefix Tree) - Java
LeetCode 314. Binary Tree Vertical Order Traversal
LeetCode 987. Vertical Order Traversal of a Binary Tree (PriorityQueue + DFS)
LeetCode 285. Inorder Successor in BST (Recursive + Iterative approaches)
LeetCode 106. Construct Binary Tree from Inorder and Postorder Traversal