Register for free in Coding Contest: bit.ly/RV_CodeRushX Let's march ahead, and create an unmatchable DSA course! ❤ Can someone please add timestamps, I will add them post it.
0:00 Introduction 2:01 Why Hashing ? 10:43 Problem 1 - Count elements of array 14:00 Problem 1 - Code 18:06 Maximum hash Array size (Main Vs Global) 22:06 Character Hashing & Problem - 2 30:16 Problem - 2 Code 33:52 Map / Hash Map 38:39 Problem - 1 Code by map 42:03 Problem - 2 Code by map 43:00 Time Complexity (map), unordered_map 47:00 Hashing Methods 54:30 Collision 58:30 Homework 59:56 Outro As always, Your content is full of Important & Valuable stuff. Thank you very much!!
#Free Education For All... # Bhishma Pitamah of DSA...You could have earned in lacs by putting it as paid couses on udamey or any other elaerning portals, but you decided to make it free...it requires a greate sacrifice and a feeling of giving back to community, there might be very few peope in world who does this..."विद्या का दान ही सर्वोत्तम दान होता है" Hats Off to you man, Salute from 10+ yrs exp guy from BLR, India......
Oh My God!!!!!!!!! Even after knowing Hashing came here...because I was very sure...Striver's video will definitely have something valuable. You are truly a Gem Striver. Always grateful to you🙇♀
If i had teacher like him in my college I wouldn't have watched TH-cam channel before day of exam... The way he teach and make us understand concept...hatsoff sir Also thank u for free DSA course🙏🙏
Understood..I had a college coding test yesterday, and I managed to solve 2 out of 3 questions just by following this amazing playlist up to the Hashing section. Thank you so much, bhaiyya! Your videos are a lifesaver!
#Free Education For All...... # Bhishma Pitamah of DSA...You could have earned in lacs by putting it as paid couses on udamey or any other elaerning portals, but you decided to make it free...it requires a greate sacrifice and a feeling of giving back to community, there might be very few peope in world who does this...."विद्या का दान ही सर्वोत्तम दान होता है" Hats Off to you man, Salute from 10+ yrs exp guy from BLR, India.
00:06 Hashing is an important topic in DS algo 05:31 Hashing is a technique to store and fetch data in a faster way. 11:30 Pre-compute the number of occurrences for each element in the array. 17:23 Arrays can be used for number hashing and character hashing. 22:55 You can count the occurrence of a specific character in a string by iterating through the string and comparing each character. 28:46 Hashing characters in a string using an array 34:15 Map and unordered map in C++ 39:58 Map in C++ can be used to store and access data efficiently 45:38 The number of elements in the map affects the computation time. 51:20 The division method is used to retrieve values and trim numbers. 56:45 Collision handling in unordered map
I wanted to learn DSA in java from beginning but wherever I search i am getting DSA with c++ only i don't know c++ . please 🙏 recommend me a channel as good as tuf so that I can learn my complete DSA from Beginning... Please didi help..
@@shahisthatahniyath379bruhh if u know logic u must do in your lang, and if u cant do so then u have not learning java or any coding lang in correct way u r just looking at the. Ode and typing or memorizing
In glaobl and main(), max size decleration concept in array is very helpful and In another conceptual question also. Your best thing in every tutorial i liked so much is you taught us question from BFS approach to Optimised approach and by different method you solved question and also taught us the preferable method accoding to it's space and time complexity. Topic covered:- -> For loop method (BFS) -> Array hashing (Optimised) -> Number hashing -> Character hashing (2 method) -> Maximum size concept in decleration of array size. -> TC difference by using in map and unordered_map STL (normally Unordered_map way is prefered by you) -> Method of Hashing -> Explain Division method - linear chaining concept -> Collision (that's why why worst case TC is O(n) by using unordered_map STL) -> Key-Pair data structure and data type decleration difference in map & in unordered_map Thankyou Striver for such an amazing content. 🔥🔥
Hashing using Map in java : public static void main(String[] args) { Scanner cin = new Scanner(System.in); System.out.print("Enter the value of n : "); int n = cin.nextInt(); int arr[] = new int[n]; System.out.print("Enter values of array : "); for (int i=0;i
28:41(ch-'a'), 31:58(If there were not any restriction on character, then u should take hash[256], i.e. array for all characters),37:28(advantage of HashMap compared to Hashing)
summarize this video00:06 Hashing is an important topic in DS algo 05:31 Hashing is a technique to store and fetch data in a faster way. 11:30 Pre-compute the number of occurrences for each element in the array. 17:23 Arrays can be used for number hashing and character hashing. 22:55 You can count the occurrence of a specific character in a string by iterating through the string and comparing each character. 28:46 Hashing characters in a string using an array 34:15 Map and unordered map in C++ 39:58 Map in C++ can be used to store and access data efficiently 45:38 The number of elements in the map affects the computation time. 51:20 The division method is used to retrieve values and trim numbers. 56:45 Collision handling in unordered map
I was recommended by a friend to watch this playlist. And it is extremely helpful and amazing. Thank you so much sir for providing such a great quality of content.
Your command of English is commendable. You speak so clearly and do not even use fillers. Please tell me how and from where did you practice English speaking? please guide me so that I can also improve my english.
Wow, just stumbled upon this video and I can't believe what I've been missing out on! I used to be intimidated by DSA, especially topics like hashing, but your mind-blowing explanation has changed everything for me. I regret not starting earlier, but hey, better late than never. Your teaching style is nothing short of incredible - it's like having a god-like figure guiding me through the complexities of DSA right on my screen. Thank you, sir, for making this seemingly daunting task so much more approachable. Love you for this, and I'm excited to dive deeper into the world of algorithms now!
You are a great teacher, and I want to be like you, and teach others who were in need, I am learning topics In a way to teach others, so that my concepts are also getting revised, simply using Feynmann technique and I am huge fans of your Brother, Thanks a lot from my heart. I can promise you, you can hear my name like you in upcoming months or years, but sure you will.
I tried to learn hashing /hash map 2-3 times from different channel but didn't able to understood so I keep on skipping this topic everytime but this is the first time that I am able to understand it in very easy way
The hashing division method is a commonly used technique for generating hash codes in hash tables. It involves using the remainder of the division operation to calculate the hash value. Hash Function: The hash function takes the key as input and generates a hash code or hash value. The goal is to distribute the keys uniformly across the available hash table buckets. Division Operation: In the hashing division method, the hash function uses the division operation to calculate the hash value. The key is divided by a prime number, typically chosen as a suitable size for the hash table (e.g., the number of buckets). The remainder of the division operation (modulo operation) is taken as the hash value. Hash Value: The resulting hash value is an integer that represents the index of the bucket where the key-value pair will be stored in the hash table. The hash value should be within the range of valid bucket indices. Here's a simplified example in C++ to demonstrate the hashing division method: unsigned int HashFunction(const std::string& key, unsigned int tableSize) { unsigned int hashValue = 0; for (char ch : key) { hashValue = hashValue * 31 + ch; // 31 is a commonly used prime number } return hashValue % tableSize; } In this example, the HashFunction takes a string key and the size of the hash table as input. It iterates over each character in the key and calculates the hash value using the division method. The constant prime number 31 is used to multiply the intermediate hash value. It's important to choose a prime number as the divisor in the division operation to minimize clustering and distribute the keys more uniformly across the buckets. The choice of the divisor depends on various factors, such as the expected size of the hash table and the characteristics of the input data.
If someone is getting : the value of variable "size" cannot be used as a constant while trying, int arr[size] : not all c++ compilers support dynamic array in this way. you can use --> new int[size]();
The explanation you gave in collision and worst case scenario was so good and it was brilliant. Thankyou so much for making this playlist. It means alot to me and other people following this playlist.!!
bro your videos are the best I think I ever watched. U explain so well that I understand everything much better. Wish I had you as my professor for all my CS classes
Understood everything very well❤❤❤❤❤❤ and even learned so many new things by you. Thankyou so much bhaiya❤❤❤❤ I would recommend everybody to have this sheet for better understanding of DSA and even things which might anybody will tell you for FREEE!!!!!!
Bhaiya iss beech me maine pura recursion padh liya .Awesome series ... And Bhaiya please thoda frequencyy badha do.I know it's not easy to manage . But if possible please do so....Thank you
If we do chaining like linked list also,insertion and deletion in linked list can be done in O(1) to make the array sorted.And binary search is O(logn).So how come it becones O(N) for storing and fetching in worst case.Most probably I guess there is more complex things happening internally 👽. Edit:- Binary search in linked list can't be done in O(logn)🙃
The last portion, especially collision and linear chaining portion is not very clear to me. Otherwise good content. Keep it up and pls post the other videos sooner.. Cheers!!
Hi Striver, Few points regarding the current lecture: - I believe for Java HashMap is an Unordered data Structures with O(1) avg TC and O(N) for worse TC - TreeMap is an Ordered data structures with O(log(N)) TC for good, avg and worse case scenario. - Please correct me if i'm wrong but here we should implement TreeMap in this code for JAVA instead of HashMap
32:16 When s[i] is used as an index in an integer array like hash, C++ automatically converts the character 'a' to its ASCII numeric value 97. This is known as implicit type casting or promotion.
@@srijanmishra5379The hash array is initialised with 0, so all the values inside it are zero, suppose the value of i is 'a', which means hash[s[i]]++ will be hash[97]++, the value at index 97 increases by 1 because it contains one 'a'. Now if we want to know the count of char 'a', we can iterate through the hash array.
I wanted to learn DSA in java, i don't know c++ .but whenever I search DSA using java I am getting DSA using c++ . please 🙏 recommend me a channel like tuf so that I can learn DSA in java from very beginning level....
I just came here because on hacker earth i got a problem with title favourite singer and it need hashing i used the first simple numerical array methos and it wokred partially, because the code on hackdr earth requires more nos like as striver said the array method can take upto 10 rais to 6 in main. Thing is i am writing this along with the numerical i got many in depth learning about the concept. I think i saw one of the best teacher
Register for free in Coding Contest: bit.ly/RV_CodeRushX
Let's march ahead, and create an unmatchable DSA course! ❤
Can someone please add timestamps, I will add them post it.
Striver, please teach fast, sliding window algorithm and other stuff are incomplete. pls striver be fast little bit in uploading video
0:00 Introduction
2:01 Why Hashing ?
10:43 Problem 1 - Count elements of array
14:00 Problem 1 - Code
18:06 Maximum hash Array size (Main Vs Global)
22:06 Character Hashing & Problem - 2
30:16 Problem - 2 Code
33:52 Map / Hash Map
38:39 Problem - 1 Code by map
42:03 Problem - 2 Code by map
43:00 Time Complexity (map), unordered_map
47:00 Hashing Methods
54:30 Collision
58:30 Homework
59:56 Outro
As always, Your content is full of Important & Valuable stuff.
Thank you very much!!
striver be fast. we have to complete this atoz course as early as possible you are too late to upload
UNDERSTOOD_BHIYA :)
Could you make a video on implementation of hash table as well as it was asked in Sprinklr interview in intern in our college.
This DSA playlist will be appreciated for hundreds of years.❤
I feel like within 20 years from now striver will make another series that works on quantum computers and that will live for 100 years.
@@SamrathChauhan-re3jb bhai tum dono theek ho faaltu ki tareef se accha hai ke jaake padhai karo
@@ahuman9964 ok bhide sir :)
#Free Education For All... # Bhishma Pitamah of DSA...You could have earned in lacs by putting it as paid couses on udamey or any other elaerning portals, but you decided to make it free...it requires a greate sacrifice and a feeling of giving back to community, there might be very few peope in world who does this..."विद्या का दान ही सर्वोत्तम दान होता है" Hats Off to you man, Salute from 10+ yrs exp guy from BLR, India......
Oh My God!!!!!!!!!
Even after knowing Hashing came here...because I was very sure...Striver's video will definitely have something valuable. You are truly a Gem Striver. Always grateful to you🙇♀
If i had teacher like him in my college I wouldn't have watched TH-cam channel before day of exam... The way he teach and make us understand concept...hatsoff sir Also thank u for free DSA course🙏🙏
🤣🤣🤣🤣🤣
Understood..I had a college coding test yesterday, and I managed to solve 2 out of 3 questions just by following this amazing playlist up to the Hashing section. Thank you so much, bhaiyya! Your videos are a lifesaver!
#Free Education For All...... # Bhishma Pitamah of DSA...You could have earned in lacs by putting it as paid couses on udamey or any other elaerning portals, but you decided to make it free...it requires a greate sacrifice and a feeling of giving back to community, there might be very few peope in world who does this...."विद्या का दान ही सर्वोत्तम दान होता है" Hats Off to you man, Salute from 10+ yrs exp guy from BLR, India.
00:06 Hashing is an important topic in DS algo
05:31 Hashing is a technique to store and fetch data in a faster way.
11:30 Pre-compute the number of occurrences for each element in the array.
17:23 Arrays can be used for number hashing and character hashing.
22:55 You can count the occurrence of a specific character in a string by iterating through the string and comparing each character.
28:46 Hashing characters in a string using an array
34:15 Map and unordered map in C++
39:58 Map in C++ can be used to store and access data efficiently
45:38 The number of elements in the map affects the computation time.
51:20 The division method is used to retrieve values and trim numbers.
56:45 Collision handling in unordered map
I wanted to learn DSA in java from beginning but wherever I search i am getting DSA with c++ only i don't know c++ . please 🙏 recommend me a channel as good as tuf so that I can learn my complete DSA from Beginning... Please didi help..
@@shahisthatahniyath379 code with harry cpp playlist and strivers a-z dsa playlist, that should be enough
@@shahisthatahniyath379bruhh if u know logic u must do in your lang, and if u cant do so then u have not learning java or any coding lang in correct way u r just looking at the. Ode and typing or memorizing
In glaobl and main(), max size decleration concept in array is very helpful and In another conceptual question also. Your best thing in every tutorial i liked so much is you taught us question from BFS approach to Optimised approach and by different method you solved question and also taught us the preferable method accoding to it's space and time complexity.
Topic covered:-
-> For loop method (BFS)
-> Array hashing (Optimised)
-> Number hashing
-> Character hashing (2 method)
-> Maximum size concept in decleration of array size.
-> TC difference by using in map and unordered_map STL (normally Unordered_map way is prefered by you)
-> Method of Hashing
-> Explain Division method - linear chaining concept
-> Collision (that's why why worst case TC is O(n) by using unordered_map STL)
-> Key-Pair data structure and data type decleration difference in map & in unordered_map
Thankyou Striver for such an amazing content. 🔥🔥
bhai lekin ye concept java ma to apply nhi hota h na? kyuki mene dekha ma 2^31 - 1 size ka bhi declare kr paa rha hu
I domt get why you wasted time in writing this dude
@@vaibhavagarwal602 it will be a nice revision for him
Hashing using Map in java :
public static void main(String[] args) {
Scanner cin = new Scanner(System.in);
System.out.print("Enter the value of n : ");
int n = cin.nextInt();
int arr[] = new int[n];
System.out.print("Enter values of array : ");
for (int i=0;i
28:41(ch-'a'), 31:58(If there were not any restriction on character, then u should take hash[256], i.e. array for all characters),37:28(advantage of HashMap compared to Hashing)
Understood! I have watched many videos to understand hash and map, but this is the best among all of them.
Truly a gem! I wish i came across this playlist 6 months ago.
summarize this video00:06 Hashing is an important topic in DS algo
05:31 Hashing is a technique to store and fetch data in a faster way.
11:30 Pre-compute the number of occurrences for each element in the array.
17:23 Arrays can be used for number hashing and character hashing.
22:55 You can count the occurrence of a specific character in a string by iterating through the string and comparing each character.
28:46 Hashing characters in a string using an array
34:15 Map and unordered map in C++
39:58 Map in C++ can be used to store and access data efficiently
45:38 The number of elements in the map affects the computation time.
51:20 The division method is used to retrieve values and trim numbers.
56:45 Collision handling in unordered map
He's the best by a very big margin when it comes to teaching DSA concepts.♥
I was recommended by a friend to watch this playlist. And it is extremely helpful and amazing. Thank you so much sir for providing such a great quality of content.
Your command of English is commendable. You speak so clearly and do not even use fillers. Please tell me how and from where did you practice English speaking? please guide me so that I can also improve my english.
read good English novels
Wow, just stumbled upon this video and I can't believe what I've been missing out on! I used to be intimidated by DSA, especially topics like hashing, but your mind-blowing explanation has changed everything for me. I regret not starting earlier, but hey, better late than never. Your teaching style is nothing short of incredible - it's like having a god-like figure guiding me through the complexities of DSA right on my screen. Thank you, sir, for making this seemingly daunting task so much more approachable. Love you for this, and I'm excited to dive deeper into the world of algorithms now!
this course is better than any paid course 100 percent agree
You are a great teacher, and I want to be like you, and teach others who were in need, I am learning topics In a way to teach others, so that my concepts are also getting revised, simply using Feynmann technique and I am huge fans of your Brother, Thanks a lot from my heart. I can promise you, you can hear my name like you in upcoming months or years, but sure you will.
I tried to learn hashing /hash map 2-3 times from different channel but didn't able to understood so I keep on skipping this topic everytime but this is the first time that I am able to understand it in very easy way
Time invested here!!
seriously i came here and it makes my concepts crystal clear!!
Understood, brilliant explanation, and for the person who has written the article on the site too also brilliant, thank you so much.
This course is better than paid courses , just amazing content..
The hashing division method is a commonly used technique for generating hash codes in hash tables. It involves using the remainder of the division operation to calculate the hash value.
Hash Function:
The hash function takes the key as input and generates a hash code or hash value.
The goal is to distribute the keys uniformly across the available hash table buckets.
Division Operation:
In the hashing division method, the hash function uses the division operation to calculate the hash value.
The key is divided by a prime number, typically chosen as a suitable size for the hash table (e.g., the number of buckets).
The remainder of the division operation (modulo operation) is taken as the hash value.
Hash Value:
The resulting hash value is an integer that represents the index of the bucket where the key-value pair will be stored in the hash table.
The hash value should be within the range of valid bucket indices.
Here's a simplified example in C++ to demonstrate the hashing division method:
unsigned int HashFunction(const std::string& key, unsigned int tableSize) {
unsigned int hashValue = 0;
for (char ch : key) {
hashValue = hashValue * 31 + ch; // 31 is a commonly used prime number
}
return hashValue % tableSize;
}
In this example, the HashFunction takes a string key and the size of the hash table as input. It iterates over each character in the key and calculates the hash value using the division method. The constant prime number 31 is used to multiply the intermediate hash value.
It's important to choose a prime number as the divisor in the division operation to minimize clustering and distribute the keys more uniformly across the buckets. The choice of the divisor depends on various factors, such as the expected size of the hash table and the characteristics of the input data.
Amazing content you are making DSA like a interesting web series .... Thanks alot brother ... Please make more contents
If someone is getting : the value of variable "size" cannot be used as a constant while trying, int arr[size] : not all c++ compilers support dynamic array in this way.
you can use --> new int[size]();
Understood!!! thank you and I'm really grateful I found you
23:11
For Python users
name = ""
def count_char(s,target):
char_dict = {}
for char in s:
char_dict[char] = char_dict.get(char,0) + 1
return char_dict[target]
better use defaultdict right?, dict will throw key error if accessing element that doesnt exist
Thank you Striver for providing such high quality intuition building concept. Very much grateful to you !
Revolution for the students , ham senior ho gye , kaash hamare time pe aapne ye start kiya hota 🥺🥺🥺🥺
Bhai Mera to abhi 1st year khtm hua hai
Striver op !
A person making impact on many people life!!! understood
i have to no words to appreciate your course... #bestAmongAllPaidResources
Understood..You put everything to make it clear..
at 20:22, in java I could declare the array with 10 power 8 i.e. (100000000) and it gave me heap space error at 10 power 9, inside the method.
The explanation you gave in collision and worst case scenario was so good and it was brilliant. Thankyou so much for making this playlist. It means alot to me and other people following this playlist.!!
Waiting for it after watching pattern printing and math video 😄🤓
This DSA course will be appreciated for decades. Thankyou ❤
Google I am Coming
Lay off kardegi mat Jaa
@@anuraggoswami3534 😂
Bulati hai magar jaane ka nhi
Layoff krri badi company
TCS, I am coming.
58:00 in java we can use complex class as key provided we overwrite the hashcode and equals method.
Understood ! Amazing content as always ! Please keep it going.
bro your videos are the best I think I ever watched. U explain so well that I understand everything much better. Wish I had you as my professor for all my CS classes
Thanks, striver_79, ur high class lectures of DP helps me a lot.
Sir one request please add your websit graph and dp rest note . It is very useful for me.
@@learncreative4732 Done
@@takeUforward thanks
Understood in a very clear manner.
The best structured DSA playlist
Understood everything very well❤❤❤❤❤❤ and even learned so many new things by you. Thankyou so much bhaiya❤❤❤❤
I would recommend everybody to have this sheet for better understanding of DSA and even things which might anybody will tell you for FREEE!!!!!!
Specifically came to TH-cam after watching the embedded video to hit the like button greatly appreciate your efforts :)
Hands off to your efforts🙌🙌
best teacher i have seen... the way u teach amazing
Amazing lecture 😍
Understood... thanks for this amazing video
Bhaiya iss beech me maine pura recursion padh liya .Awesome series ... And Bhaiya please thoda frequencyy badha do.I know it's not easy to manage . But if possible please do so....Thank you
Understood ! Amazing Content! Best Explanation Ever!
Understood! Super fantastic explanation as always, thank you very much!!
your teaching is awesome
Code for homework :
#include
using namespace std;
int main() {
int a[] = {1,2,1,2,3,4,3,1};
unordered_map < int, int > mpp;
for (int i = 0; i < 8; i++) {
mpp[a[i]]++;
}
int maxFreq = INT_MIN;
int minFreq = INT_MAX;
int maxEle = -1, minEle = -1;
for (auto & e: mpp) {
if (e.second > maxFreq) {
maxEle = e.first;
maxFreq = e.second;
}
if (e.second < minFreq) {
minEle = e.first;
minFreq = e.second;
}
}
cout
can u explain why u have initialized the max and min elements to be -1 ??
@@chandanbharti5207 based on the elements in the array he also can take int min and int max
Understood !
Excellent teaching.
bro ur teaching method is like concept of recursion .its best and i understood everything
Google i am not coming 😢
im doing dsa in typescript without a problem all thanks to you striver my man
I like that "25 or 26" confused look 😂😂😂
superb striver ... Understood it very well
If we do chaining like linked list also,insertion and deletion in linked list can be done in O(1) to make the array sorted.And binary search is O(logn).So how come it becones O(N) for storing and fetching in worst case.Most probably I guess there is more complex things happening internally 👽.
Edit:- Binary search in linked list can't be done in O(logn)🙃
Agree we cant use binary search on singly linked list.... something more complex things is happening.
very nice video understood whole concept of hashing in one go at 1.5 speed
😇
The last portion, especially collision and linear chaining portion is not very clear to me. Otherwise good content. Keep it up and pls post the other videos sooner.. Cheers!!
Understood! you are such a fantastic teacher.
Hi Striver,
Few points regarding the current lecture:
- I believe for Java HashMap is an Unordered data Structures with O(1) avg TC and O(N) for worse TC
- TreeMap is an Ordered data structures with O(log(N)) TC for good, avg and worse case scenario.
- Please correct me if i'm wrong but here we should implement TreeMap in this code for JAVA instead of HashMap
understood. best channel for dsa.
#include
Using namespace std;
int main(){
int n;
cin>>n;
int a[n];
for(int i=0;i>a[i];
Unordered _mapm;
for (int i=0;i
UNDERSTOOD.........Thank You So Much for this wonderful video.................🙏🏻🙏🏻🙏🏻🙏🏻🙏🏻🙏🏻
AMAZING MAN THANKS FOR EVERYHTING!
32:16 When s[i] is used as an index in an integer array like hash, C++ automatically converts the character 'a' to its ASCII numeric value 97. This is known as implicit type casting or promotion.
Bro can you plzz explain why at line 11 he put ++ after 'a'?
@@srijanmishra5379The hash array is initialised with 0, so all the values inside it are zero, suppose the value of i is 'a', which means hash[s[i]]++ will be hash[97]++, the value at index 97 increases by 1 because it contains one 'a'. Now if we want to know the count of char 'a', we can iterate through the hash array.
@@Narendra03kThanks a lot brother ❤️
Understood everything of this lecture!🤟
Completely undestood bro thanks❤
understood....Thank you Striver for your great effort....Love from Bangladesh💗💗
What a wonderful manner you have explained hashing, hats off to you!👏👏
I wanted to learn DSA in java, i don't know c++ .but whenever I search DSA using java I am getting DSA using c++ . please 🙏 recommend me a channel like tuf so that I can learn DSA in java from very beginning level....
Understood. Thanks for the awesome tutorials 😄
just wowwww!!! well explained finally smjh agya :)
Understood bhaiya , thanks for this course!!
hashing letsgo amazingly explained!
Although I'm doing DSA with JAVA. From starting to this video, I can say that this is the best DSA channel till yet I've seen on the internet.
Best explanation, thankyou so much. I was struggling with understanding this so much & now its so clear and seems doable.
AMazing content striver you are like a big brother to me 😇😇😇😇
Understood... You are just amazing broo 💯💯
I just came here because on hacker earth i got a problem with title favourite singer and it need hashing i used the first simple numerical array methos and it wokred partially, because the code on hackdr earth requires more nos like as striver said the array method can take upto 10 rais to 6 in main.
Thing is i am writing this along with the numerical i got many in depth learning about the concept. I think i saw one of the best teacher
Thank you so much striver...I understood everything🙂
Ek hi dil hai kitni baar jeetoge bhaiya..@striver
understood everything explained wonderfully
it is little bit confusing in the code section because i code in java otherwise the concept is crystal clear. Thank You Striverr...
PERFECTLY AND CLEARLY UNDERSTOOD!
best teacher onboard!💯💯💯
really really appreciate you man! UNDERSTOOD!
Fantastic course Striver!
understood everything, thank you sir.
Understand brother .... thankyou so much striver ❤❤❤❤❤❤❤❤....
Awesome teaching style 👏🏼
UNDERSTOOD ❤ FROM NIT SILCHAR...
28:16 mind blowing ❤
understood everything bhiaya thanku so much for this lecture
Wish you many many happy returns of the day bhaiyya
Understood !, Thank You :)
Understood.
Thanks for such great stuff.