LeetCode Problem: 217. Contains Duplicate | Java Solution

Given an integer array nums, return true if any value appears at least twice in the array, and return false if every element is distinct.
leetcode.com/p...
Find the complete playlist of LeetCode Problems
• LeetCode Problem: 709....
---------------------------------------------------------------------------------------------
---------------------------------------------------------------------------------------------
Do checkout other videos
Java Projects Playlist: • 1/12 - Bank Management...
JavaScript Projects Playlist: • JavaScript Projects
React Projects Playlist: • React Projects
MERN Stack Projects Playlist: • MERN Stack Projects
Spring Boot Full Stack Projects: • Full Stack Projects - ...
Next.js Projects Playlist: • Next.js Projects
Follow Us
Instagram: codeforinterview ( / codeforinterview )
Telegram: codeforinterview (t.me/codeforin...)

[@codeforinterview]

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 kzbin.info/www/bejne/mYC1fGOPeriab6M

[@vanshmodi14]

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😃😃.

[@codeforinterview]

🙌🙌

[@anuragsuryawanshi4177]

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

[@codeforinterview]

thankyou so much 🙌

[@anandkumarnitrourkela7404]

Great explaination.Keep uploading more such videos.

[@codeforinterview]

Thank you, I will

[@sanchitsingh6942]

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😀

[@codeforinterview]

thanks for your comment, one thing to note is return will work like a break statement because if the element is found, it will return the function and will not check any further.

[@mansigoyal9664]

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

[@codeforinterview]

Thank you so much 😀

[@akshaykumar192]

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

[@codeforinterview]

I am not sure, I am not able to replicate the same

[@your_anonymous454]

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

[@AnasAnsari-xo8bc]

Bhadia sir Video banate rahiya

[@codeforinterview]

Thank you so much 😀

[@videshpundir34]

Thank you so much..

[@codeforinterview]

You're most welcome

[@suryas8407]

Thank You

[@codeforinterview]

welcome. please find the whole playlist here kzbin.info/www/bejne/mYC1fGOPeriab6M

[@anoopshetty3580]

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