Algorithms for Coding Interviews in Java

Course Overview

Algorithms are one of the most common themes in coding interviews, so having a firm grip on them can be the difference between being hired or not. After this comprehensive course in Java, one of the most popular coding languages, you'll have an in-depth understanding of different algor... See More

How You'll Learn

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.

Course Contents

Hide All

Hide All Lessons

1. Introduction

Intended Audience

Learning Outcomes

2. Algorithmic Paradigms

Brute Force

Greedy Algorithms

Divide and Conquer

Dynamic Programming

3. Asymptotic Analysis

Comparing Algorithms

Example 1: Measuring Time Complexity of a Single Loop Algorithm

Example 2: Time Complexity of an Algorithm With Nested Loops

Introduction to Asymptotic Analysis and Big O

Other Common Asymptotic Notations and Why Big O Trumps Them

Useful Formulae

Common Complexity Scenarios

Challenge 1: Big (O) of Nested Loop with Addition

Solution Review: Big O of a Nested Loop with Addition

Challenge 2: Big (O) of Nested Loop with Subtraction

Solution Review: Big O of a Nested Loop with Subtraction

Challenge 3: Big O of Nested Loop with Multiplication

Solution Review: Big O of Nested Loop with Multiplication

Challenge 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

4. Sorting and Searching

Selection Sort, Bubble Sort, and Insertion Sort

Merge Sort

Quicksort

Time Complexities of Sorting Algorithms (Overview)

Searching Algorithms

Challenge 1: Find Two Numbers that Add up to "n"

Solution Review: Find Two Numbers that Add up to "n"

Challenge 2: Search in a Rotated Array

Solution Review: Search in a Rotated Array

Challenge 3: Group Anagrams

Solution Review: Group Anagrams

Challenge 4: Find the Median of Two Sorted Arrays

Solution Review: Find the Median of Two Sorted Arrays

Challenge 5: Find Duplicates in Array

Solution Review: Find Duplicates in Array

Challenge 6: Search in Sorted Matrix

Solution Review: Search in Sorted Matrix

Challenge 7: Count Element Occurrence

Solution Review: Count Element Occurrence

Challenge 8: Search Insert Position

Solution Review: Search Insert Position

Challenge 9: Sparse Search

Solution Review: Sparse Search

Challenge 10: Dutch National Flag Problem

Solution Review: Dutch National Flag Problem

Quiz on Sorting & Searching

5. Dynamic Programming

Fibonacci Series Using Recursion

Introducing Dynamic Programming With Fibonacci Numbers

Memoizing Fibonacci Numbers

Tabulating Fibonacci Numbers

Challenge 1: The 0/1 Knapsack Problem

Solution Review: The 0/1 Knapsack Problem

Challenge 2: Staircase Problem

Solution Review: Staircase Problem

Challenge 3: The Partition Problem

Solution Review: The Partition Problem

Challenge 4: Longest Common Substring

Solution Review: Longest Common Substring

Challenge 5: Shortest Common Supersequence

Solution Review: Shortest Common Supersequence

Challenge 6: Longest Palindromic Subsequence

Solution Review: Longest Palindromic Subsequence

Challenge 7: The Coin Change Problem

Solution Review: Coin Change Problem

Challenge 8: Egg Dropping Problem

Solution Review: Egg Dropping Problem

Challenge 9: Strings Interleaving

Solution Review: Strings Interleaving

Challenge 10: Edit Distance Problem

Solution Review: The Edit Distance Problem

Quiz on Dynamic Programming

6. Greedy Algorithms

What is a Greedy Approach?

Problem 1: Make a Change Machine!

Solution 1: Make Your own Change Machine!

Problem 2: Connecting 'n' Pipes with Minimum Cost

Solution 2: Connecting 'n' Pipes with Minimum Cost

Problem 3: Find the Egyptian Fraction

Solution 3: Find the Egyptian Fraction

Problem 4: Minimum Number of Platforms Required for Train Station

Solution 4: Minimum Number of Platforms Required for TrainStation

Problem 5: Help the Police Officers Catch the Thieves!

Solution 5: Help the Police Officers Catch the Thieves!

Problem 6: Fractional Knapsack

Solution 6: Fractional Knapsack Problem

Problem 7: Find the Largest Number

Solution 7: Find the Largest Number

Problem 8: Color the Graph!

Solution 8: Color the Graph!

Problem 9: Find the Minimum Spanning Tree

Solution 9: Kruskal’s Minimum Spanning Tree

Quick Quiz!

7. Divide and Conquer

Introduction to Divide and Conquer with Binary Search

Pascal's Triangle

Challenge 1: Euclidean Algorithm

Solution Review 1: Euclidean Algorithm

Challenge 2: Peak Element

Solution Review 2: Peak Element

Challenge 3: Maximum Subarray Sum

Solution Review 3: Maximum Subarray Sum

Challenge 4: Missing Number in Sorted Array

Solution Review 4: Missing Number in Sorted Array

Challenge 5: Find the Closest Number

Solution Review 5: Find the Closest Number

Challenge 6: Shuffle Integers

Solution Review 6: Shuffle Integers

Challenge 7: Collect Coins in Minimum Steps

Solution Review 7: Collect Coins in Minimum Steps

Challenge 8: Merge a Number of Sorted Arrays

Solution Review 8: Merge a Number of Sorted Arrays

Challenge 9: Find the Floor and Ceiling of a Number

Solution Review 9: Find the Floor and Ceil of a Number

Challenge 10: Inversion Count in an Array

Solution Review 10: Inversion Count in an Array

Quiz on Divide and Conquer

8. Graph Algorithms

Introduction to Graph Algorithms and Implementation

Challenge 1: Implement Breadth First Search

Solution Review: Implement Breadth First Search

Challenge 2: Implement Depth-First Search

Solution Review: Implement Depth-First Search

Challenge 3: Calculate the Number of Nodes in a Given Graph Level

Solution Review: Number of Nodes in a Given Graph Level

Challenge 4: Print the Transpose of a Graph

Solution Review: Print the Transpose of a Graph

Challenge 5: Count the Paths Between Two Nodes

Solution Review: Count the Paths Between Two Nodes

Challenge 6: Check if a Graph is Strongly Connected

Solution Review: Check if a Graph is Strongly Connected

Challenge 7: Print all the Connected Components in a Graph

Solution Review: Print all the Connected Components of a Graph

Challenge 8: Removing a Given Edge

Solution Review: Removing an Edge

Challenge 9: Check If Given Graph is Bipartite

Solution Review: Check if a Given Graph is Bipartite

Challenge 10: Topological Sorting of a Graph

Solution Review: Topological Sorting of a Graph

Quiz on Graph Algorithms

9. Appendix: Auxiliary Source Code

Stack Class

Queue Class

PriorityQueue Class

HashMap Class

ArrayList Class

10. Conclusion

Overview

Where to go from here