Data Structures and Algorithms in Java For Coding Interview
4.2 (98 ratings)
642 students enrolled

# Data Structures and Algorithms in Java For Coding Interview

Algorithmic Problems in Java that range a variety of data structures which often pop up during a coding interview.
4.2 (98 ratings)
642 students enrolled
Created by El Farouk Yasser
Last updated 3/2018
English
English [Auto-generated]
Current price: \$69.99 Original price: \$99.99 Discount: 30% off
5 hours left at this price!
30-Day Money-Back Guarantee
This course includes
• 6 hours on-demand video
• 2 articles
• Access on mobile and TV
• Assignments
• Certificate of Completion
Training 5 or more people?

What you'll learn
• Solve Easy to Medium Difficulty problems that address different data structures
• Have an understanding of how to systematically approach coding problems in a step by step manner
Course content
Expand all 55 lectures 05:49:28
+ Introduction
2 lectures 03:15
Preview 02:53
What is LeetCode, and How will we use it?
00:22
+ Arrays Data Structures: Two Sum
4 lectures 31:53
Optimizing further, O(nlogn) Solution
11:06
Implementing the O(nlogn) solution
08:41
+ Arrays Data Structures Maximum Consecutive Ones
5 lectures 26:16
Problem Statement
01:40
O(n^2) Naive Solution
06:42
O(n^2) Naive Solution Implementation
04:33
O(n) Solution idea and optimizations
09:13
+ Arrays Data Structures: Finding Maximum of three numbers
6 lectures 42:37
Problem Statement
02:18
O(n^3) Naive Solution
06:13
O(nlogn) Improved Solution
08:28
Implementation of O(nlogn) Solution
03:37
Optimizing further, O(n) Solution.
14:06
Implementation of O(n) Solution
07:55
+ Stack Data Structure, Valid Paranthesis
4 lectures 38:12
Problem Statement
03:08
Incorrect Approaches/Algorithms to the Problem
05:35
Recrusive Algorithm that runs in O(n^2)
17:50
Optimizing further with stacks to get O(n)
11:39
+ Stack Data Structure: Baseball Game
3 lectures 30:08
Problem Statement and Example
05:30
Naive O(n^2) Solution with additional boolean array
12:53
Optimizing on the last algorithm to an O(n) Solution
11:45
+ Hashmap and Hash Set Data structure: Contains Duplicate II
5 lectures 32:55
Problem Statement
03:39
Bruteforce Algorithm Idea: O(nk) Solution
08:33
Bruteforce Implementation and TLE
03:24
Optimizing with Hashmaps for O(n) Solution
13:45
Implementing the O(n) Solution
03:34
+ Hash map and Hash Set Data structure: Valid Anagram
8 lectures 48:54
Problem Statement
04:28
O(n!) Brute force Solution
05:38
O(n^2) Solution idea for Valid anagram
11:40
O(n^2) Solution Implementation
04:09
O(nlogn) Solution by Optimizing bottleneck
05:39
O(nlogn) Solution Implementation
03:03
O(n) Solution Idea, The final optimization with Hashtable
08:11
O(n) Solution Implementation
06:06
+ Heap Data Structure: Kth Largest Element in an Array
5 lectures 26:47
Problem Statement
01:26
O(nlogn) Naive Solution Idea
05:18
O(nlogn) Naive Solution Implementation
03:54
O(nlogk) Optimized Solution Using a Heap
12:51
Implementation of O(nlogk) Heap Solution
03:18
+ Heap Data Structure: Find K Pairs with Smallest Sums
3 lectures 28:17
Problem Statement
02:23
Idea of O(n^2Logn) Naive Solution and O(n^2logk) Optimized Solution using Heap
14:49
Implementation of O(n^2Logn) and O(n^2Logk) Solutions
11:05
Requirements
• Java Beginner to Intermediate Level (Loops/If Statements/Templates)
• Basic Understanding of BIg Oh Notation (What does O(n) mean, what does O(nlogn) mean, etc)
• Very Basic Understanding of Recursion (Factorial example suffices)
Description

Welcome to Data Structures and Algorithms in Java For Coding Interview!

This is the most comprehensive online course to help you with your coding interviews and solving algorithmic problems with Data Structures! This course utilizes Java's strong standard library to efficiently teach you what you need to know to solve basic algorithmic and data structures interview problems in the coding interview!

This course will teach you everything you need to know about utilizing data structures in your algorithms. We discuss data structures and algorithmic techniques such as:

• Array/Strings Sequences
• Stacks
• Recursion
• Hash Maps
• Binary Trees
• Searching Algorithms
• Heaps
• Several Assignments to solidify your understanding

Achieve your career goals and get a fantastic job in technology by enrolling in this course!