| 0 | 560.8 KB | ||
| 1 | 631.4 KB | ||
| 1 - Introduction.mp4 | 41.3 MB | ||
| 2 | 446.1 KB | ||
| 3 | 167 KB | ||
| 4 | 470 KB | ||
| 5 | 943.6 KB | ||
| 6 | 164.5 KB | ||
| 7 | 412.1 KB | ||
| 8 | 345.3 KB | ||
| 9 | 152.8 KB | ||
| 10 | 345.9 KB | ||
| 10 - Search in Rotated Sorted Array.mp4 | 43 MB | ||
| 10 - Solution.java | 716.8 B | ||
| 11 | 577.2 KB | ||
| 11 - 3 Sum.mp4 | 105.5 MB | ||
| 11 - Solution.java | 1.3 KB | ||
| 12 - Container With Most Water.mp4 | 56.4 MB | ||
| 12 | 463.7 KB | ||
| 12 - Solution.java | 512 B | ||
| 12 - Source Code Container with Most Water.txt | 102.4 B | ||
| 13 | 114.4 KB | ||
| 13 - Solution.java | 204.8 B | ||
| 13 - Source Code Sum of Two Integers.txt | 102.4 B | ||
| 13 - Sum of Two Integers.mp4 | 96.8 MB | ||
| 14 - Solution.java | 307.2 B | ||
| 14 | 960.4 KB | ||
| 14 - Number of 1 Bits.mp4 | 31.6 MB | ||
| 15 - Counting Bits.mp4 | 191.9 MB | ||
| 15 - Solution.java | 409.6 B | ||
| 15 - Source Code Counting Bits.txt | 102.4 B | ||
| 15 | 536.3 KB | ||
| 16 - Missing Number.mp4 | 37.4 MB | ||
| 16 | 884.6 KB | ||
| 16 - Solution.java | 204.8 B | ||
| 17 - Solution.java | 307.2 B | ||
| 17 - Source Code Reverse Bits.txt | 102.4 B | ||
| 17 | 816.3 KB | ||
| 17 - Reverse Bits.mp4 | 61.1 MB | ||
| 18 - Climbing Stairs.mp4 | 109.8 MB | ||
| 18 - Solution.java | 614.4 B | ||
| 18 | 297.1 KB | ||
| 19 - Solution.java | 614.4 B | ||
| 2 - Source Code.html | 204.8 B | ||
| 19 | 455 KB | ||
| 19 - Coin Change.mp4 | 107.2 MB | ||
| 20 - Longest Increasing Subsequence.mp4 | 82.9 MB | ||
| 20 - Solution.java | 614.4 B | ||
| 20 | 838.4 KB | ||
| 21 - Longest Common Subsequence.mp4 | 98.1 MB | ||
| 21 - Solution.java | 614.4 B | ||
| 21 | 417.9 KB | ||
| 22 - Solution.java | 614.4 B | ||
| 22 - Word Break Problem.mp4 | 45.5 MB | ||
| 22 | 460.8 KB | ||
| 23 | 630.3 KB | ||
| 23 - Combination Sum IV.mp4 | 68.7 MB | ||
| 23 - Solution.java | 409.6 B | ||
| 23 - Source Code Combination Sum IV.txt | 102.4 B | ||
| 24 | 359.1 KB | ||
| 24 - House Robber.mp4 | 64.9 MB | ||
| 24 - Solution.java | 512 B | ||
| 25 - House Robber II.mp4 | 51.5 MB | ||
| 25 - Solution.java | 614.4 B | ||
| 25 | 51.3 KB | ||
| 26 | 516.3 KB | ||
| 26 - Decode Ways.mp4 | 87.7 MB | ||
| 26 - Solution.java | 614.4 B | ||
| 27 | 388.4 KB | ||
| 27 - Solution.java | 614.4 B | ||
| 27 - Unique Paths.mp4 | 44.9 MB | ||
| 28 - Jump Game.mp4 | 20.8 MB | ||
| 28 - Solution.java | 307.2 B | ||
| 29 - Clone Graph.mp4 | 137.6 MB | ||
| 3 - Solution.java | 512 B | ||
| 3 - Two Sum.mp4 | 35.8 MB | ||
| 28 | 408 KB | ||
| 29 | 210 KB | ||
| 29 - Solution.java | 1.2 KB | ||
| 30 - Code Course Schedule Kahns Algorithm.txt | 102.4 B | ||
| 30 - Course Schedule.mp4 | 156.1 MB | ||
| 30 | 114.5 KB | ||
| 30 - Solution.java | 1.2 KB | ||
| 31 - Pacific Atlantic Waterflow.mp4 | 329.8 MB | ||
| 31 | 559.7 KB | ||
| 31 - Solution.java | 1.5 KB | ||
| 32 | 808.4 KB | ||
| 32 - Number of Islands.mp4 | 122.4 MB | ||
| 32 - Solution.java | 716.8 B | ||
| 33 - Code Longest Consecutive Sequence.txt | 102.4 B | ||
| 33 | 563.1 KB | ||
| 33 - Longest Consecutive Sequence.mp4 | 62.2 MB | ||
| 33 - Solution.java | 614.4 B | ||
| 34 - Alien Dictionary.mp4 | 244.6 MB | ||
| 34 - Code Alien Dictionary Kahns Algorithm.txt | 102.4 B | ||
| 34 - Solution.java | 2 KB | ||
| 35 - Graph Valid Tree.mp4 | 160.9 MB | ||
| 4 - Best Time to Buy and Sell Stock.mp4 | 26.3 MB | ||
| 4 - Solution.java | 409.6 B | ||
| 34 | 750.2 KB | ||
| 35 | 334 KB | ||
| 35 - Solution.java | 1 KB | ||
| 36 | 932.7 KB | ||
| 36 - Number of Connected Components in an Undirected Graph.mp4 | 78.7 MB | ||
| 36 - Solution.java | 819.2 B | ||
| 37 - Insert Interval.mp4 | 146.2 MB | ||
| 37 - Solution.java | 1 KB | ||
| 37 | 895.5 KB | ||
| 37 - Source Code Insert Interval.txt | 102.4 B | ||
| 38 - Solution.java | 614.4 B | ||
| 38 - Source Code Merge Interval.txt | 102.4 B | ||
| 38 | 190.6 KB | ||
| 38 - Merge Interval.mp4 | 68 MB | ||
| 39 - Nonoverlapping Intervals.mp4 | 104.3 MB | ||
| 39 - Solution.java | 614.4 B | ||
| 39 - Source Code Nonoverlapping Intervals.txt | 102.4 B | ||
| 39 | 654.6 KB | ||
| 40 | 328.4 KB | ||
| 40 - Meeting Rooms.mp4 | 69.5 MB | ||
| 40 - Solution.java | 716.8 B | ||
| 40 - Source Code Meeting Rooms.txt | 102.4 B | ||
| 41 - Meeting Rooms II.mp4 | 139.2 MB | ||
| 41 | 91.1 KB | ||
| 41 - Solution.java | 819.2 B | ||
| 41 - Source Code Meeting Rooms II.txt | 102.4 B | ||
| 42 - Solution.java | 1.5 KB | ||
| 42 - Source Code Reverse Linked List.txt | 102.4 B | ||
| 42 | 708.1 KB | ||
| 42 - Reverse a Linked List.mp4 | 81.3 MB | ||
| 43 - Detect Cycle in a Linked List.mp4 | 55.6 MB | ||
| 43 - Solution.java | 512 B | ||
| 43 - Source Code Linked List Cycle.txt | 102.4 B | ||
| 43 | 276.1 KB | ||
| 44 - Solution.java | 614.4 B | ||
| 44 | 652.1 KB | ||
| 44 - Merge Two Sorted Lists.mp4 | 59 MB | ||
| 45 - Merge K Sorted Lists.mp4 | 355.6 MB | ||
| 45 | 866.5 KB | ||
| 45 - Solution.java | 1.1 KB | ||
| 46 - Remove Nth Node From End Of List.mp4 | 97.1 MB | ||
| 46 - Solution.java | 512 B | ||
| 46 - Source Code Remove Nth Node.txt | 102.4 B | ||
| 46 | 63 KB | ||
| 47 | 467.9 KB | ||
| 47 - Reorder List.mp4 | 93.4 MB | ||
| 47 - Solution.java | 1 KB | ||
| 48 - Set Matrix Zeroes.mp4 | 107.9 MB | ||
| 48 - Solution.java | 1.5 KB | ||
| 48 - Source Code Set Matrix Zeroes.txt | 102.4 B | ||
| 48 | 260.3 KB | ||
| 49 - Solution.java | 1.2 KB | ||
| 49 - Source Code Spiral Order Traversal.txt | 102.4 B | ||
| 49 - Spiral Order Traversal.mp4 | 122.5 MB | ||
| 5 - Contains Duplicate.mp4 | 18.2 MB | ||
| 5 - Solution.java | 409.6 B | ||
| 50 - Rotate Image.mp4 | 139.7 MB | ||
| 50 - Solution.java | 1 KB | ||
| 50 - Source Code Rotate Image.txt | 102.4 B | ||
| 51 - Solution.java | 1.1 KB | ||
| 51 - Source Code Word Search.txt | 102.4 B | ||
| 51 - Word Search.mp4 | 112.6 MB | ||
| 51 | 136.4 KB | ||
| 52 - Longest Substring Without Repeating Characters.mp4 | 48.3 MB | ||
| 52 - Solution.java | 512 B | ||
| 52 | 802.9 KB | ||
| 53 | 954.2 KB | ||
| 53 - Longest Repeating Character Replacement.mp4 | 158.1 MB | ||
| 53 - Solution Code.txt | 102.4 B | ||
| 53 - Solution.java | 614.4 B | ||
| 54 - Minimum Window Substring.mp4 | 400.4 MB | ||
| 54 - Solution.java | 1.5 KB | ||
| 6 - Product of Array Except Self.mp4 | 55.3 MB | ||
| 6 - Solution.java | 512 B | ||
| 54 | 49.8 KB | ||
| 55 | 590.8 KB | ||
| 55 - Solution.java | 512 B | ||
| 55 - Valid Anagram.mp4 | 66 MB | ||
| 56 - Group Anagrams.mp4 | 56.1 MB | ||
| 56 | 905 KB | ||
| 56 - Solution.java | 512 B | ||
| 57 - Solution.java | 716.8 B | ||
| 57 | 459.5 KB | ||
| 57 - Valid Parentheses.mp4 | 47.7 MB | ||
| 58 | 671.8 KB | ||
| 58 - Solution.java | 614.4 B | ||
| 58 - Valid Palindrome.mp4 | 42.2 MB | ||
| 59 | 530.5 KB | ||
| 59 - Longest Palindromic Substring.mp4 | 47.9 MB | ||
| 59 - Solution.java | 716.8 B | ||
| 60 - Palindromic Substrings.mp4 | 76.2 MB | ||
| 60 | 780.8 KB | ||
| 60 - Solution.java | 512 B | ||
| 61 - Solution.java | 1 KB | ||
| 61 | 693.3 KB | ||
| 61 - Encode and Decode Strings Leetcode Premium.mp4 | 98.7 MB | ||
| 62 - Maximum Depth of Binary Tree.mp4 | 171.4 MB | ||
| 62 - Solution.java | 307.2 B | ||
| 63 - Same Tree.mp4 | 169.5 MB | ||
| 63 - Solution.java | 512 B | ||
| 64 - InvertFlip Binary Tree.mp4 | 72.9 MB | ||
| 64 - Solution.java | 409.6 B | ||
| 7 - Maximum Subarray.mp4 | 49.2 MB | ||
| 7 - Solution.java | 307.2 B | ||
| 8 - Maximum Product Subarray.mp4 | 116.5 MB | ||
| 8 - Solution.java | 614.4 B | ||
| 8 - Source Code Maximum Product Subarray.txt | 102.4 B | ||
| 9 - Find Minimum in Rotated Sorted Array.mp4 | 43.4 MB | ||
| 9 - Solution.java | 819.2 B | ||
| TutsNode.net.txt | 102.4 B | ||
| [TGx]Downloaded from torrentgalaxy.to .txt | 614.4 B | ||
| 62 | 51.9 KB | ||
| 63 | 297.7 KB | ||
| 64 | 831.6 KB | ||
| 65 | 474.3 KB | ||
| 65 - Binary Tree Maximum Path Sum.mp4 | 157.5 MB | ||
| 65 - Solution.java | 409.6 B | ||
| 66 - Binary Tree Level Order Traversal.mp4 | 46.2 MB | ||
| 66 - Solution.java | 1.1 KB | ||
| 66 | 141.8 KB | ||
| 67 | 582 KB | ||
| 67 - Serialize and Deserialize Binary Tree.mp4 | 121.6 MB | ||
| 67 - Solution.java | 716.8 B | ||
| 68 - Solution.java | 819.2 B | ||
| 68 - Subtree of Another Tree.mp4 | 78.4 MB | ||
| 69 | 779 KB | ||
| 69 - Construct Binary Tree from Preorder and Inorder Traversal.mp4 | 112.6 MB | ||
| 69 - Solution.java | 921.6 B | ||
| 70 - Validate Binary Search Tree.mp4 | 139.6 MB | ||
| 70 | 689.1 KB | ||
| 70 - Solution.java | 614.4 B | ||
| 71 | 660.8 KB | ||
| 71 - Kth Smallest Element in a BST.mp4 | 117.9 MB | ||
| 71 - Solution.java | 409.6 B | ||
| 72 | 174.1 KB | ||
| 72 - Lowest Common Ancestor of a BST.mp4 | 107.5 MB | ||
| 72 - Solution.java | 512 B | ||
| 73 - Implement Trie Prefix Tree.mp4 | 204.7 MB | ||
| 73 - Solution.java | 1.4 KB | ||
| 73 | 429.1 KB | ||
| 74 - Add and Search Word.mp4 | 172.7 MB | ||
| 74 | 707.5 KB | ||
| 74 - Solution.java | 1.3 KB | ||
| 75 | 171.6 KB | ||
| 75 - Solution.java | 1.6 KB | ||
| 75 - Word Search II.mp4 | 264.1 MB | ||
| 76 - Merge K Sorted Lists.mp4 | 260.8 MB | ||
| 76 - Solution.java | 819.2 B | ||
| 77 - Solution.java | 1 KB | ||
| 77 - Top K Frequent Elements.mp4 | 304.5 MB | ||
| 78 - Find Median From Data Stream.mp4 | 430.4 MB | ||
| 78 - Solution.java | 3.1 KB | ||
| ▲ 251 total files | |||
Description
Welcome to the “Blind 75 LeetCode Questions: Ace Algorithms Coding Interview” course!
This course is specifically designed for individuals who are seeking employment at product-based companies and students who want to enhance their coding interview skills. Our primary focus is on preparing participants to excel in coding interviews through an in-depth exploration of the Blind 75 LeetCode questions.
What are Blind 75 LeetCode Questions?
Blind 75 LeetCode questions refer to a curated list of the 75 most frequently asked LeetCode algorithms questions. This list has helped numerous engineers successfully clear interviews at top companies like Google, Facebook/Meta, Amazon, Microsoft, Netflix, and more. It has been tried and tested, with thousands of testimonials available on public review platforms such as Quora, Teamblind, and Reddit.
By following these 75 questions, we can effectively cover a wide range of coding concepts. Mastering these questions will give us a solid foundation to handle most coding interview scenarios.
Is Blind 75 enough to ace any coding interview?
The answer is both yes and no. Let’s clarify: Blind 75 questions comprise a list of 75 questions that are designed to cover the most frequently asked concepts in coding interviews. Many candidates receive direct questions from this Blind 75 list because it encompasses the most commonly asked interview questions from different companies like Google, Meta/Facebook, Amazon, Microsoft, Netflix, and more.
Practicing coding problems is the best way to prepare for interviews, and with over a thousand questions available on LeetCode, it can be overwhelming to decide which ones to focus on. That’s where Blind 75 comes in. Years ago, the author of Blind 75 (yangshun) curated a list of the most important 75 questions on LeetCode. Many other LeetCode questions are a combination of techniques from these individual questions.
Blind 75 is highly regarded in the coding interview scene and has gained popularity. People even gave it a name – Blind 75. It covers the most common coding interview patterns.
In this course, we will guide you through the Blind 75 LeetCode questions, providing a comprehensive coverage of the topics. You will learn effective problem-solving strategies, optimize time and space complexity, and understand the optimal approaches for solving these problems.
Course Highlights:
Comprehensive Coverage: We will dive deep into the Blind 75 LeetCode questions, carefully selected to enhance your problem-solving skills and prepare you for various coding interview scenarios.
Detailed Solution Walkthroughs: Each problem’s solution will be explained step-by-step, emphasizing efficient coding techniques, algorithmic insights, and optimization strategies.
Interactive Coding Sessions: Engage in hands-on coding exercises and practice sessions to reinforce your understanding and improve your coding proficiency.
By the end of this course, you will have developed a strong foundation in algorithms and data structures, acquired advanced problem-solving skills, and honed your coding abilities. You will be well-prepared to confidently tackle coding interviews, efficiently solve complex problems, and increase your chances of securing job offers at product-based companies.
Join the “Blind 75 LeetCode Questions: Ace Algorithms Coding Interview” course and equip yourself with the essential skills and knowledge to excel in coding interviews, approach challenges with confidence, and successfully navigate the hiring processes at leading technology companies.
We look forward to having you in the course!
Who this course is for:
Job Seekers: Individuals aiming to secure positions at product-based companies and looking to enhance their coding interview skills.
Students: Aspiring programmers and computer science students seeking to strengthen their problem-solving abilities and increase their chances of landing job offers from renowned tech companies.
Recent Graduates: This course is ideal for fresh graduates or individuals about to graduate who are seeking employment at product-based companies. It provides the necessary skills and knowledge to excel in coding interviews, giving them a competitive edge in the job market.
Career Switchers: Professionals looking to transition into the tech industry or change their career trajectory can benefit from this course. It equips them with the coding interview skills required to land job offers at renowned product-based companies.
Experienced Professionals: Even those with prior industry experience can benefit from the course by refreshing their algorithmic knowledge, enhancing problem-solving abilities, and familiarizing themselves with the coding interview processes at top-tier companies.
Computer Science Students: The course is highly beneficial for undergraduate and postgraduate students studying computer science or related fields. It helps them strengthen their coding skills, understand algorithms and data structures in depth, and prepare for future job interviews at product-based companies.
ACE Job Interviews at Fanng Companies: Special emphasis is given to preparing participants for job interviews at fanng (Facebook, Amazon, Apple, Netflix, Google) companies.
Self-taught Programmers: Individuals who are self-taught in programming and looking to formalize their skills and improve their chances of employment can leverage this course to gain a structured understanding of algorithms, data structures, and coding interview strategies.
Online Learners: Those who prefer online learning platforms to acquire new skills will find value in this course. It offers a structured curriculum, access to resources, and interactive sessions to facilitate effective learning.
Coding Bootcamp Students: Individuals enrolled in coding bootcamp programs can supplement their learning with this course. It provides targeted preparation for coding interviews, helping them stand out during the job placement process.
Requirements
A Computer or Laptop Phone with internet connections.
Basic programming knowledge and familiarity with a programming language such as Python, Java, or C++.
Prior exposure to coding problems and algorithms is beneficial but not mandatory.
Last Updated 5/2023
All Comments