LeetCode 1207 Solution in Hindi | Leetcode Unique Number of Occurrences

🔴 Video summary

🔴 Timestamps
Intro 0:00

[tanvishinde]

Hi Sir! a better approach // Time Complexity : O(n)
// Space Complexity : O(n)
public boolean uniqueOccurrences(int[] arr) {
Map<Integer, Integer> map = new HashMap<>();

for(int i : arr){
map.put( i, map.getOrDefault(i, 0)+1);
}
return map.keySet().size() == new
}

[jameelahmed]

runtimes become better if we use hashmap

[sonamsoni]

sir please help why this code give error
class Solution {
public:
bool arr) {
//
int num1[] = new int [2001];

for ( int i: arr){
num1[i+1000]++;
}

Array.sort(num1);
//
for( int i=0 ;i<2000;i++){

if( num1[i]!=0 && num1[i]==num1[i+1]){
return false;
}
}
return true;
}
};

error is in Line 5: Char 14: error: array initializer must be an initializer list
5 | int num1[] = new int [2001];
| ^

[Aparichigft]

Explanation is good but that voice modulation is very very irritating so pls don't do that