Login
From:
WaspDev
(Uncensored)
subscribe
Leetcode Pens and Pencils problem in O(log(min(cost1,cost2,total))) time | WaspDev
https://waspdev.com/articles/2025-03-27/leetcode-pens-and-pencils-in-logarithmical-time
links
backlinks
Tagged with:
c++
leetcode
logarithm
algorithmic complexity
euclidean algorithm
pens and pencils
A clever logarithmical solution for Leetcode Pens and Pencils problem
Roast topics
Find topics
Find it!
