Algorithms

Linked lists are the second most common data structure in coding interviews after arrays. They test your ability to work with pointers, handle edge cases, and think about memory. In this article, you will learn how linked lists work, how to implement them, and how to solve classic interview problems. We show every example in Kotlin, Python, and Go. What is a Linked List? A linked list is a collection of nodes. Each node stores two things: a value and a pointer (reference) to the next node. Unlike arrays, linked list nodes are not stored next to each other in memory. They can be anywhere in memory, connected through pointers. ...

Arrays and strings are the most common data structures in coding interviews. Almost every technical interview at Google, Meta, Amazon, or any tech company starts with an array or string problem. If you want to pass coding interviews, you need to master these two first. In this article, you will learn what arrays and strings are, their time complexities, and how to solve classic interview problems. We show every example in Kotlin, Python, and Go. ...