About this course
Alpha Plus 4.0 is an advanced training program designed to help you master Data Structures and Algorithms (DSA) with Java and ace technical interviews. Whether you’re a beginner looking to build a strong foundation or an experienced programmer aiming to enhance your problem-solving skills, this course offers a structured path to success.
This 4-month program includes:
50+ Live Practice Sessions: Learn and practice coding in real-time with expert instructors.
300+ Curated Coding Problems: Tackle problems ranging from beginner to advanced levels to build your skills progressively.
Comprehensive DSA Coverage: From basic data structures to complex algorithms, gain a deep understanding of core concepts.
Placement Preparation: Equip yourself with the skills to succeed in competitive coding and interviews.
One-on-One Doubt Resolution: Get personalized guidance and clear your doubts with direct interaction.
Advanced Topics: Dive deep into complex topics like Graphs, Dynamic Programming, and more.
Additionally, Alpha Plus 4.0 includes quantitative aptitude training and interview prep to ensure you're ready for top-tier placements. With 15 months of access to course materials, you'll have ample time to revise and hone your skills at your own pace.
Join Alpha Plus 4.0 today and take your coding and problem-solving skills to the next level!
Suggested by top companies
Top companies suggest this course to their employees and staff.
Comments (0)
01. Welcome To Alpha
2 Parts
01 . Alpha Curriculum
0.84 MB
02. Alpha Community Update
-
02. Course Introduction
3 Parts
01. Path to Placement
-
02. What will you learn
-
03. Prerequisites
-
03. Prerequisites - Installation Resources
1 Parts
01. What to Install
-
04. Flowcharts & Pseudocodes
7 Parts
01. What are Flowcharts
-
02. Flowchart Components
-
03. Sum of 2 Numbers
-
04. Calculate Simple Interest
-
05. Max of 3 Numbers
-
06. Find if a Number is Prime or not
-
07. Sum of first N natural numbers
-
06. Variables & Data Types
15 Parts
01. Creating a Java File
-
02. Boilerplate Code
-
03. Output in Java
-
04. Print a Pattern
-
05. Variables in Java
-
06. Data Types In Java
-
07. Sum of a & b
-
08. Comments in Java
-
09. Input In Java
-
10. Sum of a & b (Input From User)
-
11. Product of a & b
-
12. Area of a Circle
-
13. Type Conversion
-
14. Type Casting
-
15. Type Promotion in Expression
-
07. Operators
6 Parts
01. Types of Operators
-
02. Arithmetic Operators
-
03. Unary Operators
-
04. Relational Operators
-
05. Logical Operators
-
06. Assignment Operator
-
08. Conditional Statements
10 Parts
01. If Else
-
02. Print The Largest of 2 Numbers
-
03. Print if Number is Odd Or Even
-
04. Else If
-
05. Income Tax Calculator
-
06. Print The Largest of 3 Numbers
-
07. Ternary Operator
-
08. Check if a Student is Pass or Fail
-
09. Switch Statement
-
10. Calculator
-
09. Loops (Flow Control)
15 Parts
01. Loops Basics
-
02. While Loop
-
03. Print Numbers From 1 To 10
-
04. Print Numbers From 1 to n
-
05. Sum of First n Natural Numbers
-
06. For Loop
-
07. Print Square Pattern
-
08. Print Reverse of a Number.
-
09. Reverse The Given Number
-
10. Do While Loop
-
11. Break Statement
-
12. Question - Break Keyword
-
13. Continue Statement
-
14. Question - Continue Keyword
-
15. Check if a Number is Prime or Not
-
10. Patterns (Part I)
5 Parts
01. Intro to Nested Loops (Star Pattern)
-
02. Inverted Star Pattern
-
03. Half-Pyramid Pattern
-
04. Character Pattern
-
05. Special Note
-
11. Functions & Methods
22 Parts
01. Introduction To Function
-
02. Syntax-Function Code Demo
-
03. Syntax With Parameters
-
04. Parameters vs Arguments
-
05. What Happens In Memory(Call Stack)
-
06. Call By Value(in Java)
-
07. Product of a & b
-
08. Find Factorial
-
09. Find Binomial Coefficent
-
10. Inbuilt vs User Defined Methods
-
11. Function Overloading
-
12. Overloading Using Parameters
-
13. Overloading Using Data Types.
-
14. Check if Number is Prime or Not
-
15. Check Prime (Optmised)
-
16. Primes In Range
-
17. Binary To Decimal
-
18. Code - Binary To Decimal
-
19. Decimal To Binary
-
20. Code - Decimal To Binary
-
21. Method Scope
-
22. Block Scope
-
12. Pattern (Part II) - Advanced
11 Parts
01. Hollow Rectangle Pattern
-
02. Dry run- How Rectangle Pattern
-
03. Inverted And Rotated Half Pyramid
-
04. Inverted Half Pyramid Pattern with Numbers
-
05. Floyd_s Triangle Pattern
-
06. 0-1 Triangle Pattern
-
07. Butterfly Patter
-
08. Solid Rhombus Pattern
-
09. Hollow Rhombus Pattern
-
10. Diamond Patter
-
Bonus LIVE Class.
-
15. 2D Arrays
9 Parts
01. Introduction To 2D Arrays
-
02. Real Life Examples
-
03. Representation of 2D Arrays
-
04. Creation of 2D Arrays
-
05. 2D Array in Memory
-
07. Spiral Matrix Code
-
08. Diagonal Sum
-
09. Search In Sorted Matrix
-
10. Search In Sorted Matrix Code
-
16. Strings
13 Parts
01. What are Strings
-
02. Input - Output
-
03. String Length
-
04. String Concatenation
-
05. String charAt Method
-
06. Check if a String is Palindrome
-
07. Question - Shortest Path
-
08. String Function - Compare
-
09. String Function - Substring
-
10. Print Largest String
-
11. Why Strings Are Immutable
-
13. Convert Letters To Uppercase
-
14. Srring Compression
-
17. Bit Manipulation
20 Parts
01. Introduction To Bit Manipulation
-
02. Binary Number System
-
03. Bitwise Operators
-
04. Binary AND
-
05. Binary OR
-
06. Binary XOR
-
07. Binary 1_s Complement
-
08. Binary Left Shift
-
09. Binary Right Shift
-
10. Check If Odd Or Even
-
11. Get ith Bit
-
12. Set ith Bit
-
13. Clear ith Bit.
-
14. Update ith Bit
-
15. Clear Last i Bits
-
16. Clear Range Of Bits
-
17. Check If A Number Is Power Of 2 Or Not
-
18. Count Set Bits In Number
-
19. Fast Exponetiation
-
20. Fast Exponentiation Code.
-
18. Object Oriented Programming (OOPs)
23 Parts
01. Classes & Objects
-
02. Access Modifiers
-
03. Getters & Setters
-
04. Encapsulation
-
05. Constructors
-
06. Type of Constructors
-
07. Copy Constructor
-
08. Shallow & Deep Copy
-
09. Destructors
-
10. Inheritance
-
11. Single level Inheritance
-
12. Multi Level Inheritance
-
13 Hierarchial Inheritance
-
14. Hybrid Inheritance
-
15. Polymorphism
-
16. Method Overloading
-
17. Method Overriding
-
18. Packages in Java
-
19. Abstraction
-
20. Abstract Classes
-
21. Interfaces
-
22. Static keyword
-
24. Solved Questions Practice
-
19. Recursion Basics
19 Parts
01. What is Recursion
-
02. Print Numbers in Decreasing Order
-
03. Stack Overflow
-
04. Print Numbers in Increasing Order
-
05. Find Factorial of N
-
06. Print sum of N Natural Numbers
-
07. Print Nth Fibonacci Number
-
08. Check if Array is Sorted or Not
-
09. First Occurrence
-
10. Last Occurrence
-
11. Print x to the power n
-
12. Print x to the power n (Optimized)
-
13. Tiling Problem
-
14. Tiling Problem Code
-
15. Remove Duplicates in a String
-
16. Friends Pairing Problem
-
17. Binary Strings Problem
-
18. Binary Strings Problem Code
-
19. Stack Analysis - Binary Strings
-
20. Divide & Conquer
8 Parts
01. What is Divide & Conquer
-
02. Merge sort (Basic + Space Optimized)
-
03. Merge Sort Code
-
04. Quick Sort
-
05. Quick Sort Code
-
06. Worst Case in Quick Sort.
-
07. Sorted & Rotated Array Search
-
08. Sorted & Rotated Array Code
-
23. ArrayList
16 Parts
01. Introduction to ArrayList
-
02. Operations on ArrayList
-
03. Size of ArrayList
-
04. Print Reverse of an ArrayList
-
05. Find Maximum in an ArrayList
-
06. Swap 2 Numbers
-
07. Sorting an ArrayList
-
08. ArrayList (Implementation in Java)
-
09. Multi-dimensional ArrayLists
-
10. Container with Most Water (Brute Force)
-
11. Container with Most Water (2 Pointer Approach)
-
12. Container wMW vs. Trapping Rainwater
-
13. Pair Sum-1 (Brute Force)
-
14. Pair Sum-1 (2 Pointer Approach)
-
15. Pair Sum-2
-
16. Pair Sum-2 (Code)
-
24. Linked List (Part 1)
15 Parts
01. Introduction to Linked List
-
02. Head & Tail in LL
-
03. Add First in LL
-
04. Add Last in LL
-
05. Print a LL
-
06. Add in the Middle of LL
-
07. Size of a LL.
-
08. Remove First in LL
-
09. Remove Last in LL
-
10. Iterative Search
-
11. Recursive Search
-
12. Reverse a LL
-
13. Find and Remove Nth Node from End
-
14. Check if LL is Palindrome
-
15. Check if LL is Palindrome (Code)
-
25. Linked List (Part 2)
14 Parts
01. Detecting Cycle in LL
-
02. Detecting Cycle Code
-
03. Removing Cycle in LL
-
04. Removing Cycle Code
-
05. Removing Cycle Explanation (Math
-
06. Java Collections Framework
-
07. LL in Collections Framework
-
08. Merge Sort on LL
-
09. Merge Sort on LL (Code)
-
10. Zig Zag LL
-
11. Zig Zag LL Code
-
12. Doubly LL.
-
13. Reverse a Doubly LL
-
14. Circular LL (Approach)
-
26. Stacks
16 Parts
01. Stack Introduction
-
02. Stack using ArrayList.
-
03. Stack using Linked List
-
04. Stack using Collections Framework
-
05. Push at Bottom of Stack
-
06. Reverse a String using a Stack
-
07. Reverse a Stack
-
08. Stock Span Problem
-
09. Next greater element
-
10. Next greater element Code
-
11. Valid Parentheses
-
12. Valid Parentheses Code
-
13. Duplicate Parentheses
-
14. Duplicate Parentheses Code
-
15. Maximum Rectangular Area in Histogram
-
16. Max Reactangular Area in Histogram (Code)
-
27. Queues
14 Parts
01. Introduction to Queues
-
02. Queues using Arrays
-
03. Circular Queue using Arrays
-
04. Queue using LL
-
05. Queue using JCF
-
06. Queue using Two Stacks
-
07. Stack using 2 Queues
-
08. First Non-Repeating Letter
-
09. Interleave two halves of a Queue
-
10. Queue Reversal
-
11. Deque (Double Ended Queue)
-
12. Deque in JCF
-
13. Implement Stack using Deque
-
14. Implement Queue using Deque
-
28. Greedy Algorithms
12 Parts
28. Greedy Algorithms
-
02. Activity Selection
-
03. Activity Selection Code
-
04. Activity Selection Explanation
-
05. Fractional Knapsack
-
06. Fractional Knapsack Code
-
07. Minimum Sum absolute difference pairs
-
08. Maximum length chain of pairs
-
09. Indian Coins
-
10. Job Sequencing Problem
-
11. Chocola Problem
-
12. Chocola Problem Code
-
29. Binary Trees (Part 1)
14 Parts
01. Introduction to Binary Trees
-
02. Levels & Sub-trees in a Tree
-
03. Pop Quiz
-
04. Build Tree Preorder
-
05. Build Tree Preorder Code
-
06. Preorder Traversal
-
07. Inorder Traversal
-
08. Postorder Traversal
-
09. Level order Traversal
-
10. Height of a Tree
-
11. Count Nodes of a Tree
-
12. Sum of Nodes
-
13. Diameter of a Tree (Approach1)
-
14. Diameter of a Tree (Approach2)
-
30. Binary Trees (Part 2)
7 Parts
01. Diameter of a Tree (Approach1)
-
02. Diameter of a Tree (Approach2)
-
03. Subtree of another tree
-
04. Subtree of another tree Code
-
05. Top View of a Tree (Basics)
-
06. Top View of a Tree (Approach)
-
07. Top View of a Tree (Code)
-
31. Binary Trees (Part 3)
6 Parts
01. Kth Level
-
02. Lowest Common Ancestor (Approach1)
-
03. Lowest Common Ancestor (Approach2)
-
04. Minimum Distance between 2 Nodes
-
05. Kth ancestor of Node
-
06. Transform to Sum Tree
-
32. Binary Search Trees (Part 1)
7 Parts
01. Introduction
-
02. Concept of Search in BST
-
03. Build a BST
-
04. Search in a BST
-
05. Delete a Node
-
06. Print in Range
-
07. Root to Leaf Path
-
33. Binary Search Trees (Part 2)
6 Parts
01. Sorted Array to Balanced BST
-
02. Convert BST to Balanced BST
-
03. Size of Largest BST in BT
-
04. Size of Largest BST in BT (Code)
-
05. Merge 2 BSTs
-
06. AVL Tress
-
34. Heaps
13 Parts
01. Introduction to Priority Queues
-
02. PQ in JCF
-
03. PQ for Objects
-
04. Introduction to Heaps
-
05. Heap Implementation (using CBT)
-
06. Insert in Heap
-
07. Peek From Heap
-
08. Remove from Heap
-
09. Heap Sort
-
10. Nearby Cars
-
11. Connect N Ropes with Minimum Cost
-
12. Weakest Soldier
-
13. Sliding Window Maximum
-
35. Hashing
20 Parts
01.Hashing Introduction
-
02. HashMap
-
03. HashMap Operations
-
04. Iteration on HashMaps
-
05. HashMap Implementation
-
06. HashMap Implementation Code
-
07. Special Note
-
08. Linked HashMap
-
09. TreeMap
-
10 . Comparison Table_
0.27 MB
11. Majority Element
-
12. Valid Anagram
-
13. HashSet
-
14. Iteration on HashSets
-
15. Linked HashSet
-
16. TreeSet
-
17. Count Distinct Elements
-
18. Union & Intersection
-
19. Find Itinerary for Tickets
-
20. Largest Subarray with Sum 0.
-
36 Tries
7 Parts
01. Tries Introduction
-
02. What is a Trie
-
03. Creating a Trie
-
04. Insertion
-
05. Searching
-
06. Word Break Problem
-
07. Prefic Problem
-
37. Graphs (Part1)
8 Parts
37. Graphs (Part1)
-
02. Types of Graphs (Based on Edge)
-
03. Graph Representations
-
04. Graph Applications
-
05. Creating a Graph (Adjacency List)
-
06. BFS (Breadth First Search)
-
07. DFS (Depth First Search)
-
08. Has Path (Using DFS)
-
38. Graphs (Part2)
7 Parts
01. Connected Components
-
02. Cycle in Graphs
-
03. Cycle Detection (Undirected graphs) - DFS
-
04. Bipartite Graph
-
05. Cycle Detection (Directed graph) - DFS
-
06. Extra Read
-
07. Topological Sorting (using DFS)
-
39. Graphs (Part3)
5 Parts
01. Topological Sort using BFS (Kahn_s Algorithm)
-
02. Topological Sort using BFS (Code)
-
03. All Paths from Source to Target
-
04. Dijkstra_s Algorithm
-
05. Dijkstra_s Algorithm (Code)
-
40. Graphs (Part4)
4 Parts
01. Bellman Ford Algorithm
-
02. Bellman Ford (Code)
-
03. What is MST
-
04. Prim_s Algorithm
-
41. Graphs (Part5)
7 Parts
01. Cheapest Flights within K Stops
-
02. Cheapest Flights within K Stops (Code)
-
03. Connecting Cities
-
04. Connecting Cities (Code)
-
05. Disjoint Set Union
-
06. Kruskal_s Algorithm
-
07. Flood Fill Algorithm
-
42. Graphs - Supplemental
3 Parts
01. Strongly Connected Components (Kosaraju_s Algorithm)
-
02. Bridge in Graph (Tarjan_s Algorithm)
-
03. Articulation Point (Tarjan_s Algorithm).
-
43. DP (Part1)
8 Parts
01. Introduction to DP
-
02. What is DP (Definition)
-
03. Ways of DP
-
04. 7 Important Concepts
-
05. Climbing Stairs (Recursion)
-
06. Climbing Stairs (Memoization DP)
-
07. Climbing Stairs Variation
-
08. Climbing Stairs (Tabulation DP)
-
44. DP (Part2)
7 Parts
01. Types of Knapsack problems
-
02. 0-1 Knapsack (Recursion)
-
03. 0-1 Knapsack (Memoization)
-
04. 0-1 Knapsack (Tabulation)
-
05. Target Sum Subset (Tabulation)
-
06. Target Sum Subset (Code)
-
07. Unbounded Knapsack (Tabulation)
-
45. DP (Part3)
5 Parts
01. Coin Change (Live Class)
-
02. Rod Cutting
-
03. Longest Common Subsequence (Recursion)
-
04. LCS (Memoization)
-
05. LCS (Tabulation)
-
46. DP (Part4)
5 Parts
01. Longest Common Substring
-
02. Longest Increasing Subsequence
-
03. Edit Distance (Explanation)
-
04. Edit Distance (Code)
-
05. String Conversion
-
47. DP (Part5)
6 Parts
01. Wildcard Matching - Hard (Explanation)
-
02. Wildcard Matching (Code)
-
03. Catalan_s Number (Recursion + Memoization)
-
04. Catalan_s Number (Tabulation)
-
05. Count BSTs
-
06. Mountain Ranges
-
48. DP (Part6)
7 Parts
01. Basics of Matrices (Math)
-
02. Matrix Chain Muiltiplication
-
03. MCM (Memoization)
-
04. MCM (Tabulation)
-
05. Minimum Partitioning
-
06. Minimum Array Jumps (Explanation)
-
07. Minimum Array Jumps (Code)
-
49. Segment Trees
7 Parts
01. Segment Trees Introduction
-
02. Count & Meaning of Nodes
-
03. Creation of ST
-
04. Queries on ST.
-
05. Update on ST
-
06. Max-Min Segment Tree (Creation)
-
07. Max-Min Segment Tree (Query-Update)
-
0
0 Reviews
.png)
