ALPHA : Java with DSA Placement Course
Learn with PURE CODING MASTER
50 modules
Hinglish
Certificate of completion
Access for 730 days
Master Java, DSA, and ace placement interviews!
Overview
This comprehensive course covers Java programming with a special focus on Data Structures and Algorithms to prepare students for placements. Learn essential concepts in Java and how to apply them to solve complex problems. Master DSA techniques to excel in technical interviews and land your dream job in the tech industry.
Key Highlights
Java programming fundamentals
Data Structures and Algorithms mastery
Placements preparation
Hands-on projects and assignments
What you will learn
Solid understanding of Java fundamentals
Learn Java syntax, OOP concepts, exception handling, and more.
In-depth knowledge of Data Structures
Study arrays, linked lists, stacks, queues, trees, graphs, and their applications.
Algorithms mastery
Cover searching, sorting, dynamic programming, recursion, and more to enhance problem-solving abilities.
Crack placement interviews
Get expert guidance on tackling technical interviews and showcase your Java and DSA skills effectively.
Modules
1. Welcome to Alpha!
3 attachments • 6.3 mins
1. Alpha Curriculum PDF
7 pages
Alpha Community Update
Join Telegram
2. Course Introduction
3 attachments • 10.3 mins
1. Path to Placement
2. What will you learn
3. Prerequisites
3. Prerequisites - Installation Resources
2 attachments • 3.42 mins
1. What to Install
2. Installation Resources.pdf
1 page
4. Flowcharts & Pseudocodes
9 attachments • 46.18 mins
1. What are Flowcharts
2. Flowchart Components
3. Sum of 2 Numbers
4. Calculate Simple Interest
5. Max of 3 Numbers
6. Find if a Number is Prime or not
7. Sum of first N natural numbers
Practice Questions.pdf
1 page
Solution for Practice Qs.pdf
5 pages
5. Live Mentorship Sessions
8 attachments • 11 hrs
1. (For New Students) Bonus Live Session
2. Live Mentorship Session - 1 (with Shradha Didi)
3. Live Mentorship Session - 2 (with Shradha Didi)
4. Live Mentorship Session - 3 (Resume)
5. Live Mentorships Session - 4 (Theory Topics)
6. Live Mentorship Session - 5 (Off-campus Placements)
7. Live Mentorship Session (on Linkedin)
8. Live Mentorship Session - 7 (Interview Prep)
6. Variables & Data Types
17 attachments • 1 hrs
1. Creating A Java File
2. Boilerplate Code
3. Output In Java
4. Print A Pattern
5. Variables In Java
6. Data Types In Java
7. Sun Of a & b
8. COMMENTS IN JAVA
9. Input In Java
10. Sum Of a&b (Input From User)
12. Area Of Circle
13. Type Conversion
14. Type Casting
15. Type Promotion Expression
16. How Does Java Code Run
Practice Questions
1 page
Solutions for Practice Qs
2 pages
7. Operators
9 attachments • 36.85 mins
1. Types of Operators
2. Arithmetic Operators
3. Unary Operators
4. Relational Operators
5. Logical Operators
6. Assignment Operator
Reading Matarials : Operator Precedence.pdf
2 pages
Practice Questions.pdf
2 pages
Solutions for Practice Qs.pdf
1 page
8. Conditional Statement
11 attachments • 47.35 mins
1. If Else
2. Print The Largest Of 2 Numbers
3. Print If Number Is Odd Or Even
4. Else If
5. Income Tax Calculator
6. Print The Largest Of 3 Numbers
7. Ternary Operators
8. Check If A Student Is Pass Or Fail
10. Calculator
Practice Questions.pdf
2 pages
Solutions for Practice Qs.pdf
3 pages
9. Loops (Flow Control)
17 attachments • 1 hrs
1. Loops Basics
2. While Loop
3. Print Number From 1 To 10
4. Print Number From 1 to n
5. Sum Of First n Natural Numbers
6. For Loops
7. Print Square Pattern
8. Print Reverse Of A Number
9. Reverse The Given Number
10. Do While Loop
11. Break Statement
12. Question - Break Statement
13. Continue Statement
14. Question - Continue Keyword
15. Check If A Number Is Prime Or Not
Practice Questions.pdf
2 pages
Solutions for Practice Qs.pdf
3 pages
10. Patterns (Part 1)
6 attachments • 40.3 mins
1. Print Star Pattern
2. Print Inverted Star Pattern.mp4
3. Print Half-Pyramid Pattern
4. Print Character Pattern
6. Special Note
Looking Forward - Advanced Pattern
12 pages
11. Function & Methods
24 attachments • 1 hrs
1. Introduction To Function
2. Syntax-Function Code Demo
3. Syntax With Parameters
4. Parameters vs Arguments
5. What Happens In Memory
6. Call By Value
7. Product Of a & b_
8. Find Factorial
9. Find Binomial Coefficent
10. Inbuilt vs User Defined Methods
11. Function Overloading
12. Overloading Using Parameters
13. Overloading Using Data Types - Copy
14. Check If Number Is Prime Or Not
15. Check Prime (Optmised)
16. Prime In Range
17. Binary To Decimal
18. Code - Binary To Decimal
19. Decimal To Binary
20. Code - Decimal To Binary
21. Block Scope
22. Method Scope
Practice Questions.pdf
1 page
Solutions for Practice Qs.pdf
3 pages
12. Pattern Advanced (Part 2)
10 attachments • 1 hrs
1. Hollow Rectangle Pattern
2. Dry run- How Rectangle Pattern
3. Inverted And Rotated Half Pyramid
4. Inverted Half Pyramid Pattern with Numbers
5. Floyd's Triangle Pattern
6. (0-1) Triangle Pattern
7. Butterfly Patter
8. Solid Rhombus Pattern
9. Hollow Rhombus Pattern
10. Diamond Patter
13. Arrays
20 attachments • 2 hrs
1. Introduction
2. Arrays-Creation
3. Arrays-Input,Output & Updates
4. Arrays as Function Arguments
4.1 Space & Time Complexity (Reading Material)
3 pages
5. Linear Search
6. Largest in array
7. Binary Search
8. Binary Search Code
9. Reverse In Array
10. Pairs In Array
11. Print Subarrays
12. Max-Subarray Sum - I (Brute Force)
13. Max-Subarray Sum - II (Prifix Sum)
14. Max-Subarray Sum - III (Kadane's Algorithm)
15. Trapping Rainwater
16. Trapping Rainwater - Code
17. Best Time To Buy & Sell Stocks
Practice Questions
4 pages
Solutions for Practice Qs
6 pages
14. Basic Sorting Algorithm
12 attachments • 52.3 mins
1. What Is Sorting
2. Bubble Sort
3. Bubble Sort Code
4. Selection Sort
5. Selection Sort Code
6. Insertion Sort
7. Insertion Sort Code
8. Inbuilt sort
9. Counting Sort
10. Counting Sort Code
Practice Questions
1 page
Solutions for Practice Qs
2 pages
15. 2D Arrays
12 attachments • 1 hrs
1. Introduction To 2D Arrays
2. Real Life Examples
3. Representation Of 2D Arrays
4. Creation Of 2D Arrays
5. 2D Array In Memory
6. Spiral Matrix
7. Spiral Matrix Code
8. Diagonal Sum
9. Search In Sorted Matrix
10. Search In Sorted Matrix Code
Practice Questions.pdf
1 page
Solutions for Practice Qs.pdf
2 pages
16. Strings
16 attachments • 1 hrs
1. What are Strings
2. InputOutput
3. String Length
4. String Concatenation
5. String char At Method
6. Check If String Is Palindrome
7. Question - Shortest Path
8. String Function - Compare
9.String Function - Substring
10.Print Largest String
11. Why Strings Are Immutable
12. String Builder
13. Convert Letters To Uppercase
14. Srring Compression
Practice Questions.pdf
1 page
Solution for Practice Qs.pdf
2 pages
17. Bit Manipulation
22 attachments • 1 hrs
1. Introduction To Bit Manipulation
2. Binary Number System
3. Bitwise Operators
4. Binary AND
5. Binary OR
6. Binary XOR
7.. Binary 1's Complement
8. Binary Left Shift
9 - 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
Practice Questions (1).pdf
1 page
Solution for Practice Qs (1).pdf
2 pages
18. Object Oriented Programming (OOPs)
26 attachments • 2 hrs
1. Classes & Objects
2. Access Modifiers
3. Getters & Setters
4. Encapsulation
5. Constructors
6. Type of Constructors
7. Copy Constructor
8. Shallow & Deep Copy
9. 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
23. Super keyword
24. Solved Questions Practice
Practice Questions.pdf
3 pages
Solution for Practice Qs.pdf
2 pages
19. Recursion Basics
21 attachments • 3 hrs
1.What is Recursion_
2. Print numbers in decreasing order
3. Stack overflow
4. Print numbers in increasing order
5. Find Factorial of N
6. Print sum of N natural numbers
7.Print Nth Fibonacci number
8.Check if array is sorted or not
9.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
Practice Questions.pdf
3 pages
Solution for Practice Qs.pdf
3 pages
20. Divide & Conquer
10 attachments • 1 hrs
1.What is Divide & Conquer_
2 Merge sort (basic + space Optimized)
3. Merge Sort Code
4. Quick Sort
5. Quick Sort Code
6. Worst Case in Quick Sort
7. Sorted & Rotated Array Search
8. Sorted & Rotated Array Code
Practice Questions.pdf
2 pages
Solution for Practice Qs.pdf
9 pages
21. Time & Space Complexity
24 attachments • 2 hrs
1. Introduction
2. What is Time Complexity
3. Constant Time Complexity
4. Big O Notation
5. Big Omega & Theta Notation (1)
6. Common Complexities
7. Space Complexity
8. Simple Loop Analysis
9. Nested Loop 1 Analysis
10. Nested Loop 2 Analysis
11. Nested Loop 3 Analysis
12. Bubble Sort Analysis
13. Binary Search Analysis
14. Recursive Complexity Analysis (Factorial)
15. Sum of N Numbers Analysis
16. Fibonacci Analysis
17. Merge Sort Analysis
18. Recurrence Relation - Merge Sort
19. Power Function I - Analysis
20. Power Function II - Analysis
21. Power Function III - Analysis
22. How to approach Coding Questions
Practice Questions.pdf
2 pages
Solution for Practice Qs.pdf
1 page
22. Backtracking
15 attachments • 1 hrs
1. Introduction
2. Types of Backtracking
4. Find Subsets
6. Find Permutations
7. Find Permutations Code
9. N Queens - Time Complexity
10. N Queens - count ways
11. N Queens - print one solution
12. Grid Ways
13. Grid Ways Code
14. Grid Ways Trick
15. Sudoku
16. Sudoku Code
Practice Questions.pdf
3 pages
Solution for Practice Qs.pdf
5 pages
23. ArrayList
18 attachments • 2 hrs
1. Introduction to ArrayList
2. Operations on ArrayList
3. Size of ArrayList
4. Print Reverse of an ArrayList
5. Find Maximum in an ArrayList
6. Swap 2 Numbers
7. Sorting an ArrayList
8. ArrayList (Implementation in Java)
9. 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)
Practice Questions.pdf
3 pages
Solution for Practice Qs.pdf
4 pages
24. Linked List (Part 1)
15 attachments • 2 hrs
1. Introduction to Linked List
2. Head & Tail in LL
3. Add First in LL
4. Add Last in LL
5. Print a LL
6. Add in the Middle of LL
7. Size of a LL
8. Remove First in LL
9. 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)
17 attachments • 1 hrs
1. Detecting Cycle in LL
2. Detecting Cycle Code
3. Removing Cycle in LL
4. Removing Cycle Code
5. Removing Cycle Explanation (Math)
6. Java Collections Framework
7. LL in Collections Framework
8. Merge Sort on LL
9. Merge Sort on LL (Code)
10. Zig Zag Linked List
11. Zig Zag LL Code
12. Doubly LL
13. Reverse a Doubly LL
14. Circular LL (Approach)
Circular LInked List ( Reading Material)
8 pages
Practice Questions
3 pages
Solution for Practice Qs
11 pages
26. Stacks
18 attachments • 2 hrs
1. Stack Introduction
2. Stack using ArrayList
3. Stack using Linked List
4. Stack using Collections Framework
5. Push at Bottom of Stack
6. Reverse a String using a Stack
7. Reverse a Stack
8. Stock Span Problem
9. 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)
Practice Questions
2 pages
Solutions for Practice Qs
7 pages
27. Queues
16 attachments • 2 hrs
1. Introduction to Queues
2. Queues using Arrays
3. Circular Queue using Arrays
4. Queue using LL
5. Queue using JCF
6. Queue using Two Stacks
7. Stack using 2 Queues
8. First Non-Repeating Letter
9. 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
Practice Questions
2 pages
Solutions for Practice Qs
7 pages
28. Greedy Algorithms
15 attachments • 2 hrs
1. Introduction to Greedy
2. Activity Selection
3. Activity Selection Code
4. Activity Selection Explanation
5. Fractional Knapsack
6. Fractional Knapsack Code
7. Minimum Sum absolute difference pairs
8. Maximum length chain of pairs
9. Indian Coins
10. Job Sequencing Problem
11. Chocola Problem
12. Chocola Problem Code
Comparatos In Java (Reading Material).pdf
3 pages
Practice Questions.pdf
2 pages
Solutions for Practice Qs.pdf
5 pages
29. Binary Trees (Part 1)
14 attachments • 1 hrs
1. Introduction to Binary Trees
2. Levels & Sub-trees in a Tree
3. Pop Quiz
4. Build Tree Preorder
5. Build Tree Preorder Code
6. Preorder Traversal
7. Inorder Traversal
8. Postorder Traversal
9. 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 attachments • 1 hrs
1. Diameter of a Tree (Approach1)
2. Diameter of a Tree (Approach2)
3. Subtree of another tree
4. Subtree of another tree Code
5. Top View of a Tree (Basics)
6. Top View of a Tree (Approach)
7. Top View of a Tree (Code)
31. Binary Trees (Part 3)
8 attachments • 1 hrs
1. Kth Level of a Tree
2. Lowest Common Ancestor (Approach1)
3. Lowest Common Ancestor (Approach2)
4. Minimum Distance between 2 Nodes
5. Kth ancestor of Node
6. Transform to Sum Tree
Practice Questions
3 pages
Solutions for Practice Qs
8 pages
32. Binary Search Trees (Part 1)
9 attachments • 1 hrs
1. Introduction
2. Concept of Search in BST
3. Build a BST
4. Search in a BST
5. Delete a Node
6. Print in Range
7. Root to Leaf Path
8. Validate BST
9. Mirror a BST
33. Binary Search Trees (Part 2)
9 attachments • 1 hrs
1. Sorted Array to Balanced BST
2. Convert BST to Balanced BST
3. Size of Largest BST in BT
4. Size of Largest BST in BT (Code)
5. Merge 2 BSTs
AVL Trees (Reading Material).pdf
7 pages
Practice Questions.pdf
3 pages
BST Solutions.pdf
10 pages
Solutions for Practice Qs.pdf
10 pages
34. Heaps
15 attachments • 1 hrs
1. Introduction to Priority Queues
2. PQ in JCF
3. PQ for Objects
4. Introduction to Heaps
5. Heap Implementation (using CBT)
6. Insert in Heap
7. Peek From Heap
8. Remove from Heap
9. Heap Sort
10. Nearby Cars
11. Connect N Ropes with Minimum Cost
12. Weakest Soldier
13. Sliding Window Maximum
Practice Questions.pdf
2 pages
Solutions for Practice Qs.pdf
8 pages
35. Hashing
23 attachments • 2 hrs
1. Hashing Introduction
2. HashMap
3. HashMap Operations
4. Iteration on HashMaps
5. HashMap Implementation
6. HashMap Implementation Code
7. Special Note
8. Linked HashMap
9. TreeMap
9_Comparison Table_
10. Majority Element
11. Valid Anagram
12. HashSet
13. Iteration on HashSets
14. Linked HashSet
15. TreeSet
16. Count Distinct Elements
17. Union & Intersection
18. Find Itinerary for Tickets
19. Largest Subarray with Sum 0
20. Subarray Sum Equal to K
Practice Questions.pdf
2 pages
Solutions for Practice Qs.pdf
4 pages
36. Tries
12 attachments • 1 hrs
1. Tries Introduction
2. What is a Trie_
3. Creating a Trie
4. Insertion
5. Searching
6. Word Break Problem
7. Prefix Problem
8. startsWith Problem
9. Unique Substrings
10. Longest Word with all Prefixes
Tries Questions
1 page
Tries Solutions
4 pages
37. Graphs (Part 1)
8 attachments • 53 mins
1. Introduction to Graphs
2. Types of Graphs (Based on Edge)
3. Graph Representations
4. Graph Applications
5. Creating a Graph (Adjacency List)
6. BFS (Breadth First Search)
7. DFS (Depth First Search)
8. Has Path_ (using DFS)
38. Graphs (Part 2)
7 attachments • 1 hrs
1. Connected Components
2. Cycle in Graphs
3. Cycle Detection (Undirected graphs) - DFS
4. Bipartite Graph
5. Cycle Detection (Directed graph) - DFS
6. Extra Read
7. Topological Sorting (using DFS)
39. Graphs (Part 3)
5 attachments • 59.4 mins
1. Topological Sort using BFS (Kahn's Algorithm)
2. Topological Sort using BFS (Code)
3. All Paths from Source to Target
4. Dijkstra's Algorithm
5. Dijkstra's Algorithm (Code)
40. Graphs (Part 4)
5 attachments • 57 mins
1. Bellman Ford Algorithm
2. Bellman Ford (Code)
3. What is MST
4. Prim's Algorithm
5. Prim's Code
41. Graphs (Part 5)
9 attachments • 1 hrs
1. Cheapest Flights within K Stops
2. Cheapest Flights within K Stops (Code)
3. Connecting Cities
4. Connecting Cities (Code)
5. Disjoint Set Union
6. Kruskal's Algorithm
7. Flood Fill Algorithm
Practice Questions.pdf
3 pages
Solutions for Practice Qs.pdf
10 pages
42. Graphs - Supplements
3 attachments • 1 hrs
1. Strongly Connected Components (Kosaraju's Algorithm)
2. Bridge in Graph (Tarjan's Algorithm)
3. Articulation Point (Tarjan's Algorithm)
43. DP (Part 1)
8 attachments • 1 hrs
1. Introduction to DP
2. What is DP (Definition)
3. Ways of DP
4. 7 Important Concepts
5. Climbing Stairs (Recursion)
6. Climbing Stairs (Memoization DP)
7. Climbing Stairs Variation
8. Climbing Stairs (Tabulation DP)
44. DP (Part 2)
7 attachments • 2 hrs
1. Types of Knapsack problems
2. 0-1 Knapsack (Recursion)
3. 0-1 Knapsack (Memoization)
4. 0-1 Knapsack (Tabulation)
5. Target Sum Subset (Tabulation)
6. Target Sum Subset (Code)
7. Unbounded Knapsack (Tabulation)
45. DP (Part 3)
5 attachments • 1 hrs
1. Coin Change (Live Class)
2. Rod Cutting
3. Longest Common Subsequence (Recursion)
4. LCS (Memoization)
5. LCS (Tabulation)
46. DP (Part 4)
5 attachments • 1 hrs
1. Longest Common Substring
2. Longest Increasing Subsequence
3. Edit Distance (Explanation)
4. Edit Distance (Code)
5. String Conversion
47. DP (Part 5)
6 attachments • 1 hrs
1. Wildcard Matching - Hard (Explanation)
2. Wildcard Matching (Code)
3. Catalan's Number (Recursion + Memoization)
4. Catalan's Number (Tabulation)
5. Count BSTs
6. Mountain Ranges
48. DP (Part 6)
9 attachments • 1 hrs
1. Basics of Matrices (Math)
2. Matrix Chain Multiplication (Recursion)
3. MCM (Memoization)
4. MCM (Tabulation)
5. Minimum Partitioning
6. Minimum Array Jumps (Explanation)
7. Minimum Array Jumps (Code)
Practice Questions.pdf
3 pages
Solutions for Practice Qs.pdf
5 pages
49. Segment Trees
7 attachments • 1 hrs
1. Segment Trees Introduction
3. Creation of ST
4. Queries on ST
2. Count & Meaning of Nodes
5. Update on ST
6. Max-Min Segment Tree (Creation)
7. Max-Min Segment Tree (Query-Update)
50. Study Material
6 attachments
Computer Networking Notes for Tech Placements
16 pages
DBMS_Notes
27 pages
DSA_QUES_SHEET
5 pages
Helpful Projects
2 pages
Operating System Notes
12 pages
Quantitative Aptitude-12
58 pages
Certification
When you complete this course you receive a ‘Certificate of Completion’ signed and addressed personally by me.
FAQs
How can I enrol in a course?
Enrolling in a course is simple! Just browse through our website, select the course you're interested in, and click on the "Enrol Now" button. Follow the prompts to complete the enrolment process, and you'll gain immediate access to the course materials.
Can I access the course materials on any device?
Yes, our platform is designed to be accessible on various devices, including computers, laptops, tablets, and smartphones. You can access the course materials anytime, anywhere, as long as you have an internet connection.
How can I access the course materials?
Once you enrol in a course, you will gain access to a dedicated online learning platform. All course materials, including video lessons, lecture notes, and supplementary resources, can be accessed conveniently through the platform at any time.
Can I interact with the instructor during the course?
Absolutely! we are committed to providing an engaging and interactive learning experience. You will have opportunities to interact with them through our community. Take full advantage to enhance your understanding and gain insights directly from the expert.
About the creator
Learn with PURE CODING MASTER
Greetings! I am the founder of Pure Coding Master, At Pure Coding Master, we are dedicated to empowering individuals with the knowledge and skills they need to excel in the tech industry. Whether you’re a beginner just starting out or a professional looking to enhance your skills, our comprehensive courses and resources are designed to meet your needs.
Learn with Shradha Khapra
Taught by Shradha Khapra
Co-founder, Apna College
Ex-Microsoft, Software Engineer
Google SPS, India
Rate this Course
₹ 499.00
₹6200
Order ID:
This course is in your library
What are you waiting for? It’s time to start learning!
Wait up!
We see you’re already enrolled in this course till Access for 730 days. Do you still wish to enroll again?
