Find merge point of two linked list
By mycodeschool
Community Score: 50% | 109.6K views | 12y
0 community ratings: null thumbs up, null thumbs down
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: https://gist.github.com/mycodeschool/5bc53cb87905f95e12b3 See series on linked list here: https://www.youtube.com/watch?v=NobHlGUjV3g&list=PL2_aWCzGMAwI3W_JlcBbtYTwiQSsOTa6P&index=4 See series on time complexity here: https://www.youtube.com/watch?v=V42FBiohc6c&list=PL2_aWCzGMAwI9HK8YPVBjElbLbI3ufctn&index=2 About sets: http://www.cplusplus.com/reference/set/set/ You may also like/follow us on Facebook/Twitter: https://www.facebook.com/MyCodeSchool https://twitter.com/mycodeschool
Tags: Linked List, interview, microsoft, yt:cc=on, software, data structures, linked list, Technology
More from mycodeschool
- Introduction to programming and programming languages: C Programming Tutorial 01 — Score: 50%
- Graph Representation part 03 - Adjacency List — Score: 50%
- Graph Representation part 02 - Adjacency Matrix — Score: 50%
- Graph Representation part 01 - Edge List — Score: 50%
- Data structures: Properties of Graphs — Score: 50%
- Data structures: Introduction to graphs — Score: 50%