Solution 1 emulate + hash

  • t-complexity $O(n)$

  • s-complexity $O(C)$ C = 10

Previous0299_Bulls_and_CowsNext0300_Longest_Increasing_Subsequence

Last updated