DSA-251 by Parikh Jain - Basic DSA
DSA-251 by Parikh Jain - Basic DSA
Arrays
String
Multi-Dimensional arrays
Sum of zeroes
Matrix Symmetric
Inplace rotate matrix 90 degree
Set Matrix Zeroes
Spiral Order
Maps/Sets
Two Pointers
Pair Sum
Move Negative Number To Start
Container With Most Water
Check subsequence
Basic Algorithms
Insertion Sort
Selection Sort
Bubble Sort
Kadane’s Algoritm
Dutch National Flag Algorithm
Moore’s Voting Algorithm
Mixed Questions-1
(Concepts learned in topics above will be used in below questions. This is
critical to become great in DSA.)
Check permutation
Intersection Of Two Arrays
N/3 repeated number in array
Counting Sort
Rotate Matrix To Right
FInd Kth Character of Decrypted String
Move Zeroes To End
Sum of Two Elements Equals Third
Minimum Operations to Make String Equal
Maximum Sum Circular Array
Longest Consecutive Sequence
Maximum Subarray Sum After K Concat
Maximum Product Count
Multiply Strings
Find All Subsquares of size K
Repeat And Missing Number Array
4 Sum Problem
Count All Subarrays With Given Sum
Maximum Sum Rectangle
Nth element of spiral matrix