Algorithms and Data Structures Easy Way Java - job interview

Name: Algorithms and Data Structures Easy Way Java - job interview
Rating: 4.4 (53 reviews)

Become the star that you can be!

Created byMarcos Costa

Last updated 3/2018

English

What you'll learn

Be able to read code logic differently
Think out of the box when solving daily problems efficiently
Learn the most popular Algorithms and Data Structures
Understand the importance of unit testing your application
Get a basic understanding of Maven
Learn how recursion works
Practice with some interview coding questions
Code a Sudoku solver

Course content

4 sections • 49 lectures • 7h 47m total length

Installing Eclipse2:02
We will get Eclipse downloaded and installed so we can start coding our exercises.
Creating Maven project with JUNIT dependency1:31
At the end of this lecture you will have a maven project created with JUNIT dependency ready to work.

You will also have a basic understanding of what maven is and how it works.
Learning unit test JUNIT10:07
At the end of this lecture you will understand what is JUNIT and how to write a JUNIT test.
Euclid's algorithm with Recursion15:04
It will be easier to show how recursion works implementing an algorithm. We will implement Euclid's algorithm. I incentive you to write the code a few times then it will get stuck on your mind and easier to write and explain.

At the end of this lecture you will be able to write Euclid's algorithm and be able to explain if someone aske you this question.

Linear Search Introduction2:21
On this video you will learn Linear Search algorithm.
Linear Search Coding4:47
This lecture will teach you how to code a Linear Search. You will understand how it works and we will code it from scratch.
Unit Testing Linear Search with JUNIT7:40
On this video we will create a unit test for the Linear Search algorithm. We will test the code that we just wrote on the previous lecture.

I will also exhaust a little bit about JUNIT debugging and explaining in detail how you run multiple unit test at once and check which tests worked and which tests failed.
Insert Sort Introduction4:17
After this class you will understand how Insert Sort algorithm works.
Insert Sort Coding9:49
After this lecture you will be able to understand and code an Insert Sort algorithm.
Unit Testing Insert Sort with JUNIT14:50
After this lecture you will test and play with the results of the InsertSort class that we created on the lecture 9. We will use a new Assertion to test the arrays. We will also use a toString from the java.util.Arrays class to help us illustrate what our code is doing.
Binary Search Introduction3:31
After this lecture you will understand what is Binary Search Algorithm and how it works.
Binary Search Coding13:08
On this lecture you will learn how to code a Binary Search Algorithm. This will be coded using a non recursive way and after unit testing we will code using recursion.
Unit Testing Binary Search with JUNIT11:23
On this lecture we will unit test our Binary Search Algorithm coded on the previous lecture. We will also add some code to demonstrate what the code is doing and how many iterations are happening for the search to be completed.
Binary Search using recursion - reviewed12:14
On this lecture you will learn how to code the Binary Search Algorithm using recursion. We will also explore the differences between the two classes (non using recursion and using it)
Unit Testing Binary Search using recursion - reviewed10:31
On this lecture we will test the Binary Search Algorithm written using recursion. More important we will quickly debug and show the recursive calls happening.
Quick Sort Introduction5:31
After this lecture you will understand what is Quick Sort Algorithm and how it works.
Quick Sort Coding14:22
On this lecture you will learn how to code a Quick Sort Algorithm. It will be coded using recursion. Each functionality will be explained and we will go through some more detail over the next lecture while unit testing.
Unit Testing Quick Sort with JUNIT9:09
On this lecture we will test the Quick Sort Algorithm written using recursion. We will quickly debug the code to understand a little better.

Binary Tree Introduction4:10
After this lecture you will have a clear understanding of what is a BinaryTree and how it works.
Binary Tree Coding - reviewed21:19
On this lecture you will learn how to code a BinaryTree. We will also implement pre and post order traversal of the tree to print the elements in sort ordered or reverse ordered. We will use recursion.

At the end you will understand what it is and how to code it.
Unit Testing Binary Tree with JUNIT - reviewed14:22
On this lecture we will test the BinaryTree coded using recursion. We will quickly debug the code to understand a little better.

We will also use the library from Apache common lang to use ArrayUtils
Linked List Introduction3:32
After this lecture you will understand what is a Linked List and how it works.
Linked List Coding10:36
On this lecture you will learn how to implement a LinkedList.
Unit Testing Linked List with JUNIT6:31
On this lecture we will test the LinkedList created on the previous lecture. We will also debug to have a better understanding of the code.
Doubly Linked List Introduction2:21
After this lecture you will understand what is a DoublyLinkedList and what is the difference between DoublyLinkedList and LinkedList and you will also be able to understand how it works.
Doubly Linked List Coding part 1 of 210:49
On this lecture you will code and understand line by line what happens on this implementation of the DoublyLinkedList.
Doubly Linked List Coding part 2 of 2 - reviewed17:31
We will develop the remove method and as an nice extra we will override the toString method to get a nice String when we print our DoublyLinkedList
Unit Testing Doubly Linked List with JUNIT - reviewed22:39
On this lecture we will unit test our DoublyLinkedList methods add and remove. We will also see the result expected by the toString that we implemented.
Prefix Tree Introduction4:33
After this lecture you will understand what is a Prefix or Trie Tree and you will also be able to understand how it works.
Prefix Tree Coding part 1 of 217:19
On this lecture you will learn how to code a Prefix or Trie Tree and we will implement the insert method which will break a String into the nodes of the tree. The search method will be implemented on the next lecture so you can have some time do drink some water.
Prefix Tree Coding part 2 of 25:08
On this lecture you will learn how to implement the search method of a Prefix or Trie Tree
Unit Testing Prefix Tree with JUNIT part 1 of 210:42
On this lecture we will test the Prefix or Trie Tree implemented on the last two lectures. We will also debug the insert method so you have a better understanding of what it is doing and how it is actually working. I broke the test in two parts to make is easier to understand.
Unit Testing Prefix Tree with JUNIT part 2 of 211:24
On this lecture we will test the Prefix or Trie implemented on the lectures 30th and 31st and we will also debug the search method so you have a good understanding of what it is doing and how it is actually working.
Stack Introduction3:19
On this lecture you will understand what is a Stack and how it works.
Stack Coding14:13
On this lecture you will learn how to implement a Stack and this implementation will be using Object as the object being stored. The next lecture we will refactor this code to implement generics.
Unit Testing Stack with JUNIT10:11
On this lecture we will test the Stack implemented on the previous lecture and we will also debug so you have a better understanding of what it is doing and how it is actually working. A refactor using Generics will be done on the next lecture.
Stack Coding with Generics3:35
On this lecture we will refactor the stack developed on the previous lecture and refactor to implement generics
Unit Testing Stack Generics with JUNIT10:23
On this lecture we will test the Stack with Generics implemented on the previous lecture and we will also debug so you have a better understanding of what it is doing and how it is actually working.

Print odd numbers9:18
On this lecture we will code the interview question to print the odd numbers. We will also implement a second way to the problem.
Unit testing Print odd Number with JUNIT8:12
On this lecture we will unit test the print odd numbers interview question. We will also debug and do a small refactor to make it fancier and cleaner.
Longest substring without repeating character Introduction (Amazon question)4:17
On this lecture you will understand what is this question all about and how we are going to proceed to implement it on the next lecture.
Longest Substring without repeating character Coding 1 of 212:28
On this lecture we will implement this interview question that returns the number of characters and comment through the code.
Longest Substring without repeating character Coding 2 of 29:45
On this lecture we will refactor the code implemented on the previous lecture to also make available the sequence of characters and not just the count. We will also comment as we code for you to have a better understanding.
Unit testing Longest substring without repeating character with JUNIT12:51
On this lecture we will unit test our interview exercise find the longest substring without repeating characters. We will also debug the code to get it in a bit more detail
Sudoku Introduction (Amazon Question)3:28
On this lecture you will understand what is this question all about and how we are going to proceed to implement it on the next lecture.
Sudoku coding part 1 of 319:56
Sudoku was broken in two coding parts to make it easier for you. On this lecture we will implement the first part of the Sudoku interview question and comment through the code.
Sudoku coding part 2 of 311:15
On this lecture we will implement the second part of the Sudoku interview question and comment through the code. We will implement all the methods necessary to have the solve method working properly.
Sudoku coding part 3 of 3 Unit Testing methods12:44
On this lecture we will create unit test for all the methods that we developed to have the sudoku working. We will test solve and printMe on the next lecture.
Unit Testing Sudoku with JUNIT6:20
On this lecture we will test the solve method, debug through the code and check the output using the printMe method implemented.

Requirements

Knowledge of development in any language

Description

Here you will learn the most common algorithms and data structures and also prepare for some interview questions.

This is not an ordinary course. We will write line by line of code together and explain what is is doing. Each algorithm and data structures will be introduced to you in a easy and friendly way to understand.

It will definitely help you to get to the next level in your career. It will help you on your daily coding as well.

On this course Algorithms and Data Structures you will learn and code Euclid, Linear Search, Insert Sort, Binary Search, Quick Sort

also Binary Tree, Linked List, Doubly Linked List, Prefix Tree or Trie Tree, Stack

and finally some coding interview questions Print Odd Numbers, Longest Substring Without Repeating Character (Amazon Question), Sudoku (Amazon Question)

Algorithms and Data Structures are very important topics since your choice of algorithm and datastructure will affect memory and CPU time differently.

Be ready to code and be eager to learn more.

It is priceless to have the confidence to show off your skills without fear. You will be able to prove in a whiteboard interview that you are not just good but you are awesome.

Enjoy!

Who this course is for:

Developers that want to reach the next level on their career
Preparing for a though interview
Get noticed at your company

Algorithms and Data Structures Easy Way Java - job interview

What you'll learn

Explore related topics

Course content

Get Started4 lectures • 29min

Algorithms14 lectures • 2hr 4min

Data Structures20 lectures • 3hr 25min

Interview Coding questions11 lectures • 1hr 51min

Requirements

Description

Who this course is for: