Tony ZhangLeetCode — 1611. Minimum One Bit Operations to Make Integers ZeroThis is a hard one. The problem statement is not quite verbose but there are tons of interesting shenanigans for you to discover — let’s…Oct 7, 2020Oct 7, 2020
Tony ZhangCracking Algorithmic Problems Step-by-StepNo matter for what the purpose you work on algorithm problems — for coding interviews of big name companies like Google or Facebook, for…Sep 30, 2020Sep 30, 2020
Tony ZhangLeetCode — 1579. Remove Max Number of Edges to Keep Graph Fully Traversablehttps://leetcode.com/problems/remove-max-number-of-edges-to-keep-graph-fully-traversable/Sep 30, 2020Sep 30, 2020
Tony ZhangLeetCode — 1. Two SumAre you ready to take the very first algorithm problem to digest? Let’s get started…Sep 30, 2020Sep 30, 2020