Use topology sort to find the node(s) residing at center area.
A divergence of trie. While some solution uses Trienode, it may be too slow and a simple dictionary could work.
Description
Require a very special algo. In place modification makes it more difficult. A good practice for moving pointer…
Stack is used to address LIFO problems while queue for FIFO problems. The concept of data structure is…
Problems of greedy algorithm are usually intuitively challenging. For this one, the high level concept is “while already able to jump (global), stay behind the accessible point and seek greedier choice (local)”.
Decode parentheses from string → stack. This one is more complicated as variables in and out need computation of just the right sequence.
Given an encoded string, return its decoded string.
An extension of Combination Sum. The point is when and how to prun.
Run a flask app on gcp, set the firewall rule, so the app shall be accessed.
These were the top 10 stories published by Coding Memo; you can also dive into yearly archives: 2022, 2023.