May 11, 2020
Finding best possible answers (optimized answers) at the moment.
Edit me
- About
-
Algorithm
- Algorithm Overview
- Priority Queue vs Vector
- Prime Number
- Fenwick Tree
- Permutation
- Trie Algorithm
- Algorithm Course
- Etc
- Greedy Algorithm
-
leetcode
- 3 sum
- single number
- buy and sell stock 2
- rotate array
- Kth Smallest Element in a BST (inorder)
- Coin Change (DP)
- Palindrome Partitioning (DFS)
- Cherry Pickup II (DP w/ 3D matrix)
- Largest Rectangle In Histogram (mono-Stack)
- Pseudo-palindromic Paths In a Binary Tree (Tree DFS + Bit Masking)
- Create Sorted Array Through Instructions (Fenwick Tree)
- Boats To Save People (Two pointers)
- Minimum Operations To Reduce x To Zero (DP-Sliding window)
- Maximum Frequency Stack (Two Maps with stack)
- Best Time to Buy and Sell Stock with Transaction Fee (DP)
- Reordered Power Of 2 (Map)
- Palindrome Linked List (creativity)
- Longest Valid Parentheses (DP or Stack)
- Number of Submatrices that Sum to Target (DP)
- Interleaving String (DP/memoization)
- Jump Game VI (DP/dequeue(smart!))
- Remove All Adjacent Duplicates In String (dequeue)
- Flip String to Monotone Increasing (DP)
- Maximal Square (DP)
- Power of Two (smart)
- Course Schedule II (Graph - Topological)
- Complement of Base 10 Integer (bitwase operation)
- Sum of Root To Leaf Binary Numbers (binary->decimal)
- ★ Cheery Pickup II (Matrix as a storage)
- Koko Eating Bananas (binary search)
- Majority Element (Boyer–Moore majority vote algorithm)
- Delete and Earn (DP)
- 3Sum With Multiplicity (map+math)
- Binary Search Tree Iterator (stack)
- Course schedule III
- Minimum Time To Complete Trips (binary search)
- Merge K Sorted Lists (Time Complexity)
- Count Unreachable Pairs of Nodes in an Undirected Graph (Union find)
- Check if Object Instance of Class (JS lang)
- Path with Maximum Probability (Dijkstra)
- Predict the winner (DP - topDown)
- Minimum ASCII Delete Sum for Two Strings (DP - topDown)
- Search a 2D Matrix (binary search)
- House Robber III (DFS)
- Eliminate Maximum Number of Monsters (digitizing)
- Gas Station (Greedy)
- Find the City With the Smallest Number of Neighbors at a Threshold Distance (APSP)
- Minimum Cost to Convert String I (APSP)
- Minimum Swaps to Group All 1's Together II (Sliding window)
- baekjoon
- HackerRank
- CodeWar
- codingame
- Advent Of Code 22'
- Study
- Android