945. Minimum Increment to Make Array Unique | sorting | leetcode daily challenge | DSA | Hindi

Problem Name:
945. Minimum Increment to Make Array Unique
Problem Statement:
You are given an integer array nums. In one move, you can pick an index i where 0 = i nums.length and increment nums[i] by 1.
Return the minimum number of moves to make every value in nums unique.
The test cases are generated so that the answer fits in a 32-bit integer.
Problem link:
leetcode.com/p...
Java Plus DSA Placement Course Playlist:
• Java and DSA Course Pl...
Java Plus DSA Sheet:
docs.google.co...
Notes:
github.com/Tiw...
Telegram Link:
shashwattiwari...
Ultimate Recursion Series Playlist:
• Recursion and Backtrac...
Instagram Handle: (@shashwat_tiwari_st)
shashwattiwari...
Samsung Interview Experience:
• I cracked Samsung | SR...
Company Tags:
Facebook | Amazon | Microsoft | Netflix | Google | LinkedIn | Pega Systems | VMware | Adobe | Samsung
Timestamp:
0:00 - Introduction
#ShashwatTiwari #coding​​ #problemsolving​

[@sankalpbarriar1029]

quality content

[@RohitKumar-dz8dh]

Thanks 😊

[@PiyushSharma-we8yd]

bhaiya aap itna easily sb kuch smjha dete ho, blessing is disguise. Please dsa cousre next playlist release krdijea. I know aap uspr hi work kr rhe hai. But jitna jaldi aaega hmari help ho jaegi. thanks again. Mai completely hooked hu apki playlist se.. 🤩🤩

[@mr.nishantawasthi4402]

Sir java DSA course Main ab kya padhne wale hai please reply 🙏🙏

[@rakesh32]

nums[i] range is 10^5 in this question. Is it a good approach to use count sort in this? i though of same logic but 10^5 threw me off.

[@vishalsuryan1797]

Bhaiya I tried today's question with the help HashMap logic almost same hi tha pr TLE error aa rha tha 🥲 complete logic develop nhi kr pata please give tips

[@rode_atharva]

dhere dhere ho gayega bhai
tension mat le