3076. Shortest Uncommon Substring in an Array | Implementation | Time Complexity Analysis

[@ce088rajankumarpatel4]

❤❤❤no one explain like this .thank u...

[@ayaaniqbal3531]

Nice explanation bro😊

[@harshalgarg1676]

Nicely explained

[@PramodKumar-bu2uf]

mene contest mae same logic socha tha but implement nahi ho paya tha😇

[@PramodKumar-bu2uf]

thanks bhaiya ❤

[@jeehub041]

Superbly explained brother. Thanks a lot🙏❤

[@ayanmaity9339]

thank you so much....I tried the code for 2 hours....but didn't get it....very good explanation👍👍❤

[@ChiruBillion]

thanks bhai, video banane ke liye :)

[@fraserdab]

Man I knew brute force but I thought my solution was wrong I never thought about the constraints part

[@KothaChandraTeja-n3i]

Thankyou so much bro😊

[@MATTUPALLINVSGKESAVAKUMARBCE]

if the values of n is more and length of string is more than mentioned in the string . could you please give me approach to solve that ?

[@sudiptadas7455]

Use trie data structure

[@vinsin4619]

during the contest i did solve it i got 631 testcases passed but still no submission due to MLE

[@pranavbagal9988]

I didn't came up with a solution of this during the contest

[@ronakkriplani1838]

class Solution { public: vector shortestSubstrings(vector& arr) { int n = arr.size(); vector ans(n,""); unordered_map mp; for (int k = 0; k < n; k++) { string s = arr[k]; int sz = s.size(); for (int i = 0; i < sz; i++) { for (int j = i; j < sz; j++) { string sub = s.substr(i, j - i + 1); mp[i].insert(sub); } } } // Printing elements of the map for(int k=0;k

[@ronakkriplani1838]

got in i have made mistake in creating substrings ,I have used M[i] but i shoud use M[k[

[@shivamjha7920]

Badiya tha bhai but written code bhi de dete to phle khud se samjhne ki kosis krta phir video bhi dekhta. Although good explanation

[@swapnilwalave1135]

Bro try to provide notes