HOT
blank

Data structure and algorithms for interviews

Development

Rating4.3
Enroll Now

Data structure and algorithms for interviews, available at $54.99, has an average rating of 4.25, with 34 lectures, 1 quizzes, based on 23 reviews, and has 11012 subscribers.

You will learn about Understand patterns behind common coding interview question Time and Space Complexity of Data Structures and Algorithms Solutions to problem discussed Code for solutions in Python This course is ideal for individuals who are Software Engineers who want to ace coding interviews in top tech firms It is particularly useful for Software Engineers who want to ace coding interviews in top tech firms.

Enroll now: Data structure and algorithms for interviews

Summary

Title: Data structure and algorithms for interviews

Price: $54.99

Average Rating: 4.25

Number of Lectures: 34

Number of Quizzes: 1

Number of Published Lectures: 33

Number of Published Quizzes: 1

Number of Curriculum Items: 35

Number of Published Curriculum Objects: 34

Original Price: $19.99

Quality Status: approved

Status: Live

What You Will Learn

  • Understand patterns behind common coding interview question
  • Time and Space Complexity of Data Structures and Algorithms
  • Solutions to problem discussed
  • Code for solutions in Python

Who Should Attend

  • Software Engineers who want to ace coding interviews in top tech firms

Target Audiences

  • Software Engineers who want to ace coding interviews in top tech firms

Covers around 20+ most popular coding interview problems ranging from a variety of topics   ( will have 200+ problems as 4 problems are being added every week)

  • Merge Intervals

    • Idea of Merge Intervals

    • Merge Intervals

    • Intervals Intersection (coming soon)

    • Conflicting Appointments (coming soon)

  • Two Pointers

    • Idea of Two pointers and types of two pointers solutions

    • Two Sum

    • Remove Duplicates from Sorted Array

    • 3 Sum

    • Pair with Target Sum  (coming soon)

    • Squaring a Sorted Array  (coming soon)

    • Triplet Sum to Zero   (coming soon)

    • Triplet Sum Close to Target   (coming soon)

    • Triplets with Smaller Sum   (coming soon)

    • Subarrays with Product Less than a Target  (coming soon)

    • Dutch National Flag Problem  (coming soon)

  • Fast & Slow Pointers

    • Linked List Cycle using Floyd’s Cycle Detection Algorithm

    • Happy Numbers

    • Ugly number  (coming soon)

    • Middle of the LinkedList (coming soon)

    • LinkedList Cycle  (coming soon)

    • Start of LinkedList Cycle (coming soon)

  • Bitwise Manipulation

    • Single Numbers 

    • Flipping an Image

    • Single Number II ( coming soon)

    • Single Number III ( coming soon)

  • Greedy Technique

    • What are Greedy Algorithms ?

    • Bulbs

    • Highest Product

    • Disjoint Sets

    • Largest Permutation ( coming soon)

    • Meeting rooms ( coming soon)

    • Distribute Candy ( coming soon)

    • Seats ( coming soon)

    • Assign Mice to Holes ( coming soon)

    • Majority Element ( coming soon)

    • Gas Station ( coming soon)

  • Island Patterns

    • Intro to Matrix

    • Number of Islands Explanation

    • Number of Islands Code

    • Number of distinct Islands Explanation

    • Number of distinct island coding

    • Count sub islands   

    • Max Area of an island   (coming soon)

    • Island Perimeter  (coming soon)

    • Flood fill  (coming soon)

    • Wall and Fates   (coming soon)

    • Minesweeper   (coming soon)

    • Surrounded Regions   (coming soon)

    • Find all groups of a farm land   (coming soon)

  • Topological Sort

    • Introduction to Graph Problems 

    • Topological Sort

    • Kahn’s Algorithm

    • Implementing Topological Sort

    • Course Schedule

    • Alien Dictionary

    • Minimum Height Trees  (coming soon)

    • All Ancestors of a Node in a Directed Acyclic Graph  (coming soon)

    • Build a Matrix With Conditions  (coming soon)

    • Find All Possible Recipes from Given Supplies  (coming soon)

  • Depth First Search

    • Path Sum

Upcoming Additions  (3-4 problems are added every week)

  • Sliding Window

    • Easy

      • Maximum Sum Subarray of Size K

      • Smallest Subarray With a Greater Sum

    • Medium

      • Longest Substring with maximum K Distinct Characters 

      • Fruits into Baskets

    • Hard

      • Longest Substring with Distinct Characters

      • Longest Substring with Same Letters after Replacement

      • Longest Subarray with Ones after Replacement

  • Arrays

    • Medium

      • Group Anagrams

    • Hard

      • Trapping Rain Water

  • Merge Intervals

    • Medium

      • Intervals Intersection

      • Conflicting Appointments

  • Linked List

    • Easy

      • Reverse a Linked List

    • Medium

      • Reverse a sub list

      • Reverse a k-element sub list

  • Two Heaps

    • Medium

      • Find the median of a number stream

    • Hard

      • Maximum Capital

      • Sliding Window Median 

  • Top k elements

    • Easy

      • Top ‘K’ Numbers

      • Kth Smallest Number

      • ‘K’ Closest Points to the Origin

      • Connect Ropes

    • Medium

      • Top ‘K’ Frequent Numbers

      • Frequency Sort

      • Kth Largest Number in a Stream

      • ‘K’ Closest Numbers

      • Maximum Distinct Elements

      • Sum of Elements

    • Hard

      • Rearrange String

  • K-way merge

  • Binary Search

  • Backtracking

  • 1D Dynamic programing

  • 2D Dynamic programing

  • Cyclic Sort

  • Topological Sort

  • Stacks

  • Queues

  • Depth First Search

  • Breadth First Search

  • Trie

  • Hash Maps

  • Math Tricks

  • Miscellaneous

Course Curriculum

Chapter 1: Identifying Patterns in a Coding Interview

Lecture 1: 6 common Coding Patterns for Interviews

Lecture 2: 10 Golden Rules for Solving a Coding Question in an Interview

Chapter 2: Merge Intervals

Lecture 1: Idea of Merge Intervals

Lecture 2: Merge Interval Code

Chapter 3: Two Pointers

Lecture 1: Idea of Two pointers and types of two pointers solutions

Lecture 2: Two Sum

Lecture 3: Remove Duplicates from Sorted Array

Lecture 4: 3 Sum

Chapter 4: Fast Slow Pointers

Lecture 1: Linked List Cycle using Floyd's Cycle Detection Algorithm

Lecture 2: Happy Numbers

Chapter 5: Bitwise Manipulation

Lecture 1: Single Number

Lecture 2: Flipping an Image

Chapter 6: Greedy

Lecture 1: What are Greedy Algorithms ?

Lecture 2: Bulbs

Lecture 3: Highest Product

Lecture 4: Disjoint Sets

Chapter 7: Island Patterns

Lecture 1: Intro to Matrix

Lecture 2: Number of Islands Explantion

Lecture 3: Number of Islands Code

Lecture 4: Number of distinct Islands Explanation

Lecture 5: Number of distinct island coding

Lecture 6: Count sub islands Explanation

Lecture 7: Count sub islands coding

Chapter 8: Topological Sort

Lecture 1: Introduction to Graph Problems

Lecture 2: What is Topological Sort?

Lecture 3: Kahn's Algorithm

Lecture 4: Coding Topological Sort

Lecture 5: Course Schedule (problem statement explanation)

Lecture 6: Course Schedule ( code extended from Coding Topological Sort)

Lecture 7: Course Schedule 2

Chapter 9: Depth First Search (DFS)

Lecture 1: Intro to DFS

Lecture 2: LC 112 Target Sum

Chapter 10: Bonus Section

Lecture 1: Bonus Section

Instructors

Rating Distribution

  • 1 stars: 1 votes
  • 2 stars: 1 votes
  • 3 stars: 6 votes
  • 4 stars: 2 votes
  • 5 stars: 13 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!

You may also like

Top 10 Ethical AI Courses to Learn in November 2024

Top 10 Game Development Courses to Learn in November 2024

Top 10 Software Testing Courses to Learn in November 2024