DSA Intermediate Level
About Course
DSA basic course is very important for foundation of the Competitive Coding. This course cover how different data structures and algorithmic approaches helps to solve problems.
Course Content
Sliding Window
-
Maximum sum subarray of size K
-
Maximum Average Subarray
-
Minimum Recolors
-
First Negative Number
-
Maximum Number of Vowels in a Substring of Given Length
-
Max Consecutive Ones III
-
Max Consecutive Ones
-
Longest Subarray of 1’s After Deleting One Element
-
Maximize the Confusion of an Exam
-
Longest K unique characters substring
-
Longest Distinct characters in string
Prefix Sum
Prefix Sum Part-2
Kadanes Algorithm
Priority Queue (Heap)
Problems on Stack
Problems on Linked Lists
Student Ratings & Reviews
No Review Yet