Navigate Select ESC Close

Data Structures and Algorithms (DSA) in Java 2024

2024-10-07 Science & Technology
594.9k
11.2k
207
Telusko
Telusko
2.8m subscribers

Unlock all features

FREE: Get instant access to 10 AI summaries, chats, or transcripts per day.

Description

Learn DSA in 5 hours. Check out our courses: Industry-Ready Java Spring Boot, React & Gen AI -Live: https://go.telusko.com/industry-ready-course Coupon: TELUSKO10 (10% Discount) AI-Powered DevOps with AWS- Live V3: https://go.telusko.com/ai-powered-devops-with-AWS-v3 Coupon: TELUSKO10 (10% Discount) Master Java Spring Development : https://go.telusko.com/masterjava Coupon: TELUSKO20 (20% Discount) For More Queries WhatsApp or Call on : +919008963671 website : https://courses.telusko.com/ Java Spring:- https://go.telusko.com/Udemyjavaspring Java:- https://go.telusko.com/udemyteluskojava Spring: https://go.telusko.com/udemyteluskospring Java For Programmers:- https://go.telusko.com/javaProgrammers Python : https://go.telusko.com/udemyteluskopython Git : https://go.telusko.com/udemyteluskogit Docker : https://go.telusko.com/udemyteluskodocker Instagram : https://www.instagram.com/navinreddyofficial/ Linkedin : https://in.linkedin.com/in/navinreddy20 WhatsApp : https://go.telusko.com/whatsapp TELUSKO Android App : https://go.telusko.com/TELUSKOAPP TELUSKO IOS App : https://apple.co/3SsgmU2 Discord : https://discord.gg/D8hWe9BqfF 00:00:00 What are Data Structures 00:07:04 Abstract Data Types 00:14:12 Arrays 00:22:02 What is time complexity 00:43:10 Linear and Binary Search Example 01:02:35 Bubble Sort Theory 01:10:22 Bubble sort Code in Java 01:18:31 Selection Sort Theory 01:25:26 Selection sort Code 01:32:35 Insertion sort 01:40:02 Insertion Sort Code 01:52:55 Quick sort theory 02:14:13 Quick Sort Code 02:21:19 Divide and Conquer 02:25:07 Tree intro 02:26:52 Recursion 02:36:14 Merge Sort theory 02:52:05 Merge Sort Code in java 03:03:48 LinkedList Theory 03:18:55 LinkedList Code for Adding values 03:34:25 LinkedList AddFirst and Delete Code part 2 03:43:18 Stack theory 03:48:48 Stack Code Push 03:57:34 Stack Code pop peek 04:01:13 Queue Theory 04:12:28 Queue Code Enqueue and Dequeue 04:20:52 Circular Queue Code 04:27:47 Tree Data Structure 04:34:28 Binary Search Tree Theory 04:37:15 Tree Implementation 04:54:11 Thank you for watching

Top Comments (10)

@kipngetichabsalom9100 2024-10-07

Perfectly Explained. Also do for LLms

92
@jacksparrowc7311 2025-02-22

Man, if you are working at a company please quit and make more Aliens like you by teaching.. When you teach, i get everything like its nothing !! 😍.. Thanks brother!

37
@Anonymous.__00.2 2024-10-07

Hi telusko Iam a big fan of Your subject and Java Learning 🎀

34
@maheaa_07 2025-09-23

pls make one for advance dsa as well

30
@biswadeepchakraborty3546 2024-10-09

Nice tutorial sir, could you please upload some more advance dsa concepts and some binary search variations.

28
@vyshnavidevarayakotapothul5953 2025-08-17

21:13 public class EvenNumbers { public static void main(String[] args) { for (int i = 2; i <= 10; i += 2) { System.out.println(i); } } } option 1 is time efficient as it has 5 iterations and no condition checks

18
@omeysalvi 2024-10-07

This is exactly what I needed. Cant wait to digest the entire episode

18
@ayushmaansharma3446 2025-07-21

Hello, just wanted to mention that your final push method in stack will give index outofbond exception (Incase of overflow) as you're checking the top first and then incrementing it, so i recommend to change the condition to if(top < size - 1)

12
@Rtharani77 2026-01-04

Sir, you know exactly what we need for short-term preparation. Hats off to you for that

8
@Kummarishireesha-b5e 2026-03-04

if you are visiting the channel for the first time , still u are not late you found the BEST channel

3

Unlock the Data Inside
Turn Videos into Knowledge

  • Get FREE 10/day: transcripts, summaries, chats
  • Chat with videos, export text & PDF
  • $1 free API credit for RAG, chatbots & research

Free forever plan • All features unlocked

App screenshot