Канал: Aditya Verma

16 Word Break | Part 2

16 Word Break | Part 2

15 Word Break | Part 1

15 Word Break | Part 1

14 Print all possible Palindromic partitions

14 Print all possible Palindromic partitions

13 Rat in a Maze Problem Code

13 Rat in a Maze Problem Code

12 Rat in a Maze Problem

12 Rat in a Maze Problem

11 N Digit numbers with digits in increasing order

11 N Digit numbers with digits in increasing order

10 Largest number in K swaps Code and Time Complexity

10 Largest number in K swaps Code and Time Complexity

9 Largest number in K swaps

9 Largest number in K swaps

8 Permutation of Strings | Backtracking Solution

8 Permutation of Strings | Backtracking Solution

7 Time Complexity of a Recursive Tree

7 Time Complexity of a Recursive Tree

6 Permutation of Strings | Simple Recursion

6 Permutation of Strings | Simple Recursion

5 Backtracking Problems

5 Backtracking Problems

4 Generalization of Backtracking

4 Generalization of Backtracking

3 Identification of Backtracking Problems

3 Identification of Backtracking Problems

2 Basics of Backtracking

2 Basics of Backtracking

1 Backtracking Course Overview

1 Backtracking Course Overview

Is Aditya Verma dead? Channel hijacked?

Is Aditya Verma dead? Channel hijacked?

Minimum Window Substring | Variable Size Sliding Window

Minimum Window Substring | Variable Size Sliding Window

Pick Toys | An Interesting Sliding Window Problem

Pick Toys | An Interesting Sliding Window Problem

Longest Substring With Without Repeating Characters | Variable Size Sliding Window

Longest Substring With Without Repeating Characters | Variable Size Sliding Window

Longest Substring With K Unique Characters | Variable Size Sliding Window

Longest Substring With K Unique Characters | Variable Size Sliding Window

Variable Size Sliding Window General Format

Variable Size Sliding Window General Format

Largest Subarray of sum K | Part2

Largest Subarray of sum K | Part2

Variable Size Sliding Window | Largest Subarray of sum K | Part1

Variable Size Sliding Window | Largest Subarray of sum K | Part1

Maximum of all subarrays of size k | Sliding Window

Maximum of all subarrays of size k | Sliding Window

Count Occurrences Of Anagrams | Sliding Window

Count Occurrences Of Anagrams | Sliding Window

How To Debug Your Code | How To Solve Any Coding Problem In Your Interview Part 3

How To Debug Your Code | How To Solve Any Coding Problem In Your Interview Part 3

Significance Of The Constraints | How To Solve Any Coding Problem In Your Interview Part 2

Significance Of The Constraints | How To Solve Any Coding Problem In Your Interview Part 2

Giveaway of 2000 INR To The Community | Aditya Verma

Giveaway of 2000 INR To The Community | Aditya Verma

How To Solve Any Coding Problem In Your Interview Part 1 | Time Management | Experience And Mistakes

How To Solve Any Coding Problem In Your Interview Part 1 | Time Management | Experience And Mistakes

First Negative Number in every Window of Size K | Sliding Window

First Negative Number in every Window of Size K | Sliding Window

Maximum Sum Subarray of size K | Sliding Window

Maximum Sum Subarray of size K | Sliding Window

Sliding Window Problems

Sliding Window Problems

Sliding Window Introduction Identification And Types

Sliding Window Introduction Identification And Types

Swap Sort Time Complexity

Swap Sort Time Complexity

Find all duplicate and missing numbers from 1 to n | Swap Sort Code

Find all duplicate and missing numbers from 1 to n | Swap Sort Code

Find all duplicate and missing numbers from 1 to N

Find all duplicate and missing numbers from 1 to N

Swap Sort Explanation | Find a duplicate and a missing number

Swap Sort Explanation | Find a duplicate and a missing number

Find Missing and Duplicate Number in an Array | Swap Sort Need

Find Missing and Duplicate Number in an Array | Swap Sort Need

Face To Face Interview Interesting Algorithms

Face To Face Interview Interesting Algorithms

Josephus Problem | Game of Death in a circle | Execution in Circle

Josephus Problem | Game of Death in a circle | Execution in Circle

Print N-bit binary numbers having more 1’s than 0’s for any prefix

Print N-bit binary numbers having more 1’s than 0’s for any prefix

Generate all Balanced Parentheses

Generate all Balanced Parentheses

Letter Case Permutation | Recursion

Letter Case Permutation | Recursion

Permutation with Case Change | Recursion

Permutation with Case Change | Recursion

Print unique subsets And Variations

Print unique subsets And Variations

Permutation with spaces

Permutation with spaces

Print Subsets | Print PowerSets | Print all Subsequences

Print Subsets | Print PowerSets | Print all Subsequences

Tower of Hanoi | Recursion

Tower of Hanoi | Recursion

Kth Symbol in Grammar

Kth Symbol in Grammar

Reverse a Stack using Recursion

Reverse a Stack using Recursion

Delete Middle Element of a Stack

Delete Middle Element of a Stack

Sort A Stack

Sort A Stack

Sort An array using Recursion

Sort An array using Recursion

Height of a Binary Tree

Height of a Binary Tree

Beauty of Hypothesis And Induction

Beauty of Hypothesis And Induction

Hypothesis-Induction-Base Condition

Hypothesis-Induction-Base Condition

Recursion is Everywhere !!

Recursion is Everywhere !!

Recursion Introduction and Identification

Recursion Introduction and Identification

Allocate Minimum Number Of Pages

Allocate Minimum Number Of Pages

21 Search in Row wise And Column wise Sorted Array

21 Search in Row wise And Column wise Sorted Array

19 Search An Element in Bitonic Array

19 Search An Element in Bitonic Array

18 Find maximum element in Bitonic Array

18 Find maximum element in Bitonic Array

17 Peak Element

17 Peak Element

16 Binary Search on Answer Concept

16 Binary Search on Answer Concept

15 Minimum Difference Element in a Sorted Array

15 Minimum Difference Element in a Sorted Array

14 Index of First 1 in a Binary Sorted Infinite Array

14 Index of First 1 in a Binary Sorted Infinite Array

13 Find position of an element in an Infinite Sorted Array

13 Find position of an element in an Infinite Sorted Array

12 Next Alphabetical Element

12 Next Alphabetical Element

11 Ceil of an element in a Sorted Array

11 Ceil of an element in a Sorted Array

10 Find Floor of an element in a Sorted Array

10 Find Floor of an element in a Sorted Array

9 Searching in a Nearly Sorted Array

9 Searching in a Nearly Sorted Array

8 Find an Element in a Rotated Sorted Array

8 Find an Element in a Rotated Sorted Array

Equal Sum Partition Problem

Equal Sum Partition Problem

7 Number of Times a Sorted array is Rotated

7 Number of Times a Sorted array is Rotated

2 Binary Search

2 Binary Search

6 Count of an Element in a Sorted Array

6 Count of an Element in a Sorted Array

3 Binary Search on Reverse Sorted Array

3 Binary Search on Reverse Sorted Array

4 Order Not Known Search

4 Order Not Known Search

1 Binary Search Format Introduction

1 Binary Search Format Introduction

5 First and Last occurrence of an Element

5 First and Last occurrence of an Element

50 Maximum Path sum | From leaf node to leaf node

50 Maximum Path sum | From leaf node to leaf node

49 Maximum Path Sum | From any node to any node

49 Maximum Path Sum | From any node to any node

47 Dynamic Programming on Tree General Syntax

47 Dynamic Programming on Tree General Syntax

46 Dynamic programming on Trees Introduction and Identification

46 Dynamic programming on Trees Introduction and Identification

48 Diameter of a Binary Tree

48 Diameter of a Binary Tree

42 Scrambled String Memoized

42 Scrambled String Memoized

44 Egg Dropping Problem Memoization

44 Egg Dropping Problem Memoization

38 Palindrome Partitioning Memoized Optimisation

38 Palindrome Partitioning Memoized Optimisation

35 Matrix chain multiplication Memoization

35 Matrix chain multiplication Memoization

32 Minimum number of insertion in a string to make it a palindrome

32 Minimum number of insertion in a string to make it a palindrome

33 Matrix chain multiplication Introduction Identification and General Format

33 Matrix chain multiplication Introduction Identification and General Format

43 Egg Dropping Problem Recursive

43 Egg Dropping Problem Recursive

41 Scrambled String Recursive

41 Scrambled String Recursive

40 Evaluate Expression To True Boolean Parenthesization Memoized

40 Evaluate Expression To True Boolean Parenthesization Memoized

37 Palindrome Partitioning Memoization

37 Palindrome Partitioning Memoization

45 Egg Dropping Problem Memoization Optimization

45 Egg Dropping Problem Memoization Optimization

34 Matrix Chain Multiplication Recursive

34 Matrix Chain Multiplication Recursive

39 Evaluate Expression to True Boolean Parenthesization Recursive

39 Evaluate Expression to True Boolean Parenthesization Recursive

36 Palindrome Partitioning Recursive

36 Palindrome Partitioning Recursive

25 Minimum Number of Insertion and Deletion to convert String a to String b

25 Minimum Number of Insertion and Deletion to convert String a to String b

19 Longest common subsequence Recursive

19 Longest common subsequence Recursive

18 Longest common subsequence Introduction

18 Longest common subsequence Introduction

24 Shortest Common SuperSequence

24 Shortest Common SuperSequence

28 Minimum number of deletion in a string to make it a palindrome

28 Minimum number of deletion in a string to make it a palindrome

22 Longest Common Substring

22 Longest Common Substring

29 Print shortest common Supersequence

29 Print shortest common Supersequence

17 Coin change problem Contd.

17 Coin change problem Contd.

26 Longest Palindromic Subsequence

26 Longest Palindromic Subsequence

23 Printing Longest common subsequence

23 Printing Longest common subsequence

31 Sequence Pattern Matching

31 Sequence Pattern Matching

20 Longest common subsequence Memoization

20 Longest common subsequence Memoization

21 Longest common subsequence Top down DP

21 Longest common subsequence Top down DP

30 Longest repeating subsequence

30 Longest repeating subsequence

10 Minimum Subset Sum Difference

10 Minimum Subset Sum Difference

8 Equal Sum Partition Problem

8 Equal Sum Partition Problem

9 Count of Subsets Sum with a Given Sum

9 Count of Subsets Sum with a Given Sum

12 Target sum

12 Target sum

16 Coin change problem: Minimum number of coins

16 Coin change problem: Minimum number of coins

15 Coin change problem: Maximum number of ways

15 Coin change problem: Maximum number of ways

14 Rod Cutting Problem

14 Rod Cutting Problem

7 Subset Sum Problem

7 Subset Sum Problem

13 Unbounded Knapsack

13 Unbounded Knapsack

4 01Knapsack Memoization

4 01Knapsack Memoization

6 Identification of Knapsack Problems and Introduction

6 Identification of Knapsack Problems and Introduction

3 01 Knapsack Recursive

3 01 Knapsack Recursive

2 Types of knapsack

2 Types of knapsack

5 01 Knapsack Top Down DP

5 01 Knapsack Top Down DP

11 Count the number of subset with a given difference

11 Count the number of subset with a given difference

Dynamic Programming | Introduction

Dynamic Programming | Introduction

10 Sum of Elements between k1 smallest and k2 smallest numbers

10 Sum of Elements between k1 smallest and k2 smallest numbers

8 K Closest Points To Origin

8 K Closest Points To Origin

9 Connect Ropes to Minimise the Cost

9 Connect Ropes to Minimise the Cost

3 Return K largest Elements in array

3 Return K largest Elements in array

2 Kth Smallest Element

2 Kth Smallest Element

6 Top K Frequent Numbers

6 Top K Frequent Numbers

5 K Closest Numbers

5 K Closest Numbers

4 Sort a K Sorted Array | Sort Nearly Sorted Array

4 Sort a K Sorted Array | Sort Nearly Sorted Array

7 Frequency Sort

7 Frequency Sort

1 Heap Introduction and Identification

1 Heap Introduction and Identification

11 Minimum Element in Stack in O(1) Space

11 Minimum Element in Stack in O(1) Space

10 Minimum Element in Stack with Extra space

10 Minimum Element in Stack with Extra space

9 Rain Water Trapping

9 Rain Water Trapping

8 Max Area Rectangle in binary matrix

8 Max Area Rectangle in binary matrix

7 Maximum Area Histogram | MAH

7 Maximum Area Histogram | MAH

6 Stock Span Problem

6 Stock Span Problem

5 NSR | Nearest Smaller to Right

5 NSR | Nearest Smaller to Right

4 NSL | NEAREST SMALLER TO LEFT

4 NSL | NEAREST SMALLER TO LEFT

3 NGL | Nearest Greater to left

3 NGL | Nearest Greater to left

2 NGR | Nearest Greater to right | Next Largest Element

2 NGR | Nearest Greater to right | Next Largest Element

1 Stack Introduction And Identification

1 Stack Introduction And Identification