Bug Report for https://neetcode.io/problems/contains-duplicate-ii
here the problem state that value of k includes 0. for the value of k to be 0 both indices i and j will have to be the same. Then how will one find the duplicates.
A minimum window of 1 (i.e 1<=k<=100000) must be there else the question is wrong.
Bug Report for https://neetcode.io/problems/contains-duplicate-ii
here the problem state that value of k includes 0. for the value of k to be 0 both indices i and j will have to be the same. Then how will one find the duplicates.
A minimum window of 1 (i.e 1<=k<=100000) must be there else the question is wrong.