-
Top visited websites:
- Publish WebsiteViewed event to a queue (ActiveMQ)
- Each website maintain a HitCounter
- In-memory datastore
-
Reorganize string
- https://codebycase.github.io/algorithm/a01-fundamentals.html#contains-all-binary-codes
- https://codebycase.github.io/algorithm/a01-fundamentals.html#game-can-i-win
- https://codebycase.github.io/algorithm/a01-fundamentals.html#number-of-wonderful-substrings
- https://codebycase.github.io/algorithm/a02-arrays-and-strings.html#generate-pascal-triangle
- https://codebycase.github.io/algorithm/a02-arrays-and-strings.html#random-pick-with-blacklist
- https://codebycase.github.io/algorithm/a02-arrays-and-strings.html#single-number-iii
- https://codebycase.github.io/algorithm/a02-arrays-and-strings.html#spiral-matrix
- https://codebycase.github.io/algorithm/a02-arrays-and-strings.html#word-break
- https://codebycase.github.io/algorithm/a02-arrays-and-strings.html#word-break-ii
- https://codebycase.github.io/algorithm/a02-arrays-and-strings.html#custom-sort-string
- https://codebycase.github.io/algorithm/a02-arrays-and-strings.html#replace-and-remove
- https://codebycase.github.io/algorithm/a02-arrays-and-strings.html#group-shifted-strings
- https://codebycase.github.io/algorithm/a02-arrays-and-strings.html#find-first-substring
- https://codebycase.github.io/algorithm/a02-arrays-and-strings.html#decode-nested-string
- https://codebycase.github.io/algorithm/a02-arrays-and-strings.html#k-similar-strings
- https://codebycase.github.io/algorithm/a02-arrays-and-strings.html#longest-increasing-subsequence
- https://codebycase.github.io/algorithm/a02-arrays-and-strings.html#russian-doll-envelopes
- https://codebycase.github.io/algorithm/a02-arrays-and-strings.html#reorganize-string
- https://codebycase.github.io/algorithm/a02-arrays-and-strings.html#minimum-cost-for-tickets
- https://codebycase.github.io/algorithm/a03-list-and-linked-lists.html#combinations-of-phone-number
- https://codebycase.github.io/algorithm/a03-list-and-linked-lists.html#add-two-numbers-ii
- https://codebycase.github.io/algorithm/a08-dynamic-programming.html#paint-house
- https://codebycase.github.io/algorithm/a08-dynamic-programming.html#paint-house-iii
- https://codebycase.github.io/algorithm/a08-dynamic-programming.html#burst-balloons
- https://codebycase.github.io/algorithm/a15-the-honors-question.html#longest-valid-parentheses
- https://codebycase.github.io/algorithm/a15-the-honors-question.html#longest-palindromic-substring
- https://codebycase.github.io/algorithm/a15-the-honors-question.html#palindrome-permutation
- https://codebycase.github.io/algorithm/a15-the-honors-question.html#super-palindromes
- https://codebycase.github.io/algorithm/a15-the-honors-question.html#palindrome-pairs
- https://codebycase.github.io/algorithm/a08-dynamic-programming.html#palindrome-partitioning
- https://codebycase.github.io/algorithm/a08-dynamic-programming.html#palindrome-partition-ii
- https://codebycase.github.io/algorithm/a08-dynamic-programming.html#make-a-string-palindrome
- https://codebycase.github.io/algorithm/a08-dynamic-programming.html#compute-permutations
- https://leetcode.com/problems/permutations-ii/
- https://codebycase.github.io/algorithm/a08-dynamic-programming.html#n-pairs-of-parentheses
- https://codebycase.github.io/algorithm/a08-dynamic-programming.html#n-queens-chessboard
- https://codebycase.github.io/algorithm/a02-arrays-and-strings.html#sudoku-solver
- https://codebycase.github.io/algorithm/a05-graphs-trees-heaps.html#path-sum-iii
- https://leetcode.com/problems/path-sum-iii/
- https://codebycase.github.io/algorithm/a02-arrays-and-strings.html#three-sum-equals
- https://leetcode.com/problems/3sum/
- https://codebycase.github.io/algorithm/a15-the-honors-question.html#maximum-subarray-sum--k
- https://codebycase.github.io/algorithm/a05-graphs-trees-heaps.html#convert-to-balanced-bst
- https://codebycase.github.io/algorithm/a05-graphs-trees-heaps.html#serialize-and-deserialize
- https://codebycase.github.io/algorithm/a05-graphs-trees-heaps.html#find-exterior-of-binary-tree
- https://codebycase.github.io/algorithm/a05-graphs-trees-heaps.html#binary-tree-right-side-view
- https://codebycase.github.io/algorithm/a05-graphs-trees-heaps.html#median-of-two-sorted-arrays
- https://codebycase.github.io/algorithm/a05-graphs-trees-heaps.html#compute-k-largest-elements
- https://codebycase.github.io/algorithm/a05-graphs-trees-heaps.html#flatten-binary-tree-to-linked-list
- https://codebycase.github.io/algorithm/a05-graphs-trees-heaps.html#find-k-closest-values
- https://codebycase.github.io/algorithm/a05-graphs-trees-heaps.html#convert-traversal-data-to-bst
- https://codebycase.github.io/algorithm/a15-the-honors-question.html#sorted-singly-list-to-bst
- https://codebycase.github.io/algorithm/a15-the-honors-question.html#merge-two-bsts
- https://codebycase.github.io/algorithm/a01-fundamentals.html#accelerate-bit-manipulation
- https://codebycase.github.io/algorithm/a15-the-honors-question.html#count-smaller-numbers-after-self
- https://codebycase.github.io/algorithm/a05-graphs-trees-heaps.html#shortest-paths
- https://leetcode.com/problems/the-maze-ii/
- https://leetcode.com/problems/the-maze-iii/
- https://leetcode.com/problems/unique-paths-iii/
- https://leetcode.com/problems/network-delay-time/
- https://codebycase.github.io/algorithm/a09-recursion-greedy-invariant.html#cheapest-flights-with-k-stops
- https://codebycase.github.io/algorithm/a08-dynamic-programming.html#robot-room-cleaner
- https://codebycase.github.io/algorithm/a05-graphs-trees-heaps.html#sentence-similarity-ii
- https://codebycase.github.io/algorithm/a05-graphs-trees-heaps.html#shortest-distance-from-all-buildings
- https://codebycase.github.io/algorithm/a05-graphs-trees-heaps.html#optimize-water-distribution-in-a-village
- https://codebycase.github.io/algorithm/a05-graphs-trees-heaps.html#min-distance-in-k-sorted-arrays
- https://codebycase.github.io/algorithm/a05-graphs-trees-heaps.html#employee-free-time
- https://codebycase.github.io/algorithm/a06-sorting-and-searching.html#word-search
- https://leetcode.com/problems/word-search/
- https://leetcode.com/problems/word-search-ii/
- https://codebycase.github.io/algorithm/a06-sorting-and-searching.html#quick-sort-sample
- https://codebycase.github.io/algorithm/a06-sorting-and-searching.html#merge-sort-a-linked-list
- https://leetcode.com/problems/sort-an-array/
- https://leetcode.com/problems/sort-list/
- https://codebycase.github.io/algorithm/a05-graphs-trees-heaps.html#sort-an-increasing-decreasing-array
- https://codebycase.github.io/algorithm/a15-the-honors-question.html#count-inversions
- https://codebycase.github.io/algorithm/a02-arrays-and-strings.html#count-of-range-sum
-
https://codebycase.github.io/algorithm/a02-arrays-and-strings.html#buy-and-sell-stock
-
https://leetcode.com/problems/best-time-to-buy-and-sell-stock-ii/
-
https://leetcode.com/problems/best-time-to-buy-and-sell-stock-iii/
-
https://leetcode.com/problems/best-time-to-buy-and-sell-stock-iv/
-
https://leetcode.com/problems/best-time-to-buy-and-sell-stock-with-transaction-fee/
-
https://leetcode.com/problems/best-time-to-buy-and-sell-stock-with-cooldown/
-
https://codebycase.github.io/algorithm/a08-dynamic-programming.html#min-cost-climbing-stairs
-
https://codebycase.github.io/algorithm/a08-dynamic-programming.html#delete-and-earn
-
https://codebycase.github.io/algorithm/a08-dynamic-programming.html#max-money-rob-house
- https://codebycase.github.io/algorithm/a05-graphs-trees-heaps.html#kill-process
- https://codebycase.github.io/algorithm/a05-graphs-trees-heaps.html#deadlock-detection
- https://codebycase.github.io/algorithm/a05-graphs-trees-heaps.html#word-ladder
- https://codebycase.github.io/algorithm/a05-graphs-trees-heaps.html#sliding-puzzle
- https://codebycase.github.io/algorithm/a05-graphs-trees-heaps.html#bus-routes
- https://codebycase.github.io/algorithm/a05-graphs-trees-heaps.html#topological-ordering
- https://leetcode.com/problems/course-schedule/
- https://leetcode.com/problems/course-schedule-ii/
- https://leetcode.com/problems/course-schedule-iii/
- https://leetcode.com/problems/course-schedule-iv/
- https://codebycase.github.io/algorithm/a05-graphs-trees-heaps.html#alien-dictionary
- https://codebycase.github.io/algorithm/a15-the-honors-question.html#text-justification
- https://leetcode.com/problems/text-justification/
- https://codebycase.github.io/algorithm/a08-dynamic-programming.html#partition-array-equally
- https://codebycase.github.io/algorithm/a08-dynamic-programming.html#partition-to-k-equal-sum-subsets
- https://leetcode.com/problems/partition-equal-subset-sum/
- https://leetcode.com/problems/partition-to-k-equal-sum-subsets/
- https://leetcode.com/problems/partition-array-for-maximum-sum/
- https://leetcode.com/problems/partition-array-into-disjoint-intervals/
- https://codebycase.github.io/algorithm/a08-dynamic-programming.html#max-average-difference
- https://codebycase.github.io/algorithm/a08-dynamic-programming.html#arithmetic-slices
- https://leetcode.com/problems/arithmetic-slices/
- https://leetcode.com/problems/arithmetic-slices-ii-subsequence/
- https://leetcode.com/problems/longest-arithmetic-subsequence/
- https://leetcode.com/problems/longest-arithmetic-subsequence-of-given-difference/
- https://codebycase.github.io/algorithm/a08-dynamic-programming.html#final-score-combinations
- https://codebycase.github.io/algorithm/a08-dynamic-programming.html#max-average-difference
- https://codebycase.github.io/algorithm/a08-dynamic-programming.html#largest-sum-of-averages
- https://codebycase.github.io/algorithm/a08-dynamic-programming.html#maximum-average-subarray
- https://codebycase.github.io/algorithm/a08-dynamic-programming.html#split-array-with-same-average
- https://codebycase.github.io/algorithm/a09-recursion-greedy-invariant.html#design-hit-counter
- https://codebycase.github.io/algorithm/a09-recursion-greedy-invariant.html#heavy-hitter-tokens
- https://codebycase.github.io/algorithm/a09-recursion-greedy-invariant.html#jump-game
- https://codebycase.github.io/algorithm/a09-recursion-greedy-invariant.html#jump-game-ii
- https://codebycase.github.io/algorithm/a09-recursion-greedy-invariant.html#jump-game-iii
- https://codebycase.github.io/algorithm/a09-recursion-greedy-invariant.html#jump-game-iv
- https://codebycase.github.io/algorithm/a09-recursion-greedy-invariant.html#jump-game-vi
- https://codebycase.github.io/algorithm/a09-recursion-greedy-invariant.html#jump-game-vii
- https://codebycase.github.io/algorithm/a09-recursion-greedy-invariant.html#frog-jump
- https://codebycase.github.io/algorithm/a04-stacks-and-queues.html#largest-rectangle-skyline
- https://codebycase.github.io/algorithm/a08-dynamic-programming.html#maximal-rectangle
- https://codebycase.github.io/algorithm/a09-recursion-greedy-invariant.html#pour-water-in-histogram
- https://codebycase.github.io/algorithm/a09-recursion-greedy-invariant.html#trapping-water-in-2d-matrix
- https://codebycase.github.io/algorithm/a08-dynamic-programming.html#matrix-block-sum
- https://codebycase.github.io/algorithm/a15-the-honors-question.html#sliding-window-maximum
- https://codebycase.github.io/algorithm/a15-the-honors-question.html#sliding-window-median
- https://codebycase.github.io/algorithm/a05-graphs-trees-heaps.html#compute-online-median
- https://codebycase.github.io/algorithm/a15-the-honors-question.html#find-median-from-data-stream
- https://codebycase.github.io/algorithm/a15-the-honors-question.html#find-kth-largest-element
- https://codebycase.github.io/algorithm/a15-the-honors-question.html#maximum-product-less-than-k
- https://codebycase.github.io/algorithm/a07-hash-cache-memory.html#design-lru-cache
- https://codebycase.github.io/algorithm/a07-hash-cache-memory.html#design-lfu-cache
- https://codebycase.github.io/algorithm/a15-the-honors-question.html#max-points-on-a-line
- https://codebycase.github.io/algorithm/a15-the-honors-question.html#next-closest-time
- https://codebycase.github.io/algorithm/a15-the-honors-question.html#regular-expression-matching
- https://codebycase.github.io/algorithm/a15-the-honors-question.html#expression-add-operators
- https://codebycase.github.io/algorithm/a15-the-honors-question.html#measure-with-defective-jugs
- https://codebycase.github.io/algorithm/a08-dynamic-programming.html#interleaving-string
- https://codebycase.github.io/algorithm/a15-the-honors-question.html#optimal-account-balancing
- https://codebycase.github.io/algorithm/a10-parallel-computing.html#concurrenthashmap
- https://codebycase.github.io/algorithm/a10-parallel-computing.html#shared-variable
- https://codebycase.github.io/algorithm/a10-parallel-computing.html#a-semaphore-sample
- https://codebycase.github.io/algorithm/a10-parallel-computing.html#synchronize-two-interleaving-threads
- https://codebycase.github.io/algorithm/a10-parallel-computing.html#fix-a-concurrency-bug
- https://codebycase.github.io/algorithm/a10-parallel-computing.html#implement-a-timer-class
- https://codebycase.github.io/algorithm/a10-parallel-computing.html#javautilconcurrentexecutorcompletionservice
-
https://codebycase.github.io/algorithm/a01-fundamentals.html#number-of-wonderful-substrings
-
https://leetcode.com/problems/concatenated-words/submissions/
-
https://leetcode.com/problems/least-number-of-unique-integers-after-k-removals/submissions/
-
https://leetcode.com/problems/design-an-expression-tree-with-evaluate-function/submissions/
-
https://leetcode.com/problems/maximum-number-of-events-that-can-be-attended/submissions/
-
https://leetcode.com/problems/search-suggestions-system/submissions/
-
https://leetcode.com/problems/minimum-cost-to-connect-sticks/submissions/
-
https://leetcode.com/problems/connecting-cities-with-minimum-cost/submissions/
-
https://leetcode.com/problems/robot-bounded-in-circle/submissions/
-
https://leetcode.com/problems/k-closest-points-to-origin/submissions/
-
https://leetcode.com/problems/flip-string-to-monotone-increasing/
-
https://leetcode.com/problems/snakes-and-ladders/submissions/
-
https://leetcode.com/problems/design-in-memory-file-system/submissions/
-
https://leetcode.com/problems/design-tic-tac-toe/submissions/
-
https://leetcode.com/problems/concatenated-words/submissions/
-
https://leetcode.com/problems/minimum-swaps-to-group-all-1s-together/submissions/
-
https://codebycase.github.io/algorithm/a08-dynamic-programming.html#minimum-cost-to-merge-stones
-
https://codebycase.github.io/algorithm/a02-arrays-and-strings.html#sum-of-subarray-minimums
-
https://codebycase.github.io/algorithm/a03-list-and-linked-lists.html#snakes-and-ladders
-
https://codebycase.github.io/algorithm/a15-the-honors-question.html#bst-to-circular-sorted-dll
-
https://leetcode.com/problems/diagonal-traverse/submissions/
-
https://codebycase.github.io/algorithm/a16-tricky-code-snippets.html#maximum-swap
** Good starter **
-
https://leetcode.com/problems/minimum-add-to-make-parentheses-valid/
-
https://leetcode.com/problems/minimum-remove-to-make-valid-parentheses/
-
https://leetcode.com/problems/verifying-an-alien-dictionary/
-
https://leetcode.com/problems/remove-all-adjacent-duplicates-in-string-ii/
-
https://leetcode.com/problems/shortest-path-in-binary-matrix/solution/
-
https://leetcode.com/problems/vertical-order-traversal-of-a-binary-tree/
-
https://codebycase.github.io/algorithm/a04-stacks-and-queues.html#buildings-with-an-ocean-view
-
https://codebycase.github.io/algorithm/a05-graphs-trees-heaps.html#lca-with-a-parent-pointer
-
https://codebycase.github.io/algorithm/a05-graphs-trees-heaps.html#word-ladder-ii
-
https://leetcode.com/problems/capacity-to-ship-packages-within-d-days/submissions/
-
https://leetcode.com/discuss/interview-question/718692/facebook-training-balanced-split
-
https://leetcode.com/problems/insert-into-a-sorted-circular-linked-list/solution/
- https://codebycase.github.io/algorithm/a06-sorting-and-searching.html#balanced-split
- https://codebycase.github.io/algorithm/a06-sorting-and-searching.html#k-closest-points-to-origin
- https://www.geeksforgeeks.org/0-1-knapsack-problem-dp-10/
- https://leetcode.com/problems/bulls-and-cows/
- https://leetcode.com/problems/smallest-rectangle-enclosing-black-pixels/
- https://leetcode.com/problems/find-duplicate-subtrees/submissions/
- https://leetcode.com/problems/maximum-points-you-can-obtain-from-cards/
- https://leetcode.com/problems/strange-printer/
- https://leetcode.com/problems/asteroid-collision/submissions/
- https://leetcode.com/problems/car-fleet/
- https://leetcode.com/problems/number-of-matching-subsequences/submissions/ **
- https://leetcode.com/problems/distinct-subsequences-ii/solution/ **
- https://leetcode.com/problems/snapshot-array/
- https://leetcode.com/problems/prefix-and-suffix-search
- https://leetcode.com/problems/longest-string-chain/
- https://leetcode.com/problems/stream-of-characters/ **
- https://leetcode.com/problems/swap-adjacent-in-lr-string/submissions/ -- skip
- https://leetcode.com/problems/minimum-number-of-refueling-stops/submissions/
- canCompleteCircuit car gas station
- https://leetcode.com/problems/student-attendance-record-ii/
- https://leetcode.com/problems/array-of-doubled-pairs/solution/ - skip
- https://leetcode.com/problems/minimum-number-of-flips-to-convert-binary-matrix-to-zero-matrix/
- https://leetcode.com/problems/detect-squares
- https://leetcode.com/problems/shortest-path-in-a-grid-with-obstacles-elimination
- https://leetcode.com/problems/max-value-of-equation/ ??
- https://leetcode.com/problems/minimum-cost-to-make-at-least-one-valid-path-in-a-grid
-
https://codebycase.github.io/algorithm/a02-arrays-and-strings.html#three-sum-equals
-
https://codebycase.github.io/algorithm/a09-recursion-greedy-invariant.html#design-hit-counter
-
https://leetcode.com/problems/maximum-number-of-visible-points/
-
https://leetcode.com/problems/shortest-path-in-a-grid-with-obstacles-elimination
-
https://leetcode.com/problems/minimum-cost-to-make-at-least-one-valid-path-in-a-grid
-
https://leetcode.com/problems/minimum-number-of-flips-to-convert-binary-matrix-to-zero-matrix/
-
https://leetcode.com/problems/minimum-number-of-refueling-stops/
-
https://leetcode.com/problems/number-of-matching-subsequences/ **
-
https://leetcode.com/problems/minimum-number-of-refueling-stops/ (5)
-
https://leetcode.com/problems/maximum-number-of-points-with-cost/
-
https://leetcode.com/problems/remove-all-ones-with-row-and-column-flips/
-
https://leetcode.com/problems/step-by-step-directions-from-a-binary-tree-node-to-another/
-
https://leetcode.com/problems/find-original-array-from-doubled-array/
-
Union Find: https://leetcode.com/problems/find-all-people-with-secret/
-
Find Squares: https://leetcode.com/problems/count-square-submatrices-with-all-ones/
-
Finger Print: https://leetcode.com/problems/strings-differ-by-one-character/
-
Priority Queue: https://leetcode.com/problems/single-threaded-cpu/
-
Tree Map: https://leetcode.com/problems/stock-price-fluctuation/
-
Sliding Window: https://leetcode.com/problems/max-value-of-equation/
-
DFS Matrix: https://leetcode.com/problems/longest-increasing-path-in-a-matrix/
-
Binary Search: https://leetcode.com/problems/split-array-largest-sum/
-
Text Just: https://leetcode.com/problems/sentence-screen-fitting/
-
Bucket: https://leetcode.com/problems/minimum-time-difference/
- https://codebycase.github.io/algorithm/a15-the-honors-question.html#accounts-merge
- https://leetcode.com/problems/accounts-merge/
- https://codebycase.github.io/algorithm/a15-the-honors-question.html#draw-the-skyline
- https://leetcode.com/problems/the-skyline-problem/
- https://leetcode.com/problems/max-increase-to-keep-city-skyline/