LeetCode Problem: 217. Contains Duplicate | Java Solution 

There is a slight mistake in Brute Force Approach in the video, Please refer below solution for (int i = 0 ; i < nums.length - 1; i++) { // It should go till second last element for (int j = i + 1; j < nums.length ; j++ ) { // We should check the condition with j and increment j, not i if (nums[i] == nums[j]) { return true; } } } return false; If you have a better solution, do comment. and check out the whole playlist of Leetcode questions ru-vid.com/video/%D0%B2%D0%B8%D0%B4%D0%B5%D0%BE-cORK0YESg9A.html

After knowing the mistake in the video than correcting it in comment box is very rare not everyone do that, we need teachers like you😃😃.

Sir, you are amazing I recently started learning DSA in java and for this question I couldn't think beyond brute-force solution, but you explained every solution in a very simplistic manner Please keep making such amazing lectures

Great explaination.Keep uploading more such videos.

Great explaination sir, you are always the besttt. Big fan of you sirrrrrrr👏👏💯💯

sir can we use this sort method directly in interview as well?

Bhaiya agr hume element mil jaye toh return true krke break lga do hume aage again check krne ki zaroorat nhi hai. Thankyou for this .Please Never stop this leetcode series😀

arrays.sort(nums) karne par undeclared identifier kyu bata raha hai ?

Bhadia sir Video banate rahiya

Thank you so much..

Thank You

let mySet = new Set(nums) let bool = false if(nums.length!=mySet.size) { bool=true } return bool }; how is my code