Data Structures Algorithms In Java – Secrets To Ace Leetcode

COMPLETE Beginner to Expert Guide to Ace Coding Interview THIS YEAR with DSA in Java EVEN WITH Zero Experience.

What you'll learn

Learn various Popular Data Structures and their Algorithms.

Develop your Analytical skills on Data Structure and use then efficiently.

Ace coding interviews given by some of the top tech companies

Become a better developer by mastering computer science fundamentals

Time and Space Complexity of Algorithms, Detailed Discussion of Logic to solve LEETCODE questions

Code Implementation in Java

Real Coding Interview Questions from Google, Meta, Amazon, Adobe, Microsoft etc.

Learn Java from Scratch

Requirements

No coding or Data Structure and Algorithm knowledge needed! We'll start from scratch!

A computer (Windows/Mac/Linux) with access to the internet. That's it!

All tools and software used in this course will be free!

Description

COMPLETE Beginner to Expert Guide to Ace Coding Interview THIS YEAR with Data Structures & Algorithms in Java EVEN WITH Zero Experience.Did you know that According to the U.S. Bureau of Labor and Statistics, developers will see job growth of 27% by 2024?The problem is that everyone you know (your friends, family, professors, co-workers, etc) are LYING to you and most don’t even know it!They tell you to…Graduate from a "prestigious" university with an overpriced degree (which holds less weight than ever before)…It’s too difficult to codeIt’s too late to learnYou are not meant to codeThis sounds pretty depressing, doesn’t it?Yet, most people would succumb to other people’s opinions and would live a low quality life.If you want more out of life, there is a better way.Let me introduce you to The Amazing Escape Plan.In this comprehensive, 3-in-1 course, you are going to Learn Java from scratch, understand core fundamentals of programming, solving Easy, Medium and Hard Level LeetCode Problems. You'll learn everything that you need to know to Crack Coding Interview rounds in your dream company starting THIS YEAR through…Basics - We learn about the fundamentals of Java. How it works, the architecture, code execution, every single step in detail. We also cover the installation of tools that are required to write code in Java. We run our first Java program from scratch, providing a hands on demo of every step. We cover input and output in Java, data types, type conversion and casting, debugging, control flow, loops, and also solve a few problems.Arrays and ArrayLists - We dive deep into how it works, the memory management, input/output, multidimensional arrays, dynamic arrays, working with functions, and solve some questions.Strings and String Builder - We look into how it works internally, various operations, memory management, and some examples!Searching Algorithms - We cover Linear Search & Binary Search in-depth. We cover the working, complexity analysis, code, and solve some LeetCode and FAANGM questions to strengthen the concepts.Sorting Algorithms - In the sorting algorithm series, we cover Bubble sort, Selection sort, Insertion sort, Cycle Sort, Merge Sort in depth. We look at how the algorithm works, the complexity analysis, optimization, and code.Pattern Questions - We'll look at how you can solve any coding patterns question in a step by step manner, and what the thought process should be like.Time & Space Complexity - We'll go from beginner to advanced with “Time and Space Complexity Analysis”. We'll cover in-depth explanations of Big-O, Big-Omega, Theta and other notationsRecursion & Backtracking - Covers an introduction to Backtracking, along with maze path problems. An important video for interviews covering complete theory + code + tips.Object Oriented Programming - In this section you'll master OOP Concepts like never before. This Module contains 7 lectures crossing over 5 hrs!Linked Lists - One of the most important data structures for coding interviews. Here we also build the Linked List from scratch and see how it works internally! This module is also full of interview questions from Google, Facebook, Amazon, Microsoft, Apple, Twitter and LinkedIn ranging from LeetCode Easy to Hard.Stacks and Queues - One of the most important data structures for coding interviews. Here we also build the data structures from scratch and see how it works internally. Along with the dynamic implementations, circular queues, exception handling and more.Trees - One of the most important data structures for coding interviews. Here we also build the data structures from scratch and see how it works internally. Along with the Binary Trees, Binary Search Trees and Solving LeetCode Problems.30 DAY GUARANTEE: If this course doesn’t completely change the trajectory of your life, Udemy will refund your entire purchase within 30 days.You have nothing to lose and so much to gain!ADD TO CART now and get closer to a freer, happier life than ever before.

Overview

Section 1: Introduction

Lecture 1 Introduction to Programming languages

Lecture 2 Flow of Program - Flowcharts & Pseudocode

Lecture 3 Introduction to Java - Installation & Architecture

Section 2: Download Code Source Files

Lecture 4 Download Code Source Files

Section 3: Basics of Java - Input/Output, Debugging and Datatypes

Lecture 5 Basics of Java - Input/Output, Debugging and Datatypes

Section 4: Conditionals & Loops

Lecture 6 Conditionals & Loops

Section 5: Switch Case

Lecture 7 Switch Case

Section 6: Functions or Methods in Java

Lecture 8 Functions or Methods in Java

Section 7: Quick Reminder

Lecture 9 Quick Reminder!

Section 8: Introduction to Arrays and ArrayList in Java

Lecture 10 Arrays

Lecture 11 Multidimensional Arrays a.k.a 2D Arrays

Lecture 12 ArrayList

Lecture 13 Swapping Arrays (LeetCode Problem)

Lecture 14 Maximum value in the Array (LeetCode Problem)

Section 9: Strings and StringBuilders

Lecture 15 Strings and StringBuilders

Section 10: Bitwise Operators & Number Systems

Lecture 16 Number Systems

Lecture 17 Bitwise Operators

Lecture 18 Odd or Even

Lecture 19 Finding unique elements in Array

Lecture 20 Find, set, reset bits

Lecture 21 Negative Binary numbers and Range of numbers

Section 11: Linear Search Algorithm

Lecture 22 Linear Search Algorithm

Lecture 23 Search in String

Lecture 24 Search in Given Range

Lecture 25 Search Minimum value in Array

Lecture 26 Search in 2D Array

Lecture 27 Leetcode Problem

Section 12: Binary Search Algorithm

Lecture 28 Binary Search Algorithm

Lecture 29 Order Agnostic Binary Search

Lecture 30 Ceiling of a number

Lecture 31 Floor of a number

Lecture 32 First and Last occurrence of target

Lecture 33 Search in 2D Array

Section 13: Bubble Sort Algorithm

Lecture 34 Bubble Sort Algorithm

Section 14: Selection Sort Algorithm

Lecture 35 Selection Sort Algorithm

Section 15: Insertion Sort Algorithm

Lecture 36 Insertion Sort Algorithm

Section 16: Cycle Sort Algorithm

Lecture 37 Cycle Sort Algorithm

Lecture 38 Missing Number (LeetCode Problem)

Lecture 39 Finding Disappeared number (LeetCode Problem)

Lecture 40 Finding Duplicate number (LeetCode Problem)

Lecture 41 Find All duplicate numbers (LeetCode Problem)

Lecture 42 Set Mismatch (LeetCode Problem)

Lecture 43 First Missing Positive (LeetCode Problem)

Section 17: Solving Pattern Questions

Lecture 44 Pattern Questions

Section 18: Time and Space Complexity

Lecture 45 Introduction to Time Complexity

Lecture 46 Big Oh, Omega, Theta Notation

Lecture 47 Little Oh, Omega Notation

Lecture 48 Introduction to Space Complexity

Lecture 49 Determining Time Complexity of a Problem

Section 19: Maths for Data Structures and Algorithms

Lecture 50 Prime Numbers

Lecture 51 Seive of Eratosthenes

Lecture 52 Square root of a number

Lecture 53 Newton Raphson Method

Lecture 54 Factors of a number

Section 20: Recursion Deep Dive

Lecture 55 Introduction to Recursion

Lecture 56 Fibonacci Number

Lecture 57 Binary Search using Recursion

Lecture 58 Solving Basic Questions Using Recursion

Lecture 59 Solving Array Questions Using Recursion

Lecture 60 Solving Pattern Questions using Recursion

Lecture 61 Bubble Sort using Recursion

Lecture 62 Selection sort using Recursion

Lecture 63 Merge sort using Recursion

Lecture 64 Quick Sort using Recursion

Lecture 65 Strings, Subsets, Sub Sequence using Recursion

Lecture 66 Permutations using Recursion

Lecture 67 Google and Amazon level problem on Recursion

Lecture 68 Maze Problems

Section 21: BackTracking

Lecture 69 Backtracking

Lecture 70 Sudoku Solver (LeetCode Problem)

Section 22: Object Oriented Programming - Learn in the Best Way

Lecture 71 Classes and Objects

Lecture 72 Packages and 'Static' Keyword

Lecture 73 Inheritance, Encapsulation, Polymorphism

Lecture 74 Access Specifier, In-built Methods

Lecture 75 Interfaces and Abstract Methods

Lecture 76 Exception Handling, ArrayList Implementation

Lecture 77 Java Collections Framework

Section 23: Linked List

Lecture 78 Singly, Doubly And Circular Linked List

Lecture 79 Insert node in Linked List using Recursion

Lecture 80 Removing Duplicates from Linked List

Lecture 81 Merge 2 sorted Lists (LeetCode Problem)

Lecture 82 Linked List Cycle (LeetCode problem)

Lecture 83 Happy Number (Linked List)

Lecture 84 Middle of Linked List (LeetCode Problem)

Lecture 85 Sort List (LeetCode Problem)

Lecture 86 Reversing Linked List

Section 24: Stacks and Queues

Lecture 87 Stacks, Custom Stack, Dynamic Stacks

Lecture 88 Queues, Custom Queue, Circular Queues

Section 25: Binary Trees

Lecture 89 Binary Trees

Lecture 90 Count Number of Nodes in Binary Tree

Lecture 91 Sum of Nodes in Binary Tree

Lecture 92 Height of Tree

Lecture 93 Diameter of a tree

Lecture 94 Subtree of a tree (LeetCode Problem)

Section 26: Binary Search Trees

Lecture 95 Binary Search Tree

Section 27: BONUS

Lecture 96 Bonus Lecture

Any engineer, developer, programmer, who wants to improve their coding skills