Solving Leetcode'S Top Interview Questions In Java

Expand your knowledge of problem solving and impress your coding interviewers.

What you'll learn

Familiarity working with Arrays, Strings, Trees, Linked Lists and many other data structures

Exposure to the most common questions asked in interviews

Be able to critically analyze a problem and work towards an efficient solution

Learn numerous tricks which can be applied to the future questions you encounter

Gain the confidence and skills to ace your coding interviews

Consider time and space complexity when designing algorithms

Requirements

Basic understanding of data structures and algorithms

Fundamental understanding of Java syntax

Description

Welcome!Hello everyone, and welcome to the course that will help you prepare for your coding interviews! Specifically, we will be breaking down the easy collection of LeetCode's Top Interview Questions playlist. This playlist includes 46 problems that are very commonly asked by interviewers from large tech companies such as Apple, Meta, Google, Uber, and many more! We will learn how to approach problems of all kinds, such as those consisting of Arrays, Strings, Linked Lists, Trees, Dynamic Programming, Design, Math, and general knowledge, while also learning useful concepts and tricks which will help when facing more difficult problems.What is LeetCode?Simply put, LeetCode is a large repository filled with interview questions asked by the top tech companies around the world (Google, Facebook, Amazon, and many more).The main problem as a new user on LeetCode is that there are ENDLESS amounts of questions that you can find on there so you may not know which questions are the most common/beneficial to go over. This course's purpose is to provide a solution to this issue, as I go over the Top Inteview Questions recommended by LeetCode. If you are looking to ace your upcoming coding interview or even just to strengthen your problem solving skills, then look no further as you have found the one-stop-shop to become a problem solving machine. Course OverviewFor each problem in the playlist, I have a video dedicated to explaining the thought process in detail which will lead us to the most efficient solution, paired with a visual to aid in explaining the algorithm. After we understand the approach for the most efficient solution, I will translate the visual into Java code, breaking down every line as I code it. After the entire solution is implemented, we will analyze the time and space complexity of the solution.

Overview

Section 1: Arrays

Lecture 1 LeetCode #26: Remove Duplicates From Sorted Array

Lecture 2 LeetCode #122: Best Time to Buy and Sell Stock II

Lecture 3 LeetCode #189: Rotate Array

Lecture 4 LeetCode #217: Contains Duplicate

Lecture 5 Understanding Binary Representation

Lecture 6 LeetCode #136: Single Number

Lecture 7 LeetCode #350: Intersection of Two Arrays II

Lecture 8 LeetCode #66: Plus One

Lecture 9 LeetCode #283: Move Zeroes

Lecture 10 LeetCode #1: Two Sum

Lecture 11 LeetCode #36: Valid Sudoku

Lecture 12 LeetCode #48: Rotate Image

Section 2: Strings

Lecture 13 LeetCode #344: Reverse String

Lecture 14 LeetCode #7: Reverse Integer

Lecture 15 LeetCode #387: First Unique Character in a String

Lecture 16 LeetCode #242: Valid Anagram

Lecture 17 LeetCode #125: Valid Palindrome

Lecture 18 LeetCode #8: String to Integer (atoi)

Lecture 19 LeetCode #28: Find the Index of the First Occurrence in a String

Lecture 20 LeetCode #14: Longest Common Prefix

Section 3: Linked Lists

Lecture 21 LeetCode #237: Delete Node in a Linked List

Lecture 22 LeetCode #19: Remove Nth Node From End of List

Lecture 23 LeetCode #206: Reverse Linked List

Lecture 24 LeetCode #21: Merge Two Sorted Lists

Lecture 25 LeetCode #234: Palindrome Linked List

Lecture 26 LeetCode #141: Linked List Cycle

Section 4: Trees

Lecture 27 Depth First Search

Lecture 28 Breadth First Search

Lecture 29 LeetCode #104: Maximum Depth of Binary Tree

Lecture 30 LeetCode #98: Validate Binary Search Tree

Lecture 31 LeetCode #101: Symmetric Tree

Lecture 32 LeetCode #102: Binary Tree Level Order Traversal

Lecture 33 LeetCode #108: Convert Sorted Array to Binary Search Tree

Section 5: Sorting and Searching

Lecture 34 LeetCode #88: Merge Sorted Array

Lecture 35 LeetCode #278: First Bad Version (Binary Search)

Section 6: Dynamic Programming

Lecture 36 Introduction to Dynamic Programming

Lecture 37 LeetCode #70: Climbing Stairs

Lecture 38 LeetCode #121: Best Time to Buy and Sell Stock

Lecture 39 LeetCode #53: Maximum Subarray (Kadane's Algorithm)

Lecture 40 LeetCode #198: House Robber

Lecture 41 House Robber Optimized Solution (Constant Space Complexity)

Section 7: Design (Object Implementation)

Lecture 42 LeetCode #384: Shuffle an Array

Lecture 43 LeetCode #155: Min Stack

Section 8: Math

Lecture 44 LeetCode #412: Fizz Buzz

Lecture 45 LeetCode #204: Count Primes

Lecture 46 Count Primes Time Complexity Proof

Lecture 47 LeetCode #326: Power of Three

Lecture 48 LeetCode #13: Roman to Integer

Section 9: Others

Lecture 49 LeetCode #191: Number of 1 Bits

Lecture 50 LeetCode #461: Hamming Distance

Lecture 51 LeetCode #190: Reverse Bits

Lecture 52 LeetCode #118: Pascal's Triangle

Lecture 53 LeetCode #20: Valid Parentheses

Lecture 54 LeetCode #268: Missing Number

Developers looking to solidify their problem solving skills and ace their coding interviews