Watch Course Preview
Course Preview

Free DSA Course With Certificate | Data Structures & Algorithms Free Course

83 Videos

Self-paced Course

54 Labs

Hands-on Labs

Data Structure & Algorithms Free Course Overview

Welcome to the Data Structure & Algorithms for Beginners course! This comprehensive and free course is your gateway to the exciting world of Data Structure & Algorithms. Whether you're an absolute beginner with no prior coding experience or you're looking to expand your programming knowledge, this course is designed to get you started on the right track.

Course Features:

  1. No Cost: This course is absolutely free, making it accessible to anyone interested in learning Data Structure & Algorithms.

  2. Self-Paced Learning: Learn at your own pace. There are no deadlines or schedules to worry about, allowing you to balance your learning with your other commitments.

  3. Beginner-Friendly: Designed with beginners in mind, the course starts from the basics and gradually progresses to more advanced topics.

  4. Hands-On Experience: Gain practical experience through coding exercises and projects that reinforce what you've learned.

  5. Video Lectures: Engage with video lectures that break down complex concepts into easy-to-understand explanations.

  6. Skill Tests: Test your knowledge and track your progress through skill tests for each section.

  7. Access to Resources: Find additional resources, reference materials, and links to useful tools to support your learning journey.

Included in this Course

  •   Video Course 83 Videos
  •   Labs 54 labs

DSA and Big O

Data Structure Introduction Preview 04m 32s
Non-Linear Data Structure 09m 25s
Asymptotic analysis 14m 31s
Asymptotic Explanation 20m 23s

Array

Array Introduction 09m 58s
Array Traversal 10m 46s
Array insert data 06m 21s
Array Bound Checking 16m 52s
Array Insertion 12m 35s
Deletion in Array 07m 38s
2D array 13m 47s
Array List Integer 20m 47s

Array Questions

Array List String 18m 17s
Storing Heterogeneous Element in array 13m 20s
Array Question1 41m 40s
Array Question2 18m 48s
Sum Leet code 19m 24s
buy and sell Stock leetcode 10m 34s
Product of Array Except Self 16m 56s
Container With Most Water 19m 45s
Spiral Matrix 30m 10s
Sudoku valid 29m 36s

String

String Preview 01m 00s
String literals 09m 15s
Immutable String 05m 33s
String Methods 21m 33s
StringBuilder vs String Buffer 04m 42s
String Builder and Buffer example 11m 29s
Valid Palindrome 08m 05s
Valid Anagram 15m 23s
Longest Substring Without Repeating Characters 17m 22s
Find All Anagrams in a String 31m 07s
Largest Number 19m 26s
Largest Number 1 09m 06s

Linear Search

Linear search1 Preview 01m 42s
Linear Search Implementation 08m 04s
Linear Search Questions 25m 56s

Binary Search

Binary Search 01m 34s
Binary Search implementation 12m 19s
First and Last Occurence 23m 33s

Arrays Searching

Search in Rotated Sorted array 19m 31s
Search in rotated Sorted Array 10m 39s
Find Minimum in Rotated Sorted Array 04m 59s

Bubble, Selection and Insertion Sort

Bubble Sort 01m 28s
Bubble Sort Implementation 07m 33s
Selection Sort 02m 05s
Selection Sort Implementation 07m 15s
Insertion Sort 01m 06s
Insertion Sort implementation 10m 18s

Merge, Quick and Counting Sort

Merge Sort 09m 58s
Merge Sort Implementation 20m 22s
Quick Sort 08m 51s
Quick Sort Implementation 08m 51s
Counting Sort 02m 46s
Counting Sort Implementation 17m 57s

Bucket, Find Kth Element and Find Pages

Bucket Sot 01m 03s
Bucket Sort Implementation 15m 47s
FindKthElement 19m 26s
Kth largest element 22m 27s
Find Pages 09m 33s
Find Pages PART 2 20m 01s
Theif problem 13m 19s
Minimum swaps 15m 06s

Stack

Stack 03m 38s
Stack Implementation by library 14m 58s
Stack Implementation using Array 23m 16s
Stack Implementation using LinkedList 22m 09s
Valid Parentheses 16m 36s
Simplify Path 1 12m 27s
Simplify path 2 09m 27s
Evaluate Reverse Polish Notation 25m 12s
Trapping Rainwater 24m 04s
Longest valid Parentheses 24m 13s
Basic Calculator 26m 05s

Queue

Introduction to Queue Preview 04m 49s
Queue Implementation 13m 16s
Queue Implementation user defined function 28m 12s
Implement Stack using Queues 25m 32s
Implement Queue using Stack 21m 23s
First Unique Character in a String 26m 01s
First Unique Character in a String 26m 01s
Reveal Cards in Increasing Order 19m 32s
Find the Winner of the Circular Game 17m 23s
Hands-On Labs Labs(54)

Java: Count the frequency of an element in an Array

00:20:00

Java: Ceiling in a Sorted Array

00:25:00

Java: Two Sum

00:30:00

Java: Reverse a Stack using Recursion

00:25:00

Java: Find next right node of a given key

00:30:00

Java: Big-O-Binary Search Algorithm

00:15:00

Java: Traversing directory in Java using BFS

00:20:00

Java: Delete consecutive same words in a sequence

00:25:00

Java: Merge Sorted Arrays

00:25:00

Java: Count 1’s in a Sorted Binary Array

00:20:00

Java: Find all triplets with zero sum

00:20:00

Java: Leaders in an array

00:20:00

Java: Find a Fixed Point (Value equal to Index) in given Array

00:25:00

Java: Search Insert Position

00:25:00

Java: Sort a Stack using another stack

00:30:00

Java: Minimum time required to rot all oranges

00:40:00

Java: Next Greater Element

00:30:00

Java: First Bad Version

00:30:00

Java: Search an Element in a Sorted and Rotated Array

00:30:00

Java: Meeting Rooms

00:25:00

Java: Merge Two Sorted Arrays

00:20:00

Java: Two Elements whose Sum is Closest to Zero

00:30:00

Java: Find Peak Element

00:30:00

Java: Trapping rain water

00:30:00

Java: Largest rectangle in histogram

00:25:00

Java: Search in Rotated Sorted Array

00:25:00

Java: Search in an Almost Sorted Array

00:25:00

Java: Minimum Number of Jumps to Reach End in Array

00:25:00

Java: Move all Zeros to the beginning of an array

00:25:00

Java: Median of Two Sorted Arrays of Different Sizes

00:30:00

Java: 3 Sum

00:25:00

Java: Search a 2D Matrix

00:20:00

Java: A Pair with a Given Sum in the Rotated Sorted Array

00:25:00

Java: Remove Duplicates from an Array

00:20:00

Java: Rotate a Matrix by 90 degrees

00:25:00

Java: Sort Elements by Frequency

00:30:00

Java: Find Minimum in Rotated Sorted Array

00:25:00

Java: Find Minimum in Rotated Sorted Array II

00:35:00

Java: Sort a Linked List of 0s, 1s and 2s

00:35:00

Java: Rotate an Array to the left

00:20:00

Java: Camel Case of a given Sentence

00:20:00

Java: Find Missing Elements of a Range

00:25:00

Java: Sort a Nearly Sorted (or K sorted) Array

00:20:00

Java: Count ways to increase LCS length of two Strings by one

00:25:00

Java: Minimum rotations required to get the same string

00:15:00

Java: Chocolate Distribution Problem

00:30:00

Java: Minimum Swaps required to convert binary tree to binary search tree

00:30:00

Java: Multiply Large Numbers represented as Strings

00:25:00

Java: Find Itinerary from a given list of tickets

00:25:00

Java: Count Distinct Occurrences as a Subsequence

00:30:00

Java: Sort a Matrix in all way Increasing Order

00:20:00

Java: Find the length of the largest subarray with 0 Sum

00:25:00

Java: Longest Increasing Consecutive Subsequence

00:25:00

Java: Find Whether an Array is a Subset of Another Array

00:20:00

Our Students Reviews

Frequently Asked Questions

Q1. Can I Attend a Demo Session before Enrolment?

Yes, you can Attend a Demo Session before Enrolment in angular certification course. It gives you the opportunity to assess whether the training program aligns with your learning objectives. So, don't hesitate! Take advantage of this opportunity and attend a demo session before making your decision.

Q2. Can I request for a support session if I need to better understand the topics?

Yes, of course you can request for a support session if you need to better understand the topics. For that, you need to be in touch with the counsellor. Contact on +91- 999 9123 502 or you can mail us at hello@scholarhat.com

Q3. Do you offer certificate of completion?

Yes. The certificate is valid and can be used for interviews. Additionally, the student can register for the .Net Certification exam after completion of this course.

Q4. Who are your mentors?

All our mentors are highly qualified and experience professionals. All have at least 8-10 yrs of development experience in various technologies and are trained by Dot Net Tricks to deliver interactive training to the participants.

Q5. What If I miss my online training class?

All online training classes are recorded. You will get the recorded sessions so that you can watch the online classes when you want. Also, you can join other class to do your missing classes.

Q6. Can I share my course with someone else?

In short, no. Check our licensing that you agree to by using Dot Net Tricks LMS. We track this stuff, any abuse of copyright is taken seriously. Thanks for your understanding on this one.

Q7. Do you provide any course material or live session videos?

Yes we do. You will get access to the entire content including class videos, mockups, and assignments through LMS.

Q8. Do you provide training on latest technology version?

Yes we do. As the technology upgrades we do update our content and provide your training on latest version of that technology.

Q9. Do you prepare me for the job interview?

Yes, we do. We will discuss all possible technical interview questions and answers during the training program so that you can prepare yourself for interview.

Q10. Will I get placement assistance after receiving my course completion certificate?

Yes, you’ll get placement assistance after receiving your course completion certificate. The placement assistance provided by the US will guide you through the job search process, help you polish your resume, and connect you with potential employers. For that, you need to be in touch with the counsellor. Contact on +91- 999 9123 502 or you can mail us at hello@scholarhat.com

This course includes
100.00 % OFF
₹ 1,180 Free

Get 30+ premium courses bundle with our self-paced training membership
Still have some questions? Let's discuss.
CONTACT US
Accept cookies & close this