Data Structures and Algorithms

Become a " DSA" Specialist. In this learning path, you will learn " Asympotitic Notation, Recursion, Arrays, Sorting, Searching, Hashing, Strings, LinkedList, Stack, Graphs, Trees, Greedy algorithms, Backtracking, Dynamic Programming, Disjoint set and Many More ".

1000+ Students enrolled
Flexible Learning

Learn at your own pace and reach your personal goals on the schedule that works best for you.

Real-world Projects

You’ll master the in-demand technologies by building real-world projects.

Live Mentor Workshops

You’ll have access to free live mentor workshop sessions through out your subscription period.

Verifiable Certificate

Upon successful completion of the Course, You will receive a Verifiable certificate with QR code.

Quiz & Mock Tests

Assess your knowledge with quiz's, mock tests and interviews.

Assured Internship

Upon successful completion of this course you are eligible to grab an internship opportunity.

Data Structures and Algorithms

Become a " DSA" Specialist. In this learning path, you will learn " Asympotitic Notation, Recursion, Arrays, Sorting, Searching, Hashing, Strings, LinkedList, Stack, Graphs, Trees, Greedy algorithms, Backtracking, Dynamic Programming, Disjoint set and Many More ".

Login to Subscribe
Includes:
  • Verifiable certificate
  • Quiz & mock tests
  • Live mentor workshops
  • 2 devices access*
Course Description

Welcome to " Data Structures and Algorithms "

In this course you will be learning “Asympotitic Notation, Recursion, Arrays, Sorting,  Searching, Hashing, Strings, LinkedList, Stack, Graphs, Trees, Greedy algorithms, Backtracking, Dynamic Programming, Disjoint set and Many More ”. We'll take you step-by-step through engaging video tutorials and teach you everything you need to know to succeed in the industry. This course has a tremendous amount of content and resources so that you can learn everything you need to know - whatever is appropriate for your ability level. You will be able to learn at your own pace. You will always be able to come back to the content to review it or learn additional concepts when you are ready for them. You will get great value from this course and, more importantly, you will have a great time learning.

Happy Learning

What you will learn?
  • Asympotitic Notation
  • Recursion
  • Arrays
  • Sorting
  • Searching
  • Hashing
  • Strings
  • LinkedList
  • Stack
  • Queue
  • Tree
  • Binary Search Tree
  • Heaps
  • Graph
  • Greedy algorithms
  • Backtracking
  • Dynamic Programming
  • Disjoint set
  • Trie
Requirements
  • No Prerequisites Required
Course Curriculum
  • Module - 1: Introduction - DSA
    Go Zero-One by learning the much-needed fundamentals of “Introduction to DSA". In this course, you will learn " Intro to DSA, Asympotitic Notation and Many More "
    Section 1: Intro to DSA
    2 Lessons
    • What is an Algorithm? What are Data Structures?
    • Comparing Algorithms and Order of Growth
    • Time Complexity
    • Big-O Rules
    • Analysis of Loops
    • Amortized Time and LogN Times
    • Recursive Runtimes
    • Space Complexity
    • Practice Problems
    • Quiz
    • Quiz Solutions
  • Module - 2: Recursion - DSA
    Go Zero-One by learning the much-needed fundamentals of “Recursion". In this course, you will learn "Introduction to Recursion, Problems on Recursion and Many More "
    Section 1: Introduction to Recursion
    2 Lessons
    • Format of Recursion and its Visualisation
    • Recursion vs Iteration
    • Tower of Hanoi problem
    • Print n to 1 & Print 1 to n
    • Josephus Problem
    • Sum of Digits Problem
    • Checking Palindrome
    • Subsets of a set
    • Quiz
    • Quiz Solutions
  • Module - 3: Arrays - DSA
    Go Zero-One by learning the much-needed fundamentals of “ Arrays ". In this course, you will learn " Operations on Arrays, Problems on Arrays and Many More "
    Section 1: Introduction
    1 Lessons
    • Types of Arrays and Advantages
    • Searching
    • Insertion and Deletion
    • Vectors and its Methods
    • Reversing the Array
    • Left Rotation of the Array by K Places
    • Check if Array is Sorted
    • Leaders in a Array
    • Maximum Difference Problem
    • Frequencies in Sorted Array
    • Maximum subarray sum
    • Maximum consecutive 1s
    • Stock buy and sell problem
    • Trapping rainwater problem
    • Majority Element
    • Quiz
    • Quiz Solutions
  • Module - 4: Sorting - DSA
    Go Zero-One by learning the much-needed fundamentals of “ Sorting ". In this course, you will learn " Introduction, Sorting Algorithms, Problems on Sorting and Many More "
    Section 1: Introduction
    1 Lessons
    • What is sorting? Why is necessary
    • Bubble Sort
    • Selection Sort
    • Insertion Sort
    • Merge Sort
    • Quick Sort
    • Counting Sort
    • Radix Sort
    • Union and Intersection of two Sorted Arrays
    • Chocolate Distribution Problem
    • Merge overlapping Intervals
    • Kth Smallest Element
    • Meeting the Maximum Guests
    • Weight Job Scheduling
    • Quiz
    • Quiz Solutions
  • Module - 5: Searching - DSA
    Go Zero-One by learning the much-needed fundamentals of “Searching". In this course, you will learn " Problems on Binary Search, Problems on Two Pointer, Problems on Searching and Many More "
    Section 1: Problems on Binary Search
    5 Lessons
    • Index of first and last occurrence in Sorted Array
    • count occurences of x in Sorted Element
    • Find an element in Sorted Rotated Array
    • Count 1s in a Binary Sorted Array
    • Find an element in an infinite Sized Sorted Array
    • Find pair in an unsorted Array which gives Sum X
    • Find Triplet in an Array which gives Sum X
    • Median of two Sorted Arrays
    • Quiz
    • Quiz Solutions
  • Module - 6: Hashing - DSA
    Go Zero-One by learning the much-needed fundamentals of “ Hashing ". In this course, you will learn " Introduction to Hashing, Open Addressing, Hashing in C++ STL, Count of the frequency Array Elements, Count of Distinct Elements, Union and Intersection of two unsorted Arrays ".
    Section 1: Introduction
    3 Lessons
    • Introduction to Hashing
    • Open Addressing
    • Hashing in C++ STL
    • Count of the frequency Array Elements
    • Count of Distinct Elements
    • Union and Intersection of two unsorted Arrays
    • Subarray with Zero Sum
    • Longest subarrays with an equal 0s and 1s
    • Quiz
    • Quiz Solutions
  • Module - 7: Strings - DSA
    Go Zero-One by learning the much-needed fundamentals of “ Strings ". In this course, you will learn " Introduction to Strings, Naive Pattern Search Algorithm, Rabin-Karp Algorithm for Pattern Search, KMP Algorithm for Pattern Search, Check given String is Palindrome or Not, Check Anagram and Many More "
    Section 1: Introduction
    4 Lessons
    • Introduction to Strings
    • Naive Pattern Search Algorithm
    • Rabin-Karp Algorithm for Pattern Search
    • KMP Algorithm for Pattern Search
    • Check given String is Palindrome or Not
    • Find the Leftmost Character that Repeats in a String
    • Check Anagram
    • Given two Strings,check if there Rotations are Equal
    • Find Lexicographic Rank of a String
    • Quiz
    • Quiz Solutions
  • Module - 8: LinkedList
    Go Zero-One by learning the much-needed fundamentals of “ LinkedList ". In this course, you will learn " Single LinkedList, Doubly LinkedList, Circular LinkedList, Detecting Loop In A LinkedList, and Many More "
    Section 1: Introduction
    3 Lessons
    • Single Linked List
    • Doubly Linked List
    • Circular Linked List
    • Detecting Loop in a Linked List
    • Removing Loop in a Linked List
    • Middle of Linked List
    • Reverse a Linked List
    • Reverse Even Nodes in a Linked List
    • Copy Linked List with Arbitrary Pointer
    • Merge K Sorted Linked List
    • Quiz
    • Quiz Solutions
  • Module - 9: Stacks - DSA
    Go Zero-One by learning the much-needed fundamentals of “ Stacks ". In this course, you will learn " Basics of Stacks, Infix to Postfix, Evaluate Prefix Expression, Evaluate Postfix Expression, Two stacks in an Array, Next Greater Element, Celebrity problem using Stack and Many More "
    Section 1: Introduction to Stack
    1 Lessons
    • Basics of Stacks
    • Infix to Postfix
    • Evaluate Prefix Expression
    • Evaluate Postfix Expression
    • Two Stacks in an Array
    • Next Greater Element
    • Celebrity Problem using Stack
    • Quiz
    • Quiz Solutions
  • Module - 10: Queues - DSA
    Go Zero-One by learning the much-needed fundamentals of “Queues". In this course, you will learn " Queue Data Structure, Types of Queues, Deque Data Structure, Reversing a Queue and Many More "
    Section 1: Introduction to Queue
    2 Lessons
    • Queue Data Structure
    • Types of Queues
    • Deque Data Structure
    • Maximums of All Subarrays of Size K
    • Reversing a Queue
    • Implement Queue using Stacks
    • Implement Stack using Queue
    • First Circular Tour
    • Find the First Non-repeating Character in Stream
    • Quiz
    • Quiz Solutions
  • Module - 11: Trees - DSA
    Go Zero-One by learning the much-needed fundamentals of “ Trees ". In this course, you will learn " What is Tree?, Tree Terminologies, Binary Tree Traversal, Binary Tree Operations, AVL Tree, Height of Binary Tree, Iterative Inorder Traversal and Many More "
    Section 1: Introduction to Trees
    5 Lessons
    • What is Tree?
    • Tree Terminologies
    • Binary Tree Traversal
    • Binary Tree Operations
    • AVL Tree
    • Height of Binary Tree
    • Maximum in Binary Tree
    • Check for Balanced Binary Tree
    • Print Left View of Binary Tree
    • Print Vertical Sum of Binary Tree
    • Print Nodes at K distance
    • LCA Problem
    • Burn a Binary Tree from a Leaf
    • Maximum Width of Binary Tree
    • Check Children Sum Property
    • Iterative Inorder Traversal
    • Quiz
    • Quiz Solutions
  • Module - 12: Binary Search Tree - DSA
    Go Zero-One by learning the much-needed fundamentals of “ Binary Search Tree ". In this course, you will learn " Understanding BST and Search In BST, Operations on BST, Check for BST, Find the Kth smallest in BST and Many More "
    Section 1: Binary Search Tree
    2 Lessons
    • Understanding BST and Search In BST
    • Operations on BST
    • Check for BST
    • Find the Kth smallest in BST
    • The ceiling of a key in BST
    • LCA of two nodes in BST
  • Module - 13: Heaps - DSA
    Go Zero-One by learning the much-needed fundamentals of “Heaps". In this course, you will learn " Introduction to Heaps and Heapify, Operations on Heaps, Build Heap, Heap Sort, Kth Largest Element in Stream and Many More "
    Section 1: Heaps
    5 Lessons
    • Introduction to Heaps and Heapify
    • Operations on Heaps
    • Build Heap
    • Heap Sort
    • Priority queue in C++ STL
    • Kth Largest Element in Stream
    • Minimum Cost of Ropes
    • Sort a Nearly Sorted Array
    • Rearrange Characters
    • Quiz Solutions
  • Module - 14: Graphs - DSA
    Go Zero-One by learning the much-needed fundamentals of “ Graphs ". In this course, you will learn " Introduction to Graphs, Breadth-First Traversal of Graph(BFS), Depth First Traversal of Graph(DFS), Dijkstra's Algorithm for Shortest Path, Topological Sort, Bridges in a Graph and Many More "
    Section 1: Graphs
    6 Lessons
    • Introduction to Graphs
    • Breadth First Traversal of Graph (BFS)
    • Depth First Traversal of Graph (DFS)
    • Dijkstra's Algorithm for Shortest Path
    • Bellman Ford Algorithm for Shortest Path
    • Prim's Minimum Spanning Tree
    • Number of Connected Components in Undirected Graph
    • Detect Cycle in Undirected Graph
    • Detect Cycle in Directed graph
    • Find Number of Islands
    • Topological Sort
    • Rotten Oranges
    • Articulation Points in a Graph
    • Bridges in a Graph
    • Shortest Path in a DAG
    • Quiz
    • Quiz Solutions
  • Module - 15: Greedy Algorithms - DSA
    Go Zero-One by learning the much-needed fundamentals of “ Greedy Algorithms ". In this course, you will learn " Intro to Greedy Algorithms, Job Sequencing Problem, Fractional Knapsack Problem, Huffman Coding ".
    Section 1: Greedy Algorithms
    6 Lessons
    • Intro to Greedy Algorithms
    • Job Sequencing Problem
    • Fractional Knapsack Problem
    • Huffman Coding
    • Quiz
    • Quiz Solutions
  • Module - 16: Backtracking - DSA
    Go Zero-One by learning the much-needed fundamentals of “ Backtracking ". In this course, you will learn " Concept of Backtracking, Rat in a Maze, and N queen Problem "
    Section 1: Introduction
    5 Lessons
    • Concept of Backtracking
    • Rat in a Maze
    • N queen Problem
    • Quiz
    • Quiz Solutions
  • Module - 17: Dynamic Programming - DSA
    Go Zero-One by learning the much-needed fundamentals of “ Dynamic Programming ". In this course, you will learn "Introduction to Dynamic Programming, Properties of Dynamic Programming Problem, Overlapping Subproblems Problem, Binary Coefficients, 0-1 Knapsack and Many More "
    Section 1: Introduction
    4 Lessons
    • Introduction to Dynamic Programming
    • Properties of Dynamic Programming Problem
    • Overlapping Subproblems Problem
    • Optimal SubStructure Property
    • Solving a DP Problem
    • Binary Coefficients
    • Minimum Jumps to Reach End
    • Longest Increasing Subsequence
    • Optimal Strategy for a Game
    • Subset Sum Problem
    • Quiz
    • Quiz Solutions
  • Module - 18: Disjoint Set - DSA
    Go Zero-One by learning the much-needed fundamentals of “ Disjoint Set ". In this course, you will learn " Disjoint Set Data Structure, Union by Rank and Path Compression, Kruskal's Algorithm ".
    Section 1: Disjoint Set
    5 Lessons
    • Disjoint Set Data Structure
    • Union by Rank and Path Compression
    • Kruskal's Algorithm
    • Quiz
    • Quiz Solutions
  • Module - 19: Trie - DSA
    Go Zero-One by learning the much-needed fundamentals of “ Trie ". In this course, you will learn " Insertion and search in Trie, Deletion in Trie, Implementing auto-complete feature using Trie ".
    Section 1: Introduction
    3 Lessons
    • Insertion and Search in Trie
    • Deletion in Trie
    • Implementing autocomplete feature using Trie
  • Certificate
    Once you've successfully completed the course, You will receive the certificate

Get Certified! Get Recognized…

Upon successful completion of the Course, You will receive a Verifiable certificate with QR code. Now employers can verify the certificates just by scanning QR code or by verification ID.

Differentiate yourself

The knowledge and skills you've gained working on projects, simulations, case studies will set you ahead of competition.

Share your achievement

Talk about it on Linkedin, Twitter, Facebook, boost your resume or frame it - tell your friends about it.

Learn

Learn in-demand technology skills through immersive content.

Practice

Practice the tech skills and build real-world projects for your portfolio.

Apply

Apply your knowledge in hackathons to grab internships and placements.

Assess

Assess your knowledge with quiz's, mock tests and interviews.

What our students say about SkillLauncher

Happy Students & Feedbacks

Ajeet Deshpande

Student

Great learning platform for all type of learners, New trending courses with new teaching methods, really good work. Thanks SkillLauncher!

Pravin Pratap Basu

Student

Support on the courses is very good. Apart from that course materials are also good . Teaching faculties are also extremly supportive.

Basanti Mahal

Student

The courses are very good and well structured. SkillLauncher even covered more advanced topics which was not in agenda or course content.

Anil Prasad

Student

These guys rock with amount of patience, knowledge and love how to explain things and cannot thank enough for the extreme support and mentoring.

Rama Krishna

Student

Content of courses is amazing. No other online platform has as many courses with dedicated teaching assistance. It has some free tutorials with time access.

Pirzada Gagrani

Student

I was searching for a platform to learn AI/ML course and I came across this SkillLauncher. Their support was awesome from the day of enrollment.

Sign in with Google