The Essential Algorithms and Data Structures

Focused View

Mohammed Yasir Eramangadan

13:40:53

9 View

1. Introduction

1. Concepts.mp4

04:55

2. Note.html

2. Arrays

1.1 01 two sum.zip

1.2 Problem Link.html

1. Two Sum.mp4

07:00

2.1 02 stock.zip

2.2 Problem Link.html

2. Best Time to Buy and Sell Stocks.mp4

08:07

3.1 04 product except self.zip

3.2 Problem Link.html

3. Product of Array Except Self.mp4

08:40

4.1 03 contain duplicate.zip

4.2 Problem Link.html

4. Contains Duplicate.mp4

04:26

5.1 05 kadane.zip

5.2 Problem Link.html

5. Maximum Subarray.mp4

10:50

6.1 06 mx product.zip

6.2 Problem Link.html

6. Maximum Product Subarray.mp4

15:01

7.1 07 rotated sorted.zip

7.2 Problem Link.html

7. Find Minimum in Rotated Sorted Array.mp4

07:11

8.1 08 rotated sorted search.zip

8.2 Problem Link.html

8. Search in Rotated Sorted Array.mp4

10:05

9.1 09 3 sum.zip

9.2 3 sum.html

9. 3Sum.mp4

12:48

10.1 10 water trapping.zip

10.2 Problem Link.html

10. Container With Most Water.mp4

08:52

3. Bit Manipulation

1.1 11 sum of ints.zip

1.2 Problem Link.html

1. Sum of Two Integers.mp4

05:08

2.1 12 no of 1s.zip

2.2 Problem Link.html

2. Number of 1 Bits.mp4

07:18

3.1 13 bit cnt list.zip

3.2 Problem Link.html

3. Counting Bits.mp4

06:01

4.1 14 missing number.zip

4.2 Problem Link.html

4. Missing Number.mp4

06:58

5.1 15 reverse bits.zip

5.2 Problem Link.html

5. Reverse Bits.mp4

09:01

4. Dynamic Programing

1.1 16 climb stairs.zip

1.2 Problem Link.html

1. Climbing Stairs.mp4

06:08

2.1 17 coin change.zip

2.2 Problem Link.html

2. Coin Change.mp4

25:15

3.1 18 lis.zip

3.2 Problem Link.html

3. Longest Increasing Subsequence.mp4

12:16

4.1 19 longest common subsequence.zip

4.2 Problem Link.html

4. Longest Common Subsequence.mp4

5.1 20 word break.zip

5.2 Problem Link.html

5. Word Break Problem.mp4

06:29

6.1 21 combination sum.zip

6.2 Problem Link.html

6. Combination Sum.mp4

09:48

7.1 22 house rober.zip

7.2 Problem Link.html

7. House Robber.mp4

10:01

8.1 23 house rober 2.zip

8.2 Problem Link.html

8. House Robber II.mp4

11:00

9.1 24 decode ways.zip

9.2 Problem Link.html

9. Decode Ways.mp4

15:20

10.1 25 unique path.zip

10.2 Problem Link.html

10. Unique Paths.mp4

06:03

11.1 26 jump game.zip

11.2 Problem Link.html

11. Jump Game.mp4

09:30

5. Graph Theory

1.1 27 clone graph.zip

1.2 Problem Link.html

1. Clone Graph.mp4

10:48

2.1 28 course schedule.zip

2.2 Problem Link.html

2. Course Schedule.mp4

10:31

3.1 29 pacific atlantic.zip

3.2 Problem Link.html

3. Pacific Atlantic Water Flow.mp4

13:11

4.1 30 number of isles.zip

4.2 Problem Link.html

4. Number of Islands.mp4

07:20

5.1 31 longest consecutive sequence.zip

5.2 Problem Link.html

5. Longest Consecutive Sequence.mp4

07:27

6.1 32 alien dictionary.zip

6.2 Problem Link.html

6. Alien Dictionary.mp4

13:40

7.1 33 valid tree.zip

7.2 Problem Link.html

7. Graph Valid Tree.mp4

12:20

8.1 34 connnected components.zip

8.2 Problem Link.html

8. Number of Connected Components in an Undirected Graph.mp4

10:31

6. Intervals

1.1 35 insert interval.zip

1.2 Problem Link.html

1. Insert Interval.mp4

10:16

2.1 36 merge intervals.zip

2.2 Problem Link.html

2. Merge Intervals.mp4

08:19

3.1 37 non overlapping intervals.zip

3.2 Problem Link.html

3. Non-overlapping Intervals.mp4

09:03

4.1 38 can attent meeting.zip

4.2 Problem Link.html

4. Meeting Rooms.mp4

02:39

5.1 39 meeting room 2.zip

5.2 Problem Link.html

5. Meeting Rooms II.mp4

08:39

7. Linked List

1.1 40 reverse linked list.zip

1.2 Problem Link.html

1. Reverse a Linked List.mp4

13:35

2.1 41 cycle ll.zip

2.2 Problem Link.html

2. Detect Cycle in a Linked List.mp4

08:53

3.1 42 merge 2 ll.zip

3.2 Problem Link.html

3. Merge Two Sorted Lists.mp4

10:27

4.1 43 merge sorted lists.zip

4.2 Problem Link.html

4. Merge K Sorted Lists.mp4

11:31

5.1 44 remove nth node from end.zip

5.2 Problem Link.html

5. Remove Nth Node From End Of List.mp4

07:09

6.1 45 reorder list.zip

6.2 Problem Link.html

6. Reorder List.mp4

16:50

8. Matrix

1.1 46 set 0s.zip

1.2 Problem Link.html

1. Set Matrix Zeroes.mp4

14:13

2.1 47 spiral order.zip

2.2 Problem Link.html

2. Spiral Matrix.mp4

10:04

3.1 48 rotate matrix.zip

3.2 Problem Link.html

3. Rotate Image.mp4

08:23

4.1 49 word search.zip

4.2 Problem Link.html

4. Word Search.mp4

11:10

9. Strings

1.1 50 len of longest substr.zip

1.2 Problem Link.html

1. Longest Substring Without Repeating Characters.mp4

11:18

2.1 51 char replace.zip

2.2 Problem Link.html

2. Longest Repeating Character Replacement.mp4

16:12

3.1 52 min window.zip

3.2 Problem Link.html

3. Minimum Window Substring.mp4

16:09

4.1 53 is anag.zip

4.2 Problem Link.html

4. Valid Anagram.mp4

06:32

5.1 54 grp anag.zip

5.2 Problem Link.html

5. Group Anagrams.mp4

09:40

6.1 55 valid paranthesis.zip

6.2 Problem Link.html

6. Valid Parentheses.mp4

12:48

7.1 56 is palindrome.zip

7.2 Problem Link.html

7. Valid Palindrome.mp4

09:41

8.1 57 longest pal.zip

8.2 Problem Link.html

8. Longest Palindromic Substring.mp4

11:56

9.1 58 cnt pal substr.zip

9.2 Problem Link.html

9. Palindromic Substrings.mp4

09:49

10.1 59 enc dec.zip

10.2 Problem Link.html

10. Encode and Decode Strings.mp4

10:59

10. Tree

1.1 60 tree depth.zip

1.2 Problem Link.html

1. Maximum Depth of Binary Tree.mp4

08:56

2.1 61 is same tree.zip

2.2 Problem Link.html

2. Same Tree.mp4

09:07

3.1 62 invert tree.zip

3.2 Problem Link.html

3. InvertFlip Binary Tree.mp4

10:43

4.1 63 max path.zip

4.2 Problem Link.html

4. Binary Tree Maximum Path Sum.mp4

26:26

5.1 64 level order.zip

5.2 Problem Link.html

5. Binary Tree Level Order Traversal.mp4

10:11

6.1 65 serialize deserialize.zip

6.2 Problem Link.html

6. Serialize and Deserialize Binary Tree.mp4

12:45

7.1 66 is sub tree.zip

7.2 Problem Link.html

7. Subtree of Another Tree.mp4

11:48

8.1 67 build tree.zip

8.2 Problem Link.html

8. Construct Binary Tree from Preorder and Inorder Traversal.mp4

19:04

9.1 68 is bst.zip

9.2 Problem Link.html

9. Validate Binary Search Tree.mp4

10:33

10.1 69 kth smallest.zip

10.2 Problem Link.html

10. Kth Smallest Element in a BST.mp4

21:05

11.1 70 lca.zip

11.2 Problem Link.html

11. Lowest Common Ancestor of BST.mp4

11:36

12.1 71 trie.zip

12.2 Problem Link.html

12. Implement Trie (Prefix Tree).mp4

16:42

13.1 72 add and search word.zip

13.2 Problem Link.html

13. Add and Search Word.mp4

21:45

14.1 73 word search 2.zip

14.2 Problem Link.html

14. Word Search II.mp4

18:07

11. Heap

1.1 74 top k frequent.zip

1.2 Problem Link.html

1. Top K Frequent Elements.mp4

04:48

2.1 75 median from data stream.zip

2.2 Problem Link.html

2. Find Median from Data Stream.mp4

11:03

Description

Bootstrap DSA with Blind 75, a problem set from an ex-Meta Engineer.

What You'll Learn?

Algorithmic thinking and concept building
7 HARD, 48 MEDIUM, 20 EASY problems
Logical components of data structures and algorithms
Array, Matrix, Interval, String, Bits, Linked List, Graph, Tree, Heap and DP
Tackle difficult coding interviews
Improve yourself to be a stronger developer

Who is this for?

For students to bootstrap data structures and algorithms.

For programmers to comprehend data structures and algorithms.

For candidates to excel at programming interviews.

What You Need to Know?

Basic coding

Basic C++ standard data types.

More details

Description
Are you aspiring to master algorithms and data structures? stuck at how to filter best problems with curated logical set?

Welcome to "Blind 75 Essentials: Level-up forÂ Coding Interviews". This course will guide you to build logical constructs of programming, algorithms and data structures using C++, an ultimate blend of most curated list of logics from algorithms and data structures.

The Blind-75 is a set of problems from Leetcode, chosen by a Meta engineer in 2018 and it became famous as a great tool to bootstrap algorithms and data structures.

Lectures at this course are framed to reinforce logics around algorithms and data structures. Each problem starts with discussions, transcending to optimized solutions with hands-on-coding with C++.

Here is what you will learn -

Data Structures Covered (in C++)
Structures with list form: Array, Matrix, Interval, String & Bits
Structures formed by links & nodes: Linked List, Tree, Heap & Graph
ANDÂ Dynamic Programming

Problem Types
1. Traversal, Transformation and Searching
2. Gauging, Counting and Verification
3. Linking, Optimization and Path selection
4. Interval merging and Insertions.

Links to problems are given at resources section.
Source code (C++) for each lecture is available for you to download.
Enjoy the trajectory of course, have a nice time ahead.

Who this course is for:
For students to bootstrap data structures and algorithms.
For programmers to comprehend data structures and algorithms.
For candidates to excel at programming interviews.

User Reviews

Rating

average 0

Total votes0

Focused display

For offers and coupons, visit the link given as 'website'.Welcome to my Udemy profile! I'm Mohammed Yasir Eramangadan, a passionate young software engineer with a penchant for both practicing and teaching algorithms and data structures. With a focus on practical application and clear explanation, I aim to demystify these fundamental concepts for learners of all levels. Join me on a journey to master the building blocks of efficient software development!

Udemy

View courses Udemy

Students take courses primarily to improve job-related skills.Some courses generate credit toward technical certification. Udemy has made a special effort to attract corporate trainers seeking to create coursework for employees of their company.