Verify Alien Dictionary | Leetcode 953 | Arrays

  Рет қаралды 5,500

Nideesh Terapalli

Nideesh Terapalli

Күн бұрын

Пікірлер: 20
@thearpitkatiyar637
@thearpitkatiyar637 Жыл бұрын
Great explanation
@NideeshTerapalli
@NideeshTerapalli Жыл бұрын
Hey there! Just wanted to let you know that some of the links in this comment are affiliate links, which means that if you make a purchase through them, I may earn a small commission. Don't worry though, it doesn't cost you anything extra and it helps support this channel so I can continue to make more videos for you. Thank you so much for your support, and as always, all opinions are my own! Start getting great at system design: bytebytego.com?fpr=nideesh (affiliate link) Handpicked Algorithms and Data Structures for Interview To Save Time: interviewpen.com/?via=nideesh (affiliate link) Fast track to becoming a knowledgeable SWE www.educative.io/unlimited?aff=K1z6 (affiliate link)
@razibazargan5649
@razibazargan5649 3 жыл бұрын
Best Explanation Thanks
@shubhamrane9389
@shubhamrane9389 3 жыл бұрын
Tum bohot mast kaam karta hai magshud bhai!!!!!!!!!
@NideeshTerapalli
@NideeshTerapalli 3 жыл бұрын
ha ha! aa jaadu ki jhappi de de
@shubhamrane9389
@shubhamrane9389 3 жыл бұрын
@@NideeshTerapalli XDXD
@satyajeetkumarjha1482
@satyajeetkumarjha1482 3 жыл бұрын
@@NideeshTerapalli ae circuit tu acha algo ds padatha re .ek video geeksforgeeks pe bhi dekha tha
@NideeshTerapalli
@NideeshTerapalli 3 жыл бұрын
@@satyajeetkumarjha1482 arey bhai, tension nai lene ka. Videos dekhne ka, interview clear karne ka, aur mauj karne ka. Bas!
@JannibalForKing
@JannibalForKing 5 жыл бұрын
I love you Nids!!! Always so helpful 😍
@NideeshTerapalli
@NideeshTerapalli 5 жыл бұрын
Thanks Chad
@_ShivaniYogi
@_ShivaniYogi 3 жыл бұрын
nice explanation!
@Ash-fo4qs
@Ash-fo4qs 2 жыл бұрын
plz make more leetcode videos if you get time!!
@abhishekabraham4107
@abhishekabraham4107 4 жыл бұрын
You have some clear explanations across your videos.
@sallyzhangt
@sallyzhangt 4 жыл бұрын
Thanks for the explanation.
@raovenu9236
@raovenu9236 5 жыл бұрын
Very nice explanation Nidesh. Couple of feedback a) Always provide the runtime complexity. I believe your algorithm is O(m*n) where m is the average length of string in the array and n is the length of the array. Array building is O(constant) which is O(1) b) Think your code can be cleaner if you use if/else and make your code a bit more concise. For e.g. at 11:11, you could just have said `return a.length()
@kanishkbharti8692
@kanishkbharti8692 5 жыл бұрын
Great style of teaching. Please solve Google interview questions
@NideeshTerapalli
@NideeshTerapalli 5 жыл бұрын
Thank you
@tanjotpanesar
@tanjotpanesar 4 жыл бұрын
great vid!
@NideeshTerapalli
@NideeshTerapalli 4 жыл бұрын
Thanks!
@MrChicano101
@MrChicano101 3 жыл бұрын
I don't understand why u do w-'a', could you provide why?
G-26. Alien Dictionary - Topological Sort
20:54
take U forward
Рет қаралды 176 М.
Implement Trie (Prefix Tree) - Leetcode 208
18:56
NeetCode
Рет қаралды 208 М.
Perfect Pitch Challenge? Easy! 🎤😎| Free Fire Official
00:13
Garena Free Fire Global
Рет қаралды 45 МЛН
How Strong is Tin Foil? 💪
00:25
Brianna
Рет қаралды 60 МЛН
Triple kill😹
00:18
GG Animation
Рет қаралды 15 МЛН
Pointers and dynamic memory - stack vs heap
17:26
mycodeschool
Рет қаралды 1,4 МЛН
(Remade) First Missing Positive | Arrays | Leetcode 41
12:19
Nideesh Terapalli
Рет қаралды 13 М.
2. Data Structures and Dynamic Arrays
50:18
MIT OpenCourseWare
Рет қаралды 534 М.
Arrays | Leetcode 659 | Split Array Into Consecutive Subsequences
16:20
Nideesh Terapalli
Рет қаралды 19 М.
Topological Sort Graph | Leetcode 207 | Course Schedule
10:39
Nideesh Terapalli
Рет қаралды 21 М.
How to: Work at Google - Example Coding/Engineering Interview
24:02
Life at Google
Рет қаралды 7 МЛН
System Design Interview - Distributed Cache
34:34
System Design Interview
Рет қаралды 369 М.
Lecture 19: Dynamic Programming I: Fibonacci, Shortest Paths
51:47
MIT OpenCourseWare
Рет қаралды 2,8 МЛН
Perfect Pitch Challenge? Easy! 🎤😎| Free Fire Official
00:13
Garena Free Fire Global
Рет қаралды 45 МЛН