idbentley
Common Sense Software
© 2022. All rights reserved.
These are live lectures given with varying degrees of preparation to a group of Ian's alumni. For everyone's benefit, they are posted here, but be aware that there are certainly errors in these videos. If you spot any, please feel free to email Ian.
In this video we will solve Leetcode problem 142. We discuss a solution that uses two pointers progressing at different speeds through the linked list. When the two pointers arrive at the same node, we can be sure we detected a cycle, and we can use some simple math to determine exactly how long the cycle is!
In this video we will solve Leetcode problem 328. We discuss the runtime complexities of arrays and linked lists, and present a solution that utilizes the functionality and characteristics of linked lists.
In this video we discuss a technique for building binary trees based on two different traversals. This is a solution to leetcode problem #105.
As with all live lectures, it’s very possible that I have mis-spoken, or misrepresented something. If you notice any problems, please message me at ian@idbentley.com