🔥 Special Offer: Flat Discount on Your Favorite Courses! Use Coupons GET200OFF GET500OFF
→ Grab Offer Now ←
Course Image
DSA using Java
(Problem Solving)
By Deepak Sir Best Seller
  •   Lectures : 60+
      Price : Rs. 3999   Rs. 8999   56% off
      Rate : 5.0

Login & Buy This Course

DSA using Java (Problem Solving Questions)

Course Introduction :

This DSA Using Java course helps you master all essential Data Structures and Algorithms with a strong focus on problem-solving and interview preparation.
You will learn major data structures like arrays, strings, linked lists, stacks, queues, trees, graphs, heaps, hashmaps, and key algorithms such as two pointers, sliding window, recursion, sorting, searching, greedy, DP, backtracking, and more. The course includes 100+ quality coding questions to boost your logic and confidence.
Perfect for beginners and professionals preparing for placements, internships, and top MNC interviews.

Key Features :

    Industry Level Concepts
    Download Notes & Project Source Code
    100+ Problem Solving Questions
    Mock Interviews & Career Guidance
    Hands-on Coding on LeetCode Problems
    Get Course Completion Certificate
    Learn at Your Pace, Anytime - Anywhere
    Placement Support

Course Content

  • 1.1   What is DSA? Complete Introduction for Beginners
  • 1.2   Time & Space Complexity Explained with Examples
  • 1.3   Rules to find Function Expression [ f(n) ] of any Algorithm
  • 1.4   Asymptotic Notations – Big O, Big Ω, Big Θ
  • 1.5   How to find Time Complexity of any Algorithm
  • 1.6   Best, Worst & Average Case Analysis
  • 1.7   Analyze real LeetCode problems based on complexity

  • 2.1   Array Logical Programs (20+)
  • 2.2   Searching Algorithms
    • Linear Search
    • Binary Search (Iterative & Recursive)
  • 2.3   Sorting Algorithms
    • Bubble Sort
    • Selection Sort
    • Insertion Sort
    • Merge Sort
    • Quick Sort
    • Heap Sort

  • 3.1   Iterative Approach
  • 3.2   Brute Force Approach
  • 3.3   Prefix Sum Technique
  • 3.4   Suffix Sum Technique
  • 3.5   Two Pointer Technique
  • 3.6   Sliding Window Technique
  • 3.7   Kadane’s Algorithm (Maximum Subarray Sum)
  • 3.8   LeetCode Practice: Two Sum, Move Zeroes, Max Subarray

  • 4.1   String Manipulation (Reverse, Compare, Transform)
  • 4.2   Substrings & Palindromes
  • 4.3   Anagrams & Isomorphic Strings
  • 4.4   Character Frequency using HashMap
  • 4.5   Pattern Matching (Basic)
  • 4.6   LeetCode Practice: Valid Anagram, Longest Palindrome, Is Subsequence

  • 5.1   ArrayList
    • Dynamic Arrays and Resizing
    • Use Cases in Real-World
  • 5.2   LinkedList
    • Singly & Doubly Linked Lists
    • Insertion/Deletion at Head/Tail
    • Reverse a LinkedList
    • Find Middle, Detect Loop (Floyd’s Cycle)
    • Merge Two Sorted LinkedLists
  • 5.3   LeetCode Practice: Reverse Linked List, Detect Cycle, Merge Lists

  • 6.1   Stack using Array / LinkedList
  • 6.2   Infix → Postfix / Prefix Conversion
  • 6.3   Valid Parentheses Problem
  • 6.4   Next Greater Element
  • 6.5   Stock Span Problem
  • 6.6   Min Stack Implementation
  • 6.7   Queue, Circular Queue, Deque
  • 6.8   Priority Queue (Min / Max Heap)
  • 6.9   Sliding Window Maximum
  • 6.10   LeetCode Practice: Min Stack, Next Greater Element, Sliding Window Max

  • 7.1   Count Frequency of Elements
  • 7.2   Two Sum Problem
  • 7.3   Subarrays with Given Sum
  • 7.4   Detect Duplicates
  • 7.5   HashSet for Unique Elements
  • 7.6   HashMap vs TreeMap vs LinkedHashMap
  • 7.7   LeetCode Practice: Two Sum, Longest Substring Without Repeat

  • 8.1   Binary Tree Basics & Node Creation
  • 8.2   Tree Traversals
    • Inorder, Preorder, Postorder (DFS)
    • Level Order (BFS)
  • 8.3   Height & Diameter of a Tree
  • 8.4   Balanced Tree Check
  • 8.5   Mirror Tree
  • 8.6   Lowest Common Ancestor (LCA)
  • 8.7   BST Operations – Insertion, Deletion, Search
  • 8.8   Validate BST, Floor/Ceil, Kth Smallest/Largest
  • 8.9   LeetCode Practice: Validate BST, LCA, Diameter of Tree

  • 9.1   Min-Heap & Max-Heap
  • 9.2   Heapify and Heap Operations
  • 9.3   Insert/Delete in Heap
  • 9.4   K Largest/Smallest Elements
  • 9.5   Median of a Stream
  • 9.6   LeetCode Practice: Top K Elements, Kth Largest Element

  • 10.1   Graph Representation (Adjacency List/Matrix)
  • 10.2   DFS & BFS Traversal
  • 10.3   Cycle Detection
  • 10.4   Dijkstra’s Algorithm (Shortest Path)
  • 10.5   Union-Find / Disjoint Set
  • 10.6   LeetCode Practice: Number of Islands, Graph Valid Tree

  • 11.1   Insertion, Search & Deletion
  • 11.2   Auto-complete Feature
  • 11.3   Prefix Search
  • 11.4   Count Distinct Substrings
  • 11.5   LeetCode Practice: Implement Trie, Replace Words

  • 12.1   Basic Recursion – Factorial, Fibonacci, Power
  • 12.2   Backtracking Problems
    • N-Queens Problem
    • Sudoku Solver
    • Subsets, Combinations, Permutations
  • 12.3   Divide & Conquer
    • Merge Sort
    • Quick Sort
    • Binary Search
    • Closest Pair of Points
  • 12.4   LeetCode Practice: Subsets, Permutations, N-Queens

  • 13.1   Activity Selection
  • 13.2   Fractional Knapsack
  • 13.3   Job Sequencing
  • 13.4   Huffman Encoding
  • 13.5   LeetCode Practice: Jump Game, Gas Station

  • 14.1   Memoization vs Tabulation
  • 14.2   Fibonacci (DP Approach)
  • 14.3   0/1 Knapsack
  • 14.4   Longest Common Subsequence (LCS)
  • 14.5   Longest Increasing Subsequence (LIS)
  • 14.6   Subset Sum
  • 14.7   Coin Change
  • 14.8   LeetCode Practice: LCS, LIS, Coin Change, 0/1 Knapsack

  • 15.1   Pattern-Based LeetCode Problem Solving
  • 15.2   Mastering 2-Pointer & Sliding Window
  • 15.3   Recursion + Backtracking Patterns
  • 15.4   Interview Preparation Strategy
  • 15.5   Mock Tests & Real LeetCode Contests
Need Help? Whats App or Call Us for Course-Related Queries!
Chat on Whats App      Call us Now  

  Trainer of this course

Deepak Panwar

Deepak Panwar

Software Engineer & Developer / Trainer

I’m Deepak, a Software Engineer with 13+ years of experience in Java Development and DSA Interview Preparation.
I specialize in Java, Data Structures & Algorithms and varioud Java Frameworks.
In my DSA course, you’ll learn from fundamentals to advanced concepts through easy explanations, real questions and practical problem-solving, helping you build strong logic and become interview-ready. Let’s master DSA together! 🚀

  • 304+ Subscribers on YouTube
  • 22K+ Learners on My Platform
  • 5.0 ★ Rated Instructor
  • Practical Experience with 50+ Projects
  • Trained 80K+ Students in DSA
  • Live Problem Solving Coding Sessions
  • 13+ Years of Industry Experience
  • Expert in Java Fundamentals & Problem Solving

  Student Reviews

Frequently Asked Questions

This DSA Using Java Course covers all important Data Structures, Algorithms, Coding Patterns and Problem-Solving techniques required for cracking top IT interviews. It includes theory + dry runs + 100+ practice questions.

This course is perfect for:
  • Students preparing for placements
  • Beginners in DSA
  • Java learners
  • Working professionals switching to development
  • Anyone preparing for coding interviews

You will learn Arrays, Strings, Stack, Queue, LinkedList, Trees, BST, Graphs, Heaps, Hashing, Recursion, Backtracking, Dynamic Programming, Sliding Window, Two Pointers, Greedy, and more.

No. This course is made for beginners as well as intermediate learners. Basic Java concepts are explained whenever needed.

You will practice 100+ problem-solving questions, including
  • LeetCode
  • Company-specific coding questions
  • Pattern-based questions for interviews

Yes. The course includes:
  • Interview patterns
  • Problem-solving strategy
  • Dry-run approach
  • Complexity analysis
  • Resume guidance
  • Mock interviews (if required)

Yes. You get:
  • Downloadable notes
  • Topic-wise code files
  • Assignments for practice

Yes, after completing the course, you will receive an official course completion ISO certificate.

Yes. You can contact the instructor directly via WhatsApp or call for doubt resolution.

If you study regularly (2–3 hrs/day), the course takes 2–3 months.
If you study only on weekends, it may take 4–5 months.

Other Suggested Courses

upto 80% discount Get Upto 80% Off on our premium courses

Course Image
Java Projects Bundle
(7 Projects)
By Deepak Sir Best Seller
  •   Lectures : 70+
      Price : Rs. 4499   Rs. 9999   55% off
      Rate : 4.8
Course Image
Advance Java
(with 1 projects)
By Deepak Sir
  •   Lectures : 113
      Price : Rs. 2999   Rs. 7999   63% off
      Rate : 4.9
Course Image
Spring Boot Framework
(with 1 project)
By Deepak Sir Best Seller
  •   Lectures : 170
      Price : Rs. 3999   Rs. 8999   56% off
      Rate : 4.8
Course Image
Java Full Stack Development
(7 Projects)
By Deepak Sir Best Seller
  •   Lectures : 530+
      Price : Rs. 6999 Rs. 26999   74% off
      Rate : 4.9
/* Center content */ /* Center align text */ /* Keep button fixed on right for desktop */ /* -------- Responsive for Mobile -------- */ /* stack content vertically */ /* space before close button */ /* remove absolute positioning */ /* center the button */ /* smaller size */