technifyed

CodeHelp - by Babbar via YouTube Video playlist

Java DSA Series

Videos in this playlist 80

  1. DSA Complete Series 🚀 : Data Structures & Algorithms || 150 day Challenge
  2. Lecture 1: Flowchart & Pseudocode + Basics || DSA Series by Babbar || Java
  3. Lecture 2: How a Java Program Run || DSA Series by Babbar
  4. Lecture 3: IDE Setup for Coding || DSA Series by Babbar || Java
  5. Lecture 4: Write your FIRST Java Program || DSA Series by Babbar
  6. Lecture 5: VARIABLES in Java || DSA Series by Babbar
  7. Lecture 6: DataTypes in Java || DSA Series by Babbar
  8. Lecture 7: Operators in Java || DSA Series by Babbar
  9. Lecture 8: Input/Output in Java || DSA Series by Babbar
  10. Lecture 9: Conditionals in Java || DSA Series by Babbar
  11. Lecture 10: Loops in Java || DSA Series by Babbar
  12. Lecture 11: Solve any PATTERN Printing Problem using this TRICK || DSA Series by Babbar
  13. Lecture 12: Methods in Java || DSA Series by Babbar
  14. Lecture 13: Arrays in Java || DSA Series by Babbar
  15. Lecture 14: Strings in Java || DSA Series by Babbar
  16. Lecture 15: Basic Maths needed for DSA || DSA Series by Babbar
  17. Lecture 16: Intro to OOPs Concepts || DSA Series by Babbar
  18. Lecture 17: Classes, Objects, Constructors, Object Lifecycle in JAVA || DSA Series by Babbar
  19. Lecture 18: Encapsulation in JAVA || DSA Series by Babbar
  20. Lecture 19: Inheritance in Java || DSA Series by Babbar
  21. Lecture 20: Polymorphism in Java || DSA Series by Babbar
  22. Lecture 21: Abstraction in Java || DSA Series by Babbar
  23. Lecture 22: Time & Space Complexity || DSA Series by Babbar
  24. Lecture 23: Java Collection Framework ( Part-1 ) || DSA Series by Babbar
  25. Lecture 24: Java Collection Framework ( Part-2 ) || DSA Series by Babbar
  26. Lecture 25: Java Collection Framework ( Part-3 ) || DSA Series by Babbar
  27. Lecture 26: Bitwise Operators in Java || DSA Series by Babbar
  28. Lecture 27: Array Problem Solving Part-1 || DSA Series by Babbar
  29. Lecture 28: Array Manipulation Problems || DSA Series by Babbar
  30. Lecture 29: Array Problem Solving Part-3 || DSA Series by Babbar
  31. Lecture 30: Array Problem Solving Part-4 || DSA Series by Babbar
  32. Lecture 31: Missing Elements from an Array of Duplicates || Array Problem || DSA Series by Babbar
  33. Lecture 32: Maximum Sum Contiguous SubArray || Kadane's Algorithm || DSA Series by Babbar
  34. Lecture 33: Solving 2D Array Problems || DSA Series by Babbar
  35. Lecture 34: Rotate and Spiral Print a Matrix || DSA Series by Babbar
  36. Lecture 35: Sorting Algorithms || DSA Series by Babbar
  37. Lecture 36: Binary Search in 1 Video || DSA Series by Babbar
  38. Lecture 37: Upper/Lower Bound, Number of Occurrences Binary Search || DSA Series by Babbar
  39. Lecture 38: Find PEAK of MOUNTAIN Array || DSA Series by Babbar
  40. Lecture 39: Search in a Rotated Sorted Array || DSA Series by Babbar
  41. Lecture 40: Binary Search on Answers PATTERN || DSA Series by Babbar
  42. Lecture 41: Book Allocation Problem || Min-Max Binary Search Pattern || DSA Series by Babbar
  43. Lecture 42: Painter's Partition Problem || DSA Series by Babbar
  44. Lecture 43: Aggressive Cows Problem || DSA Series by Babbar
  45. Lecture 44: EKO SPOJ Problem || Binary Search || DSA Series by Babbar
  46. Lecture 45: ROTI PRATA SPOJ Problem || DSA Series by Babbar
  47. Lecture 46: Search in Nearly Sorted Array || Binary Search || DSA Series by Babbar
  48. Lecture 47: Find Single Non-Duplicate element using Binary Search || DSA Series by Babbar
  49. Lecture 48: Search in 2D Matrix I and II (Binary Search) || DSA Series by Babbar
  50. Lecture 49: Row with Maximum 1's || Binary Search || DSA Series by Babbar
  51. Lecture 50: Unbounded Search using Binary Search Concept || DSA Series by Babbar
  52. Lecture 51: Reverse Words in a Strings || DSA Series by Babbar
  53. Lecture 52: String Interview Questions Part-2 || DSA Series by Babbar
  54. Lecture 53: String Interview Problems Part-3 || DSA Series by Babbar
  55. Lecture 54: Recursion Basics || Recursion Series Day-1 || DSA Series by Babbar
  56. Lecture 55: Recursive Time & Space Complexity || Recursion Series Day-2 || DSA Series by Babbar
  57. Lecture 56: Climbing Stairs problem || Recursion Series Day-3
  58. Lecture 57: Recursion Basics || Recursion Day-4
  59. Lecture 58: Recursive BINARY SEARCH || Recursion Day-5
  60. Lecture 59: Subsequences of String || Recursion Series Day-6
  61. Lecture 60: House Robber Problem || Recursion Series Day-7
  62. Lecture 61: Coin Change 2 Problem || Recursion Series Day-8
  63. Lecture 62: COin Change I Problem || Recursion Series Day-9
  64. Lecture 64: Minimize the Difference Between Target and Chosen Elements || Recursion Series Day-11
  65. Lecture 63: Partition Equal Subset Sum Problem || Recursion Series Day-10
  66. Lecture 65: Jump Game Problem || Recursion Series Day-12
  67. Lecture 66: Leetcode Triangle Problem || Recursive Series Day-13
  68. Lecture 67: Subsequences with Sum K || Recursion Series Day-14
  69. Lecture 68: Subsets 1 & Subsets II Problem || Recursion Series Day-15
  70. Lecture 69: Combination Sum (All 3 *variants*) || Recursion Series Day-16
  71. Lecture 70: Permutations of String || Recursion Series Day-17
  72. Lecture 71: Intro to Backtracking || Recursion Series Day-18
  73. Lecture 72: Phone Keypad Problem || Recursion Series Day-19
  74. Lecture 73: N-Queen Problem || Recursion Series Day-20
  75. Lecture 74: Sudoku Solver Problem || Recursion Series Day-21
  76. Lecture 75: Merge Sort in 1 Video || Recursion Series Day-22
  77. Lecture 76: Inversion Count in an Array || Recursion Day-23
  78. Lecture 77: Quick Sort in 1 Video || Recursion Day - 24
  79. Lecture 78: Starting Linked List Series || Day - 1
  80. Lecture 79: All about Doubly Linked List || Linked List Series Day - 2

Advantages and disadvantages

Advantages

  • Free and complete: every lecture is in the playlist, in order.
  • Watch at 1.5x, skip what you know, rewatch what you don't.
  • Taught in Hindi (or Hinglish), which many students find easier to follow.
  • Made for Indian students, with placement and exam context.
  • 720,737 views, so help and notes are easy to find.
  • Completely free.
  • Self-paced: start any time.
  • A clear syllabus (80 videos) you can see before you start.

Disadvantages

  • No certificate, deadlines or graded work.
  • Quality and depth vary: check that the playlist is finished before you start.
  • Less depth than a university course on some topics.
  • No certificate.
  • A big commitment: about 104 videos, 64 hours in all.
  • No graded assignments or feedback.

Some points apply to every course of this kind; see how we rank.

Free

  • Free: Watch on YouTube, no account needed.
  • Certificate: None. Code or take notes along to make it stick.

CodeHelp - by Babbar is in Tier 3: good universities, respected companies, nonprofits and well-known teachers of our institution ranking (72/100).

Similar courses

Compare these

Massachusetts Institute of Technology · YouTube

MIT 6.006 Introduction to Algorithms, Fall 2011

This course provides an introduction to mathematical modeling of computational problems. It covers the common algorithms, algorithmic paradigms, and data structures used to solve these problems. The course emphasizes the relationship between algorithms and programming, and introduces basic performa…

Free video47 videos, 42 hours

Massachusetts Institute of Technology · YouTube

MIT 6.006 Introduction to Algorithms, Spring 2020

Instructor: Prof. Erik Demaine, Dr. Jason Ku, Prof. Justin Solomon View the complete course: https://ocw.mit.edu/6-006S20 YouTube Playlist: https://www.youtube.com/playlist?list=PLUl4u3cNGP63EdVPNLG3ToM6LaEUuStEY This course is an introduction to mathematical modeling of computational problems, as…

Free video32 videos, 35 hours

Massachusetts Institute of Technology · YouTube

MIT 6.046J / 18.410J Introduction to Algorithms (SMA 5503),

This course teaches techniques for the design and analysis of efficient algorithms, emphasizing methods useful in practice. Topics covered include: sorting; search trees, heaps, and hashing; divide-and-conquer; dynamic programming; amortized analysis; graph algorithms; shortest paths; network flow;…

Free video23 videos, 30 hours

Massachusetts Institute of Technology · YouTube

MIT 6.046J Design and Analysis of Algorithms, Spring 2015

View the complete course: http://ocw.mit.edu/6-046JS15 Instructors: Erik Demaine, Srinivas Devadas, Nancy Ann Lynch 6.046 introduces students to the design of computer algorithms, as well as analysis of sophisticated algorithms. License: Creative Commons BY-NC-SA More information at http://ocw.mit.…

Free video34 videos, 39 hours

Massachusetts Institute of Technology · YouTube

MIT 6.851 Advanced Data Structures, Spring 2012

View the complete course: http://ocw.mit.edu/6-851S12 Instructor: Erik Demaine Videos of 6.851 Lectures Spring 2012 License: Creative Commons BY-NC-SA More information at http://ocw.mit.edu/terms More courses at http://ocw.mit.edu

Free video22 videos, 30 hours

Harvard University · edX

Fundamentals of TinyML

4.567 ratings

Focusing on the basics of machine learning and embedded systems, such as smartphones, this course will introduce you to the “language” of TinyML.

Free to audit5 weeks, 2 - 4 hours per week

Enter your email and the official page opens. Phone is optional.