Beginner

225 Lessons

35h

Certificate of Completion

Looking to Train your Team?

Empower your engineers to reach their potential faster.

Data structures are amongst the fundamentals of Computer Science and an important decision in every program. Consequently, they are also largely categorized as a vital benchmark of computer science knowledge when it comes to industry interviews. This course contains a detailed review o...

Hands-on coding environments

You donâ€™t get better at swimming by watching others. Coding is no different. Practice as you learn with live code environments inside your browser.

Faster than videos

Videos are holding you back. The average video tutorial is spoken at 150 words per minute, while you can read at 250. Thatâ€˜s why our courses are text-based.

No set-up required

Start learning immediately instead of fiddling with SDKs and IDEs. Itâ€˜s all on the cloud.

Progress you can show

Built-in assessments let you test your skills. Completion certificates let you show them off.

Hands-on coding environments

You donâ€™t get better at swimming by watching others. Coding is no different. Practice as you learn with live code environments inside your browser.

Faster than videos

Videos are holding you back. The average video tutorial is spoken at 150 words per minute, while you can read at 250. Thatâ€˜s why our courses are text-based.

No set-up required

Start learning immediately instead of fiddling with SDKs and IDEs. Itâ€˜s all on the cloud.

Progress you can show

Built-in assessments let you test your skills. Completion certificates let you show them off.

Comparing AlgorithmsExample: Measuring Time Complexity of a Single Loop AlgorithmExample: Time Complexity of an Algorithm With Nested LoopsIntroduction to Asymptotic Analysis and Big OOther Common Asymptotic Notations and Why Big O Trumps ThemUseful FormulaeCommon Complexity ScenariosChallenge: Big (O) of Nested Loop with AdditionSolution: Big O of a Nested Loop with AdditionChallenge: Big (O) of Nested Loop with SubtractionSolution: Big O of a Nested Loop with SubtractionChallenge: Big O of Nested Loop with MultiplicationSolution: Big O of Nested Loop with MultiplicationChallenge: Nested Loop with Multiplication (Basic)Solution: Nested Loop with Multiplication (Basic)Challenge: Nested Loop with Multiplication (Intermediate)Solution: Nested Loop with Multiplication (Intermediate)Challenge: Nested Loop with Multiplication (Advanced)Solution: Nested Loop with Multiplication (Advanced)Challenge: Nested Loop with Multiplication (Pro)Solution: Nested Loop with Multiplication (Pro)Complexity Interview Questions

What is an Array?Two Dimensional ArraysChallenge: Remove Even Integers from an ArraySolution: Remove Even Integers from an ArrayChallenge: Merge Two Sorted ArraysSolution: Merge Two Sorted ArraysChallenge: Find Two Numbers that Add up to "n"Solution: Find Two Numbers that Add up to "n"Challenge: Array of Products of All Elements Except ItselfSolution: Array of Products of All Elements Except ItselfChallenge: Find Minimum Value in ArraySolution: Find Minimum Value in an ArrayChallenge: First Non-Repeating Integer in an ArraySolution: First Non-Repeating Integer in an ArrayChallenge: Find Second Maximum Value in an ArraySolution: Find Second Maximum Value in an ArrayChallenge: Right Rotate the Array by One IndexSolution: Right Rotate the Array by One IndexChallenge: Re-arrange Positive & Negative ValuesSolution: Re-arrange Positive & Negative ValuesChallenge: Rearrange Sorted Array in Max/Min FormSolution: Re-arrange Sorted Array in Max/Min FormChallenge: Find the Sum of Maximum Sum SubarraySolution: Find the Sum of Maximum Sum SubarrayArray Interview Questions

What is the Singly Linked List (SLL)?Basic Linked List OperationsInsertion in a Singly Linked ListChallenge: Insertion in a Singly Linked List (Insert at End)Solution: Insertion in a Singly Linked List (Insert at End)Insertion in Singly Linked List (Insert After)Challenge: Search in Singly Linked ListSolution: Search in a Singly Linked ListSingly Linked List Deletion (Implementation)Challenge: Deletion in Singly Linked List (Delete by Value)Solution: Deletion in Singly Linked ListLinked Lists vs. ArraysWhat is a Doubly Linked List (DLL)?Linked List with TailChallenge: Find the Length of a Linked ListSolution: Find the Length of a Linked ListChallenge: Reverse a Linked ListSolution: Reverse a Linked ListChallenge: Detect Loop in a Linked ListSolution: Detect Loop in a Linked ListChallenge: Find the Middle Node of a Linked ListSolution: Find the Middle Node of a Linked ListChallenge: Remove Duplicates from a Linked ListSolution: Remove Duplicate from a Linked ListChallenge: Union & Intersection of ListsSolution: Union & Intersection of ListsChallenge: Return the Nth Node from EndSolution: Return the Nth Node from EndChallenge: Find if Doubly Linked-list is a PalindromeSolution: Find if a Doubly Linked-list is a PalindromeLinked list Interview Questions

What is a Stack?Stack (Implementation)What is a Queue?Queue (Implementation)Challenge: Generate Binary Numbers from 1 to n Using a QueueSolution: Generate Binary Numbers from 1 to n Using QueueChallenge: Implement Two Stacks Using One ArraySolution: Implement Two Stacks Using One ArrayChallenge: Reversing the First k Elements of a QueueSolution: Reversing the First k Elements of a QueueChallenge: Implement Queue Using StackSolution: Implement Queue Using StackChallenge: Sort the Values in a StackSolution: Sort the Values in a StackChallenge: Evaluate Postfix Expressions Using StacksSolution: Evaluate Postfix Expressions Using StacksChallenge: Next Greater Element Using StackSolution: Next Greater Element Using StackChallenge: Solve a Celebrity Problem Using a StackSolution: Solve a Celebrity Problem Using a StackChallenge: Check for Balanced Parentheses Using a StackSolution: Check for Balanced Parentheses Using a StackChallenge: Create Stack Where min() Gives Minimum in O(1)Solution: Create Stack Where min() Gives Minimum in O(1)Stack/Queue Interview Questions

What is a Graph?Representation of GraphsGraph ImplementationComplexities of Graph OperationsWhat is a Bipartite Graph?Graph Traversal AlgorithmsChallenge: Implement Breadth First SearchSolution: Implement Breadth First SearchChallenge: Implement Depth First SearchSolution: Implement Depth First SearchChallenge: Cycle Detection in a Directed GraphSolution: Cycle Detection in a Directed GraphChallenge: Find "Mother Vertex" in a Directed GraphSolution: Find "Mother Vertex" in a Directed GraphChallenge: Count the Number of Edges in an Undirected GraphSolution: Count the number of Edges in an Undirected GraphChallenge: Check if a Path Exists Between Two VerticesSolution: Check if a Path Exists Between Two VerticesChallenge: Check if a Directed Graph is Tree or NotSolution: Check if a Directed Graph is Tree or NotChallenge: Find Length of Shortest Path Between Two VerticesSolution: Find the Shortest Path Between Two VerticesChallenge: Remove Edge from a Directed GraphSolution: Remove Edge from a Directed GraphGraph Interview Questions

What is a Tree?Types of TreesWhat Makes a Tree Balanced?What is a Binary Tree?More on Complete Binary TreesSkewed Binary TreeWhat is a Binary Search Tree (BST)?Insertion in Binary Search TreesInsertion in BST (Complete Implementation)Search in Binary Search Trees (Implementation)Deletion in Binary Search TreesDeletion in Binary Search Trees (Implementation)Pre-Order Traversal in Binary Search TreesIn-Order Traversal in Binary Search TreesPost-Order Traversal in Binary Search TreeWhat is an AVL Tree?AVL InsertionAVL DeletionWhat is a Red-Black Tree?Red-Black Tree InsertionRed-Black Tree DeletionWhat is a 2-3 Tree?2-3 Insertion2-3 Deletion of Element at Leaf Node2-3 Deletion of Element at Internal Node2-3-4 TreesOverview of TreesChallenge: Find the Minimum Value in a Binary Search TreeSolution: Find the Minimum Value in a Binary Search TreeChallenge: Find kth Maximum Value in a Binary Search TreeSolution: Find kth Maximum Value in a Binary Search TreeChallenge: Find Ancestors of Given Node in Binary Search TreeSolution: Find Ancestors of a Given Node in a BSTChallenge: Find the Height of a Binary Search TreeSolution: Find the Height of a Binary Search TreeChallenge: Find Nodes at "k" Distance from the RootSolution: Find Nodes at "k" Distance from the RootTree Interview Questions

What is a Trie?The Structure of a TrieInsertion in a TrieSearch in a TrieDeletion in a TrieChallenge: Total Number of Words in a TrieSolution: Total Number of Words in a TrieChallenge: Find All of the Words in a TrieSolution: Find All of the Words in a TrieChallenge: Sort the Elements of an Array using a TrieSolution: Sort the Elements of an Array using a TrieChallenge: Word Formation from a Given Dictionary Using a TrieSolution: Word Formation from Given Dictionary Using TrieTrie Interview Questions

What is a HeapWhy Use Heaps?Heap Representation in ArraysMax Heap: IntroductionMax Heap (Implementation)Min Heap: An IntroductionMin Heap (Implementation)Challenge: Convert a Max-Heap to a Min-HeapSolution: Convert a Max-Heap to a Min-HeapChallenge: Find the k Smallest Elements in an ArraySolution: Find the k Smallest Elements in an ArrayChallenge: Find the k Largest Elements in an ArraySolution: Find the k Largest Elements in an ArrayHeap Interview Questions

What is a Hash Table?Hash FunctionsCollisions in Hash TablesBuilding a Hash Table from ScratchAdd/Remove & Search in a Hash Table (Implementation)Complete Implementation of Hash TablesTrie vs Hash TableHashMap vs HashSetChallenge: Find Whether an Array is a Subset of Another ArraySolution: Find Whether an Array is a Subset of Another ArrayChallenge: Check if the Given Arrays are DisjointSolution: Check if the Given Arrays are DisjointChallenge: Find Symmetric Pairs in an ArraySolution: Find Symmetric Pairs in an ArrayChallenge: Trace the Complete Path of a JourneySolution: Trace the Complete Path of a JourneyChallenge: Find Two Pairs in an Array such that a+b = c+dSolution: Find Two Pairs in an Array such that a+b = c+dChallenge: Find If a Subarray with a Sum Equal to 0 ExistsSolution: Find If a Subarray with a Sum Equal to 0 existsChallenge: First Non-Repeating Integer in an ArraySolution: First Non-Repeating Integer in an ArrayChallenge: Remove Duplicate from a Linked List Using HashingSolution: Remove Duplicate from Linked List Using HashingChallenge: Union and Intersection of Lists Using HashingSolution: Union and Intersection of Lists Using HashingChallenge: Find Two Numbers that Add Up to "n"Solution: Find Two Numbers that Add Up to "n"Hashing Interview Questions

Part of the Java Interview Prep Path

Learn to tackle anything you might face in a coding interview in Java with absolute confidence.

7 Modules

Join more than 1.4 million learners from companies like

COURSE BY:

Coderust

License:All rights reserved

Teams of every size choose

Educative for Business

to train, upskill & onboard their developers