Nice try, Clément :) I was wondering by the way. I see that you also do mock interviews with some people for your channel. Do they sign up somewhere or something?
I wonder if people still want to be smart and learn to code. This video only has 22K view, even after a whole day. Compare that to Ashnikko _stupid_ video getting 60M views out of 2M subscribers. Is being stupid really popular these days?
Hey Clement! If you ever read this, I just wanted to let you know how much your videos have helped me!. As a high school student, I legit didnt know anything up until like a year back. I plan on buying algoexpert next year and finish it before my high school grad. Thank you again!
1. Logarithm 2. Graph Traversal a. Depth First Search (DFS) b. Breadth-first search (BFS) 3. Binary Search 4. Sliding Window Technique 5. Recursion a. Nth Fib 6. Invert binary tree & reversing LinkedList 7. Suffix Trees (advanced) 8. Heaps a. Min heaps b. Max heaps 9. Dynamic Programming 10. Sorting Algorithms a. Quick Sort b. Merge Sort
You've made me feel highly unprepared for my Google front end software engineer interview tomorrow. I don't know like 90% of this stuff. I went through their google tech guide, watched all their data structures videos and did a couple of their problems. The stuff is going to take me a long time to learn...What sucks is, I have a bachelors degree and 6 years of experience. I'm able to solve 99% of the problems i've encountered in my day to day job. I just never had a use for learning these more advanced topics.
Really liked the "I won't teach you, I will just let you know that these things exist". For self taught programmers this is one of the best things to share. Thanks for this video - really valuable content :)
I’ve been having trouble finding sources (outside of books) to learn these more intermediate topics. I always thought learning coding tipis from a book would be difficult however I find it to be a better source of information than any other learning medium if tried so far.
I am a frontend engineer right now and I will be for some time cause I enjoy it. But I cant wait to learn all the complex problems behind algorithms and data structures because its a challenge for me. I find it incredibly difficult but just for challenging myself, I will study all of that and become proficient. And maybe one day I will decide to switch from web to SWE where I will definitely need those things.
May I ask how you became a front-end engineer without studying algos? I'm not being sarcastic, every where I apply I get asked coding questions, wondering if anyone else found a way around them 🤣. I'm currently studying as much as I can, and I'm not trying to get into a FAANG at all lol, just a 'decent' job.
Thanks for pointing out Logarithms, I haven't seen this as a suggestion in many interview preparation videos but it has good application in time and space complexities. I need to revise it too, might have forgotten some concepts which were simple long ago.
Hey Clément, I just had a pretty funny idea to make a video of. You and another coder could record a shared coding session. Each person is allowed to code one line of code - then the other person writes the next line (meaningful line)... The deal is - no one has any clue what the goal of the code is. So maybe both of you will code in the same direction, or not... This might be fun :)
I currently unrolled on AlgoExpert, and am finding it useful, hopefully I will ace code challenge I have in like two months, coz normally am horrible in Algorithms , but AlgoExperts got me covered
I work with Camunda Workflow(basically trees to model business processes) and I just wrote a parser to process the nested XML. Recursion actually made it very easy to extract and process and add on to certain nodes in the tree. If not that it would days of manual work.
Maybe worth to mention bucket sort as well? Since in some technical coding questions with limited items to sort in a large range it can improve time complexity from O(nlogn) just to liner O(n) only.
Thanks for these useful concepts, especially the first one: logarithm which I didn't pay enough attention to. Absolutely great videos and it definitely helps me.
I've only been taking programming seriously for half a year without any external support (eg. boot camp & (sadly) algo expert) yet I feel relatively familiar with most of the concepts mentioned. I probably should take algo expert anyway for good measure. :P
What I hate the most in all of this knowledge... you don't need it in real life programming, because all these problems were solved already for you. Why do tech companies do not focus on clean code knowledge, solid, domain modeling etc?
this comes up once or twice in a career, but if you have less then 20 items in your list, your linear search will stomp the binary search. And N, can even be 100 depending on the computer. Because, the linear search, does not have any math.
It has a very high constant for a sorting algorithm - quick sort and merge sort are preferred to heapsort. From experience, sorting by a heap or balanced binary search tree tends to be 2-3x slower than quick sort and about or slower than merge sort for high sizes of the array.
Yes. You just have to find the recursive relation. It helps that there are basically only like 6 kinds of dynamic programming problems, so you just have to do some pattern matching with these 6 or so DP patterns. Or if you want to skip looking for the top down answer before looking for the bottom up answer, then just think about how you would solve the problem brute force and then just ask yourself, "What work is being repeated that increases the time complexity of my solution by an entire order? 9 times out of 10, finding a way of not repeating/recalculating that extra work will give you the bottom up answer. Again, there are only like 6 patterns of ways you can skip recalculating old work, so that makes it much easier.
Hi Clement. I bet you have very strong arms. I hope if at any point in my career we will meet on an interview, the table will be wide enough for me to survive the meeting xD Thank you for the quality wrap up!
Should i focus on this type of learning first or doing projects? I have been a developer for a while, i can easly understand things when i try to build something but i was clueless when i hopped into leetcode and attempted anything above easy. I feel like if i spend a few weeks munching problems, if i then dont touch those for a while, i will completely forget how to resolve them. They seem to be extremely niche problems that are just in interviews to ensure you're an expert
@@somerandomguy000, being a trie of something doesn't really make it the same thing as "trie", and it's not just a matter of terminology. A Suffix Tree doesn't even refer to a bunch of strings, but instead to a single one. It is a *compressed* trie (Prefix Tree) of all the suffixes of a given string.
Yeah I was also confused why he didn't introduce trie before suffix trees, since suffix trees tend to be used in competitive programming and tries appear more in interview problems
Thanks for your videos and quality content. I was just wondering about the kind of RUclips setup you use for your videos if you don't mind giving me some hints. Thank you.
Good stuff Clement, gives me something to work towards. On a completely different subject, has anyone said you sound like John Carmack? It's a good thing, enjoy listening to John for hours 😁
Hey, Clément. I was wondering if there's a specific language that is best implemented for ds based problems. Like in colleges here, they teach data structures using C, even though we have python language and it's easier. So I was wondering if it is related to industry expectations or just college guidelines?
I'm no professional by any means but I would just assume that is college guidelines. Most languages are pretty similar as I'm sure you know, so even if a company is expecting a certain language, it should not take a seasoned programmed much time at all to transfer their knowledge from one language to another. Most companies I've interviewed with rarely ever require knowledge in only one language, so I wouldn't worry much about trying to learn as many languages as possible, and instead master at least one of them.
Dont forget about the linear search. On occasion, especially when the search set is trivial, or the data is 99% in order, then the linear search performs better. ie: doing a qsort, on a list of 20, it will cost more then a linear search. Its a dumb mistake.
I wonder though: If I'm going to make a game where I don't need these concepts, why are they evaluated? I've never seen a single person wonder how many triplets of prime numbers are in the array such that their sum is k.
@Richard Horvatich ahh, I was referring to the platform and he was referring to a RUclips channel. They do have video walkthroughs of all their solutions on the website - obviously Clement isn't going to give away his paid platform for free.
@@fattymcgirthy9829 I was referring to the platform, not the channel. I know they work hard to release new questions but if they want to remain competitive, they need to continue releasing more questions frequently. After all, this is the intent of their product (and what users mainly pay for). Once they have somewhere around 250+ questions on their platform, they will really start to dominate this space.
Not to sound like a smart ass, but you can save yourself the return statement. def reverse_binary(t): if t is not None: t.l, t.r = t.r, t.l reverse_binary(t.l) reverse_binary(t.r) looks more neat imo
I am web developer and wrok with javascript and its frameworks like nodejs and reactjs i wanted to ask which programming language is best to learn algorithms.
I have a question from a very long time that no one has answered yet! Can there be any problem asked in a coding interview whose solution cannot be better than O(n^2)?
Yes there can be I believe. For example, Knapsack problem solved using just the top-down recursive approach would work in exp. time complexity, whereas the same solved using DP would boil down to quadratic time complexity [O(n^2)] and not any better than this.
You said that in order to reverse an array list you need three pointers. I was able to reverse a linked list just swaping two consequtive elements (none-cycling list).
Man graph problems are hard, i don't know why im having such trouble picking up the intuition about them. I can understand how to find cycles and traverse a DAG ect. But when it comes to optimal routing my brain gets fried.
Good job Clement...Some suggestions. i) Add Dynamic Programming concepts in your list of problems. ii) Provide shorter versions of videos on coding so developers who have less time can quickly get the concepts
Hello Everyone, I have QQ - Will there be expectations for coding or algorithm challenges to be solved using Java streams (if Java is chosen as coding language)?
Certainly, but I think he just wanted to point out that during coding interviews, being able to come up with a recursive solution gives a great cushion instead of struggling to find the iterative solution. So if anything, it’s a good brute force solution, and if the interviewer doesn’t ask for the iterative solution then you’re good to go.
Shameless Instagram plug: instagram.com/clement_mihailescu/ - and don't forget to use the promo code clem, C L E M, for a disc-oh wait...
Nice try, Clément :)
I was wondering by the way. I see that you also do mock interviews with some people for your channel. Do they sign up somewhere or something?
stupid clement btw love your everyvids
Lol
I wonder if people still want to be smart and learn to code. This video only has 22K view, even after a whole day. Compare that to Ashnikko _stupid_ video getting 60M views out of 2M subscribers. Is being stupid really popular these days?
People are claiming to be you and sending people who comment links and fake phone numbers. Be careful and possibly let your audience know.
Summary
1. Logarithm (Complexity Analysis)
2. Graph Traversals (BFS & DFS)
3. Binary Search
4. Sliding Window
5. Recursion
6. 2 Algorithms (Inverting a binary tree & Reverse a Linked List)
7. Suffix Trees
8. Heaps
9. DP
10. Sorting Algorithms (Quick & Merge)
thank you
you da real MVP
thanks ❤️
Thanks
Inverting means left child to right and right to left, right?
00:00 Intro
1 1:11 Logarithm
2 1:57 Graph Traversal
3 2:36 Binary Search
4 3:38 Sliding Window Techniques
5 4:45 Recursion
6 6:15 2Algorithms
7 8:12 Suffix Tree
8 9:06 Heaps
9 10:11 DP
10 11:01 Sorting
thank you
Thanks
Thanks
He could have included this, but maybe he wants people to view the video instead of the summary of the concepts
@@lancetv4826 may be ig.
Hey Clement! If you ever read this, I just wanted to let you know how much your videos have helped me!. As a high school student, I legit didnt know anything up until like a year back. I plan on buying algoexpert next year and finish it before my high school grad. Thank you again!
Same here...
how oldie are yo?
1. Logarithm
2. Graph Traversal
a. Depth First Search (DFS)
b. Breadth-first search (BFS)
3. Binary Search
4. Sliding Window Technique
5. Recursion
a. Nth Fib
6. Invert binary tree & reversing LinkedList
7. Suffix Trees (advanced)
8. Heaps
a. Min heaps
b. Max heaps
9. Dynamic Programming
10. Sorting Algorithms
a. Quick Sort
b. Merge Sort
Thank you my good sir
It's super cool that you had an Algoexpert ad before this video. And no, I didn't skip it, folks.
You've made me feel highly unprepared for my Google front end software engineer interview tomorrow. I don't know like 90% of this stuff. I went through their google tech guide, watched all their data structures videos and did a couple of their problems. The stuff is going to take me a long time to learn...What sucks is, I have a bachelors degree and 6 years of experience. I'm able to solve 99% of the problems i've encountered in my day to day job. I just never had a use for learning these more advanced topics.
I think this video is more relevent for SWE role, i don't know if DS will be asked in such depth for a frontend role
When I hear coding interviewers, I hear “so do you want to be a software engineer at Google?”
he never says that, does he?
@@amitavamozumder73 Its the algoexpert advertisement
@@sanjayvasnani988 ooh ok.
Ok, so name every Google search ever
Lol
Really liked the "I won't teach you, I will just let you know that these things exist". For self taught programmers this is one of the best things to share. Thanks for this video - really valuable content :)
Same here!
Agreed 💯
Clement: Pays youtube to show ads on other channels.
RUclips: Shows ads on Clement channel and pays him back.
Me block both ads.
@@shashankkumar1974 Karma will come
Dude has hacked youtube
Use Brave git gud
You have seriously created immense value for a very huge crowd by making this video. Thank you.
Very cool concepts, literally 0% of which will be used after you get the job. Interview WIN
I’ve been having trouble finding sources (outside of books) to learn these more intermediate topics. I always thought learning coding tipis from a book would be difficult however I find it to be a better source of information than any other learning medium if tried so far.
I am a frontend engineer right now and I will be for some time cause I enjoy it. But I cant wait to learn all the complex problems behind algorithms and data structures because its a challenge for me.
I find it incredibly difficult but just for challenging myself, I will study all of that and become proficient.
And maybe one day I will decide to switch from web to SWE where I will definitely need those things.
May I ask how you became a front-end engineer without studying algos? I'm not being sarcastic, every where I apply I get asked coding questions, wondering if anyone else found a way around them 🤣. I'm currently studying as much as I can, and I'm not trying to get into a FAANG at all lol, just a 'decent' job.
He literally spilled all the contents of algoexpert.
Thanks for pointing out Logarithms, I haven't seen this as a suggestion in many interview preparation videos but it has good application in time and space complexities. I need to revise it too, might have forgotten some concepts which were simple long ago.
Logarithm (big - o, Complexity, etc)
Graph traversal, tree traversal, matrix traversal (DFS, BFS), Cyloc graph traversal
Binary search
Sliding window technique
Recursion
Inverting a Binary tree, reversing a linked list
Suffix tree (difficult DS)
Heaps, Binary heaps, min heaps, Max heaps
DP
Sorting - Quick sort and merge sort
You're the best, man! I wish you were my university teacher on each subject 10 years ago when I learned for CS BSc
Great video, a small mistake at 9:32, find operations for min (in a min-heap) and max (in a max-heap) are constant, not logarithmic.
Oh, yes, good catch! 🤦♂️ *Adding* and *removing* values are the logarithmic operations!
Was just going to post this :)
1:30 Logarithms are very useful. One more topic of math thats comes in handy a lot is combinatorics.
Hey Clément, I just had a pretty funny idea to make a video of. You and another coder could record a shared coding session. Each person is allowed to code one line of code - then the other person writes the next line (meaningful line)...
The deal is - no one has any clue what the goal of the code is. So maybe both of you will code in the same direction, or not... This might be fun :)
we are not here for fun Alexander :p
@@ps_tech19 oh sorry about that :)
This sounds fun. Wanna give it a try?
I currently unrolled on AlgoExpert, and am finding it useful, hopefully I will ace code challenge I have in like two months, coz normally am horrible in Algorithms , but AlgoExperts got me covered
1:07 he finally pronounced his surname.
I work with Camunda Workflow(basically trees to model business processes) and I just wrote a parser to process the nested XML. Recursion actually made it very easy to extract and process and add on to certain nodes in the tree. If not that it would days of manual work.
Maybe worth to mention bucket sort as well? Since in some technical coding questions with limited items to sort in a large range it can improve time complexity from O(nlogn) just to liner O(n) only.
Best platform for non cs enthusiasts .... Worth every penny ❤️
Binary trips -> either a good trip or a bad one :)
Thanks for these useful concepts, especially the first one: logarithm which I didn't pay enough attention to. Absolutely great videos and it definitely helps me.
I've only been taking programming seriously for half a year without any external support (eg. boot camp & (sadly) algo expert) yet I feel relatively familiar with most of the concepts mentioned. I probably should take algo expert anyway for good measure. :P
💪 That's awesome! Means you must be doing something right! And yes, definitely get AlgoExpert :P
Appreciate your content Sir clement, as a aspiring googler your videos helps me a lot.
What I hate the most in all of this knowledge... you don't need it in real life programming, because all these problems were solved already for you. Why do tech companies do not focus on clean code knowledge, solid, domain modeling etc?
Thanks so much man! Algoexpert is amazing! You are an amazing teacher too! Thank you Clement!
way u explained about dynamic programing made me feel nice ,like never knew that am dynamic i solve bit by bit
this comes up once or twice in a career, but if you have less then 20 items in your list, your linear search will stomp the binary search. And N, can even be 100 depending on the computer. Because, the linear search, does not have any math.
I learned the word Caveat from this man, I learn through repetition
Awesome video! This guy is built different! You can just look at the way he speaks. He holds great great value!
Thank you so much Clément, but if you can fix chapters, would be great :)
Awesome! Thanks for sharing 👍
Clement: I think that we can all agree that Linked Lists are an important data structure.
Me: umm... yes?
Why everyone hates heapsort? Lololoo It's the most beautiful sorting algorithm
All my homies hate heapsort
Radix sort with large base wants to have a talk with you
@Sai Akhil Katukam bro Morris traversal is the best
Nope. Radix is da best.
It has a very high constant for a sorting algorithm - quick sort and merge sort are preferred to heapsort. From experience, sorting by a heap or balanced binary search tree tends to be 2-3x slower than quick sort and about or slower than merge sort for high sizes of the array.
10:18 dynamic programming sound like iterative recursion with extra steps
It is the extra steps that present the most difficulty: the way to derive next state from the previous.
Yes. You just have to find the recursive relation. It helps that there are basically only like 6 kinds of dynamic programming problems, so you just have to do some pattern matching with these 6 or so DP patterns.
Or if you want to skip looking for the top down answer before looking for the bottom up answer, then just think about how you would solve the problem brute force and then just ask yourself, "What work is being repeated that increases the time complexity of my solution by an entire order? 9 times out of 10, finding a way of not repeating/recalculating that extra work will give you the bottom up answer. Again, there are only like 6 patterns of ways you can skip recalculating old work, so that makes it much easier.
These are absolutely great concepts and will definitely be helpful for coding interviews. Thanks for creating this awesome video!
I think prefix trees(TRIES) are also important. Nice video.
Hi Clement. I bet you have very strong arms. I hope if at any point in my career we will meet on an interview, the table will be wide enough for me to survive the meeting xD
Thank you for the quality wrap up!
1:11 01. Logarithm (Complexity Analysis)
1:57 02. Graph Traversal
a. Depth First Search (DFS)
b. Breadth-first search (BFS)
2:36 03. Binary Search
3:38 04. Sliding Window Technique
4:45 05. Recursion
a. Nth Fib
6:15 06. Invert binary tree & reversing LinkedList
8:12 07. Suffix Trees (advanced)
9:06 08. Heaps
a. Min heaps
b. Max heaps
10:11 09. Dynamic Programming
11:01 10. Sorting Algorithms
a. Quick Sort
b. Merge Sort
Thank you for the video. I am grateful for your time and contribution. Kind regards, Akira.
Clem, does your course offer explanations for all these 10 topics?
Should i focus on this type of learning first or doing projects?
I have been a developer for a while, i can easly understand things when i try to build something but i was clueless when i hopped into leetcode and attempted anything above easy.
I feel like if i spend a few weeks munching problems, if i then dont touch those for a while, i will completely forget how to resolve them. They seem to be extremely niche problems that are just in interviews to ensure you're an expert
Seriously.
In 12 years of web dev, I've never needed any of these algorithm skills.
But I guess that's why I don't make the big bucks.
Are there going to be any more google interviews videos like your videos by the way keep going
Of course!
You-tube would probably "not upload" his video if (count=="no.of times he says algoexpert"
That is one dope monitor :)
Is that the Sony?
I think you wanted to say Prefix Trees (Tries), not Suffix Trees, which are actually quite complicated, at least to build (in linear time).
All those terms refer to the same thing (Tries)
@@somerandomguy000, being a trie of something doesn't really make it the same thing as "trie", and it's not just a matter of terminology. A Suffix Tree doesn't even refer to a bunch of strings, but instead to a single one. It is a *compressed* trie (Prefix Tree) of all the suffixes of a given string.
Yeah I was also confused why he didn't introduce trie before suffix trees, since suffix trees tend to be used in competitive programming and tries appear more in interview problems
@@somerandomguy000 tries and suffix trees aren't the same thing
Love this! Thank you~
Thanks for your videos and quality content. I was just wondering about the kind of RUclips setup you use for your videos if you don't mind giving me some hints. Thank you.
Super informative, thanks!
Fun way to die: take a shot every time AlgoExpert gets plugged
Good stuff Clement, gives me something to work towards. On a completely different subject, has anyone said you sound like John Carmack? It's a good thing, enjoy listening to John for hours 😁
It was really an amazing video, Thanks
How presumptuous of I. I just started learning how to write a code and yet I am now watching this video.
Very high quality video
Thank you sooo much. Was waiting for something like this!
Hey, Clément. I was wondering if there's a specific language that is best implemented for ds based problems. Like in colleges here, they teach data structures using C, even though we have python language and it's easier. So I was wondering if it is related to industry expectations or just college guidelines?
I'm no professional by any means but I would just assume that is college guidelines. Most languages are pretty similar as I'm sure you know, so even if a company is expecting a certain language, it should not take a seasoned programmed much time at all to transfer their knowledge from one language to another. Most companies I've interviewed with rarely ever require knowledge in only one language, so I wouldn't worry much about trying to learn as many languages as possible, and instead master at least one of them.
Great video, it’s funny how you accidentally said treap instead of heap. And treap is actually a data structure useful in competitive coding.
Dont forget about the linear search. On occasion, especially when the search set is trivial, or the data is 99% in order, then the linear search performs better. ie: doing a qsort, on a list of 20, it will cost more then a linear search. Its a dumb mistake.
I wonder though: If I'm going to make a game where I don't need these concepts, why are they evaluated?
I've never seen a single person wonder how many triplets of prime numbers are in the array such that their sum is k.
I really hated you earlier because of your adds everywhere. But after watching your one interview with keerti I love to see your videos and adds too❤️
When can we expect to see new questions on AlgoExpert? 😎
Just this year we've seen almost 20 new questions added. I'm sure they are trying to keep the scope focused
@Richard Horvatich ahh, I was referring to the platform and he was referring to a RUclips channel.
They do have video walkthroughs of all their solutions on the website - obviously Clement isn't going to give away his paid platform for free.
@@fattymcgirthy9829 I was referring to the platform, not the channel. I know they work hard to release new questions but if they want to remain competitive, they need to continue releasing more questions frequently. After all, this is the intent of their product (and what users mainly pay for). Once they have somewhere around 250+ questions on their platform, they will really start to dominate this space.
Excellent video!
It's weird because I have a weird obsession with quicksort. I created multiple versions of them in my spare time.
And it is not a hard algorithm.
Thank you
Not to sound like a smart ass, but you can save yourself the return statement.
def reverse_binary(t):
if t is not None:
t.l, t.r = t.r, t.l
reverse_binary(t.l)
reverse_binary(t.r)
looks more neat imo
I am web developer and wrok with javascript and its frameworks like nodejs and reactjs i wanted to ask which programming language is best to learn algorithms.
Awesome and useful!
this guy's jaw has a life of its own
Clement just invented a new data structure called binary treaps
I have a question from a very long time that no one has answered yet! Can there be any problem asked in a coding interview whose solution cannot be better than O(n^2)?
Yes there can be I believe. For example, Knapsack problem solved using just the top-down recursive approach would work in exp. time complexity, whereas the same solved using DP would boil down to quadratic time complexity [O(n^2)] and not any better than this.
@@sridharg3043 something that was going on in my head!! Finally clarified. Thanks a lot!!
You said that in order to reverse an array list you need three pointers. I was able to reverse a linked list just swaping two consequtive elements (none-cycling list).
Hello Clem, are all interview questions based around data structures or will there be front end questions?
hmm, so I love Javascript with all my heart and sole, but it has no heap..
Am I screwed if I don't learn Python instead for my code interviews?
Man graph problems are hard, i don't know why im having such trouble picking up the intuition about them. I can understand how to find cycles and traverse a DAG ect. But when it comes to optimal routing my brain gets fried.
For graph traversals, do I need to know union find, topological sort, or dijkstra?
Which langauage you use for explanation videos?
What are your views for politics inside software companies. Specially shortlisting students of particular universities.
Great overview
Wow great video sir.. thank u so much...
@Clèment Mihailescu thanks again
“If you don’t know any of these topics…”
Me: “yup that’s me. Take my money.”
Thanks buddy!
Your content gives more knowledge than university degree
Is that Piton mt in St Lucia on your screen saver?
Good job Clement...Some suggestions. i) Add Dynamic Programming concepts in your list of problems. ii) Provide shorter versions of videos on coding so developers who have less time can quickly get the concepts
Actually the 9th concept is Dynamic Programming, maybe you miss it
9:20 you do know that treaps are a thing, right?
you know right?
i already know 8/10 algorithm
Can I assume the order indicates the importance?
Do you teach algorithms from dummy level 😢😢😢to expert level then give project were one gets to understand it uses ??
Waiting for a Collab with Meg Williams 😍
Хорошо описана суть проблемы с объединяторами
Hello Everyone,
I have QQ - Will there be expectations for coding or algorithm challenges to be solved using Java streams (if Java is chosen as coding language)?
great video thanks
can you tell me all the important concepts for coding instead just only 10?
One thing about the recursion part. Isn't recursion quite ineffecient espacially when it comes to memory management in the ram ?
Certainly, but I think he just wanted to point out that during coding interviews, being able to come up with a recursive solution gives a great cushion instead of struggling to find the iterative solution. So if anything, it’s a good brute force solution, and if the interviewer doesn’t ask for the iterative solution then you’re good to go.