~Get Your Files Here !

  01 Introduction

   001 About this Course.mp4

  02 [Strings] Check whether the given String is a permutation of a palindrome

   001 Problem Statement.mp4

   002 Figuring out the approach.mp4

   003 Analysing the Time and Space Complexity.mp4

   004 Coding the Optimal Solution.mp4

  03 [Linked Lists] Return Kth to last element in LinkedList

   001 Problem Statement.mp4

   002 Brute-Force Solution.mp4

   003 Optimizing further.mp4

   004 Coding the Optimal Solution.mp4

  04 [Stacks and Queues] Stack with min Operation

   001 Problem Statement.mp4

   002 Figuring out the approach.mp4

   003 Coding the optimal solution.mp4

  05 [Linked Lists] Reverse a Single LinkedList

   001 Problem Statement.mp4

   003 Figuring out the approach.en.srt

   004 Coding the optimal solution.en.srt

  06 [Searching] Search a Sorted Array for first occurrence of k

   001 The Problem Statement.mp4

   002 Exercise-1.mp4

   003 Figuring out the Test Cases.mp4

   004 Exercise-2.mp4

   005 Brute-Force Solution.mp4

   006 Optimizing further.mp4

   007 Exercise-3.mp4

   008 Coding the optimal solution.mp4

  07 [Dynamic Programming] Count ways to climb

   001 Problem Statement.mp4

   002 Understanding the problem statement.mp4

   003 Recursive approach.mp4

   004 Optimising using Memoization.mp4

  08 [Math] Trailing Zeros in n factorial

   001 Problem Statement.mp4

   002 Figuring out the approach.mp4

   003 Coding the solution.mp4

  09 [Searching] Search a Sorted Array for Entry equal to its Index

   001 The Problem Statement.mp4

   003 Bruteforce Solution.en.srt

   004 Optimizing further.en.srt

   005 Writing TestCases.en.srt

   006 Validating the approach with Test Cases.en.srt

   007 Coding the Optimal Solution.en.srt

  10 [Strings] URLify a String

   001 Problem Statement.mp4

   002 Figuring out the approach.mp4

   003 Coding the solution.mp4

  11 [Binary Search Trees] Construct a minimal height tree from a sorted array

   001 Problem Statement.mp4

   002 Figuring out the approach.mp4

   003 Coding the solution.mp4

  12 [Stacks and Queues] Implement a Queue using Stacks

   001 Problem Statement.mp4

   002 Understanding the Problem Statement.mp4

   004 Figuring out the Solution.en.srt

   005 Coding the Optimal Solution.en.srt

  13 [Primitive Types] Check if a Decimal Integer is a Palindrome

   001 Problem Statement.mp4

   003 Figuring out the Solution.en.srt

   004 Coding the Optimal Solution.en.srt

  14 [Sorting] Compute the Intersection of two sorted arrays

   001 Problem Statement.mp4

   003 Brute-Force Solution.en.srt

   004 Optimizing further - 1.en.srt

   005 Optimizing further - 2.en.srt

   006 Writing TestCases.en.srt

   007 Validating the approach with Testcases.en.srt

   008 Coding the Optimal Solution.en.srt

  15 [Arrays] The Dutch National Flag Problem

   001 Problem Statement.mp4

   002 Brute-Force Solution.mp4

   003 Optimizing further.mp4

   004 Writing TestCases.mp4

   006 Coding the optimal solution.en.srt

  16 [Greedy] The Interval Covering Problem

   001 Problem Statement.mp4

   002 Understanding the Problem Statement.mp4

   004 Figuring out the approach.en.srt

   005 Exercise-2.html

   006 Coding the optimal solution.mp4

  17 [Bit Manipulation] Generate the Power Set

   001 Problem Statement.mp4

   002 Figuring out the approach.mp4

   003 Coding the optimal solution.mp4

  18 [Recursion] Generate all subsets using Recursion

   001 Problem Statement.mp4

   002 Figuring out the approach.mp4

   003 Coding the Solution.mp4

  19 [Recursion] Generate all subsets of size k

   001 Problem Statement.mp4

   002 Figuring out the approach_Part-1.mp4

   003 Figuring out the approach_Part-2.mp4

   004 Coding the Solution.mp4

  20 [Strings] Run Length Encoding

   001 Problem Statement.mp4

   002 Figuring out the approach.mp4

   003 Coding the optimal solution.mp4

  21 [Binary Search Trees] First Key greater than a given value in a Binary Search Tr

   001 Problem Statement.mp4

   002 Brute-Force Solution.mp4

   003 Figuring out the approach.mp4

   004 Writing TestCases.mp4

   005 Exercise-1.mp4

   006 Coding the optimal solution.mp4

  22 [Recursion] Towers Of Hanoi

   001 Problem Statement.mp4

   002 Figuring out the approach.mp4

   003 Coding the solution.mp4

   004 Analysing the Time Complexity.mp4

  23 [Dynamic Programming] Longest Increasing Subsequence

   001 Problem Statement.mp4

   002 Figuring out the approach.mp4

   003 Coding the optimal solution.mp4

  24 [Bit Manipulation] Flip Bits count to convert A to B

   001 Problem Statement.mp4

   002 Figuring out the approach.mp4

   003 Coding the solution.mp4

  25 [Strings] Check whether Strings A is a permutation of B

   001 Problem Statement.mp4

   002 Figuring out the approach.mp4

  26 [Graphs] Route Between two Nodes in a Directed Graph

   001 Problem Statement.mp4

   002 Figuring out the approach_Part-1.mp4

   003 Figuring out the approach_Part-2.mp4

   004 Coding the Optimal Solution.mp4

  27 [Strings] Check whether the String is a Rotation of another String

   001 Problem Statement.mp4

   002 Figuring out the approach.mp4

  28 [Recursion] Print all combinations of balanced parentheses

   001 Problem Statement.mp4

   002 Figuring out the approach.mp4

   003 Coding the Solution.mp4

   004 Analysing Time Complexity and Space Complexity.mp4

  29 [LinkedLists] Delete a node given only access to that node

   001 Problem Statement.mp4

   002 Figuring out the approach.mp4

  30 [Recursion] Compute all permutations of a string of unique characters

   001 Problem Statement.mp4

   002 Figuring out the approach.mp4

   003 Coding the Solution.mp4

   004 Calculating the Runtime.mp4

  31 [Recursion] Compute Permutations of a String with duplicate characters

   001 Problem Statement.mp4

   002 Figuring out the approach.mp4

   003 Coding the solution.mp4

  32 [Searching] Search in a Sorted Rotated array

   001 Problem Statement.mp4

   002 Figuring out the approach.mp4

   003 Exercise.mp4

  33 [Strings] Is One Edit Away

   001 Problem Statement.mp4

   002 Figuring out the approach.mp4

   003 Coding the Solution.mp4

  34 [LinkedLists] Detection of loop and the node at the beginning of the loop

   001 Problem Statement.mp4

   002 Loop Detection.mp4

   003 Finding the first node of the Loop.mp4

   004 Coding the Solution.mp4

  35 [Binary Search Trees] Validate a Binary Search Tree

   001 Problem Statement.mp4

   002 Figuring out the approach_Part-1.mp4

   003 Figuring out the approach_Part-2.mp4

   004 Coding the solution.mp4

  36 [Sorting] Merge two sorted arrays

   001 Problem Statement.mp4

   002 Figuring out the approach.mp4

  37 [LinkedLists] Remove duplicates

   001 Problem Statement.mp4

   003 Coding the solution.en.srt

  38 [Stacks and Queues] Sorting a Stack

   001 Problem Statement.mp4

   002 Figuring out the approach.mp4

  39 [LinkedLists] Determine the intersection point of two Linked Lists

   001 Problem Statement.mp4

   002 Figuring out the approach.mp4

  40 [Binary Trees] Create LinkedList at each depth

   001 Problem Statement.mp4

   002 Figuring out the approach.mp4

  41 [LinkedLists] Add two numbers represented by Linked Lists

   001 Problem Statement.mp4

   002 Figuring out the approach.mp4

   003 Coding the solution.mp4

  42 [Binary Trees] Check whether the given Binary Tree is balanced

   001 Problem Statement.mp4

   002 Figuring out the approach.mp4

   003 Coding the solution.mp4

  43 [Arrays] Contiguous sequence with the largest sum

   001 Problem Statement.mp4

   002 Figuring out the approach.mp4

  44 [Stacks] Evaluation of Postfix Expression

   001 Problem Statement.mp4

   002 Figuring out the approach.mp4

  45 [Dynamic Programming] Longest Palindromic Subsequence

   001 Problem Statement.mp4

   002 Recursive approach.mp4

   003 Optimizing using Memoization.mp4

  46 [Searching] Find Pairs with Sum

   001 Problem Statement.mp4

   002 Figuring out the approach.mp4

   003 Coding the Solution.mp4

  47 [Binary Trees] Lowest Common Ancestor

   001 Problem Statement.mp4

   002 Figuring out the approach.mp4

   003 Coding the Solution.mp4

  48 [Greedy] Interval scheduling maximization problem

   001 Problem Statement.mp4

   002 Figuring out the approach.mp4

   003 Coding the Solution.mp4

  49 [Strings] Are characters unique

   001 Problem Statement.mp4

   002 Figuring out the approach.mp4

  50 [Arrays] Zeroing the Matrix

   001 Problem Statement.mp4

   002 Figuring out the approach.mp4

   003 Optimizing further.mp4

   004 Coding the Solution.mp4

  51 [Binary Trees] Is Symmetric

   001 Problem Statement.mp4

   002 Figuring out the approach.mp4

  52 [Heaps] Implement a Stack API using a Heap

   001 Problem Statement.mp4

   002 Figuring out the approach.mp4

  53 [Arrays] Delete duplicates from a sorted array without using additional space

   001 Problem Statement.mp4

   002 Figuring out the approach.mp4

   003 Coding the Solution.mp4

  54 [Recursion] Compute all mnemonics for a phone number

   001 Problem Statement.mp4

   002 Figuring out the approach.mp4

   003 Coding the Solution.mp4

  55 [Linked Lists] Merge two sorted linked lists

   001 Problem Statement.mp4

   002 Figuring out the approach.mp4

  Bonus Resources.txt