Ultimate Coding Interview Prep- Algorithms Data Structures

Ultimate Coding Interview Prep: Algorithms & Data Structures, available at $19.99, has an average rating of 3.4, with 59 lectures, based on 5 reviews, and has 137 subscribers.

You will learn about Learn the most commonly asked questions by the likes of Facebook, Google, Amazon and Spotify for beginners. Learn not only concepts but also be able to articulate your thought process as you plan and execute a solution. Learn the best way to answer an interview question Analyze the time complexity of various algorithms Learn through hands-on coding examples and learn to solve problems quickly Refresh your Java knowledge This course is ideal for individuals who are Anyone learning Java or You have a Java interview coming up and need to learn how to answer questions properly or You need to learn the most popular questions that you might be asked or You need to learn the top 10 most common subjects asked about and sample questions for each or You havent used Java in a while and want to refresh your knowledge It is particularly useful for Anyone learning Java or You have a Java interview coming up and need to learn how to answer questions properly or You need to learn the most popular questions that you might be asked or You need to learn the top 10 most common subjects asked about and sample questions for each or You havent used Java in a while and want to refresh your knowledge.

Enroll now: Ultimate Coding Interview Prep: Algorithms & Data Structures

Summary

Title: Ultimate Coding Interview Prep: Algorithms & Data Structures

Price: $19.99

Average Rating: 3.4

Number of Lectures: 59

Number of Published Lectures: 59

Number of Curriculum Items: 59

Number of Published Curriculum Objects: 59

Original Price: $199.99

Quality Status: approved

Status: Live

What You Will Learn

Learn the most commonly asked questions by the likes of Facebook, Google, Amazon and Spotify for beginners.

Learn not only concepts but also be able to articulate your thought process as you plan and execute a solution.

Learn the best way to answer an interview question

Analyze the time complexity of various algorithms

Learn through hands-on coding examples and learn to solve problems quickly

Refresh your Java knowledge

Who Should Attend

Anyone learning Java

You have a Java interview coming up and need to learn how to answer questions properly

You need to learn the most popular questions that you might be asked

You need to learn the top 10 most common subjects asked about and sample questions for each

You havent used Java in a while and want to refresh your knowledge

Target Audiences

Anyone learning Java

You have a Java interview coming up and need to learn how to answer questions properly

You need to learn the most popular questions that you might be asked

You need to learn the top 10 most common subjects asked about and sample questions for each

You havent used Java in a while and want to refresh your knowledge

The Best Java Interview Guide

Learn the most commonly asked questions by the likes of Facebook, Google, Amazon and Spotify for beginners.

Preparing for the Java interview is hard. You need to understand not only concepts but also be able to articulate your thought process as you plan and execute a solution.

In Ultimate Coding Interview Prep, you’ll learn the best way to answer an interview question, look at the most commonly asked questions, and analyze time complexity of various algorithms.

You’ll learn through hands-on coding examples and learn to solve problems quickly.

Refresh your Java knowledge and solve new problems with the most common beginner interview questions asked by FANG companies.

COURSE BREAKDOWN

Section 0: Introduction to Interview Questions

Course Overview

FizzBuzz: Print the numbers from 1 to 100 and for multiples of ‘3’ print “Fizz” instead of the number and for the multiples of ‘5’ print “Buzz”.

Section 1: String/Array Interview Questions

01 Reverse Words in a String: Given an input string, reverse the string word by word.

02 Rotate Array: Rotate an array of n elements to the left by k steps.

03 Isomorphic Strings: Given two strings a and b, determine if they are isomorphic.

04 Kth Largest Element in an Array: Find the kth largest element in an unsorted array. Note that it is the kth largest element in the sorted order, not the kth distinct element.

Section 2: Matrix Interview Questions

01 Set Matrix Zeroes: Given a 2D matrix, if an element is 0, set its entire row and column to 0. Do it in place.

02 Spiral Matrix: Given a 2D matrix, return all elements of the matrix in spiral order.

03 Number of Islands: Given a 2D grid map of 1s (land) and 0s (water), count the number of islands.

Section 3: Linked List Interview Questions

01 Implement a Stack Using an Array in Java: Implement a stack using an array.

02 Add Two Numbers: You are given two linked lists representing two non-negative numbers. The digits are stored in reverse order and each of their nodes contain a single digit. Add the two numbers and return it as a linked list.

03 Reverse a Linked List: Reverse a singly linked list.

Section 4: Tree Interview Questions

01 Inorder Traversal: Perform inorder traversal on a binary tree.

02 Preorder Traversal: Perform inorder traversal on a binary tree.

03 Postorder Traversal: Perform inorder traversal on a binary tree.

04 Binary Tree Maximum Path Sum: Given a binary tree, find the maximum path sum.

Section 5: Graph Interview Questions

01 Clone an Undirected Graph: Each node in the graph contains a label and a list of its neighbors.

Section 6: Sorting and Time Complexity

01 Types of Time Complexity: Learn the types of time complexity in Big-O Notation in order of horrible to good.

02 Bubble Sort Algorithm: Sort a list with bubble sort.

03 Selection Sort Algorithm: Sort a list with selection sort.

04 Insertion Sort Algorithm: Sort a list with insertion sort.

05 Quick Sort Algorithm: Sort a list with Quick Sort.

06 Merge Sort Algorithm: Sort a list with Merge Sort.

07 Time Complexity of Different Sorting Algorithms

Section 7 Dynamic Programming Interview Questions

01 Coin Change: You are given coins of different denominations and a total amount of money amount. Write a function to compute the fewest number of coins that you need to make up that amount.

02 Edit Distance: Find the edit distance between two strings.

03 Distinct Subsequences: Given a string S and a string T, count the number of distinct subsequences of T in S.

04 Maximum Sum Subarray: Find the sum of contiguous subarray within a one-dimensional array of numbers which has the largest sum

Section 8 Bit Manipulation Interview Questions

01 Bitwise and Shift Operators: Manipulate bits and shift bits to change values.

02 Single Number: Given an array of integers, every element appears twice except for one. Find that single one.

03 Sum of Two Integers: Calculate the sum of two integers a and b, but you are not allowed to use the operator + and -.

04 Number of 1 Bits: Take an unsigned integer and return the number of ’1′ bits it has (also known as the Hamming weight.)

05 Reverse Bits: Reverse the bits of a given 32 bit unsigned integer.

06 Bitwise AND of a Range: Given two non-negative long integers, a and b and given a <= b, find the bitwise AND of all integers from a and b.

Section 9 Combinations and Permutations Interview Questions

01 Permutations: Print all permutations of a given string.

02 Distinct Permutations of a String: Print all distinct permutations of a string that contains duplicates.

03 Letter Combinations of a Phone Number: Given a digit string, return all possible letter combinations that the number could represent on a phone board.

04 Factor Combination: Return all possible combinations of an integer n’s factors.

Section 10 Math Interview Questions

01 Reverse Integer: Reverse the digits of an integer n.

02 Palindrome Number: Determine whether an integer is a palindrome. Do this without extra space.

03 Excel Sheet Column Numbe: Given a column title from an Excel sheet, return its corresponding column number.

A SCHOOL YOU CAN TRUST

Lifetime access that never expires

Project-based curriculum to superboost your portfolio

Graduation certificate for every course

Absolute beginner-friendly

New courses every month

Efficient lectures with step by step explanations

Relevant industry topics 8 years of award-winning course delivery

700,000 students in 186 countries

Learn with free tools and affordable courses

REVIEWS OF MAMMOTH COURSES

Captivating voice, easy to follow at a rapid pace, get some paper and fasten your seat-belts. I’m enjoying every second of this.

— PHILIP MURRAY

I have completed many Udemy and Skillshare tutorials. This one is the most outstanding one that I have seen thus far. It is doubtful that it could be topped. This is a superior tutorial. Amazing.

— JOSEPH APPLEGARTH

COURSE AUTHOR

Alexandra Kropova, Software Developer at Mammoth Interactive INC.

Alexandra Kropova is a software developer specializing in Java and JavaScript, with extensive experience in full-stack web development and app development. She has helped produce courses for Mammoth Interactive INC. since 2016.

FREQUENTLY ASKED QUESTIONS

When does the course start and finish?

The course starts now and never ends! It is a completely self-paced online course – you decide when you start and when you finish.

How long do I have access to the course?

How does lifetime access sound? After enrolling, you have unlimited access to this course for as long as you like – across any and all devices you own.

What if I am unhappy with the course?

We would never want you to be unhappy! If you are unsatisfied with your purchase, contact us in the first 30 days and we will give you a full refund.

Do I get course certificates?

Yes, a course certificate will be generated at the end of each course you complete! Along with projects, certificates are a way you can prove your work on LinkedIn.

Do I have to show up at a particular place or a particular time?

No, each course happens online, and you can take it from any place where you have an internet connection.All lectures are prerecorded so you can watch them at any time that works for you. Of course, you can also enjoy all the lectures on your phone and tablet.

How much time do I need in order to take each course?

You can spend as much or as little time as you want. With Lifetime Access, there is no expiry. You aren’t required to complete the course within a certain time period. You can follow the course at your own pace and always come back to the videos later when you want to revisit the material or work on improving certain skills.

What if I’m not good with technology?

The majority of Mammoth Interactive students are complete beginners. Even if you feel like you know nothing about technology, you won’t feel left out. All technical concepts are described in simple terms while avoiding unnecessary jargon. Each course starts from scratch and builds up your knowledge substantially in steps. Students from age 5 to 70 have successfully completed our courses. And just in case you get stuck, you can always ask any questions under each lecture, which will be promptly answered by one of my team members.

What if I’m an experienced developer?

Stack Overflow’s yearly developer survey found that developers over age 50 start to make less than their younger counterparts. Don’t become one of the people affected by skill stagnation. Enroll in our school to future-proof your career for life. If you’re an experienced developer, you will still benefit from Mammoth Interactive courses. By starting from scratch with each course, you will revisit the fundamentals and undo bad coding habits. You’ll also find it easier to pick up new languages, making you able to take more courses and broaden your skillset.

Course Curriculum

Chapter 1: Introduction and FizzBuzz

Lecture 1: 00 Course Overview

Lecture 2: 01 Fizzbuzz

Lecture 3: FizzBuzz Code

Chapter 2: Section 1 String and Array Interview Questions

Lecture 1: 01 Reverse Words In A String

Lecture 2: 02 Rotate Array

Lecture 3: 03 Isomorphic Strings

Lecture 4: 04 Kth Largest Element In An Array

Lecture 5: 05 Testing Our Solution

Lecture 6: Section 1 Code

Chapter 3: Section 2 Matrix Interview Questions

Lecture 1: 01 Set Matrix Zeros

Lecture 2: 02 Spiral Matrix

Lecture 3: 03 Number Of Islands

Lecture 4: 04 Testing Our Solution

Lecture 5: Section 2 Code

Chapter 4: Section 3 Linked List Interview Questions

Lecture 1: 01 Implement a Stack Using an Array

Lecture 2: 02 Add Two Numbers

Lecture 3: 03 Testing Our Solution

Lecture 4: 04 Reverse a Linked List

Lecture 5: Linked List Source Code

Chapter 5: Section 4 Binary Tree Interview Questions

Lecture 1: 01 Inorder Traversal

Lecture 2: 02 Preorder Traversal

Lecture 3: 03 Postorder Traversal

Lecture 4: 04 Binary Tree Maximum Path Sum

Lecture 5: Binary Tree Source Code

Chapter 6: Section 5 Graph Interview Questions

Lecture 1: 01 Clone an Undefined Graph

Lecture 2: 02 Building And Traversing The Graph

Lecture 3: 03 Testing Our Solution

Lecture 4: Graph Interview Questions Source Code

Chapter 7: Section 6 Sorting and Time Complexity

Lecture 1: 01 Types Of Time Complexity

Lecture 2: 02 Bubble Sort Algorithm

Lecture 3: 03 Selection Sort Algorithm-

Lecture 4: 04 Insertion Sort Algorithm

Lecture 5: 05 Quick Sort

Lecture 6: 06 Merge Sort Algorithm

Lecture 7: 07 Time Complexity Of Different Sorting Algorithms

Lecture 8: Section 6 Sorting and Time Complexity Code

Lecture 9: Time Complexity of Different Sorting Algorithms Slides

Chapter 8: Section 7 Dynamic Programming

Lecture 1: 01 Coin Change

Lecture 2: 02 Edit Distance

Lecture 3: 03 Distinct Subsequences

Lecture 4: 04 Maximum Sum Subarray

Lecture 5: Dynamic Programming Source Code

Chapter 9: Section 8 Bit Manipulation Interview Questions

Lecture 1: 01 Bitwise And Shift Operators

Lecture 2: 02 Single Number

Lecture 3: 03 Number Of 1 Bits

Lecture 4: 04 Sum Of Two Integers

Lecture 5: 05 Reverse Bits

Lecture 6: 06 Bitwise And Of A Range

Lecture 7: Bitwise and Shift Operators Slides

Lecture 8: Bit Manipulation Source Code

Chapter 10: Section 9 Combinations and Permutations Interview Questions

Lecture 1: 01 Permutations

Lecture 2: 02 Distinct Permutations Of A String

Lecture 3: 03 Letter Combinations Of A Phone Number

Lecture 4: 04 Factor Combinations

Lecture 5: Combinations and Permutations Interview Questions Code

Chapter 11: Section 10 Math Interview Questions

Lecture 1: 01 Reverse Integer

Lecture 2: 02 Palindrome Number

Lecture 3: 03 Excel Sheet Column Number

Lecture 4: Math Interview Questions Code

Instructors

Mammoth Interactive
Top-Rated Instructor, 3.3 Million+ Students

John Bura
Best Selling Instructor Web/App/Game Developer 1Mil Students

Rating Distribution

1 stars: 1 votes

2 stars: 0 votes

3 stars: 1 votes

4 stars: 2 votes

5 stars: 1 votes

Frequently Asked Questions

How long do I have access to the course materials?

You can view and review the lecture materials indefinitely, like an on-demand channel.

Can I take my courses with me wherever I go?

Definitely! If you have an internet connection, courses on Udemy are available on any device at any time. If you don’t have an internet connection, some instructors also let their students download course lectures. That’s up to the instructor though, so make sure you get on their good side!