enjoyalgorithms

DSA Interview Course

A free self-paced DSA course for students and professionals who want to learn data structures and algorithms concepts, master problem-solving approaches, and crack the coding interview. Enjoy learning algorithms!

What will you learn?

✓ Problem Solving Techniques

✓ Designing Efficient Solutions

✓ Implementing Correct Code

✓ Analysis and Code Optimization

enjoyalgorithms dsa course
☆ 16-week live DSA course
Explore details
☆ 16-week live ML course
Explore details
☆ 10-week live DSA course
Explore details

DSA Course Modules ↓

Mentor and Author: Shubham Gautam

Find us on:

LinkedinMediumFacebookTwitter

Try new look of this course

I. DSA Guidance

1
Why DSA Important?
2
DSA Learning Challenges
3
Develop Algorithmic Thinking
4
DSA Study and Interview Guide
5
Coding Interview Learning Plan
6
DSA Problem Solving Techniques
7
Competitive Coding Guide
8
Steps of DSA Problem Solving
9
Tips for Problem Solving

II. DSA Fundamentals

1
Introduction to Algorithms
2
Introduction to Data Structures
3
Time Complexity Analysis
4
What is Iteration?
5
Analysis of Loop
6
How Recursion Works?
7
Analysis of Recursion
8
Iteration vs. Recursion
9
Divide and Conquer

III. Problem Solving using Loop

1
Buildings Facing Sun
2
Find Leaders in an Array
3
Valid Mountain Array
4
Convert Roman to Integer
5
Find Equilibrium Index
6
Product of Array Except Self
7
Rotate Matrix by 90 Degrees
8
Print Matrix in Spiral Order
9
Find Min and Max in Array

IV. Binary Search

1
Binary Search Algorithm
2
Fixed Point in Sorted Array
3
Max in Incr and Decr Array
4
Find First and Last Positions
5
Min in Sorted and Rotated Array
6
Search in a Sorted Matrix
7
Median of Sorted Arrays
8
Row with Max Ones

V. Sorting Algorithms

1
Why we learn Sorting?
2
Bubble, Selection, Insertion Sort
3
Merge Sort Algorithm
4
Quick Sort Algorithm
5
Lower Bound of Sorting
6
Counting Sort Algorithm
7
Sorting Algorithms Comparison
8
Sort Array of 0s, 1s and 2s
9
Sort Array in Waveform

VI. Two Pointers, Sliding Window

1
Move Zeroes to End
2
Remove Duplicates from Array
3
Container with Most Water
4
Trapping Rainwater
5
Longest Substring of Characters
6
Distinct Elements in Window
7
Max Continuous Series of 1s
8
Max Consecutive 1's
9
N Repeated Element in Array

VII. Hashing and Hash Table

1
Introduction to Hashing
2
Hash Functions in Data Structure
3
Check Arrays are Equal or Not
4
Most Frequent Element in Array
5
Largest Subarray with 0 Sum
6
Longest Consecutive Sequence
7
Check Anagram Strings
8
Sort Characters by Frequency
9
First Missing Positive

VIII. Additional Practice Problems

1
Fizz Buzz Problem
2
Check Pair Sum in Array
3
Triplets with Zero Sum
4
Intersection of Two Arrays
5
Check Arrays are Subset or Not
6
Maximum Difference in Array
7
Maximum Index Difference
8
Majority Element in Array
9
Count Valid Triangle Number

IX. Array and Linked List

1
Array in Data Structure
2
Dynamic Array Data Structure
3
Middle Element in Linked List
4
Reverse Linked List
5
Remove Nth Node from List End
6
Intersection of Sorted Linked Lists
7
Swap List Nodes in Pairs
8
Detect Loop in Linked List
9
Insertion Sort Linked List

X. Stack and Queue

1
Introduction to Stack
2
Application of Stack
3
Sort Stack using Stack
4
Next Greater Element
5
Implement Queue using Stacks
6
Implement Stack using Queues
7
Valid Parentheses Expression
8
Min Stack Problem

XI. Binary Tree

1
Introduction to Binary Tree
2
Recursive Binary Tree Traversal
3
Iterative Binary Tree Traversal
4
Level Order Traversal
5
Height of a Binary Tree
6
Min Depth of a Binary Tree
7
Merge Two Binary Trees
8
Left View of Binary Tree

XII. BST and Heap

1
Introduction to BST
2
Searching in BST
3
Insertion in BST
4
Deletion in BST
5
Inorder Successor in BST
6
Inorder Predecessor in BST
7
What is Heap Data Structure?
8
Kth Smallest Element in Array

XIII. Advanced Data Structures

1
Introduction to AVL Tree
2
Introduction to Trie
3
Binary Indexed Tree
4
Segment Tree Part 1
5
Segment Tree Part 2
6
Implement LRU Cache
7
Implement LFU Cache
8
Implement Bloom Filter
9
Introduction to N-ary Tree
10
Introduction to Suffix Tree

XIV. Dynamic Programming

1
Introduction to DP
2
Top-down vs Bottom-up
3
DP vs Divide and Conquer
4
Types of DP Problems
5
Climbing Stairs Problem
6
Minimum Coin Change
7
Maximum Subarray Sum
8
Longest Common Subsequence
9
Minimum Number of Jumps
10
0-1 Knapsack Problem

XV. Additional Practice Problems

1
Edit Distance Algorithm
2
Count Unique BSTs
3
Sorted Array to Balanced BST
4
Validate binary search tree
5
Min Absolute Difference in BST
6
Kth Largest Element in BST
7
Merge Overlapping Intervals
8
Count Inversions of an Array
9
Flood Fill Algorithm
10
Generate K-combinations

Note: In the coming future, we will publish more concept and problem blogs related to queues, linked lists, heaps, graphs, backtracking, greedy algorithms, bit manipulation, number theory, etc. We are looking forward to your critical feedback and reviews. Enjoy algorithms!

Our Newsletter

Subscribe to get well designed content on data structure and algorithms, machine learning, system design, object orientd programming and math.

Coding Interview

DSA Course
DSA Blogs

Machine Learning

ML Course
ML Blogs

System Design

SD Course
SD Blogs

OOP Concepts

OOP Course
OOP Blogs

©2023 Code Algorithms Pvt. Ltd.

All rights reserved.