Here I would be sharing the code I wrote for the problems posted on LeetCode.
Most problems took time for me to write the working code & optimize that. So I am giving some of those here as I solve Hard/Medium/Easy problems on LeetCode. I think, like me, many people would be able to understand the problems & come up with possible solution quickly, but during implementation are lost in the middle. So check the code given here & get the idea & write your own code your own way...Cheers!
238. Product of Array Except Self(Medium)
442. Find All Duplicates in an Array(Medium)
262. Trips and Users(Hard)
1250. Check If It Is a Good Array(Hard)
239. Sliding Window Maximum(Hard)
965. Univalued Binary Tree(Easy)