2451. Odd String Difference | Leetcode BiWeekly 90 | LeetCode 2451

Here in this video we have discussed the approach to solve
2451. Odd String Difference of Leetcode BiWeekly 90

📢📢 Our complete Placement Preparation Series [PPS] :-

After this if you need doubt support join our telegram channel for getting it solved
👇🏻
========================================================================
========================================================================
Link to our other major series:-
========================================================================
Bro Coders leetcode editorial leetcode editorial in hindi leetcode code walkthrough
leetcode solution leetcode best explanation begginer level explanation
Bro Coders leetcode editorial leetcode editorial in hindi leetcode code walkthrough
leetcode solution leetcode best explanation begginer level explanation
Bro Coders leetcode editorial leetcode editorial in hindi leetcode code walkthrough
leetcode solution leetcode best explanation begginer level explanation
Bro Coders leetcode editorial leetcode editorial in hindi leetcode code walkthrough
leetcode solution leetcode best explanation begginer level explanation
Bro Coders leetcode editorial leetcode editorial in hindi leetcode code walkthrough
leetcode solution leetcode best explanation begginer level explanation

2451. Odd String Difference | Leetcode BiWeekly 90 | LeetCode 2451
2451. Odd String Difference | Leetcode BiWeekly 90 | LeetCode 2451
2451. Odd String Difference | Leetcode BiWeekly 90 | LeetCode 2451
2451. Odd String Difference | Leetcode BiWeekly 90 | LeetCode 2451
2451. Odd String Difference | Leetcode BiWeekly 90 | LeetCode 2451
2451. Odd String Difference | Leetcode BiWeekly 90 | LeetCode 2451

2451. Odd String Difference | Leetcode BiWeekly 90 | LeetCode 2451
2451. Odd String Difference | Leetcode BiWeekly 90 | LeetCode 2451
2451. Odd String Difference | Leetcode BiWeekly 90 | LeetCode 2451
2451. Odd String Difference | Leetcode BiWeekly 90 | LeetCode 2451
2451. Odd String Difference | Leetcode BiWeekly 90 | LeetCode 2451
2451. Odd String Difference | Leetcode BiWeekly 90 | LeetCode 2451

2451. Odd String Difference | Leetcode BiWeekly 90 | LeetCode 2451
2451. Odd String Difference | Leetcode BiWeekly 90 | LeetCode 2451
2451. Odd String Difference | Leetcode BiWeekly 90 | LeetCode 2451
2451. Odd String Difference | Leetcode BiWeekly 90 | LeetCode 2451
2451. Odd String Difference | Leetcode BiWeekly 90 | LeetCode 2451
2451. Odd String Difference | Leetcode BiWeekly 90 | LeetCode 2451

2451. Odd String Difference | Leetcode BiWeekly 90 | LeetCode 2451
2451. Odd String Difference | Leetcode BiWeekly 90 | LeetCode 2451
2451. Odd String Difference | Leetcode BiWeekly 90 | LeetCode 2451
2451. Odd String Difference | Leetcode BiWeekly 90 | LeetCode 2451
2451. Odd String Difference | Leetcode BiWeekly 90 | LeetCode 2451
2451. Odd String Difference | Leetcode BiWeekly 90 | LeetCode 2451

2451. Odd String Difference | Leetcode BiWeekly 90 | LeetCode 2451
2451. Odd String Difference | Leetcode BiWeekly 90 | LeetCode 2451
2451. Odd String Difference | Leetcode BiWeekly 90 | LeetCode 2451
2451. Odd String Difference | Leetcode BiWeekly 90 | LeetCode 2451
2451. Odd String Difference | Leetcode BiWeekly 90 | LeetCode 2451
2451. Odd String Difference | Leetcode BiWeekly 90 | LeetCode 2451

2451. Odd String Difference | Leetcode BiWeekly 90 | LeetCode 2451
2451. Odd String Difference | Leetcode BiWeekly 90 | LeetCode 2451
2451. Odd String Difference | Leetcode BiWeekly 90 | LeetCode 2451
2451. Odd String Difference | Leetcode BiWeekly 90 | LeetCode 2451
2451. Odd String Difference | Leetcode BiWeekly 90 | LeetCode 2451

[victorfrankenstein]

Mene maps use kiya tha usse bhi ho gya :)

string oddString(vector<string>& words) {
unordered_map<string, pair<string, int>> mp;
for (string it : words)
{
int n = it.size();
string temp = "";
for (int i=1; i<n; i++)
temp += to_string(it[i] - it[i-1]);
mp[temp] = make_pair(it, mp[temp].second+1);
}
int mini = INT_MAX;
string ans;
for (auto it : mp)
{
if (it.second.second<mini)
ans = it.second.first, mini = it.second.second;
}
return ans;
}

[pritishpattnaik]

My approach by maps, 2nd one was easier than this
string oddString(vector<string>& words) {
int ctr = 0;
map<char, int> mp1;
for (char c='a' ; c<='z' ; c++){
mp1[c] = ctr;
ctr++;
}

map<vector<int>, string> mp2;
vector<vector<int>> arr;
for (auto x : words){
string w = x;
vector<int> v;
for (int i=1 ; i<w.size() ; i++){
int diff = mp1[w[i]] - mp1[w[i-1]];
v.push_back(diff);
}
mp2.insert({v, w});
arr.push_back(v);
}

string ans;
map<vector<int>, int> mp3;
for (auto x : arr){
mp3[x]++;
}
for (auto it : mp3){
if (it.second == 1){
ans = mp2[it.first];
}
}
return ans;
}