LEETCODE In C++ Top 100 Coding Interview Problems

LEETCODE In C++ – Top 100 Coding Interview Problems, available at $59.99, has an average rating of 4.81, with 100 lectures, based on 100 reviews, and has 543 subscribers.

You will learn about Top 100 Leetcode Practice Problems MAANG Interview Problems On Leetcode Leetcode Practice Problems On Dynamic Programming, Greedy Algorithms in Javascript Leetcode Practice Problems On Graphs, Trees, Backtracking in Javascript Leetcode Practice Problems On Arrays, Sliding Window, Two Pointer, Ad hoc Problems in Javascript This course is ideal for individuals who are This course is for anyone practicing on Leetcode for coding interviews It is particularly useful for This course is for anyone practicing on Leetcode for coding interviews.

Enroll now: LEETCODE In C++ – Top 100 Coding Interview Problems

Summary

Title: LEETCODE In C++ – Top 100 Coding Interview Problems

Price: $59.99

Average Rating: 4.81

Number of Lectures: 100

Number of Published Lectures: 100

Number of Curriculum Items: 100

Number of Published Curriculum Objects: 100

Original Price: $19.99

Quality Status: approved

Status: Live

What You Will Learn

Top 100 Leetcode Practice Problems

MAANG Interview Problems On Leetcode

Leetcode Practice Problems On Dynamic Programming, Greedy Algorithms in Javascript

Leetcode Practice Problems On Graphs, Trees, Backtracking in Javascript

Leetcode Practice Problems On Arrays, Sliding Window, Two Pointer, Ad hoc Problems in Javascript

Who Should Attend

This course is for anyone practicing on Leetcode for coding interviews

Target Audiences

This course is for anyone practicing on Leetcode for coding interviews

The “Mastering the Top 100 Leetcode Problems” course is a comprehensive training program designed to help you excel in coding interviews by focusing on the top 100 Leetcode problems.

Leetcode is a well-known platform that offers a vast collection of coding challenges frequently used by tech companies during their hiring process.

In this course, we will tackle the most frequently encountered problems in coding interviews.

Each problem will be thoroughly analyzed, providing you with valuable insights into the underlying concepts and problem-solving techniques.

You will learn how to approach problems systematically, break them down into smaller manageable tasks, and devise efficient algorithms to solve them.

A key aspect of this course is the live implementation of code.

Each problem will be demonstrated in real-time, allowing you to witness the coding process firsthand.

This practical approach will help solidify your understanding and improve your coding skills.

You will gain insights into efficient coding practices, optimization techniques, and common pitfalls to avoid.

We will go over each of the problems in extreme detail, going through the thought process, and live implementation for the code.

To support your learning journey, the course will provide code sample files accompanying the video lectures.

These resources will serve as valuable references and guides, assisting you in implementing the solutions effectively.

Course Curriculum

Chapter 1: Arrays and Its Techniques

Lecture 1: Practice Problem 1 – Maximum Sum Subarray

Lecture 2: Practice Problem 2 – Best Time To Buy And Sell Stock

Lecture 3: Practice Problem 3 – Majority Element

Lecture 4: Practice Problem 4 – Move Zeroes

Lecture 5: Practice Problem 5 – Two Sum II Input Array Is Sorted

Lecture 6: Practice Problem 6 – Trapping Rain Water

Lecture 7: Practice Problem 7 – Sort Colors

Lecture 8: Practice Problem 8 – Maximum Product Subarray

Lecture 9: Practice Problem 9 – Product Of Array Except Self

Lecture 10: Practice Problem 10 – Sliding Window Maximum

Lecture 11: Practice Problem 11 – Rotate Array

Lecture 12: Practice Problem 12 – Max Consecutive Ones

Lecture 13: Practice Problem 13 – Set Matrix Zeroes

Lecture 14: Practice Problem 14 – Container With Most Water

Lecture 15: Practice Problem 15 – Spiral Matrix

Lecture 16: Practice Problem 16 – Valid Sudoku

Chapter 2: Recursion & Backtracking

Lecture 1: Practice Problem 1 – Combination Sum

Lecture 2: Practice Problem 2 – Subsets

Lecture 3: Practice Problem 3 – N Queens

Chapter 3: Binary Search

Lecture 1: Practice Problem 1 – Search Insert Position

Lecture 2: Practice Problem 2 – Find First And Last Position Of Element In Sorted Array

Lecture 3: Practice Problem 3 – Search In A Rotated Sorted Array

Lecture 4: Practice Problem 4 – Koko Eating Bananas

Lecture 5: Practice Problem 5 – Magnetic Force Between Two Balls

Lecture 6: Practice Problem 6 – Find Minimum In Rotated Sorted Array

Chapter 4: Binary Search Tree

Lecture 1: Practice Problem 1 – Kth Smallest Element In BST

Lecture 2: Practice Problem 2 – Validate Binary Search Tree

Lecture 3: Practice Problem 3 – Lowest Common Ancestor Of A Binary Search Tree

Chapter 5: Binary Trees

Lecture 1: Practice Problem 1 – Binary Tree InOrder Traversal

Lecture 2: Practice Problem 2 – Symmetric Tree

Lecture 3: Practice Problem 3 – Maximum Depth Of Binary Tree

Lecture 4: Practice Problem 4 – Invert Binary Tree

Lecture 5: Practice Problem 5 – Diameter Of A Binary Tree

Lecture 6: Practice Problem 6 – Binary Tree Level Order Traversal

Lecture 7: Practice Problem 7 – Path Sum

Lecture 8: Practice Problem 8 – Path Sum II

Lecture 9: Practice Problem 9 – Cousins In Binary Tree

Lecture 10: Practice Problem 10 – Maximum Level Sum Of Binary Tree

Lecture 11: Practice Problem 11 – Same Tree

Lecture 12: Practice Problem 12 – Construct Binary Tree From PreOrder And InOrder Traversal

Lecture 13: Practice Problem 13 – Subtree Of Another Tree

Lecture 14: Practice Problem 14 – Balanced Binary Tree

Lecture 15: Practice Problem 15 – Binary Tree Right Side View

Lecture 16: Practice Problem 16 – Count Good Nodes In Binary Tree

Lecture 17: Practice Problem 17 – Sum Of Left Leaves

Chapter 6: Bit Manipulation

Lecture 1: Practice Problem 1 – Single Number

Lecture 2: Practice Problem 2 – Counting Bits

Lecture 3: Practice Problem 3 – Find The Duplicate Number

Lecture 4: Practice Problem 4 – Divide Two Integers

Lecture 5: Practice Problem 5 – Missing Number

Lecture 6: Practice Problem 6 – Number Of 1 Bits

Lecture 7: Practice Problem 7 – Sum Of Two Integers

Lecture 8: Practice Problem 8 – Reverse Integer

Chapter 7: Dynamic Programming

Lecture 1: Practice Problem 1 – Climbing Stairs

Lecture 2: Practice Problem 2 – Jump Game

Lecture 3: Practice Problem 3 – Coin Change

Lecture 4: Practice Problem 4 – Target Sum

Lecture 5: Practice Problem 5 – Longest Common Subequence

Lecture 6: Practice Problem 6 – House Robber

Lecture 7: Practice Problem 7 – Longest Increasing Subsequence

Lecture 8: Practice Problem 8 – Partition Equal Subset Sum

Lecture 9: Practice Problem 9 0-1 Matrix

Lecture 10: Practice Problem 10 – Integer Replacement

Lecture 11: Practice Problem 11 – Edit Distance

Lecture 12: Practice Problem 12 – Decode Ways

Lecture 13: Practice Problem 13 – House Robber II

Lecture 14: Practice Problem 14 – Min Cost Climbing Stairs

Lecture 15: Practice Problem 15 – Longest Palindromic Substring

Chapter 8: Graphs

Lecture 1: Practice Problem 1 – Course Schedule

Lecture 2: Practice Problem 2 – Number Of Islands

Lecture 3: Practice Problem 3 – Find The Town Judge

Lecture 4: Practice Problem 4 – Surrounded Regions

Lecture 5: Practice Problem 5 – Number Of Enclaves

Lecture 6: Practice Problem 6 – Network Delay Time

Lecture 7: Practice Problem 7 – Flood Fill

Chapter 9: Hash Table

Lecture 1: Practice Problem 1 – Two Sum

Lecture 2: Practice Problem 2 – Three Sum

Lecture 3: Practice Problem 3 – Longest Consecutive Sequence

Lecture 4: Practice Problem 4 – Contains Duplicate

Lecture 5: Practice Problem 5 – Valid Anagram

Chapter 10: Heaps

Lecture 1: Practice Problem 1 – Kth Largest Element In An Array

Lecture 2: Practice Problem 2 – Find Median From Data Stream

Lecture 3: Practice Problem 3 – Kth Largest Element In A Stream

Chapter 11: Linked Lists

Lecture 1: Practice Problem 1 – Intersection Of Two Linked Lists

Lecture 2: Practice Problem 2 – Merge Two Sorted Lists

Lecture 3: Practice Problem 3 Linked List Cycle

Lecture 4: Practice Problem 4 – Reverse Linked List

Lecture 5: Practice Problem 5 – Palindrome Linked List

Lecture 6: Practice Problem 6 – Linked List Cycle II

Instructors

Pratik Singhal
Senior Software Engineer @ Amazon

Rating Distribution

1 stars: 1 votes

2 stars: 0 votes

3 stars: 1 votes

4 stars: 17 votes

5 stars: 81 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!