INTERACTIVE COURSE

Beginner

225 Lessons

35h

Certificate of Completion

133 Playgrounds

63 Challenges

23 Quizzes

1212 Illustrations

Course Overview

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 of all the common data structures and provides implementation level details in Java to allow readers to become well equipped. Now with more code solutions, lessons, and illustrations than ever, this is the course for you!

Course Content

1

Complexity Measures

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

2

Arrays

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

3

Linked Lists

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 List (Delete by Value)Linked 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

4

Stack/Queues

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

5

Graphs

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 the 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

6

Trees

38 Lessons

7

Trie (Advanced Trees)

14 Lessons

8

Heaps

14 Lessons

9

Hash Tables

29 Lessons

10

Summary of Data Structures

2 Lessons

COURSE AUTHOR

How You'll Learn

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.

Videos are holding you back. Educativeâ€˜s interactive, text-based lessons accelerate learning â€” no setup, downloads, or alt-tabbing required.

Learn faster and smarter with adaptive AI tools embedded in every Educative course.

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

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

Ace the Java Coding Interview

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

7 Modules

Recommended Courses

BEFORE STARTING THIS COURSE

AFTER FINISHING THIS COURSE