Write a function that takes a node and returns True if the node is part of a tree or False if it's part of a graph.

Read More >>Assuming we have a singly linked list of unknown length, how could we go about finding the N'th to last element.

Read More >>Given a singly linked list, write a function that returns a linked list with all the nodes in reverse order.

Read More >>A very common question to come across in a developer interview involves checking if a linked list contains a loop or cycle. In this article, we will look at a strategy for efficiently determining if a linked list contains a loop.

Read More >>A linked list is a data structure comprised of nodes. Each node contains a value and a pointer to another node, which allows the nodes to be linked together in a chain. This data structure allows for O(1) insertions and deletes, but comes at the cost of an O(n) search.

Read More >>A stack is a data structure that allows for collecting elements that are "stacked" on top of one another using two methods, "push" and "pop". Stacks have a wide variety of applications, and are a core data structure for engineers to know.

Read More >>A binary search is an algorithm that finds the index of a given value within a sorted array. By taking advantage of specific properties of a sorted array, a binary search can be performed in O(Log(N)) time instead of the O(N) time needed to perform a search on an unsorted array.

Read More >>Merge Sort is a commonly used sorting algorithm that utilizes a divide-and-conquer strategy. It is also an incredibly useful algorithm to master when preparing for interviews, and is a strong foundation for understanding many other types of sorting algorithms.

Read More >>Hash tables are a data structure used to store data by mapping keys to values, in which keys are created by running a hashing function on a given object which will map to a bucket that the value will be stored in. Due to the O(1) time complexity for insertions, deletions, and search, hash tables are an incredibly powerful tool that has wide applications. In this article, we will look at how to implement a simple hash table in Python.

Read More >>Given an array containing N integers, write a class that contains two functions: and update function that will update a value at a given index, and a sum function that will sum all values between indexes I1 and I2.

Read More >>