- Видео 110
- Просмотров 66 045 209
mycodeschool
Индия
Добавлен 9 сен 2012
mycodeschool is an educational initiative. Our aim is to present some core concepts of computer programming through illustrated examples and creative teaching techniques.
You can send your feedback to mycodeschool [at] gmail [dot] com
Visit: www.mycodeschool.com
Some good resources to learn and practice programming:
TopCoder - community.topcoder.com/tc
Codeforces - codeforces.com/
Some good resources to practice for programming interviews:
Nice article on how to Ace a coding interview -
www.linkedin.com/today/post/article/20141120061048-6976444-ace-the-coding-interview-every-time
www.geeksforgeeks.org/
www.careercup.com/
You can send your feedback to mycodeschool [at] gmail [dot] com
Visit: www.mycodeschool.com
Some good resources to learn and practice programming:
TopCoder - community.topcoder.com/tc
Codeforces - codeforces.com/
Some good resources to practice for programming interviews:
Nice article on how to Ace a coding interview -
www.linkedin.com/today/post/article/20141120061048-6976444-ace-the-coding-interview-every-time
www.geeksforgeeks.org/
www.careercup.com/
Graph Representation part 03 - Adjacency List
See complete series on data structures here:
ruclips.net/p/PL2_aWCzGMAwI3W_JlcBbtYTwiQSsOTa6P
In this lesson, we have talked about Adjacency List representation of Graph and analyzed its time and space complexity of adjacency list representation.
Previous Lesson: ruclips.net/video/9C2cpQZVRBA/видео.html
Lesson on Pointers:
ruclips.net/video/ASVB8KAFypk/видео.html
ruclips.net/video/sHcnvZA2u88/видео.html
Time Complexity analysis playlist:
ruclips.net/p/PL2_aWCzGMAwI9HK8YPVBjElbLbI3ufctn
For practice problems and more, visit: www.mycodeschool.com
Like us on Facebook: MyCodeSchool
Follow us on twitter: mycodeschool
ruclips.net/p/PL2_aWCzGMAwI3W_JlcBbtYTwiQSsOTa6P
In this lesson, we have talked about Adjacency List representation of Graph and analyzed its time and space complexity of adjacency list representation.
Previous Lesson: ruclips.net/video/9C2cpQZVRBA/видео.html
Lesson on Pointers:
ruclips.net/video/ASVB8KAFypk/видео.html
ruclips.net/video/sHcnvZA2u88/видео.html
Time Complexity analysis playlist:
ruclips.net/p/PL2_aWCzGMAwI9HK8YPVBjElbLbI3ufctn
For practice problems and more, visit: www.mycodeschool.com
Like us on Facebook: MyCodeSchool
Follow us on twitter: mycodeschool
Просмотров: 430 580
Видео
Graph Representation part 02 - Adjacency Matrix
Просмотров 534 тыс.9 лет назад
See complete series on data structures here: ruclips.net/p/PL2_aWCzGMAwI3W_JlcBbtYTwiQSsOTa6P In this lesson, we have talked about Adjacency Matrix representation of Graph and analyzed its time and space complexity of adjacency matrix representation. Previous Lesson: ruclips.net/video/ZdY1Fp9dKzs/видео.html Time Complexity analysis playlist: ruclips.net/p/PL2_aWCzGMAwI9HK8YPVBjElbLbI3ufctn For ...
Graph Representation part 01 - Edge List
Просмотров 473 тыс.9 лет назад
See complete series on data structures here: ruclips.net/p/PL2_aWCzGMAwI3W_JlcBbtYTwiQSsOTa6P In this lesson, we have described how we can represent and store a graph in computer's memory as vertex-list and edge-list. We have analyzed the time and space complexities of such a representation. In next two lessons, we will talk about adjacency matrix and adjacency list representations. Next Lesson...
Data structures: Properties of Graphs
Просмотров 476 тыс.9 лет назад
See complete series on data structures here: ruclips.net/p/PL2_aWCzGMAwI3W_JlcBbtYTwiQSsOTa6P In this lesson, we have described below properties of Graph data structure: a) directed graph vs undirected graph b) weighted graph vs unweighted graph c) sparse graph vs dense graph d) strongly connected graphs e) Acyclic graphs. Next Lesson:- ruclips.net/video/ZdY1Fp9dKzs/видео.html For practice prob...
Data structures: Introduction to graphs
Просмотров 958 тыс.9 лет назад
See complete series on data structures here: ruclips.net/p/PL2_aWCzGMAwI3W_JlcBbtYTwiQSsOTa6P In this lesson, we have described Graph data structure as a mathematical model. We have briefly described the concept of Graph and some of its applications. For practice problems and more, visit: www.mycodeschool.com Like us on Facebook: MyCodeSchool Follow us on twitter: mycod...
Know your data type: int - C Programming Tutorial 08
Просмотров 234 тыс.10 лет назад
See complete series on C programming here: ruclips.net/p/PL2_aWCzGMAwLSqGsERZGXGkA5AfMhcknE In this tutorial, we have discussed int data-type in detail. We have explained below concepts: How data is stored in computer's memory. Size and range of int Signed and unsigned int How negative numbers are stored in binary. About binary number system: ruclips.net/video/5OBZYhJnne0/видео.html About 2's c...
Maximum sum sub-array
Просмотров 385 тыс.10 лет назад
In this lesson, we have solved another famous programming interview question - finding maximum sub-array sum in an array. See source codes here: O(n^3) algorithm - gist.github.com/mycodeschool/9666221e7527935d8e1d O(n^2) algorithm - gist.github.com/mycodeschool/447854ea1844b1b42cd3 O(NlogN) algorithm - gist.github.com/mycodeschool/8b4bcff69427c8a6f2aa O(N) algorithm - gist.github.com/mycodescho...
Using Arithmetic Operators - C Programming Tutorial 07
Просмотров 140 тыс.10 лет назад
See complete series on C programming here: ruclips.net/p/PL2_aWCzGMAwLSqGsERZGXGkA5AfMhcknE In this tutorial, we have explained how to use arithmetic operators to perform arithmetic in a C program. For more such videos and updates, subscribe to our channel: ruclips.net/user/mycodeschool You may also like/follow us on Facebook/Twitter: MyCodeSchool mycodeschool
Find merge point of two linked list
Просмотров 108 тыс.10 лет назад
In this lesson, we have solved a famous programming interview question - finding merge point of two linked list. We have written a C implementation. See source code here: gist.github.com/mycodeschool/5bc53cb87905f95e12b3 See series on linked list here: ruclips.net/video/NobHlGUjV3g/видео.html See series on time complexity here: ruclips.net/video/V42FBiohc6c/видео.html About sets: www.cplusplus....
Input and Output: Printf and Scanf - C Programming Tutorial 06
Просмотров 277 тыс.10 лет назад
See complete series on C programming here: ruclips.net/p/PL2_aWCzGMAwLSqGsERZGXGkA5AfMhcknE In this tutorial, we have explained printf and scanf functions in C that are used to read input and write output from command line or Console. For more such videos and updates, subscribe to our channel: ruclips.net/user/mycodeschool You may also like/follow us on Facebook/Twitter: MyCodeScho...
Inorder Successor in a binary search tree
Просмотров 359 тыс.10 лет назад
See complete series on data structures here: ruclips.net/p/PL2_aWCzGMAwI3W_JlcBbtYTwiQSsOTa6P In this lesson, we have discussed efficient algorithm to find Inorder successor of a Node in binary search tree. See source code here: gist.github.com/mycodeschool/6515e1ec66482faf9d79 See video on Inorder Traversal here: ruclips.net/video/gm8DUJJhmY4/видео.html For practice problems and more, visit: w...
Find height of a binary tree
Просмотров 563 тыс.10 лет назад
See complete series on data structures here: ruclips.net/p/PL2_aWCzGMAwI3W_JlcBbtYTwiQSsOTa6P In this lesson, we have written code to find height of a binary tree using a simple recursion. For practice problems and more, visit: www.mycodeschool.com Like us on Facebook: MyCodeSchool Follow us on twitter: mycodeschool
Delete a node from Binary Search Tree
Просмотров 1,2 млн10 лет назад
See complete series on data structures here: ruclips.net/p/PL2_aWCzGMAwI3W_JlcBbtYTwiQSsOTa6P In this lesson, we have discussed deletion of a node from binary search tree data structure. We have discussed the core logic and written implementation of it in C . See source code here: gist.github.com/mycodeschool/9465a188248b624afdbf For practice problems and more, visit: www.mycodeschool.com Like ...
Check if a binary tree is binary search tree or not
Просмотров 376 тыс.10 лет назад
See complete series on data structures here: ruclips.net/p/PL2_aWCzGMAwI3W_JlcBbtYTwiQSsOTa6P In this lesson, we have written a program in C/C to verify whether a given binary tree is binary search tree or not. For practice problems and more, visit: www.mycodeschool.com Like us on Facebook: MyCodeSchool Follow us on twitter: mycodeschool
Binary tree traversal: Preorder, Inorder, Postorder
Просмотров 953 тыс.10 лет назад
See complete series on data structures here: ruclips.net/p/PL2_aWCzGMAwI3W_JlcBbtYTwiQSsOTa6P In this lesson, we have described Preorder, Inorder and Postorder algorithms for binary tree traversal and analyzed their time and space complexities. See source code here: gist.github.com/mycodeschool/10016271 For more on time complexity analysis: www.geeksforgeeks.org/618/ For practice problems and m...
Direction of a point from a line segment
Просмотров 23 тыс.10 лет назад
Direction of a point from a line segment
Binary tree traversal - breadth-first and depth-first strategies
Просмотров 792 тыс.10 лет назад
Binary tree traversal - breadth-first and depth-first strategies
Find min and max element in a binary search tree
Просмотров 354 тыс.10 лет назад
Find min and max element in a binary search tree
BST implementation - memory allocation in stack and heap
Просмотров 298 тыс.10 лет назад
BST implementation - memory allocation in stack and heap
Binary search tree - Implementation in C/C++
Просмотров 1,3 млн10 лет назад
Binary search tree - Implementation in C/C
Data structures: Binary Search Tree
Просмотров 1,3 млн10 лет назад
Data structures: Binary Search Tree
Data structures: Introduction to Trees
Просмотров 1,5 млн10 лет назад
Data structures: Introduction to Trees
Evaluation of Prefix and Postfix expressions using stack
Просмотров 627 тыс.10 лет назад
Evaluation of Prefix and Postfix expressions using stack
Data structures: Linked List implementation of Queue
Просмотров 534 тыс.10 лет назад
Data structures: Linked List implementation of Queue
wow so easy so understand, thank you sir
Best online teacher of computer science, bar none.
thank you. easy to follow and great visuals. 10 years on and this is still great.
but always stack memory comes at top. and also static/global segment divided into initialized and unintilazied data
Legendary!
Man of magic. 10yrs old. Still we re watching
100 percent better than majority of paid courses
Amazing amazing amazing 😍
thanks a lot!
10 years ago he passed away
Watching after 10 years
at 7:45, shouldnt j be from i+1 to n? otherwise we keep missing the last element of the array and dont compare it to anything
I watched from the first video in this playlist upto here in one watch..This playlist made me relise and gave a realaly good uunderstanding also cleared lotta doubts on a project i did using dynamic memory allocation.Thanks a lot
legendary
At 16:38, I think at level 1 it is n/2 (not n) because we are using only n/2 space, we didn't even entered the right recursion tree. Same goes for the next level, n/4, then n/8 and so on. So, the total space would be n/2+n/4+n/8+.....+1 (or may use infinity for simplification), and not n+n/2+n/4+....+1. But, anyway, it would be in O(n). Correct me if I'm wrong.
Anyone 2024
2024❤
why n-2 times while sqrt(n-1) times???
tbf, this is amazing tutorial. great job
Helped me in 2024🙏🌞
Best DSA
This is a godsend thank you
álgorithm, not algórithm anyway, thanks for the video, man you are great! <3
Whose voice is this Animesh or Harsha?
Life is full of circles!! Few years ago in 2020, I was watching your video to get my first job in college placement and now here i am again!!
helping people 10 years later :).
One of the greatest videos on youtube. Cheers.
Who is watching this video in 2024 ❤
I somehow found your video in my first year of college (2020) and today i have graduated (2024), still when i have to revise algorithms i watch your tutorials. I know you are no more in this world, but your contribution to community will always be remembered sir.
This is what i need as comp engineering student. Many tutorial there are just not enough to fill my curoisity. But this make me more understood about c and memory management. Thanks
A student of computer science here. This is one of the best recursion videos I've seen on yt. You give the simplest and very very clean explanations. I love your channel, it's one of the best I came across. You helped me understand so many things very clearly. Thank you <3! And please keep making videos :)))
thanks man it really helped me.
even if I am Learning it in C , it is more clearer than others anything resources ,
thank you
thank you, you will be missed
It's always good to come back to basics once in a while. Really loved the explanations.
Minor correction: main as is, must return a value of type int
I dont how the lecture was passed away but may your soul rest in peace sir 🙏
Awesome video
Thank you for clearly explaining O(1) and O(n) with example. Easy to understand. Your videos ❤❤❤❤ Love learning. God bless you!
Iam now getting 🙏😮💨
holy shit what a golden video! THANKS
This is it for this lesson .Thanks for watching❤❤❤❤.love you❤❤
This is the most effective explanation I've found on RUclips
I hava nerver met a class like this one. It is really easy to understnd and kind for beginner.
You are better than a professor Thanks for your great teaching❤❤
thank you
The best educational channel.
Amazing clarity and detail in the explanation.
All-time top, I am re-visiting after 6 years still no one can simplify to this level. hats off to the trainer