Data Structure

Each node stores a reference to an object that is an element of the sequence, as well as a reference to the next node of the list.

Singly Linked List Singly Linked List is a linear and connected data structure made of Nodes. Each node is composed of a variable data where its content (actual value) is stored and a pointer to the next Node (next node location) on the list. The Linked List has a pointer to the first element of this Node […]

Reverse String

This interview question requires you to reverse a string using recursion. Make sure to think of the base case here.

Queue

Given the Stack class below, implement a Queue class using two stacks

LIFO Last In First Out in Stack

Given a string of opening and closing parentheses, check whether it’s balanced. We have 3 types of parentheses: round brackets: (), square brackets: [], and curly brackets: {}.

Array

Given an array of integers (positive and negative) find the largest continuous sum.

Array

Consider an array of non-negative integers. A second array is formed by shuffling the elements of the first array and deleting a random element. Given these two arrays, find which element is missing in the second array.

Bio-Notation Visualize

Big-O Complexity for Python Data Structures

Bio-Notation Visualize

Big-O (in its simplest form) reduces the comparison between algorithms to a single variable. That variable is chosen based on observations or assumptions

Each node stores a reference to an object that is an element of the sequence, as well as a reference to the next node of the list.

Write a function to reverse a Linked List in place. The function will take in the head of the list as input and return the new head of the list.

Each node stores a reference to an object that is an element of the sequence, as well as a reference to the next node of the list.

Write a function that takes a head node and an integer value n and then returns the nth to last node in the linked list. For example, given: