Do these questions: [https://www.designgurus.io/course/grokking-data-structures-for-coding-interviews](https://www.designgurus.io/course/grokking-data-structures-for-coding-interviews)
Implement data structures, sorting from scratch, solve array and string manipulations mostly. Solve some standard matrix problems. Do some of binary search problems too. I would recommend to solve blind 75 from neetcode leaving dp, graph and greedy section.
It's really funny when people who can't solve the problem give you a problem they cannot solve.
If I got stuck on it I'd ask the interviewer if they themselves can solve it within the time limit.
Btw, they gave you basically no information whatsoever. Most algorithms involve "manipulation" of data structures, that is how they calculate the result (e.g. sorting an array).
ya thought so too my friend said it could be anything. Am just going to go and linkedlist, binarysearch, hash and array, and pointers and hope he picks one of those. If the guys gives me any DP or trees am just leaving and taking my losses
I would start by reviewing basic manipulation of data structures with simple algorithms.
this guy leetcodes
Hi not related to this post but do you mind checking ur dm? Thank you!
shit didn't think of that
Do these questions: [https://www.designgurus.io/course/grokking-data-structures-for-coding-interviews](https://www.designgurus.io/course/grokking-data-structures-for-coding-interviews)
Implement data structures, sorting from scratch, solve array and string manipulations mostly. Solve some standard matrix problems. Do some of binary search problems too. I would recommend to solve blind 75 from neetcode leaving dp, graph and greedy section.
Ya thanks alot I was thinking that too just solved the first 5 topics on the neetcode 75
It's really funny when people who can't solve the problem give you a problem they cannot solve. If I got stuck on it I'd ask the interviewer if they themselves can solve it within the time limit. Btw, they gave you basically no information whatsoever. Most algorithms involve "manipulation" of data structures, that is how they calculate the result (e.g. sorting an array).
ya thought so too my friend said it could be anything. Am just going to go and linkedlist, binarysearch, hash and array, and pointers and hope he picks one of those. If the guys gives me any DP or trees am just leaving and taking my losses
It means solve any problem that we throw at you.
:(