Beat the Codility Coding Interview in Java

Course Curriculum

Chapter 1: Introduction

Lecture 1: Make most of this course

Lecture 2: Useful links and resources

Chapter 2: Time Complexity

Lecture 1: Quick recap on Complexity Theory

Lecture 2: Perm Missing Element Problem

Lecture 3: Perm Missing Element Hint 1

Lecture 4: Perm Missing Element Hint 2

Lecture 5: Perm Missing Element Solution

Lecture 6: Perm Missing Element Code Walkthrough

Lecture 7: Equilibrium Problem

Lecture 8: Equilibrium Hint 1

Lecture 9: Equilibrium Hint 2

Lecture 10: Equilibrium Solution

Lecture 11: Equilibrium Code Walkthrough

Chapter 3: Arrays

Lecture 1: Refresh your knowledge on Arrays

Lecture 2: Cyclic Rotation Problem

Lecture 3: Cyclic Rotation Hint

Lecture 4: Cyclic Rotation Solution

Lecture 5: Cyclic Rotation Code Walkthrough

Chapter 4: Counting Elements

Lecture 1: What do we mean by Counting Elements?

Lecture 2: Frog River One Problem

Lecture 3: Frog River One Hint

Lecture 4: Frog River One Solution

Lecture 5: Frog River One Code Walkthrough

Lecture 6: Max Counters Problem

Lecture 7: Max Counters Hint 1

Lecture 8: Max Counters Hint 2

Lecture 9: Max Counters Solution

Lecture 10: Max Counters Code Walkthrough

Chapter 5: Stacks and Queues

Lecture 1: The basics around Stacks and Queues

Lecture 2: Brackets Problem

Lecture 3: Brackets Hint

Lecture 4: Brackets Solution

Lecture 5: Brackets Code Walkthrough

Lecture 6: Fish Problem

Lecture 7: Fish Hint

Lecture 8: Fish Solution

Lecture 9: Fish Code Walkthrough

Chapter 6: Leader

Lecture 1: Leader definition and the Dominator Problem

Lecture 2: Dominator Hint

Lecture 3: Dominator Solution

Lecture 4: Dominator Code Walkthrough

Chapter 7: Maximum Slice Problem

Lecture 1: Introduction to the Maximum Sub Array problem

Lecture 2: Max Profit Problem

Lecture 3: Max Profit Hint

Lecture 4: Max Profit Solution

Lecture 5: Max Profit Code Walkthrough

Chapter 8: Sorting

Lecture 1: Overview of different Sorting Algorithms

Lecture 2: Disc Intersection Problem

Lecture 3: Disc Intersection Hint

Lecture 4: Disc Intersection Solution

Lecture 5: Disc Intersection Code Walkthrough

Chapter 9: Prefix Sums

Lecture 1: How to generate prefix sums

Lecture 2: Passing Cars Problem

Lecture 3: Passing Cars Hint

Lecture 4: Passing Cars Solution

Lecture 5: Passing Cars Code Walkthrough

Lecture 6: Div Count Problem

Lecture 7: Div Count Hint

Lecture 8: Div Count Solution

Lecture 9: Div Count Code Walkthrough

Chapter 10: Primes and Composites

Lecture 1: Understanding Primes and Composites

Lecture 2: Flags Problem

Lecture 3: Flags Hint 1

Lecture 4: Flags Hint 2

Lecture 5: Flags Solution

Lecture 6: Flags Code Walkthrough

Chapter 11: Euclidean Algorithm

Lecture 1: What's the Greatest Common Divisor Algorithm?

Lecture 2: Chocolates By Numbers Problem

Lecture 3: Chocolates By Numbers Hint

Lecture 4: Chocolates By Numbers Solution

Lecture 5: Chocolates By Numbers Walkthrough

Chapter 12: Caterpillar method

Lecture 1: How does a Caterpillar move?

Lecture 2: Count Distinct Slices Problem

Lecture 3: Count Distinct Slices Hint 1

Lecture 4: Count Distinct Slices Hint 2

Lecture 5: Count Distinct Slices Solution

Lecture 6: Count Distinct Slices Walkthrough

Lecture 7: Min Abs Sum Of Two Problem

Lecture 8: Min Abs Sum Of Two Hint 1

Lecture 9: Min Abs Sum Of Two Hint 2

Lecture 10: Min Abs Sum Of Two Hint 3

Lecture 11: Min Abs Sum Of Two Solution

Lecture 12: Min Abs Sum Of Two Walkthrough

Chapter 13: Greedy Algorithms

Lecture 1: What's a Greedy Algorithm like?

Lecture 2: Max Non Overlapping Segments Problem

Lecture 3: Max Non Overlapping Segments Hint

Lecture 4: Max Non Overlapping Segments Solution