本站已收录 番号和无损神作磁力链接/BT种子 

[@csalgo] CB Competitive Programming

种子简介

种子名称: [@csalgo] CB Competitive Programming
文件类型: 视频
文件数目: 507个文件
文件大小: 13.77 GB
收录时间: 2021-11-26 06:02
已经下载: 3
资源热度: 218
最近下载: 2024-11-14 00:33

下载BT种子文件

下载Torrent文件(.torrent) 立即下载

磁力链接下载

magnet:?xt=urn:btih:62269be165957568ccab1de511c3ed866d46041f&dn=[@csalgo] CB Competitive Programming 复制链接到迅雷、QQ旋风进行下载,或者使用百度云离线下载。

喜欢这个种子的人也喜欢

种子包含的文件

[@csalgo] CB Competitive Programming.torrent
  • 10.Maths-III Solving Linear Recurrences/0.FastExponentiationPowerinLogN.m4v10.23MB
  • 10.Maths-III Solving Linear Recurrences/1.MatrixExponentiation01SolvingLinearRecurrences.m4v18.16MB
  • 10.Maths-III Solving Linear Recurrences/2.MatrixExponentiation02DesigningTransformationMatrix.m4v18.2MB
  • 10.Maths-III Solving Linear Recurrences/3.MatrixExponentiation03ImplementationSEQSpoj.m4v33.1MB
  • 10.Maths-III Solving Linear Recurrences/4.MatrixExponentiation04RecursiveSequenceIISPP.m4v12.84MB
  • 10.Maths-III Solving Linear Recurrences/5.MatrixExponentiation05LaddersProblem.m4v9.46MB
  • 11.Maths-IV Pigeonhole Principle/0.PigeonholePrinciple.m4v4.42MB
  • 11.Maths-IV Pigeonhole Principle/1.DivisibleSubarrays.m4v41.16MB
  • 11.Maths-IV Pigeonhole Principle/2.DivisibleSubsetCodechef.m4v30.81MB
  • 11.Maths-IV Pigeonhole Principle/3.GraySimilarCodePigeonholeProblem.m4v19.25MB
  • 11.Maths-IV Pigeonhole Principle/4.HolidayAccomodationIConcept.m4v35.39MB
  • 11.Maths-IV Pigeonhole Principle/5.HolidayAccommodationIIImplementation.m4v25.7MB
  • 12.Maths-V Mathematical Expectation/0.MathematicalExpectationIntroduction.m4v6.97MB
  • 12.Maths-V Mathematical Expectation/1.LinearityofExpectationRule.m4v9.29MB
  • 12.Maths-V Mathematical Expectation/2.ExpectationGetaHead.m4v3.35MB
  • 12.Maths-V Mathematical Expectation/3.ExpectationGetTwoConsecutiveHeads.m4v9.63MB
  • 12.Maths-V Mathematical Expectation/4.ExpectationGetNConsecutiveHeads.m4v6.46MB
  • 12.Maths-V Mathematical Expectation/5.ExpectedHeadsinNThrows.m4v2.27MB
  • 12.Maths-V Mathematical Expectation/6.BernaullisTrial.m4v8.78MB
  • 12.Maths-V Mathematical Expectation/7.BernaulliTrialCandidatesinInterview.m4v3.11MB
  • 12.Maths-V Mathematical Expectation/8.CouponCollectorProblem.m4v9.89MB
  • 12.Maths-V Mathematical Expectation/9.FavouriteDiceCouponCollectorExample.m4v5.23MB
  • 13.🔥 Challenges - Mathematics/11.CatalanNumbersHint.m4v1.43MB
  • 13.🔥 Challenges - Mathematics/14.XOR4HINT.m4v8MB
  • 13.🔥 Challenges - Mathematics/16.MATHDAYHINT.m4v2.64MB
  • 13.🔥 Challenges - Mathematics/18.EVALUATINGFUNTIONSHINT.m4v2.87MB
  • 13.🔥 Challenges - Mathematics/20.DivisibleSubarraysHint.m4v10.39MB
  • 13.🔥 Challenges - Mathematics/22.FastFibonacciHint.m4v3.52MB
  • 13.🔥 Challenges - Mathematics/25.SPPHint.m4v12.48MB
  • 13.🔥 Challenges - Mathematics/27.FibosumHint.m4v6.68MB
  • 13.🔥 Challenges - Mathematics/30.ChoosingNumbersHint.m4v3.29MB
  • 13.🔥 Challenges - Mathematics/32.InterviewCandidatesHint.m4v3.33MB
  • 13.🔥 Challenges - Mathematics/37.SUMSUMSHint.m4v3.63MB
  • 13.🔥 Challenges - Mathematics/4.BostonNumbersHint.m4v3.88MB
  • 13.🔥 Challenges - Mathematics/6.MarblesHint.m4v4.76MB
  • 13.🔥 Challenges - Mathematics/8.AFactorialProblem.m4v39.38MB
  • 14.Number Theory I - Primes & Factorization /0.PrimeSieveEratosthenesSieve.m4v43.27MB
  • 14.Number Theory I - Primes & Factorization /1.PrimeVisitsPrimeSieveProblem.m4v20.87MB
  • 14.Number Theory I - Primes & Factorization /10.ProductofNumbersCodeforces.m4v14.82MB
  • 14.Number Theory I - Primes & Factorization /2.BitsetSieve.m4v7.48MB
  • 14.Number Theory I - Primes & Factorization /3.LargePrimeCheckusingsieve.m4v10.01MB
  • 14.Number Theory I - Primes & Factorization /4.AlmostPrimeCodeforces.m4v7.84MB
  • 14.Number Theory I - Primes & Factorization /5.SegmentedPrimeSievePRIME1Spoj.m4v42.44MB
  • 14.Number Theory I - Primes & Factorization /6.PrimeFactorisationusingoptimisedtrialdivisions.m4v21.07MB
  • 14.Number Theory I - Primes & Factorization /7.PrimeFactorisationusingSieve.m4v13.35MB
  • 14.Number Theory I - Primes & Factorization /8.CountingDivisorsusingsieve.m4v11.35MB
  • 14.Number Theory I - Primes & Factorization /9.AFactorialProblem.m4v39.38MB
  • 15.Number Theory-II GCD & Extended Euclidean/0.GCDEuclidsAlgorithm.m4v22.21MB
  • 15.Number Theory-II GCD & Extended Euclidean/1.GCDTimeComplexityofEuclidsAlgorithm.m4v6.07MB
  • 15.Number Theory-II GCD & Extended Euclidean/2.ExtendedEuclidsAlgorithm.m4v24.65MB
  • 15.Number Theory-II GCD & Extended Euclidean/3.ExtendedEuclideanAlgorithmImplementation.m4v14.81MB
  • 16.Number Theory - III Modulo Problems/0.ModuloProperties.m4v5.31MB
  • 16.Number Theory - III Modulo Problems/1.FastModuloExponentiationusingBitmasks.m4v12.36MB
  • 16.Number Theory - III Modulo Problems/2.MultiplicativeModuloInverseusingExtendedEuclidsAlgorithm.m4v14.93MB
  • 16.Number Theory - III Modulo Problems/3.BiggcdHint.m4v3.29MB
  • 16.Number Theory - III Modulo Problems/4.YetAnotherCountingProblem.m4v14.14MB
  • 17.Number Theory - IV Linear Diophantine Equations/0.LinearDiophantineEquations.m4v8.15MB
  • 17.Number Theory - IV Linear Diophantine Equations/1.SolvingLinearDiophantineEquations.m4v12.07MB
  • 17.Number Theory - IV Linear Diophantine Equations/2.MultiplicativeModuloInverseusingExtendedEuclidsAlgorithm.m4v14.93MB
  • 17.Number Theory - IV Linear Diophantine Equations/3.FootballSeason.m4v30.86MB
  • 18.Number Theory - V Theorems/0.TotientFindingPrimeFators.m4v14.54MB
  • 18.Number Theory - V Theorems/2.ChineseRemainderTheorem.m4v31.37MB
  • 18.Number Theory - V Theorems/3.MillerRabin1.m4v27.78MB
  • 18.Number Theory - V Theorems/4.MillerRabin2.m4v32.34MB
  • 18.Number Theory - V Theorems/5.MobiusFunction.m4v50.63MB
  • 18.Number Theory - V Theorems/6.WilsonsTheoremProblemBoringFactorialsDCEPC11B.m4v25.02MB
  • 18.Number Theory - V Theorems/7.POWPOW2HardSpojNumberTheory.m4v78.48MB
  • 19.🔥 Challenges - Number Theory/10.TPrimeHint.m4v2.74MB
  • 19.🔥 Challenges - Number Theory/14.NumberOfDivisorsHint.m4v5.8MB
  • 19.🔥 Challenges - Number Theory/16.FindItHint.m4v5.45MB
  • 19.🔥 Challenges - Number Theory/19.AliceandTotientHint.m4v6.43MB
  • 19.🔥 Challenges - Number Theory/22.ViratandNcRHint.m4v3.67MB
  • 19.🔥 Challenges - Number Theory/25.MaxXorArrayHint.m4v3.83MB
  • 19.🔥 Challenges - Number Theory/28.FibonaccimeetsGCDHint.m4v4.32MB
  • 19.🔥 Challenges - Number Theory/30.BiggcdHint.m4v3.29MB
  • 19.🔥 Challenges - Number Theory/32.PrimalityTestingHint.m4v1.76MB
  • 19.🔥 Challenges - Number Theory/36.EvenandOddDivisorsHint.m4v3.62MB
  • 19.🔥 Challenges - Number Theory/4.MultiplicativeInverseHint.m4v1.31MB
  • 19.🔥 Challenges - Number Theory/6.ViratandFatorialsHint.m4v1.93MB
  • 19.🔥 Challenges - Number Theory/8.EvaluatingFunctionsHint.m4v2.87MB
  • 2.STL Quickstart/0.STLContainersIntroduction.m4v19.4MB
  • 2.STL Quickstart/1.FindFunction.m4v7.97MB
  • 2.STL Quickstart/10.StackSTL.m4v9.15MB
  • 2.STL Quickstart/11.QueueSTL.m4v7.31MB
  • 2.STL Quickstart/12.PriorityQueueSTL01.m4v12.39MB
  • 2.STL Quickstart/13.PriorityQueueSTL02ComparatorClass.m4v19.04MB
  • 2.STL Quickstart/14.MapsSTL.m4v27.87MB
  • 2.STL Quickstart/15.MultimapSTL.m4v16.99MB
  • 2.STL Quickstart/16.UnorderedMapSTL.m4v14.86MB
  • 2.STL Quickstart/17.UnorderedMapHashFunctionsforCustomClass.m4v22.1MB
  • 2.STL Quickstart/18.SetSTLIntroduction.m4v13.57MB
  • 2.STL Quickstart/19.MultisetSTL.m4v20.19MB
  • 2.STL Quickstart/2.BinarySearchSTL..m4v19.4MB
  • 2.STL Quickstart/3.Strings01StringClass.m4v29.74MB
  • 2.STL Quickstart/4.Strings02Sorting.m4v14.33MB
  • 2.STL Quickstart/5.Strings03Tokenizationusingstrtok.m4v14.4MB
  • 2.STL Quickstart/6.Vectors01Introduction.m4v32.02MB
  • 2.STL Quickstart/7.Vectors02Methods.m4v30.28MB
  • 2.STL Quickstart/8.ListSTLI.m4v15.11MB
  • 2.STL Quickstart/9.ListSTLII.m4v12.44MB
  • 20.Recursion-I Basics/0.RecursionIntroduction.m4v30.84MB
  • 20.Recursion-I Basics/1.FibonacciRecursionCallStackVisualisation.m4v17.65MB
  • 20.Recursion-I Basics/2.IncreasingDecreasingRecursion.m4v13.26MB
  • 20.Recursion-I Basics/3.RecursionArrayisSorted.m4v15.19MB
  • 20.Recursion-I Basics/4.TimetoTryRecursion.m4v3.56MB
  • 21.Recursion-II Implementation Based/0.RecursionFirstOccurenceLinearSearch.m4v17.34MB
  • 21.Recursion-II Implementation Based/1.LastOccurenceRecursion.m4v10.49MB
  • 21.Recursion-II Implementation Based/2.AllOccurrencesRecursion.m4v18.86MB
  • 21.Recursion-II Implementation Based/3.FastPowerRecursion.m4v14.04MB
  • 21.Recursion-II Implementation Based/4.BubbleSortRecursion.m4v20.27MB
  • 21.Recursion-II Implementation Based/5.MergeSort.m4v22.02MB
  • 21.Recursion-II Implementation Based/6.InversionCount.m4v37.82MB
  • 21.Recursion-II Implementation Based/7.QuicksortAlgorithm.m4v31.74MB
  • 22.Recursion-III Quick Thinking/0.2048ProblemRecursion.m4v12.86MB
  • 22.Recursion-III Quick Thinking/1.StringToIntegerRecursion.m4v8.13MB
  • 22.Recursion-III Quick Thinking/2.ReplacePiRecursion.m4v17.56MB
  • 22.Recursion-III Quick Thinking/3.TilingProblemRecursion.m4v5.9MB
  • 22.Recursion-III Quick Thinking/4.LaddersProblemRecursion.m4v17.09MB
  • 22.Recursion-III Quick Thinking/5.FriendsProblemRecursion.m4v8.14MB
  • 22.Recursion-III Quick Thinking/6.OptimalBinaryStringsRecursion.m4v4.29MB
  • 22.Recursion-III Quick Thinking/7.TowerofHanoiRecursion.m4v30.02MB
  • 23.Recursion-IV Subset Based/0.SubsequencesGenerationRecursion.m4v26.9MB
  • 23.Recursion-IV Subset Based/1.GenerateBracketsRecursion.m4v15.38MB
  • 23.Recursion-IV Subset Based/2.01KnapsackRecursion.m4v18.25MB
  • 23.Recursion-IV Subset Based/3.PhoneKeypadProblemRecursion.m4v14.83MB
  • 23.Recursion-IV Subset Based/4.StringGenerationAcodeRecursion.m4v18.71MB
  • 24.Recursion-V Backtracking /0.CPPRecursionRatinaMaze.m4v27.72MB
  • 24.Recursion-V Backtracking /1.CPPPermutations.m4v22.8MB
  • 24.Recursion-V Backtracking /2.SetExampleUniquePermutations.m4v9.82MB
  • 24.Recursion-V Backtracking /3.N - Queen Problem using Backtracking.mkv40.1MB
  • 24.Recursion-V Backtracking /4.CPPRecursionSudokuSolver.m4v32.61MB
  • 25.Recursion-VI Advanced Backtracking (Optional)/0.AdvancedBacktrackingWebinarOptional.m4v125.93MB
  • 25.Recursion-VI Advanced Backtracking (Optional)/2.AdvancedRecursionBacktrackingCrosswordPuzzleHackerRank.m4v28.32MB
  • 25.Recursion-VI Advanced Backtracking (Optional)/5.AdvancedRecursionSagheertheHausmeisterCodeforces.m4v25.51MB
  • 26.🔥 Challenges - Recursion And Backtracking/1.TillingProblemIIHint.m4v2.75MB
  • 26.🔥 Challenges - Recursion And Backtracking/11.FunkyChessBoardHint.m4v5.13MB
  • 26.🔥 Challenges - Recursion And Backtracking/13.ClassAssignmentHint.m4v1.81MB
  • 26.🔥 Challenges - Recursion And Backtracking/15.SmartKeypad1Hint.m4v4.41MB
  • 26.🔥 Challenges - Recursion And Backtracking/17.SmartKeypadAdvanceHint.m4v2.84MB
  • 26.🔥 Challenges - Recursion And Backtracking/19.TrickyPermutationsHint.m4v2.53MB
  • 26.🔥 Challenges - Recursion And Backtracking/22.SumItUpHint.m4v3.36MB
  • 26.🔥 Challenges - Recursion And Backtracking/26.SubsetSumEasyHint.m4v916.41KB
  • 26.🔥 Challenges - Recursion And Backtracking/3.GenerateParanthesisHint.m4v7.49MB
  • 26.🔥 Challenges - Recursion And Backtracking/32.NQueenHardHint.m4v2.37MB
  • 26.🔥 Challenges - Recursion And Backtracking/36.RatInAMazeHint.m4v1.84MB
  • 26.🔥 Challenges - Recursion And Backtracking/5.CountNumberOfBinaryStringsHint.m4v4.2MB
  • 26.🔥 Challenges - Recursion And Backtracking/7.FriendsPairingHint.m4v2.58MB
  • 26.🔥 Challenges - Recursion And Backtracking/9.RecursionCodesOfTheStringHint.m4v3.4MB
  • 27.Binary Search (Divide & Conquer)/0.BinarySearchonArrays.m4v22.83MB
  • 27.Binary Search (Divide & Conquer)/1.BinarySearchFirstLastOccurence.m4v17.52MB
  • 27.Binary Search (Divide & Conquer)/10.HomeworkPaintersPartitionProblemEKOSpoj.m4v8.73MB
  • 27.Binary Search (Divide & Conquer)/2.BinarySearchSTL..m4v18.95MB
  • 27.Binary Search (Divide & Conquer)/3.BinarySearchHelpRahulPivotElement.m4v23.03MB
  • 27.Binary Search (Divide & Conquer)/4.BinarySearchinMonotonicSearchSpaces.m4v20.13MB
  • 27.Binary Search (Divide & Conquer)/5.AggressiveCows.m4v33.04MB
  • 27.Binary Search (Divide & Conquer)/6.BookAllocationConcept.m4v17.14MB
  • 27.Binary Search (Divide & Conquer)/7.BookAllocationImplementation.m4v19.03MB
  • 27.Binary Search (Divide & Conquer)/8.PRATASpoj.m4v14.42MB
  • 27.Binary Search (Divide & Conquer)/9.WinningCBScholarship.m4v19.86MB
  • 28.🔥 Challenges - Divide And Conquer/1.SimpleEnoughHint.m4v12.72MB
  • 28.🔥 Challenges - Divide And Conquer/12.AgressiveCowsHint.m4v12.03MB
  • 28.🔥 Challenges - Divide And Conquer/14.MurthalParathasHint.m4v13.53MB
  • 28.🔥 Challenges - Divide And Conquer/16.PaintersPartitionProblemHint.m4v16.22MB
  • 28.🔥 Challenges - Divide And Conquer/19.WinningCBScholarshipHint.m4v5.23MB
  • 28.🔥 Challenges - Divide And Conquer/21.AreTheySameHint.m4v2.17MB
  • 28.🔥 Challenges - Divide And Conquer/3.InversionCountHint.m4v6.24MB
  • 28.🔥 Challenges - Divide And Conquer/5.MaximumSubarraySumDCHint.m4v4.53MB
  • 28.🔥 Challenges - Divide And Conquer/9.PivotOfSortedandRotatedArray.m4v1.08MB
  • 29.Segment Trees I - Basics/0.SegmentTreeIntroductiontoRangeBasedQueries.m4v6.21MB
  • 29.Segment Trees I - Basics/1.SegmentTree01BuildtheTree.m4v23.44MB
  • 29.Segment Trees I - Basics/2.SegmentTree02Query.m4v20.49MB
  • 29.Segment Trees I - Basics/3.SegmentTree03PointUpdates.m4v16.63MB
  • 29.Segment Trees I - Basics/4.SegmentTree04RangeUpdaets.m4v10.24MB
  • 3.Policy Based Data Structures (C++)/0.PolicyBasedDataStructures1.m4v26.71MB
  • 3.Policy Based Data Structures (C++)/1.PolicyBasedDataStructures2.m4v16.85MB
  • 3.Policy Based Data Structures (C++)/2.PolicyBasedDataStructures3.m4v16.21MB
  • 3.Policy Based Data Structures (C++)/3.PolicyBasedDataStructures4.m4v22.02MB
  • 30.Segment Trees II - Lazy Propagation/0.LazyPropagationIntroduction.m4v27.69MB
  • 30.Segment Trees II - Lazy Propagation/1.LazyUpdatesImplementation.m4v18.16MB
  • 30.Segment Trees II - Lazy Propagation/2.ImplementingLazyQueries.m4v13.83MB
  • 30.Segment Trees II - Lazy Propagation/3.RangeSumQuerywithLazy.m4v9.17MB
  • 31.Segment Trees III - Persistent Segment Trees/0.PersistentSegmentTree01.m4v39.17MB
  • 31.Segment Trees III - Persistent Segment Trees/1.PersistentSegmentTree02.m4v21.5MB
  • 31.Segment Trees III - Persistent Segment Trees/2.PersistentSegmentTree03.m4v44.32MB
  • 31.Segment Trees III - Persistent Segment Trees/3.PersistentSegmentTree04.m4v44.28MB
  • 32.Segment Tree IV - Problems/0.SegmentTreesProblemGSS1Spoj.m4v36.38MB
  • 32.Segment Tree IV - Problems/1.KqueryoHintCode.m4v25.67MB
  • 32.Segment Tree IV - Problems/2.XeniaandBitOperations.m4v22.78MB
  • 33.🔥 Challenges - Segment Trees/10.MaximumSubarraySumDCHint.m4v4.53MB
  • 33.🔥 Challenges - Segment Trees/13.FibonaccimeetsGCDHint.m4v4.32MB
  • 33.🔥 Challenges - Segment Trees/16.KqueryoHintCode.m4v25.67MB
  • 33.🔥 Challenges - Segment Trees/4.MaxQuery1Hint.m4v10.27MB
  • 33.🔥 Challenges - Segment Trees/6.QueryBitsHint.m4v19.91MB
  • 33.🔥 Challenges - Segment Trees/8.MatrixQueriesHint.m4v6.96MB
  • 34.Fenwick TreeBinary Indexed Tree(BIT)/0.BIT01Introduction.m4v1.78MB
  • 34.Fenwick TreeBinary Indexed Tree(BIT)/1.BIT02MotivationandStructure.m4v29.04MB
  • 34.Fenwick TreeBinary Indexed Tree(BIT)/2.BIT03BuildandUpdate.m4v16.95MB
  • 34.Fenwick TreeBinary Indexed Tree(BIT)/3.BIT04Queries.m4v5.93MB
  • 34.Fenwick TreeBinary Indexed Tree(BIT)/4.BIT05ImplementationRangeSumQuery.m4v8.24MB
  • 34.Fenwick TreeBinary Indexed Tree(BIT)/5.BIT06PrefixMaxElementQuery.m4v9.82MB
  • 34.Fenwick TreeBinary Indexed Tree(BIT)/6.BIT07InversionCountINVCNTSpoj.m4v23.4MB
  • 34.Fenwick TreeBinary Indexed Tree(BIT)/7.BIT08CoordinateCompression.m4v8.96MB
  • 34.Fenwick TreeBinary Indexed Tree(BIT)/8.BIT09UPDATEITSpoj.m4v8.57MB
  • 34.Fenwick TreeBinary Indexed Tree(BIT)/9.PashmakandParmidasproblem.m4v22.24MB
  • 35.🔥 Challenges - Fenwick Tree/3.LISModifiedHint.m4v25.5MB
  • 35.🔥 Challenges - Fenwick Tree/5.ShilandPalindromeReasearchHint.m4v10.59MB
  • 35.🔥 Challenges - Fenwick Tree/8.BuyandSellHint.m4v7.25MB
  • 36.Greedy Algorithms/0.Greedy01Introduction.m4v23.41MB
  • 36.Greedy Algorithms/1.Greedy02IndianCoinChangeCode.m4v9.07MB
  • 36.Greedy Algorithms/10.Greedy11KingdomDefenseCode.m4v11.8MB
  • 36.Greedy Algorithms/11.Greedy12Chopsticks.m4v11.11MB
  • 36.Greedy Algorithms/12.Greedy13ExpeditionSpoj.m4v30.11MB
  • 36.Greedy Algorithms/13.Greedy14ExpeditionCodeHard.m4v33.6MB
  • 36.Greedy Algorithms/14.Codeforces564AGreedy.m4v53MB
  • 36.Greedy Algorithms/15.HuffmanEncodingIntroduction.m4v72MB
  • 36.Greedy Algorithms/2.Greedy03BusyManActivitySelectionConcept.m4v12.88MB
  • 36.Greedy Algorithms/3.Greedy04BusyManActivitySelectionCode.m4v13.54MB
  • 36.Greedy Algorithms/4.Greedy05ConnectingWires.m4v11.08MB
  • 36.Greedy Algorithms/5.Greedy06BiasedStandingConcept.m4v19.02MB
  • 36.Greedy Algorithms/6.Greedy07BaisedStandingCode.m4v9.52MB
  • 36.Greedy Algorithms/7.Greedy08LoadBalancer.m4v34.83MB
  • 36.Greedy Algorithms/8.Greedy09LoadBalancerCode.m4v11.2MB
  • 36.Greedy Algorithms/9.Greedy10KingdomDefenseConcept.m4v18.62MB
  • 38.Graph 01 - Introduction/01. Graph Data Structure Introduction - 10 Real Life Applications.m4v11.4MB
  • 38.Graph 01 - Introduction/02. Graph Representation in Data Structure - Adjacency Matrix & Adjacency List .m4v13.87MB
  • 38.Graph 01 - Introduction/03. Graph Data Structure - Creating Adjacency List in Cpp.m4v11.23MB
  • 38.Graph 01 - Introduction/04. Graph Adjaceny List Representation - Using Hash-map.m4v17.36MB
  • 39.Graph 02 - Traversals (BFS & DFS)/0.GraphsBreadthFirstSearch.m4v29.25MB
  • 39.Graph 02 - Traversals (BFS & DFS)/1-Single Source Shortest Path using BFS Graphs.m4v22.12MB
  • 39.Graph 02 - Traversals (BFS & DFS)/2.SnakesandLadderBFSSSSPProblemGraphs.m4v37.86MB
  • 39.Graph 02 - Traversals (BFS & DFS)/3.DepthFirstSearchinGraphs.m4v19.44MB
  • 39.Graph 02 - Traversals (BFS & DFS)/4.ConnectedComponentsusingDFSGraphs.m4v16.87MB
  • 39.Graph 02 - Traversals (BFS & DFS)/5.GraphsTutorialJourneyToTheMoon.m4v13.51MB
  • 39.Graph 02 - Traversals (BFS & DFS)/6.HolidayAccomodationIConcept.m4v35.87MB
  • 39.Graph 02 - Traversals (BFS & DFS)/7.HolidayAccommodationIIImplementation.m4v26.21MB
  • 4.🔥 Challenges - STL/11.UnlockHint.m4v4.61MB
  • 4.🔥 Challenges - STL/13.SubarrayWithDistinctElementsHint.m4v11.07MB
  • 4.🔥 Challenges - STL/3.StringSort.m4v1.47MB
  • 4.🔥 Challenges - STL/5.MedianOfSortedArraysHint.m4v7.52MB
  • 4.🔥 Challenges - STL/7.HostelVisitHint.m4v3.44MB
  • 4.🔥 Challenges - STL/9.StringWindowHintCode.m4v64.95MB
  • 40.Graph 03 - Undirected Graph Problems/0.FloodFillAlgorithm.m4v23MB
  • 40.Graph 03 - Undirected Graph Problems/1.CycleDetectionUndirectedGraphusingDFS.m4v24.48MB
  • 40.Graph 03 - Undirected Graph Problems/2.BipartiteGraphCheck.m4v21.26MB
  • 40.Graph 03 - Undirected Graph Problems/3.Shortestcycleinundirectedgraph.m4v24.31MB
  • 41.Graph 04 - Directed Graph Problems/0.DAGsTopologicalSortUsingDFSGraphs.m4v21.22MB
  • 41.Graph 04 - Directed Graph Problems/1.TopologicalSortUsingBFSGraphs.m4v22.54MB
  • 41.Graph 04 - Directed Graph Problems/2.CycleDetectioninDirectedGraphusingDFS.m4v33.74MB
  • 41.Graph 04 - Directed Graph Problems/3.StronglyConnectedComponentsKosarajusAlgorithm.m4v29.06MB
  • 41.Graph 04 - Directed Graph Problems/3.StronglyConnectedComponentsKosarajusAlgorithm1.m4v34.29MB
  • 41.Graph 04 - Directed Graph Problems/4.StronglyConnectedComponentsKosarajusAlgorithm2.m4v18.24MB
  • 41.Graph 04 - Directed Graph Problems/4.StronglyConnectedComponentsKosarajusCode.m4v19.86MB
  • 42.Graph 05 - Disjoint Set Union/1-DSU 01 - Introduction to Disjoint Set Union.m4v7.46MB
  • 42.Graph 05 - Disjoint Set Union/2-DSU 02 - Union & Find Operations.m4v15.37MB
  • 42.Graph 05 - Disjoint Set Union/3-DSU 03 - Union Find PseudoCode & Complexity.m4v12.23MB
  • 42.Graph 05 - Disjoint Set Union/4-DSU 04 - Cycle Detection & Implementation.m4v22.35MB
  • 42.Graph 05 - Disjoint Set Union/5-DSU 05 - Path Compression Optimisation.m4v14.26MB
  • 42.Graph 05 - Disjoint Set Union/6-DSU 06 - Union by Rank Optimisation.m4v20.77MB
  • 42.Graph 05 - Disjoint Set Union/7-DSU 07 - Dry Run Analysis.m4v27.65MB
  • 42.Graph 05 - Disjoint Set Union/8-DSU 08 - Pairing Problem.m4v28.35MB
  • 42.Graph 05 - Disjoint Set Union/9.SpojColorfulArray.m4v60.03MB
  • 43.Graph 06 - Minimum Spanning Trees/0.GraphsKruskalsConcept.m4v22.92MB
  • 43.Graph 06 - Minimum Spanning Trees/1.GraphsKruskalsCode.m4v11.42MB
  • 43.Graph 06 - Minimum Spanning Trees/2.GraphsPrimsConcept.m4v29.02MB
  • 43.Graph 06 - Minimum Spanning Trees/3.GraphsPrimsCode.m4v18.54MB
  • 44.Graph 07 - Shortest Paths/1-Single Source Shortest Path using BFS Graphs.m4v22.12MB
  • 44.Graph 07 - Shortest Paths/2-Dijkstra's Algorithm Shortest Path on Weighted Graphs.m4v67.86MB
  • 44.Graph 07 - Shortest Paths/3-Bellman Ford Algorithm Concept.m4v67.08MB
  • 44.Graph 07 - Shortest Paths/4-Bellman Ford Algorithm Code.m4v14.95MB
  • 44.Graph 07 - Shortest Paths/5-Floyd-Warshall Algorithm.m4v70.75MB
  • 44.Graph 07 - Shortest Paths/6-Floyd-Warshall Code.m4v18.45MB
  • 44.Graph 07 - Shortest Paths/OLD/2.GraphsBellmanFordAlgorithmConcept.mp490.15MB
  • 44.Graph 07 - Shortest Paths/OLD/3.GraphsBellmanFordAlgorithmCode.mp428.78MB
  • 44.Graph 07 - Shortest Paths/OLD/4.FloydWarshallAlgorithmConcept1.mp418.17MB
  • 44.Graph 07 - Shortest Paths/OLD/5.FloydWarshallAlgorithmConcept2.mp47.06MB
  • 44.Graph 07 - Shortest Paths/OLD/6.FloydWarshallAlgorithmCode.mp45.74MB
  • 45.Graphs 08 - Implicit Graphs Splitwise Algorithm/0.SplitwiseAppIntroduction.m4v8.79MB
  • 45.Graphs 08 - Implicit Graphs Splitwise Algorithm/1.SplitwiseAppAlgorithm.m4v16.52MB
  • 45.Graphs 08 - Implicit Graphs Splitwise Algorithm/2.SplitwiseAlgorithmImplementation.m4v21.37MB
  • 45.Graphs 08 - Implicit Graphs Splitwise Algorithm/3.SplitwiseAlgorithmwithTransactionDetail.m4v20.33MB
  • 46.Graph 09 - Network Flow [Optional]/0.CppNetworkFlowIntroduction.m4v6.71MB
  • 46.Graph 09 - Network Flow [Optional]/1.CppTerminologiesNetworkFlow.m4v10.82MB
  • 46.Graph 09 - Network Flow [Optional]/2.CppFordFulkersonAlgorithm.m4v12.77MB
  • 46.Graph 09 - Network Flow [Optional]/3.CppFordFulkersonAlgorithmDryRun.m4v11.49MB
  • 46.Graph 09 - Network Flow [Optional]/4.CppFordFulkersonAlgorithmBackwardEdgeCompatibility.m4v6.84MB
  • 46.Graph 09 - Network Flow [Optional]/5.CppEdmondKarpAlgorithm.m4v30.6MB
  • 46.Graph 09 - Network Flow [Optional]/6.CppMinimumCutInNetworkFlow.m4v9.26MB
  • 47.Graph 10 - Advanced Topics /0.EulerTour1.m4v36MB
  • 47.Graph 10 - Advanced Topics /1.EulerTour2.m4v22.09MB
  • 47.Graph 10 - Advanced Topics /2.EulerTour3.m4v26.91MB
  • 47.Graph 10 - Advanced Topics /4.DPonTrees.m4v19.92MB
  • 47.Graph 10 - Advanced Topics /5.DPonGraphs.m4v18.39MB
  • 47.Graph 10 - Advanced Topics /6.DPonGraphs2.m4v12.52MB
  • 47.Graph 10 - Advanced Topics /7.ArticulationPointandBridges1.m4v22.6MB
  • 47.Graph 10 - Advanced Topics /8.ArticulationPointandBridge2.m4v16.13MB
  • 47.Graph 10 - Advanced Topics /9.ArticulationPointandBridge3.m4v19.74MB
  • 48.Graph 11 - LCA/0.SparseTable1.m4v48.73MB
  • 48.Graph 11 - LCA/1.SparseTable2.m4v20.77MB
  • 48.Graph 11 - LCA/2.LCA1.m4v16.91MB
  • 48.Graph 11 - LCA/3.LCA2.m4v13.59MB
  • 48.Graph 11 - LCA/4.LCA3.m4v38.2MB
  • 48.Graph 11 - LCA/5.LCA4.m4v27.7MB
  • 48.Graph 11 - LCA/6.LCA5.m4v20.99MB
  • 48.Graph 11 - LCA/7.LCAQuestion.m4v23.18MB
  • 49.Graph 12 - Competitive Problems/0.BeautifulGraph.m4v30.27MB
  • 49.Graph 12 - Competitive Problems/1.LeetcodeProblemCourseSchedule2.m4v11.51MB
  • 49.Graph 12 - Competitive Problems/2.FieldofDreams.m4v26.85MB
  • 49.Graph 12 - Competitive Problems/3.LunarNewYearandWander.m4v17.59MB
  • 49.Graph 12 - Competitive Problems/4.SecretPasswords.m4v29.66MB
  • 49.Graph 12 - Competitive Problems/5.SNSOCIAL.m4v28.21MB
  • 49.Graph 12 - Competitive Problems/6.TreeofQueries.m4v31.2MB
  • 49.Graph 12 - Competitive Problems/7.PathQueries1.m4v29.08MB
  • 49.Graph 12 - Competitive Problems/8.PathQueries2.m4v12.41MB
  • 49.Graph 12 - Competitive Problems/9.KthPath.m4v31.93MB
  • 50.🔥 Challenges - Graphs/13.VivekandPartyHint.m4v7.24MB
  • 50.🔥 Challenges - Graphs/15.BeautifulVerticesHint.m4v7.68MB
  • 50.🔥 Challenges - Graphs/2.BFSShortestPathHint.m4v2.3MB
  • 50.🔥 Challenges - Graphs/5.ExpandThePondHint.m4v9.89MB
  • 50.🔥 Challenges - Graphs/9.PairingHint.m4v7.28MB
  • 51.Game Theory/0.GameTheoryLIVEWebinar10December.m4v254.76MB
  • 53.Dynamic Programming/0.DPIntroductiontoDynamicProgramming.m4v37.63MB
  • 53.Dynamic Programming/1.DPFibonacciRecursionCallStack.m4v16.25MB
  • 53.Dynamic Programming/10.DPWinesProblemTopDown.m4v29.86MB
  • 53.Dynamic Programming/11.DPWinesProblemBottomUpApproach.m4v35.77MB
  • 53.Dynamic Programming/12.DPWinesProblemCode.m4v13.38MB
  • 53.Dynamic Programming/13.1DPMaximumSubarraySum.m4v21.78MB
  • 53.Dynamic Programming/14.1DPMaximumSubarraySumSpaceOptimisation.m4v6.58MB
  • 53.Dynamic Programming/15.1DPLaddersTopDown.m4v22.93MB
  • 53.Dynamic Programming/16.1DPLaddersBottomUp.m4v7.4MB
  • 53.Dynamic Programming/17.1DPLaddersOptimisedApproach.m4v17.03MB
  • 53.Dynamic Programming/18-Rod Cutting Problem (Recursion + Bottom Up DP).m4v22.77MB
  • 53.Dynamic Programming/19-LCS (Recursion & TopDown Approach).m4v25.91MB
  • 53.Dynamic Programming/2.DPTopDownDPFibonacciImplementation.m4v10.85MB
  • 53.Dynamic Programming/20.MDPMatrixChainMultiplication.m4v160.21MB
  • 53.Dynamic Programming/21.MDPMatrixChainMultiplicationInterviewBitCode.m4v9.73MB
  • 53.Dynamic Programming/22.AdvancedDPCellMitosisHackerBlocks.m4v20.85MB
  • 53.Dynamic Programming/23.AdvancedDPMixturesSpoj.m4v27.95MB
  • 53.Dynamic Programming/24.CPPDynamicProgrammingFriendsPairingProblem.m4v6.81MB
  • 53.Dynamic Programming/25-DP - Catalan Number Concept.m4v44.93MB
  • 53.Dynamic Programming/26.DynamicProgrammingOptimalGameStrategy.m4v13.27MB
  • 53.Dynamic Programming/27-MDP - Alyona and Strings CodeForces.m4v21.28MB
  • 53.Dynamic Programming/28.MDPAlyonaandStringsCodeforcesCode.m4v21.28MB
  • 53.Dynamic Programming/29.AdvancedDPRockScissorsPaperProblem3DDP.m4v28.43MB
  • 53.Dynamic Programming/3.DPBottomUpFibonacciDPSpaceOptimisation.m4v12.21MB
  • 53.Dynamic Programming/30.DiwaliPuzzle3dDP.m4v31.18MB
  • 53.Dynamic Programming/31.AdvancedDPValentineMagicHackerBlocks.m4v19.06MB
  • 53.Dynamic Programming/4.DPMinStepstoOne.m4v29.8MB
  • 53.Dynamic Programming/5.DPMinimumStepsTopDownCode.m4v11.04MB
  • 53.Dynamic Programming/6.DPMinimumStepsBottomUpCode.m4v8.46MB
  • 53.Dynamic Programming/7.DPMinimumCoinChange.m4v53.99MB
  • 53.Dynamic Programming/8.DPCoinChangeTopDownCode.m4v10.74MB
  • 53.Dynamic Programming/9.DPCoinChangeBottomUpCode.m4v13.2MB
  • 54.Grid Based DP/0.GridDP01MinimumCostPath.m4v18.08MB
  • 54.Grid Based DP/1.GridDP02RatElephantWays.m4v25.62MB
  • 54.Grid Based DP/2.GridDP03RobotPathsCodechef.m4v21.61MB
  • 54.Grid Based DP/3.GridDP042DPrefixSumGoldGrid.m4v40.19MB
  • 54.Grid Based DP/4.GridDP05WorkingOutCodeforces.m4v41.78MB
  • 55.DP Problems Set - I/1.ProblemAFrog1.m4v20.45MB
  • 55.DP Problems Set - I/2.ProblemBFrog2.m4v20.43MB
  • 55.DP Problems Set - I/3.ProblemCVacation.m4v33.29MB
  • 55.DP Problems Set - I/4.ProblemDKnapsack1Logic.m4v17.86MB
  • 55.DP Problems Set - I/5.ProblemDKnapsack1Implementation.m4v13.68MB
  • 56.DP Problem Set - II /0.ProblemEKnapsack2.m4v24.25MB
  • 56.DP Problem Set - II /1.ProblemFLCS.m4v36.77MB
  • 56.DP Problem Set - II /2.ProblemGLongestPath.m4v24.36MB
  • 56.DP Problem Set - II /3.ProblemHGrid1.m4v33.9MB
  • 57.DP Problem Set - III/0.ProblemICoins.m4v21.4MB
  • 57.DP Problem Set - III/1.ProblemJSushiProblemExplanation.m4v26.69MB
  • 57.DP Problem Set - III/2.ProblemJSushiLogicandImplementation.m4v36.85MB
  • 57.DP Problem Set - III/3.ProblemKStones.m4v21.91MB
  • 57.DP Problem Set - III/4.ProblemLDeque.m4v28.71MB
  • 58.DP Problem Set - IV/0.ProblemMCandies.m4v40.9MB
  • 58.DP Problem Set - IV/1.ProblemNSlimes.m4v28.71MB
  • 58.DP Problem Set - IV/2.ProblemOMatching.m4v52.65MB
  • 58.DP Problem Set - IV/3.ProblemPIndependentSet.m4v20.35MB
  • 58.DP Problem Set - IV/4.ProblemQFlowers.m4v32.7MB
  • 59.DP Problem Set - V/0.ProblemRWalk.m4v32.19MB
  • 59.DP Problem Set - V/1.ProblemSDigitSum.m4v31.73MB
  • 59.DP Problem Set - V/2.ProblemTPermutation.m4v59.18MB
  • 59.DP Problem Set - V/3.ProblemUGrouping.m4v51.6MB
  • 59.DP Problem Set - V/4.ProblemVSubtree.m4v52.16MB
  • 6.Bit Manipulation /0.BitwiseOperators.m4v15.24MB
  • 6.Bit Manipulation /1.UniqueNumberI.m4v6.52MB
  • 6.Bit Manipulation /10.UniqueNumberIIIConcept.m4v10.92MB
  • 6.Bit Manipulation /11.UniqueNumberIIICode.m4v13.44MB
  • 6.Bit Manipulation /12.FastExponentiationusingBitmasking.m4v12.91MB
  • 6.Bit Manipulation /13.GenerateSubsetsusingBitmasking.m4v14.91MB
  • 6.Bit Manipulation /14.InclusionExclusionConceptImplementation.m4v43.5MB
  • 6.Bit Manipulation /2.BitManipulationGetSetBits.m4v22.73MB
  • 6.Bit Manipulation /3.BitManipulationClearUpdateBits.m4v22.19MB
  • 6.Bit Manipulation /4.BitManipulationClearRangeOfBits.m4v28.18MB
  • 6.Bit Manipulation /5.ReplaceBitsinNbyM.m4v13.27MB
  • 6.Bit Manipulation /6.CountingSetBitsOptimisations.m4v19.86MB
  • 6.Bit Manipulation /7.DecimaltoBinaryusingBitwise.m4v7.01MB
  • 6.Bit Manipulation /8.UniqueNumberIIConcept.m4v12.97MB
  • 6.Bit Manipulation /9.UniqueNumberIICode.m4v17.63MB
  • 60.DP Problem Set - VI/0.ProblemWIntervalsBruteForceApproach.m4v20.31MB
  • 60.DP Problem Set - VI/1.ProblemWIntervalsOptimisedApproach.m4v37.84MB
  • 60.DP Problem Set - VI/2.ProblemXTower.m4v39.5MB
  • 60.DP Problem Set - VI/3.ProblemYGrid2Logic.m4v34.36MB
  • 60.DP Problem Set - VI/4.ProblemYGrid2Implementation.m4v36.99MB
  • 60.DP Problem Set - VI/5.ProblemZFrog3.m4v73.21MB
  • 61.🔥 Challenges - Dynamic Programming/10.ExchangingCoinsHint.m4v4.32MB
  • 61.🔥 Challenges - Dynamic Programming/3.1CountHint.m4v13.69MB
  • 61.🔥 Challenges - Dynamic Programming/8.FriendsPairingHint.m4v2.58MB
  • 62.One Problem Many Ways - Longest Increasing Subsequence /0.LIS1.m4v20.07MB
  • 62.One Problem Many Ways - Longest Increasing Subsequence /1.LIS2.m4v6.95MB
  • 62.One Problem Many Ways - Longest Increasing Subsequence /2.LIS3.m4v39.91MB
  • 62.One Problem Many Ways - Longest Increasing Subsequence /3.LIS4.m4v12.01MB
  • 62.One Problem Many Ways - Longest Increasing Subsequence /4.LIS5.m4v18.65MB
  • 62.One Problem Many Ways - Longest Increasing Subsequence /5.LIS6.m4v36.91MB
  • 62.One Problem Many Ways - Longest Increasing Subsequence /6.LIS7.m4v11.88MB
  • 63.Advanced DS - Geometry & Convex Hull/0.ConvexHull1.m4v24.35MB
  • 63.Advanced DS - Geometry & Convex Hull/1.ConvexHull2continued.m4v36.96MB
  • 64.Advanced DS - Hashing Problems/1-Hashing 01 - Check Subarray With Sum Zero.m4v13.58MB
  • 64.Advanced DS - Hashing Problems/10-Hashing - Rectangle Counting.m4v31.89MB
  • 64.Advanced DS - Hashing Problems/2-Hashing 02 - Length Of Longest Subarray With Sum Zero.m4v20.53MB
  • 64.Advanced DS - Hashing Problems/3-Hashing 03 - Longest Subarray With Sum K.m4v18.41MB
  • 64.Advanced DS - Hashing Problems/4-Hashing 04 - Longest Consecutive Subsequence - I.m4v11.13MB
  • 64.Advanced DS - Hashing Problems/5-Hashing 05 - Longest Consecutive Subsequence-II (Unordered Map).m4v38.54MB
  • 64.Advanced DS - Hashing Problems/6-Hashing 06 - Longest Consecutive Subsequence-III (Unordered Set).m4v25.61MB
  • 64.Advanced DS - Hashing Problems/7-Minimum Window Substring Concept (Sliding Window).m4v24.73MB
  • 64.Advanced DS - Hashing Problems/8-Minimum Window Substring (Sliding Window).m4v36.52MB
  • 64.Advanced DS - Hashing Problems/9-Hashing - Right Angled Triangles.m4v15.89MB
  • 64.Advanced DS - Hashing Problems/OLD/10.UniqueWordsPairHint.mp4100.35MB
  • 64.Advanced DS - Hashing Problems/OLD/4.LongestConsecutiveSubsequenceApproach2.mp4239.2MB
  • 64.Advanced DS - Hashing Problems/OLD/5.LongestConsecutiveSubsequenceApproach3.mp457.38MB
  • 64.Advanced DS - Hashing Problems/OLD/6.LongestConsecutiveSequenceImplementationC.mp422.38MB
  • 65.Advanced DS - Trie Problems/1.TrieDataStructure.m4v39.35MB
  • 65.Advanced DS - Trie Problems/2-Trie 02 - Unique Prefix Array.m4v13.74MB
  • 65.Advanced DS - Trie Problems/3-Trie 03 - Max XOR Pair.m4v29.36MB
  • 65.Advanced DS - Trie Problems/4-Trie 04 - Max Xor Pair Implementation.m4v28.23MB
  • 65.Advanced DS - Trie Problems/5-Trie 05 - Subarray With Maximum Xo.m4v11.05MB
  • 67.Persistent Tries/0.PersistentTrieLecture1.m4v149.3MB
  • 67.Persistent Tries/1.PersistentTrieLecture2.m4v211.48MB
  • 67.Persistent Tries/2.PersistentTrieLecture3.m4v148.68MB
  • 68.Square Root Decomposition Mo's Algorithm/0-Square Root Decomposition - I.m4v22.55MB
  • 68.Square Root Decomposition Mo's Algorithm/1-Square Root Decomposition - II [Implementation].m4v23.63MB
  • 68.Square Root Decomposition Mo's Algorithm/3.MosAlgorithm.m4v31.56MB
  • 68.Square Root Decomposition Mo's Algorithm/4.SPOJDQuery.m4v29.09MB
  • 68.Square Root Decomposition Mo's Algorithm/5.CodechefDDCC.m4v42.18MB
  • 69.String Matching Algorithms [Optional]/1-String Matching Algorithms - Introduction.m4v3.57MB
  • 69.String Matching Algorithms [Optional]/10-Rabin Karp Algorithm Second Method - Cod.m4v12.61MB
  • 69.String Matching Algorithms [Optional]/2-Trie Introduction.m4v20.99MB
  • 69.String Matching Algorithms [Optional]/3-Trie - Insertion, Searching Code.m4v16.15MB
  • 69.String Matching Algorithms [Optional]/4-Trie - String Matching.m4v8.89MB
  • 69.String Matching Algorithms [Optional]/5-String Matching Using Trie.m4v9.16MB
  • 69.String Matching Algorithms [Optional]/6-String Hashing.m4v21.11MB
  • 69.String Matching Algorithms [Optional]/7-Rabin Karp Algo - Concept.m4v12.09MB
  • 69.String Matching Algorithms [Optional]/8-Rabin Karp Algorithm - Code.m4v29.69MB
  • 69.String Matching Algorithms [Optional]/9-Rabin Karp Algorithm Second Method - Concept.m4v9.56MB
  • 69.String Matching Algorithms [Optional]/OLD/0.NaiveAlgorithmConcept.mp459.4MB
  • 69.String Matching Algorithms [Optional]/OLD/1.NaiveAlgorithmCode.mp447.44MB
  • 69.String Matching Algorithms [Optional]/OLD/4.KMPKnuthMorrisPrattStringMatchingAlgorithmConcept.mp4392.73MB
  • 69.String Matching Algorithms [Optional]/OLD/5.KMPKnuthMorrisPrattStringMatchingAlgorithmCode.mp4100.27MB
  • 7.🔥 Challenges - Bitmasking/10.IncredibleHulkHint.m4v4.26MB
  • 7.🔥 Challenges - Bitmasking/7.XorProfitHint.m4v12.61MB
  • 70.Interactive Problems [Optional]/0.InteractiveProblems1Introduction.m4v30.83MB
  • 70.Interactive Problems [Optional]/1.InteractiveProblems2Examples.m4v31.22MB
  • 70.Interactive Problems [Optional]/2.InteractiveProblems3Examples.m4v49.51MB
  • 70.Interactive Problems [Optional]/3.InteractiveProblems4Examples.m4v26.2MB
  • 72.Webinars Misc Topics [Optional]/1-Webinar - Recursion.m4v187.14MB
  • 72.Webinars Misc Topics [Optional]/10.DynamicProgrammingwithBitmasksWebinar.m4v272.72MB
  • 72.Webinars Misc Topics [Optional]/11-Constructive Algorithms ( SNACKUP Codechef ).m4v46.34MB
  • 72.Webinars Misc Topics [Optional]/12-Competitive Webinar - Number Theory Revisited.m4v106.36MB
  • 72.Webinars Misc Topics [Optional]/13-CRX-AVL Tre.m4v231.24MB
  • 72.Webinars Misc Topics [Optional]/2-Webinar - Trees.m4v166.78MB
  • 72.Webinars Misc Topics [Optional]/3-Webinar - Graph.m4v206.1MB
  • 72.Webinars Misc Topics [Optional]/4-Webinar - Dynamic Programming - Part I (Sanket).m4v74.68MB
  • 72.Webinars Misc Topics [Optional]/5-Webinar - Dynamic Programming - Part 2.m4v88.77MB
  • 72.Webinars Misc Topics [Optional]/6-Webinar - Dynamic Programming.m4v202.55MB
  • 72.Webinars Misc Topics [Optional]/7.CPPWebinarOOPSWebinarOperatorOverloading.m4v74.28MB
  • 72.Webinars Misc Topics [Optional]/8-Webinar - Big Integers.m4v324.16MB
  • 72.Webinars Misc Topics [Optional]/9-Time Limit Exceeded - Learn about Complexities.m4v16.41MB
  • 73.Heavy Light Decomposition [Optional]/0.HLDIntroductionToHeavyLightDecomposition.m4v14.14MB
  • 73.Heavy Light Decomposition [Optional]/1.HLDTotalSegmentTreesInDecompositionOfTree.m4v6.78MB
  • 73.Heavy Light Decomposition [Optional]/2.HLDAlgorithm.m4v18.75MB
  • 73.Heavy Light Decomposition [Optional]/3.HLDQTREEHLDProblemSPOJ.m4v63.66MB
  • 74.Fast Fourier Transform (FFT's) [Optional]/1.FFT 1 - Polynomial Multiplication, FFT Basics.m4v10.05MB
  • 74.Fast Fourier Transform (FFT's) [Optional]/2.FFT 2 - FFT Concept and Mathematics.m4v33.08MB
  • 74.Fast Fourier Transform (FFT's) [Optional]/3.FFT 3 - Discrete Fourier Transform.m4v24.13MB
  • 74.Fast Fourier Transform (FFT's) [Optional]/4.FFT 4 - Discrete Fourier Transform Example.m4v50.59MB
  • 74.Fast Fourier Transform (FFT's) [Optional]/5.FFT5InverseFastFourierTransform.m4v15.94MB
  • 74.Fast Fourier Transform (FFT's) [Optional]/6.FFT6InverseFFTExampleDryRun.m4v19.04MB
  • 76.Student Interview Experiences/Amazon, Goldman Sachs, CodeNation Interview🔥 - BST ❓Heaps ❓ Binary Search Questions ❓- Pulkit DTU.m4v32.03MB
  • 76.Student Interview Experiences/Coding Interview Questions - Anirudh Gupta l Amazon l DTU.m4v43.36MB
  • 76.Student Interview Experiences/Coding Interview Questions - Harshita Kalsi l American Express l IGDTUW.m4v102.03MB
  • 76.Student Interview Experiences/Google Interview - How Siddharth cracked It- Know Google Interview Questions & process!.m4v56.6MB
  • 76.Student Interview Experiences/HSBC Interview questions by Meghansh and Rohan, VIT vellore.m4v64.49MB
  • 76.Student Interview Experiences/Hackerearth & Tripshire Web Developer Interview questions - Naman gets offcampus offers!.m4v64.65MB
  • 76.Student Interview Experiences/Offcampus Placement at GO-JEK, Microsoft & BrowserStack from MAIT - IP University.m4v93.64MB
  • 76.Student Interview Experiences/Samsung & Flipkart Interview Questions - DTUs Anubhav and Tushar grab job offers!.m4v148.84MB
  • 76.Student Interview Experiences/UBER Internship & ACM-ICPC Interview experience by Samarth Jain.m4v64.69MB
  • 76.Student Interview Experiences/UBER Internship & ACM-ICPC Interview experience by Samarth Jain.mp468.6MB
  • 8.Maths-I Big Integers/0.BigIntegers01LargeFactorialsinC.m4v25.79MB
  • 8.Maths-I Big Integers/1.BigIntegers02BigFactorialsinPython.m4v3.37MB
  • 8.Maths-I Big Integers/2.BigIntegers03JavaBigIntegerClass.m4v19.87MB
  • 8.Maths-I Big Integers/3.BigInteger04JavaFactorialExample.m4v3.29MB
  • 8.Maths-I Big Integers/4.BigInteger05JULKASpojProblem.m4v7.27MB
  • 9.Maths-II Combinatorics/0.BirthdayParadoxProblem..m4v17.56MB
  • 9.Maths-II Combinatorics/1.BirthdayParadoxImplementation..m4v9.01MB
  • 9.Maths-II Combinatorics/2.InterestingFibonacciFacts.m4v22.87MB
  • 9.Maths-II Combinatorics/3.BinomialCoefficientsPascalTriangle.m4v10.76MB
  • 9.Maths-II Combinatorics/4.CatalanSeriesApplications.m4v26.16MB
  • 9.Maths-II Combinatorics/5.OEISSeriesFinder.m4v10.62MB
  • 9.Maths-II Combinatorics/6.CountingProblemsInclusionExclusionPrinciple.m4v7.83MB
  • 9.Maths-II Combinatorics/7.InclusionExclusionConceptImplementation.m4v43.5MB