Data Structures & Algorithms Tutorial with Coding Interview Questions

About the Course (DSA level-1):

This course offers comprehensive coverage of coding questions that serve as a solid foundation for understanding DSA concepts. These questions are frequently asked in coding interviews, either directly or with some variations, by many companies, including Adobe, Facebook (Meta), Paytm, Amazon, Google, and others.

Questions difficulties are of level-1 in this course.We will raise the bar  in 'DSA level-2' course. In the last course of this series 'DSA level-3', we will attempt very difficult level of questions. So, be patient and complete the level-1 course content even if you found questions are not that tough. They will help to clear the basics and building mind for more adventure.  

Our primary objective is to enhance your problem-solving skills and enable you to devise optimal solutions. The course 'DSA level-1' includes a wide range of topics, such as Arrays, Strings, Searching and Sorting, Greedy Algorithms, Trees, Graphs, Dynamic Programming, and more.

Upon completion, you will possess the necessary skills to ace DSA interviews for typical companies or excel in the initial rounds of product-based companies such as Google, Microsoft and similar others.


Our course is organised into chapters that follow a consistent structure. Initially, we introduce the fundamental concepts of each topic, followed by coding questions in subsequent chapters. This comprehensive course comprises various DSA sheets available on internet , Company wise interview Questions, online resources, and other essential elements from the perspective of Code Katha writers.
For each question, we start with a basic solution and then analyse its time complexity. We then explore optimisation techniques and design an algorithm before coding the solution. 

Our ultimate goal is to develop your problem-solving abilities and thought process.We will also provide the videos for the course and they will be uploaded for all the chapters in Hindi and English.
After completion of DSA level-1, we can proceeds for DSA level-2 Course for more adventure.

Index of Chapters

Any topics and concepts not included as headings in this list below are addressed in between the chapters. 
Once course completed by covering all topics listed below then, Video lectures will upload for the same with detail explanation in English and Hindi Languages.

Bit Manipulation 

1. Bit Manipulation and Bit Masking Concepts | 

2. Count set bits in an integer | 

3. Find the two non-repeating elements in an array of repeating elements 

4. Program to find whether a no is power of two

5. Find position of the only set bit


1. Basics of String |  Upcoming

2. Valid Palindrome

3. Valid Anagram

4. Valid parentheses (Stacks)

5. Remove Consecutive Characters

6. Longest Common Prefix

7. Convert a Sentence into its Equivalent Mobile Numeric Keypad Sequence

8. Print all the Duplicates in the Input String


1. Basics of Array

2. Maximum and Minimum Element in an Array

3. Reverse the Array

4. Maximum-Subarray (Kadane's Algorithm)

5. Contains Duplicate

6. Chocolate Distribution Problem

7. Search in Rotated Sorted Array

Searching and Shorting

1. Searching Algorithms

2. Shorting Algorithms

3. Permute Two Arrays such that Sum of Every Pair is Greater or Equal to K

4. counting sort

5. find common elements three sorted arrays

6. Searching in an array where adjacent differ by at most k

7. ceiling in a sorted array

8. Piar with given difference

Linked List

1. Basics of Link List

2. Reverse Linked List

3. Linked List Cycle

4. Merge Two Sorted Lists

5. Delete without Head node

6. Remove duplicates from an unsorted linked list

7. Sort a linked list of 0s-1s-or-2s

8. Multiply two numbers represented linked lists

Stack and Queue

1. Basics of Stack

2. Basics of Queue

3. Implement two stacks in an Array

4. Evaluation of Postfix Expression

5. Implement Stack using Queues

6. Queue Reversal

7. Implement Stack Queue using Deque

8. Reverse first k elements of queue

Greedy algorithm approach

1. Basics of greedy algorithm approach

2. Activity selection problem greedy algo

3. Greedy algorithm to find minimum number of coins

4. Minimum sum two numbers formed digits array-2

5. Minimum sum absolute difference pairs two arrays

6. Find maximum height pyramid from the given array of objects

7. Minimum cost for acquiring all coins with k extra coins allowed with every coin

8. Find maximum equal sum of every three stacks

Binary Trees

1. Basics of Binary Trees

2. Maximum Depth of Binary Tree

3. Reverse Level Order Traversal

4. Subtree of Another Tree

5. Invert Binary Tree

6. Binary Tree Level Order Traversal

7. Left View of Binary Tree

8. Right View of Binary Tree

9. ZigZag Tree Traversal

10. Create a mirror tree from the given binary tree

11. Leaf at same level

12. Check for Balanced Tree

13. Transform to Sum Tree

14. Check if Tree is Isomorphic

15. Same Tree


1. Basics of graphs

2. BFS

3. DFS

4. Flood Fill Algorithm

5. Number of Triangles

Recursion and Dynamic programming

1. Basics of recursion and dynamic programming

2. Knapsack with Duplicate Items

3. BBT counter

4. Reach a given score

5. Maximum difference of zeros and ones in binary string

6. Climbing Stairs

7. Permutation Coefficient

8. Longest Repeating Subsequence

9. Pairs with specific difference

10. Longest subsequence-1

Start the Course

Hope this blog tutorial has been helpful to you. If you have any remaining doubts or suggestions, please feel free to share them in the comments below. We would be glad to receive your feedback.

💛 You can Click Here to connect with us. We will give our best for you.


Popular Posts on Code Katha

Java Interview Questions for 10 Years Experience

Visual Studio Code setup for Java and Spring with GitHub Copilot

Spring Boot Interview Questions for 10 Years Experience

Spring Data JPA

Elasticsearch Java Spring Boot

Count set bits in an integer

Spring Boot Kafka Tutorial

Sql Interview Questions for 10 Years Experience