Home
Courses
Blogs
Books
Internship
Services
Quizzes chevron_right Abouts chevron_right Contact T&C chevron_right Privacy Policy chevron_right Refunds Policy chevron_right
Login
Signup

Root to Leaf Path

Dear Sciaku Learner you are not logged in or not enrolled in this course.

Please Click on login or enroll now button.

If you have any query feel free to chat us!

Happy Coding! Happy Learning!

Lecture 395:- Root to Leaf Path

1. Welcome to Alpha

1. ALPHA Launched
2. ALPHA INTRODUCTION

2. Course Introduction

1. Path to Placement
2. What will you learn
3. Prerequisites

3. Prerequisites - Installation Resources

1. What to Install on your laptop

4. Flowcharts & Pseudocodes

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

5. Live Mentorship Sessions

1. (For New Students) Bonus Live Session
2. Bonus Live Session with Aman Dhatterwal
3. Mentorship Session 1
4. Mentorship Session 2
5. Mentorship Session - 3 (Resume)
6. Bonus Live Session (on Linkedin)
7. Manual Recording August Live Session testing
8. Manual Recording 16th aug Bonus Live Session with Aman
9. Manual Recording Bonus Live Class ( patterns problem discussed)
10. Manual Recording Mentorship_Session_2_Shardha_Didi
11. Manual Recording Part 1 22 August Live
12. Manual Recording Part 2 22 August Live

6. Variable & Data Structure

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)
11. PRODUCTS OF A & B
12. Area Of Circle
13. Type Conversion
14. Type Casting
15. Type Promotion Expression
16. How Does Java Code Run
17. Variables Questions

7. Operators

1. Types Of Operators
2. Arithmetic Operators
3. Unary Operators
4. Relational Operators
5. Logical Operators
6. Assignment Operator

8. Conditional Statement

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
9. Switch Statement
10. Calculator
11. Conditional Questions
12. Conditional Solutions

9. Loops (Flow Control)

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
16. Loops Questions
17. Loops Solutions

10. Patterns (Part- I)

1. Print Star Pattern
2. Print Inverted Star Pattern
3. Print Half-Pyramid Pattern
4. Print Character Pattern
5. Special Note
6. Looking Forward - Advanced Pattern

11. Function & Methods

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
23. Functions Questions
24. Functions SOLUTIONS

12. Pattern Advanced (Part - II)

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 Pattern
11. Bonus LIVE Class

13. Arrays

1. Introduction
2. IntroductionArrays-Creation
3. Arrays as Function Argument
4. 4.1 Space & Time Complexity
5. Linear Search
6. Largest in array
7. Binary Search Code
8. Reverse In Array
9. Pairs In Array
10. Print Sub-Array
11. Max-Subarray Sum - I (Brute Force)
12. Max-Subarray Sum - II (Prifix Sum)
13. Max-Subarray Sum - III (Kadane's Algorithm)
14. Trapping Rainwater
15. Trapping Rainwater - Code
16. Best Time To Buy & Sell Stocks
17. Arrays - Solution

14. Basic Sorting Algorithm

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. Counting Sort
9. Counting Sort Code
10. Basic Sorting Questions
11. Basic Sorting Solutions

15. 2-D Arrays

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
11. Question
12. 2D ARRAY Solution

16. Strings

1. What are Strings
2. Input Output
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
15. String Question
16. String Solution

17. Bit Manipulation

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
21. Question
22. Solution

18. Oops

1. Classes & Objects
2. Access Modifiers
3. Getters & Setters
4. Encapsulation
5. Constructors
6. Type of Constructors
7. Copy Constructor
8. Copy Constructor 2
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
25. Question.pdf
26. Solution.pdf

19. Recursion

1. What is Recursion
2. Print numbers in decreasing order
3. Stack overflow video
4. Print numbers in increasing order
5. Find Factorial of N video
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
20. Question.pdf
21. Solution.pdf

20. Divide and Conquer

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
9. Question.pdf
10. Solution.pdf

21. Time Complexity

1. Basics of Time Complexity and Space Complexity
2. Big O Notation
3. Nested Loop 2 Analysis
4. Nested Loop 3 Analysis video
5. Bubble Sort Analysis video
6. Power Function I - Analysis
7. How To Approach Coding Question

22. Backtracking

1. Introduction
2. Types of Backtracking
3. Backtracking on Arrays
4. Find Subsets
5. Find Subsets Code
6. Find Permutations
7. Find Permutations Code
8. N Queens - all ways
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
17. BACKTRACKING Questions.pdf
18. BACKTRACKING Solutions .pdf

23. Array List

1. Introduction To ArrayList
2. Operations
3. Size Of AL
4. Print Reverse Of An ArrayList
5. Find Maximum In An ArrayList
6. Swap 2 Numbers
7. Sorting An ArrayList
8. Implementation
9. Multi Dimensional ArrayList
10. Container With Most Water
11. Container With Most Water 2
12. How is this Different Than Trapping Rainwater
13. Pair Sum 1
14. Pair Sum-1 (2 Pointer Approch)
15. Pair Sum - 2
16. Pair Sum - 2 Code
17. ArrayList Questions .pdf
18. ArrayList Solutions .pdf

24. Linked List(Part - I)

1. Introduction To LinkedList
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 LL
8. Remove First In LL
9. Remove Last In LL
10. Iterative Search
11. Recursive Search
12. Reverse A LinkedList
13. Find And Remove Nth Row From The End
14. Check If LL Is Palindrome
15. Check If LL Is Palindrome code

25. Linked List (Part-II)

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)

26. Stacks

1. Stack Introduction
2. Stack Using ArrayList
3. Stack Using LinkedList
4. Stack Using Collections Framework
5. Push At Bottom Of Stack
6. Reverse A String Using Stack
7. Reverse A Stack
8. Stock Span Problem
9. Next Greater Element
10. Next Greater Element Code
11. Valid Parenthesis
12. Valid Parenthesis Code
13. Duplicate Parenthesis
14. Duplicate Parenthesis Code
15. Maximum Rectangular Area In Histogram
16. Maximum Rectangular Area In Histogram Code

27. Queues

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 Two 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

28. Greedy Algorithms

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
13. Comparatos In Java
14. Greedy_questions
15. Greedy-Solutions

29. Binary Trees (Part - I)

1. Introduction to Binary Trees
2. Build Tree Preorder Code
3. Preorder Traversal
4. Postorder Traversal
5. Level order Traversal
6. Height of a Tree
7. Count Nodes of a Tree
8. Diameter of a Tree (Approach1)

30. Binary Trees (Part - II)

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 - III)

1. Kth Level video
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
7. Question
8. Solution

32. Binary Search Trees (Part - I)

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)

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
6. AVL Trees
7. AVL Trees in Java
8. Red Black Trees in Java
9. BST Questions
10. BST Solutions

34. Heaps

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
14. Heap Questions
15. Heap Solutions

35. Hashing

1. Hashing Introduction
2. Hashmap
3. Hashmap Operations
4. Iterations on HashMaps
5. HashMap Implementation
6. HashMap Implementation Code
7. Special Note
8. LinkedHashMap
9. TreeMap
10. TreeMap Majority Element
11. TreeMap Comparison Table
12. Valid Anagram
13. HashSet
14. Iteration on HashSets
15. LinkedHashSet
16. TreeSet
17. Count Distinct Element
18. Union and Intersection
19. Find Itinerary for Tickets
20. Largest SubArray with sum 0
21. SubArray Sum equal to K
22. Hashing Questions
23. Hashing Solutions

36. Tries

1. Tries Introduction
2. What is Trie
3. Creating a Trie
4. Insertion
5. Searching
6. Word Break Problem
7. Prefix Problem

37. Graphs (Part -1)

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)

1. Extra Read

39. Graphs (Part - 3)

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. Dynamic Programming

1. Dynamic Programming 1
2. 0/1 Knapsack Problem
3. Rod Cutting Problem
4. Longest Common Substring Problem
5. Wildcard Matching Problem
6. Matrix Chain Problem

41. Segment Trees

1. Segment Trees

42. Study Material (Alpha)

1. DSA_QUES_SHEET
2. Helpful Projects

1 Comment

shriyashj68 May 19, 2024 at 7:33 PM

How you system work after payment you give me a download link for the course or i just need to attend online

admin79 May 30, 2024 at 9:17 PM

Online lecture and download link also available.

Frequently Asked Questions About Sciaku Courses & Services

Quick answers to common questions about our courses, quizzes, and learning platform

How do I register on Sciaku.com?

Course Related 1 min read

expand_more

To register on Sciaku.com, click on the "Signup" button on the homepage, fill in the required information, and create your account. Once registered, you can log in using your credentials.

Still need help? Contact us

How can I enroll in a course on Sciaku.com?

Course Related 1 min read

expand_more

After logging in, browse the available courses, and click on the desired course. On the course page, click the "Enroll" button. You'll gain access to the course materials and resources.

Still need help? Contact us

Are there free courses available on Sciaku.com?

Course Related 1 min read

expand_more

Yes, Sciaku.com offers a variety of free courses. You can explore and enroll in these courses without any payment.

Still need help? Contact us

How do I purchase a paid course on Sciaku.com?

Course Related 1 min read

expand_more

To purchase a paid course, click on the course you're interested in, and choose the "Purchase" option. Follow the on-screen instructions to complete the payment process securely.

Still need help? Contact us

What payment methods are accepted on Sciaku.com?

Course Related 1 min read

expand_more

Sciaku.com accepts various payment methods, including credit/debit cards and other secure online payment options. Ensure your preferred payment method is supported during the checkout process.

Still need help? Contact us

How will I access the course content after purchasing a course?

Course Related 1 min read

expand_more

Upon successful payment, you will be granted access to the course immediately. Simply log in to your account, go to the "My Courses" section, and start learning from the course materials.

Still need help? Contact us

How long do I have access to a purchased course on Sciaku.com?

Course Related 1 min read

expand_more

Once you've purchased a course, you'll have lifetime access to it. You can revisit the course materials and resources at any time.

Still need help? Contact us

How do I contact the admin for assistance or support?

Course Related 1 min read

expand_more

If you need assistance, contact our support team by navigating to the "Contact Us" page. Fill out the form, and our admin will respond to your inquiries promptly.

Still need help? Contact us

Can I get a refund for a course I've purchased?

Course Related 1 min read

expand_more

Refund policies may vary. Please refer to our "Refund Policy" page for detailed information on the conditions and process for obtaining a refund.

Still need help? Contact us

How does the admin grant access to a course after payment?

Course Related 1 min read

expand_more

Upon successful payment, our admin team will verify the transaction, and once confirmed, they will grant you access to the purchased course. This process is typically completed within a short period.

Still need help? Contact us

Didn't find what you're looking for?

help_center Contact Support

Sciaku (सियाकु)

Sciaku (सियाकु) provides you a technical and programming content like Java Programming, Python Programming, C Programming,Android Development, Web Development, etc. Learn how to make software, website, and applications here and also we have industrial internship for you.

Important Links

Useful links

Contact

G20, Gopal Vihar Colony, Noida Sector 2, Uttar Pradesh, India, 201301

[email protected]

Copyright © 2022-2025 Created by ❤️ Sciaku

Privacy Policy | Terms & Conditions | Refunds Policy

Free Technical | Programming Courses with Certificates | Sciaku

Logout

Explore Sciaku - Home

Discover Free Online Courses

Read Latest Tech Articles and Tutorials

Access Best Free Books and Resources

Internship

Login to Your Sciaku Account

Create a Sciaku Account

If you complete this course goto My learning.