LeetCode in Java: Algorithms Coding Interview Questions

LeetCode in Java: Algorithms Coding Interview Questions

LeetCode in Java: Algorithms Coding Interview Questions

Ace your next coding interview by solving essential coding interview questions and get an offer from big tech company.

Language: english

Note: 4.1/5 (529 notes) 72,124 students

Instructor(s): Md. A. Barik

Last update: 2022-04-15

What you’ll learn

  • Solve Easy to Hard Difficulty Problems
  • How to solve some of the classical coding interview questions
  • How to breaking down the coding interview problems in a decomposition manner
  • Strengthen your problem solving skills

 

Requirements

  • Basic Knowledge of fundamental data structures and algorithms is preferred
  • A Computer or Smart Phone with internet connection

 

LeetCode in Java: Algorithms Coding Interview Questions

Baby Groot plush DIY (Etsy)

 

Description

Welcome to “LeetCode in Java: Algorithms Coding Interview Questions” course!

In this course, you’ll have a detailed, step by step explanation of classical hand-picked LeetCode Problems where you’ll learn about the optimum ways to solve technical coding interview question. This is the course I wish I had when I was preparing myself for the interviews. This course comes with a 30-day money-back guarantee. So nothing to lose!

What is LeetCode?

LeetCode is a huge repository of real interview questions asked by the most popular tech industries( Google, Amazon, Facebook, Microsoft, Apple, Quora, LinkedIn, Bloomberg, Uber, Goldman Sachs, Twitter and more ).

Interviewers from the most popular companies(like Google, Amazon, Facebook, Uber, Twitter etc.) often directly ask questions they find on LeetCode. It’s hard to navigate through the large amount of problems(around 1500) to most important questions, this is what this course stand for.

I spent countless hours on LeetCode. From my experience, I’m telling you that you don’t have to do the all problem and still be able to get a job at a big tech industry.

By the time you’re finished with the course, you will be prepared for common technical coding interview questions.

See you inside the course!

 

LeetCode in Java: Algorithms Coding Interview Questions

Mokoko Seed Holidays plush DIY (Etsy)

 

Who this course is for

  • Who want to succeed the technical coding interview at companies like Google, Facebook, Microsoft, Amazon, etc.
  • People who want to developed their problem solving skill
  • Who want to ace their technical coding interview
  • Students getting ready for their internship

 

Course content

  • Introduction
    • Introduction
  • Intergers
    • FizzBuzz (LeetCode 412)
    • Palindrome Number (LeetCode 9)
    • Pow(x, n) (LeetCode 50)
  • Strings
    • Reverse String (LeetCode 344)
    • Longest Common Prefix (LeetCode 14)
    • Reverse Words in a String (LeetCode 151)
    • Longest Palindromic Substring (LeetCode 5)
    • [OLD Video] Longest Palindromic Substring (LeetCode 5)
    • Longest Substring without Repeating Characters (LeetCode 3)
    • Valid Parentheses (LeetCode 20)
    • Decode String (LeetCode 394)
    • Word Break (LeetCode 139)
    • Valid Anagram (LeetCode 242)
    • Repeated DNA Sequences (LeetCode 187)
    • Integer to English Words (LeetCode 273)
    • Basic Calculator II (LeetCode 227)
  • Arrays
    • Two Sum (LeetCode 1)
    • Sort Colors (LeetCode 75)
    • Merge Sorted Array (LeetCode 80)
    • Binary Search (LeetCode 704)
    • Length of Last Word (LeetCode 58)
    • Plus One (LeetCode 66)
    • Jump Game (LeetCode 55)
    • Search in Rotated Sorted Array (LeetCode 33)
    • Move Zeroes (LeetCode 283)
    • Asteroid Collision (LeetCode 753)
    • Kids with Greatest Number of Candies (LeetCode 1431)
    • Average Salary Excluding the Minimum and Maximum (LeetCode 1491)
    • Best Time to Buy And Sell Stock
    • Best Time to Buy and Sell Stock II (LeetCode 122)
    • Find All Disappeared Numbers in an Array (LeetCode 448)
    • Find All Duplicates Numbers in an Array (Leetcode 442)
    • Pascal’s Triangle (LeetCode 118)
    • Pascal’s Triangle II (LeetCode 119)
    • Sequential Digits (LeetCode 1291)
    • Product of Array Except Self (LeetCode 238)
    • Gas Station (LeetCode 134)
    • Rotate Array (LeetCode 189)
    • Minimum Domino Rotations For Equal Row (LeetCode 1007)
    • Subarray Product Less than K (LeetCode 713)
    • Jump Game III (LeetCode 1306)
    • K-Diff Pairs in an Array (LeetCode 532)
    • Degree of an Array (LeetCode 697)
    • [NEW] Majority Element :: 3 Solutions :: (LeetCode 169)
    • [OLD] Majority Element – O(n) Space Solution (LeetCode 169)
    • [OLD] Majority Element – O(1) Space Solution (LeetCode 169)
    • House Robber II (LeetCode 213)
    • [OLD]House Robber II (LeetCode 213)
    • Maximum Product Subarray (LeetCode 152)
    • Group Anagrams (LeetCode 49)
    • 132 Pattern :: 3 Solution :: (LeetCode 456)
    • First Missing Positive (LeetCode 41)
    • Sliding Window Maximum (LeetCode 239)
    • Median of Two Sorted Arrays (LeetCode 4)
  • Two Pointer
    • Is Subsequence (LeetCode 392)
    • Valid Palindrome (LeetCode 125)
    • Squares of a Sorted Array (LeetCode 977)
    • Remove Duplicates from Sorted Array (LeetCode 26)
    • Trapping Rain Water (LeetCode 42)
    • 3 Sum (LeetCode 15)
  • Famous Algorithm
    • Kaden’s Algorithm (Maximum Subarray :: LeetCode 53)
    • [OLD] Kaden’s Algorithm (Maximum Subarray :: LeetCode 53)
  • Sorting Algorithms
    • Merge Sort ::Sort an Array (LeetCode 912)
    • Quick Sort ::Sort an Array (LeetCode 912)
  • 2D Arrays / Matrix
    • Rotate Image (LeetCode 48)
    • Remove Covered Interval (LeetCode 1288)
    • Merge Intervals (LeetCode 56)
    • Matrix Diagonal Sum (LeetCode 1572)
    • Search a 2D Matrix (LeetCode 74)
    • Set Matrix Zeroes(3 Solutions) (LeetCode 73)
    • Spiral Matrix (LeetCode 54)
  • Linked List
    • Flatten Binary Tree to Linked List (LeetCode 114)
    • Add Two Linked Lists || Add Two Numbers II (LeetCode 445)
    • Odd Even Linked List (LeetCode 328)
    • Rotate List (LeetCode 61)
    • Swap Nodes In Pairs [Iterative] (LeetCode 24)
    • Swap Nodes In Pairs [Recursive] (LeetCode 24)
    • Middle of a Linked List (LeetCode 876)
    • Linked List Cycle ii (LeetCode 142)
    • [OLD] Linked List Cycle ii (LeetCode 142)
    • Linked List Cycle (LeetCode 141)
    • Reverse Linked List [Iterative + Recursive] (LeetCode 206)
    • [New video] Reverse Linked List [Iterative] (LeetCode 206)
    • [New video] Reverse Linked List [Recursive] (LeetCode 206)
    • Merge Two Sorted Lists (LeetCode 21)
    • Intersection of Two Linked List (LeetCode 160)
    • Palindrome Linked List (LeetCode 234)
    • Copy List with Random Pointer (LeetCode 138)
    • Reverse Nodes in k-group (LeetCode 25)
    • LRU Cache (LeetCode 146)
    • Design Linked List (LeetCode 707)
  • Tree, Stack, Queue
    • Tree Traversal Techniques in Details (Preorder, Inorder, Postorder)
    • Binary Tree Preorder Traversal ::Recursive + Iterative Solution:: (LeetCode 144)
    • Binary Tree Inorder Traversal ::Recursive + Iterative Solution:: (LeetCode 94)
    • Binary Tree Post Order Traversal ::Recursive + Iterative:: (LeetCode 145)
    • Level Order Traversal Binary Tree ::Recursive + Iterative:: (LeetCode 102)
    • [OLD] Level Order Traversal Binary Tree (LeetCode 102)
    • Binary Tree Zigzag Level Order Traversal ::Recursive + Iterative::(LeetCode 103)
    • Convert Sorted Array to Binary Search Tree (LeetCode 108)
    • Construct Binary Search Tree from Preorder Traversal (LeetCode 1008)
    • Diameter of Binary Tree (LeetCode 543)
    • Range Sum of BST (LeetCode 938)
    • Same Tree (LeetCode 100)
    • [New] Flip/Invert Binary Tree (LeetCode 226)
    • [OLD] Flip/Invert Binary Tree (LeetCode 226)
    • Minimum Depth of Binary Tree (LeetCode 111)
    • Maximum Depth of Binary Tree (LeetCode 104)
    • Balanced Binary Tree (LeetCode 110)
    • Insert into a Binary Search Tree (LeetCode 701)
    • Serialize and deserialize binary tree (LeetCode 297)
    • Binary Tree Maximum Path Sum (LeetCode 124)
    • Implement Trie (LeetCode 208)
    • Validate Binary Search Tree (LeetCode 98)
    • Robber House III (LeetCode 337)
    • Lowest Common Ancestor of Binary Tree (LeetCode 236)
  • Graph
    • Number of Islands (LeetCode 200)
    • Clone a Graph (LeetCode 133)
    • Pacific Atlantic Water Flow (LeetCode 417)
  • Fibonacci Sequence
    • Climbing Stairs
  • Backtracking / Recursion
    • Generate Parentheses (LeetCode 22)
    • Combination Sum (LeetCode 39)
    • Combination Sum iii (LeetCode 216)
    • Subsets (LeetCode 78)
    • Letter Combinations of a Phone Number (LeetCode 17)
    • Permutations (LeetCode 46)
  • Dynamic Programming
    • Climbing Stairs (LeetCode 70)
    • Fibonacci Number :: 3 Solutions :: (LeetCode 509)
    • Minimum Path Sum (LeetCode 64)
    • House Robber (LeetCode 198)
    • Longset Increasing Subsequence(LeetCode 300)
    • Best Time to Buy and Sell Stock IV (LeetCode 188)
    • Longest Common Subsequence (LeetCode 1143)
    • Edit Distance (LeetCode 72)
    • Wilcard Matching (LeetCode 44)
    • Regular Expression Matching (LeetCode 10)
  • Bit Manipulation
    • Number of 1 Bits (LeetCode 191)
    • Find the Difference (LeetCode 389)
    • Reverse Bits (LeetCode 190)
    • Hamming Distance (LeetCode 461)
    • Complement of Base 10 Integer (LeetCode 1009)
    • Counting Bits (LeetCode 338)
    • Sum of Two Integers (LeetCode 371)
    • Divide Two Integers (LeetCode 29)
  • Design
    • Design a Stack ::Min Stack:: (LeetCode 155)

 


Time remaining or 915 enrolls left

 

Don’t miss any coupons by joining our Telegram group 

Udemy Coupon Code 100% off | Udemy Free Course | Udemy offer | Course with certificate