Data Structure And Algorithms For Interviews
Published 11/2022
MP4 | Video: h264, 1280x720 | Audio: AAC, 44.1 KHz
Language: English | Size: 324.65 MB | Duration: 0h 58m
Published 11/2022
MP4 | Video: h264, 1280x720 | Audio: AAC, 44.1 KHz
Language: English | Size: 324.65 MB | Duration: 0h 58m
Ace your Tech Interviews
What you'll 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
Requirements
python
basic idea of Data Structures and Algorithms
Leetcode account
Description
Covers around 200+ most popular coding interview problems ranging from a variety of topics Two PointersEasy Pair with Target Sum Remove Duplicates Squaring a Sorted Array Medium Triplet Sum to Zero Triplet Sum Close to Target Triplets with Smaller Sum Subarrays with Product Less than a Target Dutch National Flag Problem Fast & Slow PointersEasyMiddle of the LinkedListLinkedList Cycle Medium Start of LinkedList CycleHappy Numbers Bitwise ManipulationSingle Numbers Single Number IISingle Number IIIFlipping the imageSliding 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 HardLongest Substring with Distinct Characters Longest Substring with Same Letters after Replacement Longest Subarray with Ones after Replacement ArraysMedium Group AnagramsHardTrapping Rain WaterMerge IntervalsMedium Intervals Intersection Conflicting Appointments Linked ListEasyReverse a Linked List Medium Reverse a sub list Reverse a k-element sub list Two HeapsMedium Find the median of a number streamHardMaximum CapitalSliding Window Median Top k elementsEasyTop 'K' Numbers Kth Smallest Number 'K' Closest Points to the Origin Connect Ropes MediumTop 'K' Frequent Numbers Frequency Sort Kth Largest Number in a Stream 'K' Closest Numbers Maximum Distinct Elements Sum of Elements HardRearrange String K-way mergeBinary SearchGreedy TechniqueBacktracking1D Dynamic programing 2D Dynamic programing Cyclic SortTopological SortStacksQueuesDepth First SearchBreadth First Search TrieHash MapsMath TricksMiscellaneous
Overview
Section 1: 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
Section 2: Fast Flow Pointers
Lecture 5 Linked List Cycle using Floyd's Cycle Detection Algorithm
Lecture 6 Happy Numbers
Section 3: Bitwise Manipulation
Lecture 7 Single Number
Lecture 8 Flipping an Image
Software Engineers who want to ace coding interviews in top tech firms