225 Lessons

23 Quizzes

63 Challenges

133 Playgrounds

1212 Illustrations

Tackle anything you might face on a coding interview in Java with absolute confidence.

Ace the Java Coding Interview

Tackle anything you might face on a coding interview in Java with absolute confidence.

8 Modules

Explore Path

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 1: Measuring Time Complexity of a Single Loop AlgorithmExample 2: 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 1: Big (O) of Nested Loop with AdditionSolution Review: Big O of a Nested Loop with AdditionChallenge 2: Big (O) of Nested Loop with SubtractionSolution Review: Big O of a Nested Loop with SubtractionChallenge 3: Big O of Nested Loop with MultiplicationSolution Review: Big O of Nested Loop with MultiplicationChallenge 4: Nested Loop with Multiplication (Basic)Solution Review: Nested Loop with Multiplication (Basic)Challenge 5: Nested Loop with Multiplication (Intermediate)Solution Review: Nested Loop with Multiplication (Intermediate)Challenge 6: Nested Loop with Multiplication (Advanced)Solution Review: Nested Loop with Multiplication (Advanced)Challenge 7: Nested Loop with Multiplication (Pro)Solution Review: Nested Loop with Multiplication (Pro)Complexity Interview Questions

What is an Array?Two Dimensional ArraysChallenge 1: Remove Even Integers from an ArraySolution Review: Remove Even Integers from an ArrayChallenge 2: Merge Two Sorted ArraysSolution Review: Merge Two Sorted ArraysChallenge 3: Find Two Numbers that Add up to "n"Solution Review: Find Two Numbers that Add up to "n"Challenge 4: Array of Products of All Elements Except ItselfSolution Review: Array of Products of All Elements Except ItselfChallenge 5: Find Minimum Value in ArraySolution Review: Find Minimum Value in an ArrayChallenge 6: First Non-Repeating Integer in an ArraySolution Review: First Non-Repeating Integer in an ArrayChallenge 7: Find Second Maximum Value in an ArraySolution Review: Find Second Maximum Value in an ArrayChallenge 8: Right Rotate the Array by One IndexSolution Review: Right Rotate the Array by One IndexChallenge 9: Re-arrange Positive & Negative ValuesSolution Review: Re-arrange Positive & Negative ValuesChallenge 10: Rearrange Sorted Array in Max/Min FormSolution Review: Re-arrange Sorted Array in Max/Min FormChallenge 11: Find the Sum of Maximum Sum SubarraySolution Review: 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 1: Insertion in a Singly Linked List (insert at End)Solution Review: Insertion in a Singly Linked List(insert at End)Insertion in Singly Linked List (Insert After)Challenge 2: Search in Singly Linked ListSolution Review: Search in a Singly Linked ListSingly Linked List Deletion (Implementation)Challenge 3: Deletion in Singly Linked List(Delete by Value)Solution Review: Deletion in Singly Linked ListLinked Lists vs. ArraysWhat is a Doubly Linked List (DLL)?Linked List with TailChallenge 4: Find the Length of a Linked ListSolution Review: Find the Length of a Linked ListChallenge 5: Reverse a Linked ListSolution Review: Reverse a Linked ListChallenge 6: Detect Loop in a Linked ListSolution Review: Detect Loop in a Linked ListChallenge 7: Find the Middle Node of a Linked ListSolution Review: Find the Middle Node of a Linked ListChallenge 8: Remove Duplicates from a Linked ListSolution Review: Remove Duplicate from a Linked ListChallenge 9: Union & Intersection of ListsSolution Review: Union & Intersection of ListsChallenge 10: Return the Nth node from EndSolution Review: Return the Nth node from EndChallenge 11: 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 1: Generate Binary Numbers from 1 to n using a QueueSolution Review: Generate Binary Numbers from 1 to n using QueueChallenge 2: Implement Two Stacks using one ArraySolution Review: Implement Two Stacks using one ArrayChallenge 3: Reversing the First k Elements of a QueueSolution Review: Reversing the First k Elements of a QueueChallenge 4: Implement Queue using StackSolution Review: Implement Queue using StackChallenge 5: Sort the Values in a StackSolution Review: Sort the Values in a StackChallenge 6: Evaluate Postfix Expressions using StacksSolution Review: Evaluate Postfix Expressions using StacksChallenge 7: Next Greater Element using StackSolution Review: Next Greater Element using StackChallenge 8: Solve a Celebrity Problem using a StackSolution Review: Solve a Celebrity Problem using a StackChallenge 9: Check for Balanced Parentheses using a StackSolution Review: Check for Balanced Parentheses using a StackChallenge 10: Create Stack where min() gives minimum in O(1)Solution Review: 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 1: Implement Breadth First SearchSolution Review: Implement Breadth First SearchChallenge 2: Implement Depth First SearchSolution Review: Implement Depth First SearchChallenge 3: Cycle Detection in a Directed GraphSolution Review: Cycle Detection in a Directed GraphChallenge 4: Find "Mother Vertex" in a Directed GraphSolution Review: Find "Mother Vertex" in a Directed GraphChallenge 5: Count the Number of Edges in an Undirected GraphSolution Review: Count the number of Edges in an Undirected GraphChallenge 6: Check if a Path Exists Between Two VerticesSolution Review: Check if a Path Exists Between Two VerticesChallenge 7: Check if a Directed Graph is Tree or notSolution Review: Check if a Directed Graph is Tree or notChallenge 8: Find Length of Shortest Path between Two VerticesSolution Review: Find the Shortest Path between Two VerticesChallenge 9: Remove Edge from a Directed GraphSolution Review: 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 (Case #1)2-3 Deletion (Case #2)2-3-4 TreesOverview of TreesChallenge 1: Find the Minimum Value in a Binary Search TreeSolution Review: Find the Minimum Value in a Binary Search TreeChallenge 2: Find kth Maximum Value in a Binary Search TreeSolution Review: Find kth Maximum Value in a Binary Search TreeChallenge 3: Find Ancestors of Given Node in Binary Search TreeSolution Review: Find Ancestors of a Given Node in a BSTChallenge 4: Find the Height of a Binary Search TreeSolution Review: Find the Height of a Binary Search TreeChallenge 5: Find Nodes at "k" Distance from the RootSolution Review: 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 1: Total Number of Words in a TrieSolution Review: Total Number of Words in a TrieChallenge 2: Find All of the Words in a TrieSolution Review: Find All of the Words in a TrieChallenge 3: Sort the Elements of an Array using a Trie.Solution Review: Sort the Elements of an Array using a Trie.Challenge 4: Word Formation from a Given Dictionary using a TrieSolution Review: 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 1: Convert a Max-Heap to a Min-HeapSolution Review: Convert a Max-Heap to a Min-HeapChallenge 2: Find the k Smallest Elements in an ArraySolution Review: Find the k Smallest Elements in an ArrayChallenge 3: Find the k Largest Elements in an ArraySolution Review: 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 1: Find whether an array is a subset of another arraySolution Review: Find whether an array is a subset of another arrayChallenge 2: Check if the given arrays are disjointSolution Review: Check if the given arrays are disjointChallenge 3: Find symmetric pairs in an ArraySolution Review: Find symmetric pairs in an ArrayChallenge 4: Trace the complete path of a journeySolution Review: Trace the complete path of a journeyChallenge 5: Find two pairs in an Array such that a+b = c+dSolution Review: Find two pairs in an Array such that a+b = c+dChallenge 6: Find If a Subarray with a Sum Equal to 0 ExistsSolution Review: Find if a subarray with a sum equal to 0 exists.Challenge 7: First Non-Repeating Integer in an ArraySolution Review: First Non-Repeating Integer in an ArrayChallenge 8: Remove Duplicate from a Linked List using HashingSolution Review: Remove Duplicate from Linked List using HashingChallenge 9: Union and Intersection of Lists using HashingSolution Review: Union and Intersection of Lists using HashingChallenge 10: Find Two Numbers that Add up to "n"Solution Review: Find Two Numbers that Add up to "n"Hashing Interview Questions

Recommended before you start this course

Recommended before you start this course

Recommended before you start this course

Recommended after you finish this course

Recommended after you finish this course

Recommended after you finish this course

COURSE BY:

Coderust

License:All rights reserved

Teams of every size choose

Educative for Business

to train, upskill & onboard their developers