educative.io

Data Structures in JavaScript: An Interview Refresher (Coderust)


Introduction to Complexity Measures - Other Common Asymptotic Notations and Why Big O Trumps Them This lesson introduces other members of the family of notations and why Big O is the most popular of them! View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5663204961157120/5699349795307520). Introduction to Arrays - Solution Review: Merge Two Sorted Arrays This review provides a detailed analysis of the different ways to solve the Merge Two Sorted Arrays challenge. View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5663204961157120/5704393160654848). Introduction to Arrays - Solution Review: Find Minimum Value in Array This review provides a detailed analysis of the different ways to find the minimum value in an array. View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5663204961157120/5734439678115840). Introduction to Graphs - Solution Review: Count the Number of Edges in a Graph This review provides a detailed analysis of the different ways to solve the Count the Number of Edges in Graph challenge​. View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5663204961157120/5736232826961920). Introduction to Graphs - Solution Review: Check if a Path Exists Between Two Vertices This review provides a detailed analysis of the different ways to solve the Check if a Path Exists Between Two Vertices challenge. View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5663204961157120/5654456649646080). Introduction to Trees - Solution Review: Find the ​Minimum Value in Binary Search Tree This review provides a detailed analysis of the different ways to solve the Find the Minimum Value in Binary Search Tree challenge. View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5663204961157120/5666224323166208). Introduction to Trees - Solution Review: Find the Height of a Binary Tree This review provides a detailed analysis of the different ways to solve the Find the Height of a Binary Tree challenge. View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5663204961157120/5714237762568192). Trie - Solution Review: Find All Words Stored in Trie This review provides a detailed analysis of the different ways to solve the Find All Words Stored in Trie Challenge. View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5663204961157120/5743939608903680). Introduction to Arrays - var vs. let vs. const Let's compare the var, let, and const keywords in JavaScript! View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5663204961157120/5745493850193920). Introduction to Linked Lists - Challenge 5 : Reverse a Linked List Can we implement a program which could reverse a linked list? Let’s find out. Introduction to Trees - Binary Search Tree Insertion (Implementation) In this lesson, we’ll study the implementation of Binary Search Tree insertion in JavaScript through the iterative and recursive approaches. Introduction to Stack/Queues - Challenge 6: Evaluate Postfix Expression Using a Stack Let’s try to compute postfix mathematical expressions using stacks! Introduction to Arrays - Solution Review : Right Rotate Array This review provides a detailed analysis of the different ways to solve the Right Rotate Array challenge View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5663204961157120/5701265350721536). Introduction to Heap - Min Heap (Implementation) We’ll implement a min heap in this lesson! Introduction to Hashing - The Hash Function This is the first building block of a hash table. Let's see how it works. View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5663204961157120/5758448008429568). Introduction to Graphs - Solution Review: Implement Depth First Search This review provides a detailed analysis of the different ways to solve the Implement Breadth First Search challenge. View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5663204961157120/5727060924301312). Introduction to Trees - Challenge 4: Find the Height of a Binary Tree Given the root to a Binary Search Tree, write a function to find the height of the tree. A solution is placed in the “solution” section for your help, but we would suggest you solve it on your own first. Trie - Challenge 1: Total Number of Words in a Trie For your first challenge regarding tries, you’ll be writing a commonly used function which gives us the trie word count. Introduction to Heap - Min Heap: Introduction This lesson will give a brief introduction to min heaps and how elements are inserted and removed from them. Introduction to Arrays - Arrays In this lesson, we define arrays and their methods in JavaScript! View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5663204961157120/5674804392755200). Trie - Structure of a Trie This lesson covers the structure of the Trie class in JavaScript. Introduction to Trees - 2-3 Deletion (Case #1) This lesson will cover the deletion operation in 2-3 trees, discussing all four scenarios based on the position of the element that needs to be deleted. Introduction to Complexity Measures - Challenge 3: Big (O) of Nested Loop with Multiplication Compute Big(O) of an algorithm involving nested loops and the loop variables increment with multiplication. Introduction to Linked Lists - Solution Review: Search in a Singly Linked List This review provides a detailed analysis of the different ways to solve the Search in a Singly Linked List challenge. View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5663204961157120/5679350280093696). Introduction to Linked Lists - Basic Linked List Operations This lesson lists the various operations that can be performed on linked lists View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5663204961157120/5728526581891072). Introduction to Heap - Max Heap: Introduction This lesson will give a brief introduction to Max-Heaps and how their elements are inserted or removed from Max-Heaps. Introduction to Graphs - Challenge 1: Implement Breadth First Search Now, we shall build the BFS algorithm in JavaScript code. Introduction to Graphs - What is a Graph? This lesson is a brief introduction to the graph data structure, its types and the standard terminologies used to describe it. Introduction to Trees - Solution Review: Find Nodes at "k" Distance From the Root This review provides a detailed analysis of the different ways to solve the Find Nodes at "k" Distance From the Root challenge. View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5663204961157120/5675342538735616). Introduction to Trees - Post-Order Traversal In this lesson, we will cover Post-Order Traversal in a Binary Search Tree and implement it in JavaScript. Introduction to Trees - Trees Quiz: Test Your Understanding of Trees The top ten most commonly asked interview questions about trees​ will be covered in this lesson in the​ ​form of a quiz. Introduction to Trees - 2-3-4 Trees This lesson is a brief introduction to 2-3-4 Trees. We will discuss its key features and take a look at some examples. Introduction to Hashing - Hashing Quiz: Test Your Understanding of Hashing The top ten most commonly asked interview questions about hashing will be covered in this lesson in the ​form of a quiz. Introduction to Heap - Solution Review: Find k Largest Elements in an Array This review provides a detailed analysis of the way to solve the Find k largest elements in an Array Challenge. View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5663204961157120/5736829290545152). Introduction to Arrays - Challenge 4: Array of Products of All Elements Given an array, return an array where each index stores the product of all numbers in the array except the number at the index itself. Introduction to Graphs - Challenge 3: Detect Cycle in Graph Here’s another coding challenge on graphs. You’ll implement a cool function which detects loops! Introduction to Trees - What is a Binary Search Tree (BST)? This lesson will introduce Binary Search Trees and their properties. Introduction to Graphs - Solution Review: Check if a Graph is a Tree or Not This review provides a detailed analysis of the different ways to solve the Check if a Graph is a Tree or Not Challenge. View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5663204961157120/5719980670713856). Introduction to Trees - In-Order Traversal In this lesson, we will cover In-Order Traversal and implement it in JavaScript. Introduction to Linked Lists - Linked Lists vs. Arrays Let's pit the two data structures against each other to find out which is more efficient. View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5663204961157120/5696228427825152). Introduction to Stack/Queues - What is a Queue? This lesson gives an introduction to the queue data structure, its various uses, and types. We will also go through the inner workings of a Queue by briefly discussing each of its functions. Introduction to Stack/Queues - Stack/Queue Quiz: Test Your Understanding of Stack/Queue The top ten most commonly asked interview questions about stack and queue will be covered in this lesson in the form of a quiz. Introduction to Linked Lists - Solution Review: Deletion by Value This review provides a detailed analysis of the different ways to solve the Deletion by Value challenge. View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5663204961157120/5161132411060224). Introduction to Graphs - Graph Implementation This lesson will cover the implementation of a unidirectional graph via an adjacency list in JavaScript. We will also go through the time complexity of basic graph operations. Introduction to Trees - What is a 2-3 Tree? This lesson is an introduction to 2-3 trees and its properties, along with an example and the basic operations that this data structure offers. Introduction to Linked Lists - Solution Review: Detect a Loop in a Linked List This review provides a detailed analysis of the different ways to solve the Detect a Loop in a Linked List challenge. View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5663204961157120/6287032317902848). Introduction to Stack/Queues - Solution Review: Reversing First k Elements of Queue This review provides a detailed analysis of the different ways to solve the Reversing First k Elements of Queue challenge. View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5663204961157120/5700812231671808). Introduction to Stack/Queues - Challenge 9: min() Function Using a Stack Using your knowledge, create an efficient min() function using a stack. Introduction to Stack/Queues - Stack (Implementation) In this lesson, we are going to look at how Stacks are implemented in JavaScript and how the main Stack functions actually work. Trie - Solution Review: Array Sort Using Tries This review provides a detailed analysis of the different ways to solve the Array Sort Using Tries Challenge. View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5663204961157120/5707166098915328). Introduction to Hashing - Solution Review: Find Symmetric Pairs in an Array This review provides a detailed analysis of the different ways to solve the Find Symmetric Pairs in an Array Challenge. View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5663204961157120/5681162219421696). Introduction to Linked Lists - Solution Review: Return the Nth Node for the End This review provides a detailed analysis of the different ways to solve the Detect a Loop in a Linked List challenge. View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5663204961157120/6197310451089408). Introduction to Graphs - Complexities of Graph Operations Let's discuss the performance of the two graph representation approaches. View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5663204961157120/5690373313658880). Trie - Insertion in a Trie This lesson defines all the cases needed for inserting a word into a trie, along with the JavaScript implementation. Introduction to Stack/Queues - Challenge 7: Next Greater Element Using a Stack Using a stack, can you implement a function to find the next greater element after any given element in an array? Introduction to Graphs - Solution Review: Implement Breadth First Search This review provides a detailed analysis of the different ways to solve the Implement Breadth First Search challenge. View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5663204961157120/5660403031867392). Introduction to Graphs - Representation of Graphs Two approaches to represent a graph will be covered in this lesson. Summary of Data Structures - Conclusion That's a wrap! View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5663204961157120/5744981138472960). Introduction to Graphs - Challenge 9: Remove Edge In this challenge, we will learn how to delete an edge between two vertices. View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5663204961157120/5710396451192832). Introduction to Trees - Red-Black Tree Deletion This lesson will cover the deletion function of Red-Black trees and will discuss all four deletion cases. Introduction to Stack/Queues - Solution Review: Implement a Queue Using Stacks This review provides a detailed analysis of the different ways to solve the Implement a Queue Using Stacks challenge. View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5663204961157120/5673461879930880). Introduction to Graphs - Solution Review: Remove Edge This review provides a detailed analysis of the different ways to solve the Remove Edge challenge. View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5663204961157120/5124732563226624). Introduction to Arrays - Solution Review: Find Second Maximum Value in an Array This review provides a detailed analysis of the different ways to solve the Find Second Maximum Value in an Array challenge. View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5663204961157120/5132285263216640). Trie - Challenge 3: Array Sort Using Tries This lesson is about sorting string arrays using tries. Trie - What is a Trie? This lesson gives a brief introduction to tries, their properties, and common applications. Introduction to Linked Lists - Challenge 3: Deletion by Value Based on how we handled the deletion at head strategy, let’s write the function for deletion by value. Introduction to Arrays - Solution Review: First Non-Repeating Integer in an Array This review provides a detailed analysis of the different ways to solve the First Non-Repeating Integer in an Array challenge. View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5663204961157120/5635792869261312). Introduction to Trees - Implementing a Binary Search Tree in JavaScript In this lesson, we'll implement a very basic Binary Search Tree in JavaScript. View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5663204961157120/5755997729587200). Introduction to Hashing - Solution Review: An Array as a Subset of Another Array This review provides a detailed analysis of the different ways to solve the An Array as a Subset of Another Array challenge. View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5663204961157120/5644534738321408). Introduction to Linked Lists - Solution Review: Reverse a Linked List This review provides a detailed analysis of the different ways to solve the Reverse a Linked List challenge. View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5663204961157120/5122237187227648). Introduction to Trees - What is an AVL Tree? This lesson is a brief introduction to AVL trees, why they are used, and what makes them more efficient than regular binary search trees Introduction to Complexity Measures - Common Complexity Scenarios This lesson summarizes our discussion of complexity measures and includes some commonly used examples and handy formulas to help you with your interview. Introduction to Linked Lists - Singly Linked Lists vs. Doubly Linked Lists Let's see how the two renditions of the linked list structure fare against each other. View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5663204961157120/5743314154291200). Introduction to Graphs - Challenge 4: Find "Mother Vertex" in a Graph Given a graph, can you find a vertex which shares a common edge with all the other vertices? Introduction to Trees - AVL Deletion This lesson will cover the deletion operation in AVL trees, discussing all four deletion cases. Trie - Search in a Trie This lesson defines the algorithm for a word search in a trie. It also highlights the different scenarios taken care of in the algorithm. Introduction to Hashing - Challenge 3: Find Symmetric Pairs in an Array Now we will implement a symmetry detection algorithm using hash tables. Introduction to Heap - Challenge 3: Find k Largest Elements in an Array If you are given an array and any number “k”, can you write a code to find the first “k” largest elements using max-heap? Introduction to Hashing - Challenge 5: Find Two Pairs in an Array Such That a+b = c+d If you are given an array, can you find two pairs such that their sum is equal? Trie - Trie Quiz: Test Your Understanding of Tries We’re at the end of our discussion on tries. Here are a few follow up questions to reinforce your concepts. Introduction to Stack/Queues - Queue (Implementation) Let’s look at the basic functionality and implementation of queues in JavaScript! Introduction to Graphs - What is a Bipartite Graph? Now, we’ll be introduced to a unique graph called the bipartite graph. We will also take a look at some examples to better understand the concept. Introduction to Complexity Measures - Challenge 6: Nested Loop with Multiplication (Pro) A pro-level exercise based on Big(O) of an algorithm involving nested loops and the loop variables increment with multiplication and addition. Introduction to Arrays - Solution Review: Remove Even Integers From an Array This review provides a detailed analysis of the different ways to solve the Remove Even Integers From an Array challenge. View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5663204961157120/5698311486963712). Introduction to Arrays - Solution Review : Array of Products of All Elements This review provides a detailed analysis of the different ways to solve the array of products of all elements challenge! View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5663204961157120/5639868793225216). Introduction to Linked Lists - Singly Linked Lists (SLL) This lesson is a brief introduction to the functionality and purpose of the popular data structure called linked lists. Introduction to Stack/Queues - Solution Review: Check Balanced Parentheses using Stack This review provides a detailed analysis of the solution to solve the Check Balanced Parentheses using Stack challenge. View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5663204961157120/5754980359208960). Introduction to Graphs - Solution Review: Find the Shortest Path Between Two Vertices This review provides a detailed analysis of the different ways to solve the Find the Shortest Path Between Two Vertices challenge. View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5663204961157120/5687682516647936). Introduction to Trees - Pre-Order Traversal In this lesson, we will cover the traversal strategy, ‘Pre-Order Traversal’, in a Binary Search Tree and implement it in JavaScript. Introduction to Stack/Queues - Solution Review: Evaluate Postfix Expression Using a Stack This review provides a detailed analysis of the different ways to solve the Evaluate Postfix Expression Using Stack challenge. View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5663204961157120/5719074432614400). Introduction to Hashing - Solution Review: A Subarray with a Sum of 0 This review provides a detailed analysis of the different ways to solve the A Subarray with a Sum of 0 challenge. View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5663204961157120/5705944180719616). Introduction to Trees - Challenge 2: Find the kth Maximum Value in a Binary Search Tree Given the root to a Binary Search Tree and a number “k”, write a function to find the kth maximum value in the tree. A solution is placed in the “solution” section for your help, but we would suggest you solve it on your own first. Introduction to Linked Lists - Challenge 4: Find the Length of a Linked List Let’s write a function to tell us the length of a linked list. Introduction to Hashing - Solution Review: Find Two Pairs Such That a+b = c+d This review provides a detailed analysis of the different ways to solve the Find Two Pairs Such That a+b = c+d challenge. View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5663204961157120/5633049995771904). Introduction to Trees - What is a Binary Tree? An introduction to binary trees, and different types of binary trees. Introduction to Linked Lists - Challenge 6: Detect Loop in a Linked List Loops in linked lists can be dangerous. Now, you’ll create an algorithm to detect them. Trie - Solution Review: Word Formation from a Dictionary Using a Trie This review provides a detailed analysis of the different ways to solve the Word Formation from a Dictionary Using a Trie Challenge. View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5663204961157120/5667240082931712). Introduction to Hashing - What is a Hash Table? This lesson is a brief introduction to the hash table data structure and the basic principles behind implementing it. Introduction to Linked Lists - Challenge 8: Remove Duplicates from Linked List In this lesson, you must figure out the JavaScript solution for removing duplicates from a linked list. Introduction to Linked Lists - Solution Review: Insertion at Tail This review provides a detailed analysis of the different ways to solve the Insertion at Tail challenge. View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5663204961157120/5712679226310656). Introduction to Linked Lists - Challenge 7: Find Middle Value of Linked List Here’s another interesting coding challenge to test your knowledge on linked lists. Introduction to Graphs - Types of Graphs This lesson showcases the two main categories of graphs. View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5663204961157120/5652096565116928). Introduction to Arrays - Solution Review : Rearrange Sorted Array in Max/Min Form This review provides a detailed analysis of the different ways to solve the Rearrange Sorted Array in Max/Min Form challenge View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5663204961157120/5737480514961408). Introduction to Hashing - Challenge 2 : Check if Arrays are Disjointed Building upon the previous challenge, we will learn how to check if two arrays are disjointed. Introduction to Linked Lists - Solution Review: Union and Intersection of Linked Lists This review provides a detailed analysis of the different ways to solve the Union and Intersection of Linked Lists challenge. View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5663204961157120/5187211452481536). Introduction to Graphs - Solution Review: Detect Cycle in Graph This review provides a detailed analysis of the different ways to solve the Detect a Cycle in a Graph challenge. View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5663204961157120/5641906755207168). Introduction to Graphs - Challenge 5: Count the Number of Edges in a Graph In this lesson, we will figure out if it’s possible to count the total number of edges in a graph. Introduction to Hashing - Solution Review: Check if Arrays are Disjointed This review provides a detailed analysis of the different ways to solve the Check if Arrays are Disjointed challenge. View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5663204961157120/5710161838604288). Introduction to Complexity Measures - Complexity Measures This chapter will cover different types of complexity measures, such as Big(O), and their uses. View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5663204961157120/5695219446054912). Introduction to Hashing - Challenge 4: Trace the Complete Path of a Journey Test your knowledge on hash table traversal with this coding exercise! Introduction to Linked Lists - Challenge 2: Search in a Singly Linked List This lesson explains how searching is done in a singly linked list. There is also a coding exercise to test your concepts. Introduction to Complexity Measures - Challenge 2: Big (O) of Nested Loop with Subtraction Compute Big(O) of an algorithm involving nested loops and the loop variables decrement with subtraction. Introduction to Complexity Measures - Challenge 5: Nested Loop with Multiplication (Complex) A more complex exercise based on Big(O) of an algorithm which involves nested loops and the loop variables increment with multiplication. Introduction to Stack/Queues - Solution Review: Generate Binary Numbers Using a Queue This review provides a detailed analysis of the different ways to solve the Generate Binary Numbers from 1 to n using a Queue challenge. View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5663204961157120/5717244776546304). Introduction to Graphs - Graph Traversal Algorithms In this lesson, we will learn the basic logic behind graph traversal and we will see how it applies to the two most famous graph traversal algorithms. Introduction to Heap - Solution Review: Convert Max-Heap to Min-Heap This review provides a detailed analysis of the way to solve the Convert Max-Heap to Min-Heap Challenge. View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5663204961157120/6332798952538112). Introduction to Hashing - Add/Remove & Search in Hash Table (Implementation) This lesson will cover the JavaScript Implementation for search, insertion and deletion in hash tables. Introduction to Complexity Measures - Solution Review: Big (O) of Nested Loop with Addition This review provides a detailed analysis of the time complexity of the Nested Loop with Addition problem! View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5663204961157120/5765183054020608). Introduction to Arrays - Challenge 3: Find Two Numbers that Add up to "n" Given an array and a number <code>n</code>, find two numbers from the array that sum to <code>n</code>. Implement your solution in JavaScript and see if your output matches with the correct output. Introduction to Stack/Queues - Challenge 3: Reversing First k Elements of Queue Can you reverse the first “k” elements in a given queue? A solution is placed in the “solution” section for your help, but we would suggest you solve it on your own first. Introduction to Trees - Challenge 1: Find the Minimum Value in a Binary Search Tree Given the root to a Binary Search Tree, write a function to find the minimum value in that tree. A solution is placed in the “solution” section for your help, but we would suggest you solve it on your own first. Introduction to Trees - Deletion in Binary Search Tree In this lesson, we are going to learn how nodes are deleted in binary search trees. We will take a look at a few node deletion scenarios and what to do in each one. Introduction to Trees - Overview of Trees A quick overview of trees, their types, and some important formulas to compute height and number of nodes in a tree. Trie - Challenge 2: Find All Words Stored in Trie If you are given a trie, can you return every word it contains? Introduction to Arrays - Arrays Quiz: Test Your Understanding of Arrays The top ten most commonly asked interview questions about arrays will be covered in this lesson in the form of a quiz. Introduction to Arrays - Challenge 10 : Rearrange Sorted Array in Max/Min Form Arrange elements in such a way that the maximum element appears at first, then minimum at second, then second maximum at third position and second minimum at fourth and so on. Introduction to Heap - What is a Heap? A brief introduction to heaps and their uses. We will also discuss the heap property and how a heap is implemented. Introduction to Arrays - Challenge 5 : Find Minimum Value in Array Given an array of size “n”: can you find the minimum value in the array? Implement your solution in JavaScript and see if your output matches the expected output. Introduction to Heap - Max Heap (Implementation) Let’s implement a max heap! Trie - Deletion in a Trie After insertion and search, let’s figure out the logic behind deletion in tries. Introduction to Trees - More on Complete Binary Trees In this lesson, we are going to discuss what Complete Binary Trees are and how elements are inserted into them. Introduction to Trees - Deletion in Binary Search Tree (Implementation) We will now write the implementation of the delete function which covers all the cases that we discussed previously. Introduction to Trees - 2-3 Insertion This lesson will explain how insertion is done in 2-3 Trees based on multiple scenarios that are explained with the insertion algorithm. Introduction to Graphs - Challenge 2: Implement Depth First Search After the BFS algorithm, we will now tackle the implementation for Depth First Search. Introduction to Linked Lists - Doubly Linked Lists (DLL) After singly linked lists, we’ve come to the more evolved version of the linked list data structure: doubly linked lists. Trie - Challenge 4: Word Formation from a Dictionary Using Trie This is a more advanced problem regarding tries and shows us the efficiency of this data structure in word matching. Introduction to Heap - Heap Quiz: Test Your Understanding of Heaps Here are the top ten most commonly asked interview questions on heaps! Summary of Data Structures - Overview of Linear & Non-Linear Data Structures In this lesson, we will review the ​time complexities of the data structures we have studied. We will also categorize them into linear and non-linear data structures. Introduction to Linked Lists - Challenge 10: Return the Nth Node from the End Returning the Nth node from the start of a linked list is easy. Can you return Nth node from the end of a list? Introduction to Complexity Measures - Solution Review: Big (O) of Nested Loop with Subtraction This review provides a detailed analysis of the time complexity of the Nested Loop with Subtraction problem! View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5663204961157120/5633722695024640). Introduction to Trees - Red-Black Tree Insertion This lesson will cover the insertion operation in Red-Black trees, discussing all four insertion cases. Introduction to Stack/Queues - Solution Review: Sort Values in Stack This review provides a detailed analysis of the different ways to solve the Sort Values in a Stack challenge. View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5663204961157120/5653241173901312). Introduction to Stack/Queues - Solution Review: Next Greater Element Using a Stack This review provides a detailed analysis of the different ways to solve the Next Greater Element Using a Stack challenge. View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5663204961157120/5689765575786496). Introduction to Trees - What Makes a Tree 'Balanced'? In this chapter, we are going to study what makes a tree balanced. We are also going to look at a high-level description of the algorithm used to determine if a given tree is balanced. Introduction to Hashing - Challenge 1: An Array as a Subset of Another Array Can you find whether a given array is a subset of another array by using a hash table? Introduction to Complexity Measures - Example 1: Measuring Time Complexity In this lesson, we are going to learn how to compute the running time complexity of an algorithm that involves loops. View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5663204961157120/5691082318807040). Introduction to Stack/Queues - Solution Review: Implementing Two Stacks Using One Array This review provides a detailed analysis of the different ways to solve the Implementing Two Stacks Using One Array challenge. View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5663204961157120/5738522044530688). Introduction to Graphs - Challenge 8: Find the Shortest Path Between Two Vertices We’ve dealt with several graph traversals. Now, we’ll find the shortest path traversal between two vertices. Introduction to Stack/Queues - Solution Review: min() Function Using a Stack This review provides a detailed analysis of the different ways to solve the min() Function Using a Stack challenge. View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5663204961157120/5643517367943168). Introduction to Complexity Measures - Introduction to Asymptotic Analysis and Big O Asymptotic analysis is a way to classify the running time complexity of algorithms. View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5663204961157120/5642165526986752). Introduction to Complexity Measures - Solution Review: Nested Loop with Multiplication (Pro) This review provides a detailed analysis of the different ways to solve the Nested Loop with Multiplication (Pro) challenge. View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5663204961157120/5650387168133120). Introduction to Arrays - Challenge 7: Find Second Maximum Value in an Array Given an array of size n, can you find the second maximum element in the array? Implement your solution in JavaScript and see if your output matches the correct output! Introduction to Linked Lists - Challenge 1: Insertion at Tail Now, we’ll tackle the second insertion strategy in linked lists. However, you will be the one implementing it! Introduction to Hashing - Trees vs Hash Tables This lesson highlights the differences between trees and hash tables. Introduction to Complexity Measures - Example 2: Measuring Time Complexity Compute the time complexity of a given algorithm with nested loops. View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5663204961157120/5731601040277504). Introduction to Complexity Measures - Useful Formulas In this lesson, we'll study some mathematical formulae to make calculating time complexity easier! View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5663204961157120/5675494473203712). Introduction to Stack/Queues - Challenge 1:​ Generate Binary Numbers Using a Queue Can you generate binary numbers from 1 to any given number “n”? Introduction to Trees - Searching in a Binary Search Tree (Implementation) This lesson is about Searching in a Binary Search Tree and how to implement searching functionality in JavaScript. Introduction to Arrays - Challenge 1: Remove Even Integers From an Array Given an array of size n, remove all even integers from it. Implement this solution in JavaScript and see if it runs without an error. Introduction to Hashing - Building a Hash Table from Scratch This lesson is about how hash tables are implemented in JavaScript. Introduction to Graphs - Challenge 6: Check if a Path Exists Between Two Vertices Given a graph and two vertices, can you write a code to check if a path exists between the two vertices? Introduction to Complexity Measures - Solution Review: Nested Loop with Multiplication (Complex) This review provides a detailed analysis of the different ways to solve the Nested Loop with Multiplication (Complex) challenge View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5663204961157120/5742058950098944). Introduction to Complexity Measures - Solution Review: Big (O) of Nested Loop with Multiplication This review provides a detailed analysis of the different ways to solve the Big (O) of Nested Loop with Multiplication Quiz. View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5663204961157120/5705431468998656). Introduction to Complexity Measures - Challenge 4: Nested Loop with Multiplication (Advanced) An advanced exercise based on the Big(O) of an algorithm involving nested loops and the loop variables increment with multiplication. Introduction to Hashing - Collisions in Hash Tables This lesson is about how collisions occur in hashing and the common strategies used in resolving these collisions. Introduction to Complexity Measures - Solution Review: Nested Loop with Multiplication (Advanced) This review provides a detailed analysis of the different ways to solve the nested loop with multiplication (Advanced) problem View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5663204961157120/5666536245166080). Introduction to Trees - An Introduction to Trees and Basic Tree Properties! In this chapter, we are going to study the basics of the tree data structure! Introduction to Trees - Binary Search Tree Insertion In this lesson, we’ll study the binary search tree insertion algorithm! Introduction to Trees - Skewed Binary Tree In this lesson, we will discuss another type of Binary Tree called a Skewed Binary Tree. We will look at some of its properties and types. Introduction to Linked Lists - Solution Review: Find the Length of a Linked List This review provides a detailed analysis of the different ways to solve the Find the Length of a Linked List challenge. View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5663204961157120/5685187140648960). Trie - Solution Review: Total Number of Words in a Trie This review provides a detailed analysis of the different ways to solve the Total Number of Words in a Trie Challenge. View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5663204961157120/5678724825481216). Introduction to Graphs - Graph Quiz: Test Your Understanding of Graphs Here are the ten most commonly asked interview questions about graphs. Introduction to Complexity Measures - Challenge 1: Big (O) of Nested Loop with Addition Compute the Big O complexity of an algorithm involving nested loops where the loop variables increase with addition. Introduction to Complexity Measures - Complexity Quiz: Test Your Understanding of Complexity The top ten most commonly asked interview questions about Complexity Measures will be covered in this lesson in the form of a quiz. Introduction to Heap - Challenge 1: Convert Max-Heap to Min-Heap Given a max-heap convert it into a min-heap. A solution is placed in the “solution” section for your help, but we would suggest you ​solve it on your own first. Introduction to Stack/Queues - What is a Stack? An introduction to the Stack data structure, its uses, and functionality. Introduction to Arrays - Challenge 8 : Right Rotate Array Given an array, can you rotate its elements from right to left by one index? Implement your solution in JavaScript and see if your code runs successfully! Introduction to Trees - AVL Insertion This lesson will cover the insertion operation in AVL trees, discussing the four insertion cases. Introduction to Linked Lists - Singly Linked List Deletion After insertion and search, we’ll be tackling the concept of deletion in a linked list. Introduction to Stack/Queues - Challenge 5: Sort Values in a Stack In this lesson, we will learn how to sort elements using a stack. Introduction to Stack/Queues - Challenge 2: Implement Two Stacks using one Array Can you implement two stacks using a single array? A solution is placed in the “solution” section for your help, but we would suggest you solve it on your own first. Introduction to Trees - Challenge 3: Find Ancestors of a Given Node in Binary Tree If you are given the root to a Binary Search Tree and a node value “k”, can you write a code to find the ancestor of that node? A solution is placed in the “solution” section for your help, but we would suggest you solve it on your own first. Introduction to Stack/Queues - Challenge 4: Implement a Queue Using Stacks We have seen the difference between stacks and queues, but is it possible to make one from the other? Let’s find out. Introduction to Arrays - Challenge 9: Rearrange Positive & Negative Values Given an array, can you re-arrange its elements in such a way that the negative elements appear at one side and positive elements appear in the other? Solve this problem in JavaScript and see if your code runs correctly! Introduction to Arrays - Challenge 2: Merge Two Sorted Arrays Given two sorted arrays, merge them into one array that is sorted. Implement the solution in JavaScript to see if your code runs successfully! Introduction to Linked Lists - Solution Review: Find Middle Value of a Linked List This review provides a detailed analysis of the different ways to solve the Find the Middle Value in a Linked List challenge. View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5663204961157120/5634360497668096). Introduction to Linked Lists - Solution Review: Remove Duplicates from a Linked List This review provides a detailed analysis of the different ways to solve the Remove Duplicates from a Linked List challenge. View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5663204961157120/5071410544246784). Introduction to Arrays - Solution Review: Find Two Numbers That Add up to "n" This review provides a detailed analysis of the different ways to solve the Find Two Numbers That Add up to "n" challenge. View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5663204961157120/5739975890960384). Introduction to Arrays - Challenge 6: First Non-Repeating Integer in an Array Given an array, find the first integer which is unique in the array. Unique means the number does not repeat and appears only once in the whole array. Implement your solution in JavaScript and see if it runs correctly! Introduction to Arrays - Solution Review: Rearrange Positive & Negative Values This review provides a detailed analysis of the different ways to solve the Rearrange Positive & Negative Values challenge. View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5663204961157120/5672265731538944). Introduction to Linked Lists - Singly Linked List Insertion Let’s look at the JavaScript implementation for the insertion of a node in a linked list. Introduction to Heap - Solution Review: Find k Smallest Elements in an Array This review provides a detailed analysis of the way to solve the Find k smallest Elements in an Array challenge. View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5663204961157120/5670377556541440). Introduction to Graphs - Solution Review: Find "Mother Vertex" in a Graph This review provides a detailed analysis of the different ways to solve the Find "Mother Vertex" in a Graph challenge. View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5663204961157120/5703702744662016). Introduction to Graphs - Challenge 7: Check if the Given Graph is Tree or Not? In this lesson, we will learn the difference between a graph and a tree. You will use this knowledge for the challenge below. Introduction to Trees - Solution Review: Find kth Maximum Value in Binary Search Tree This review provides a detailed analysis of the different ways to solve the Find kth Maximum Value in Binary Search Tree challenge. View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5663204961157120/5722608653828096). Introduction to Hashing - Challenge 6: A Subarray with a Sum of 0 In this exercise, we will find a subarray whose sum turns out to be zero. Let’s try it out! Introduction to Linked Lists - Challenge 9: Union & Intersection of Linked Lists In this lesson, linked lists meet data set operations. Introduction to Linked Lists - Linked Lists Quiz: Test Your Understanding of Linked Lists The top ten most commonly asked interview questions about linked lists will be covered in this lesson in the form of a quiz. Introduction to Stack/Queues - Challenge 8: Check Balanced Parentheses Using Stack If you are given an expression, can you check if its parentheses are balanced? A solution is placed in the “solution” section for your help, but we would suggest you solve it on your own first. Introduction to Trees - 2-3 Deletion (Case #2) How do we delete an element present in an internal node? It will be explained in this lesson with the help of an example. Introduction to Trees - Solution Review: Find Ancestors of a Given Node in a Binary Tree This review provides a detailed analysis of the different ways to solve the Find Ancestors of a Given Node in a Binary Tree challenge View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5663204961157120/5742571661819904). Introduction to Trees - Challenge 5: Find Nodes at "k" Distance From the Root If you are given the root to a Binary Search Tree and a node value “k”, can you write a code to find the nodes at “k” distance from the root? A solution is placed in the “solution” section for your help, but we would suggest you ​solve it on your own first. Introduction to Hashing - A Quick Overview of Hash Tables Let’s combine the different operations discussed previously and test out the functionality of our complete hash table class. Introduction to Hashing - Solution Review: Trace the Complete Path of a Journey This review provides a detailed analysis of the way to solve the Trace the Complete Path of a Journey challenge. View the lesson [here](https://www.educative.io/collection/page/5642554087309312/5663204961157120/5746196614217728). Introduction to Trees - What is a Red-Black Tree? This lesson is an introduction to Red-Black trees, their properties, and the total time they take to perform the operations of insertion, deletion and searching. We will also do a small comparison between AVL and Red-Black Trees. Introduction to Heap - Challenge 2: Find k Smallest Elements in an Array Given an array and a number “k”, write a function that returns the first “k” smallest elements using a min-heap.
About the Data Structures in JavaScript: An Interview Refresher (Coderust) category [Data Structures in JavaScript: An Interview Refresher (Coderust)] (1)
Error in the solution #3 [Introduction to Stack/Queues - Solution Review: Implement a Queue Using Stacks] (2)
Why aren't Objects covered? [Data Structures in JavaScript: An Interview Refresher (Coderust)] (2)
Why is the number of primitive ops for sum += 1 equal to three? [Introduction to Complexity Measures - Complexity Measures] (2)
Why my solution fails and what is its run time [Introduction to Arrays - Solution Review: Merge Two Sorted Arrays] (2)
Question about method .printList() on lesson "Single Linked List Insertion" [Introduction to Linked Lists - Singly Linked List Insertion] (1)
Time complexity with for loop and splice [Introduction to Arrays - Solution Review: Remove Even Integers From an Array] (1)
Test Comparing Value Incorrectly [Introduction to Trees - Challenge 3: Find Ancestors of a Given Node in Binary Tree] (3)
Bug in the testing? [Introduction to Trees - Challenge 3: Find Ancestors of a Given Node in Binary Tree] (2)
there can be multiple mother vertices. [Introduction to Graphs - Challenge 4: Find "Mother Vertex" in a Graph] (2)