Mô tả

This course has been designed to help you pass your next coding interview. It focuses on puzzles from Codility's training lessons, so if you have an online coding test coming up, this course is perfect for you.

The key to passing coding interviews is to practice as much as possible by solving various types of coding puzzles. In doing so you sharpen your problem solving skills and eventually you will start to see patterns amongst the different coding solutions. You also increase your chances of being asked a problem you’ve already solved.

In this course you’ll get to practice many of these coding puzzles. In every section we introduce the topic, explain the problem and later provide you with a few hints that help solve the puzzle. In the end we arrive at the solution together.

Along the way you'll learn how to ride a motorbike, surf, scuba dive and fly an aeroplane. *

Join me on this course, and let’s get you to pass this interview!


*Not really, however this course is pretty fun regardless.

All code in this course can be found on github, username/project: cutajarj/CodilityInJava

Bạn sẽ học được gì

Experience solving many of codility's coding interview puzzles, with problem descriptions, hints and solutions

Learn common problem solving tips ideal for coding interviews

Have a greater chance of passing the coding interview with codility, hackerrank and others

Have a better chance of doing well in a face to face or phone coding interview

Yêu cầu

  • Java programming language
  • Basic understanding of data structures and algorithms

Nội dung khoá học

14 sections

Introduction

2 lectures
Make most of this course
05:25
Useful links and resources
00:15

Time Complexity

11 lectures
Quick recap on Complexity Theory
08:57
Perm Missing Element Problem
02:52
Perm Missing Element Hint 1
03:26
Perm Missing Element Hint 2
04:08
Perm Missing Element Solution
06:32
Perm Missing Element Code Walkthrough
04:31
Equilibrium Problem
05:38
Equilibrium Hint 1
03:29
Equilibrium Hint 2
02:30
Equilibrium Solution
02:58
Equilibrium Code Walkthrough
04:16

Arrays

5 lectures
Refresh your knowledge on Arrays
03:17
Cyclic Rotation Problem
02:44
Cyclic Rotation Hint
02:07
Cyclic Rotation Solution
03:20
Cyclic Rotation Code Walkthrough
03:44

Counting Elements

10 lectures
What do we mean by Counting Elements?
04:15
Frog River One Problem
04:02
Frog River One Hint
01:34
Frog River One Solution
03:36
Frog River One Code Walkthrough
04:05
Max Counters Problem
05:04
Max Counters Hint 1
04:06
Max Counters Hint 2
01:33
Max Counters Solution
01:44
Max Counters Code Walkthrough
05:03

Stacks and Queues

9 lectures
The basics around Stacks and Queues
05:24
Brackets Problem
03:11
Brackets Hint
02:41
Brackets Solution
04:58
Brackets Code Walkthrough
04:39
Fish Problem
04:15
Fish Hint
02:18
Fish Solution
04:52
Fish Code Walkthrough
05:56

Leader

4 lectures
Leader definition and the Dominator Problem
05:15
Dominator Hint
02:17
Dominator Solution
05:37
Dominator Code Walkthrough
05:16

Maximum Slice Problem

5 lectures
Introduction to the Maximum Sub Array problem
05:57
Max Profit Problem
02:19
Max Profit Hint
04:10
Max Profit Solution
05:42
Max Profit Code Walkthrough
02:39

Sorting

5 lectures
Overview of different Sorting Algorithms
04:45
Disc Intersection Problem
03:44
Disc Intersection Hint
02:08
Disc Intersection Solution
08:46
Disc Intersection Code Walkthrough
06:59

Prefix Sums

9 lectures
How to generate prefix sums
03:17
Passing Cars Problem
02:15
Passing Cars Hint
02:19
Passing Cars Solution
04:02
Passing Cars Code Walkthrough
03:26
Div Count Problem
02:38
Div Count Hint
01:29
Div Count Solution
04:47
Div Count Code Walkthrough
05:03

Primes and Composites

6 lectures
Understanding Primes and Composites
04:07
Flags Problem
05:03
Flags Hint 1
02:43
Flags Hint 2
04:18
Flags Solution
07:54
Flags Code Walkthrough
06:51

Euclidean Algorithm

5 lectures
What's the Greatest Common Divisor Algorithm?
10:43
Chocolates By Numbers Problem
03:49
Chocolates By Numbers Hint
01:53
Chocolates By Numbers Solution
04:59
Chocolates By Numbers Walkthrough
03:11

Caterpillar method

12 lectures
How does a Caterpillar move?
10:31
Count Distinct Slices Problem
04:42
Count Distinct Slices Hint 1
03:54
Count Distinct Slices Hint 2
04:58
Count Distinct Slices Solution
06:33
Count Distinct Slices Walkthrough
05:26
Min Abs Sum Of Two Problem
04:00
Min Abs Sum Of Two Hint 1
04:19
Min Abs Sum Of Two Hint 2
01:53
Min Abs Sum Of Two Hint 3
01:03
Min Abs Sum Of Two Solution
07:11
Min Abs Sum Of Two Walkthrough
04:05

Greedy Algorithms

9 lectures
What's a Greedy Algorithm like?
05:47
Max Non Overlapping Segments Problem
03:08
Max Non Overlapping Segments Hint
02:52
Max Non Overlapping Segments Solution
05:05
Max Non Overlapping Segments Walkthrough
03:14
Tie Ropes Problem
03:20
Tie Ropes Hint
01:19
Tie Ropes Solution
02:55
Tie Ropes Walkthrough
02:50

Closing Note

1 lectures
Thank You!
00:32

Đánh giá của học viên

Chưa có đánh giá
Course Rating
5
0%
4
0%
3
0%
2
0%
1
0%

Bình luận khách hàng

Viết Bình Luận

Bạn đánh giá khoá học này thế nào?

image

Đăng ký get khoá học Udemy - Unica - Gitiho giá chỉ 50k!

Get khoá học giá rẻ ngay trước khi bị fix.