Blind 75, The Dsa Essentials: Level-Up Coding Interviews

Build and blend DSA logics by solving Blind 75, a problem set curated by an ex-Meta Engineer.

What you'll learn

Solve curated list of problem by MANG engineer

Understand essential logics of Data Structures and Algorithms

Advance your algorithmic thinking

Build a firm grip on programming concepts

Array, Strings, Linked List, Bits, DP, Graphs, Tree and Heap

Covering simple to advanced problems

Learn to analyze problems

Learn to write complex codes

Requirements

Familiarity with basic coding

Ability to understand code

Description

Are you aspiring to master algorithms? stuck how to filter best problems with curated logical set?Welcome to Blind 75 Essentials: Level-up Coding Interviews the course which guide to build logical constructs of programming and DSA, an ultimate blend of most curated list of logics of Data Structures and Algorithms and helping you to strap your boots strong at your algorithm journeys ahead. The Course contains Blind 75, a list of 75 coding problems from LeetCode having most frequent and essential logics of DSA for preparing for technical interviews at MANG companies. The list was created by a Meta engineer in 2018 and has become famous as a great tool to start your interview preparation. The lecture contents are formatted to reinforce your understanding further by ordering the flow to build your logics constructively. Every problem starts with discussions around logics, then transcending to optimized methods with hands-on-coding in C++. Here is what you will learn -Problems on Data Structures* Arrays, Strings, Vectors* Hashing (Unordered Maps, Maps, Sets)* Stacks, Queues, Linked Lists* Binary Trees, BSTs, Heaps* Graphs, Tries, MatricsProblems on Algorithms* Brute force, Backtracking* Sliding Window, Interval Algorithms* Sorting, Searching, Binary Search* Dynamic Programming Fundamentals* Graph AlgorithmsLinks to actual problems and sample text forms of solutions-discussed are provided at resources section for further practice and analysis. Enjoy the trajectory of course, have a nice time.

Overview

Section 1: Introduction

Lecture 1 Concepts

Lecture 2 Note

Section 2: Arrays

Lecture 3 Two Sum

Lecture 4 Best Time to Buy and Sell Stocks

Lecture 5 Product of Array Except Self

Lecture 6 Contains Duplicate

Lecture 7 Maximum Subarray

Lecture 8 Maximum Product Subarray

Lecture 9 Find Minimum in Rotated Sorted Array

Lecture 10 Search in Rotated Sorted Array

Lecture 11 3Sum

Lecture 12 Container With Most Water

Section 3: Bit Manipulation

Lecture 13 Sum of Two Integers

Lecture 14 Number of 1 Bits

Lecture 15 Counting Bits

Lecture 16 Missing Number

Lecture 17 Reverse Bits

Section 4: Dynamic Programing

Lecture 18 Climbing Stairs

Lecture 19 Coin Change

Lecture 20 Longest Increasing Subsequence

Lecture 21 Longest Common Subsequence

Lecture 22 Word Break Problem

Lecture 23 Combination Sum

Lecture 24 House Robber

Lecture 25 House Robber II

Lecture 26 Decode Ways

Lecture 27 Unique Paths

Lecture 28 Jump Game

Section 5: Graph Theory

Lecture 29 Clone Graph

Lecture 30 Course Schedule

Lecture 31 Pacific Atlantic Water Flow

Lecture 32 Number of Islands

Lecture 33 Longest Consecutive Sequence

Lecture 34 Alien Dictionary

Lecture 35 Graph Valid Tree

Lecture 36 Number of Connected Components in an Undirected Graph

Section 6: Intervals

Lecture 37 Insert Interval

Lecture 38 Merge Intervals

Lecture 39 Non-overlapping Intervals

Lecture 40 Meeting Rooms

Lecture 41 Meeting Rooms II

Section 7: Linked List

Lecture 42 Reverse a Linked List

Lecture 43 Detect Cycle in a Linked List

Lecture 44 Merge Two Sorted Lists

Lecture 45 Merge K Sorted Lists

Lecture 46 Remove Nth Node From End Of List

Lecture 47 Reorder List

Section 8: Matrix

Lecture 48 Set Matrix Zeroes

Lecture 49 Spiral Matrix

Lecture 50 Rotate Image

Lecture 51 Word Search

Section 9: Strings

Lecture 52 Longest Substring Without Repeating Characters

Lecture 53 Longest Repeating Character Replacement

Lecture 54 Minimum Window Substring

Lecture 55 Valid Anagram

Lecture 56 Group Anagrams

Lecture 57 Valid Parentheses

Lecture 58 Valid Palindrome

Lecture 59 Longest Palindromic Substring

Lecture 60 Palindromic Substrings

Lecture 61 Encode and Decode Strings

Section 10: Tree

Lecture 62 Maximum Depth of Binary Tree

Lecture 63 Same Tree

Lecture 64 Invert/Flip Binary Tree

Lecture 65 Binary Tree Maximum Path Sum

Lecture 66 Binary Tree Level Order Traversal

Lecture 67 Serialize and Deserialize Binary Tree

Lecture 68 Subtree of Another Tree

Lecture 69 Construct Binary Tree from Preorder and Inorder Traversal

Lecture 70 Validate Binary Search Tree

Lecture 71 Kth Smallest Element in a BST

Lecture 72 Lowest Common Ancestor of BST

Lecture 73 Implement Trie (Prefix Tree)

Lecture 74 Add and Search Word

Lecture 75 Word Search II

Section 11: Heap

Lecture 76 Top K Frequent Elements

Lecture 77 Find Median from Data Stream

Students pursuing Computer Science or related fields.,Beginner-Intermediate level programmers who wish to ground their theories.,Developers who want to excel in problem solving skills & interviews.