287. Find the Duplicate Number | Day 013 | 5 Ways | Binary Search | Bit Manipulation | Slow & Fast 

I think the last solution 2 pointer approach will work only if elements are in range of array size -1 For example my array is [67, 56, 67, 70] in this case will get ArrayIndexOutOfBoundException if I'm not wrong

hello aryan. I'm following from a month ago and i really appreciate your work and dedication to help freshers. I have just one request as of now you are focusing on leetcode platform can you make videos for codeforces as well. As right now I'm doing problems on both if i'm facing any problem in leetcode just go for your videos but in case of codeforces it is not that easy. As i like your way of explainig can please make videos on codeforces problem as well keep going full support from our side

in brute force approach, int len = nums.size(); would be correct and nums.length; is giving error !!

Brother, can u tell how can I see the companies like we can see in your which extension is this?