Articles in this series
Task description link Solution Using Set(), figure out the array A has an 1)duplicated or 2)missing element. import Foundation import Glibc public...
Task description Notice : if frog is never able to jump to the other side of the river, return -1 Solution In my solution, I used path array to...
Task description Notice : N is an integer within the range 2 ~ 100,000 (Time complexity should not be O(N^2)) Solution I tried several times and...
Task description Notice : N is an integer within the range 0 ~ 100,000 Solution Using a dictionary, the time complexity is O(N) . After...
Task description Notice: X, Y and D are integers within the range [1..1,000,000,000] Solution At first, I used a while loop to solve this problem,...
Task description Notice : Write an efficient algorithm O(N), O(NlogN) Solution First, since the length of array A can be up to 1,000,000, I use a...