This is my all learning of Java and DSA

I have learned all the topics from basic to advance level of Java Programming Language. I have deep understaning of Object-Oriented Programming (OOPs) in Java and I also have deep knowledge of DSA in Java

I mention all the topics which I was learn, you can explore my learning and efforts toward my passion of coding

Explore All core and advanced topics of Java Programming

if-else	The if-else statement is a conditional control structure that executes different blocks of code based on whether a condition is true or false.
Switch	The switch statement allows multi-way branching based on the value of an expression. It replaces multiple if-else conditions for better readability.
While-loop	A while loop executes a block of code repeatedly as long as a specified condition is true.
Do While Loop	A do-while loop is similar to a while loop but ensures the block of code executes at least once before checking the condition.
For Loop	A for loop is a control structure that allows repeating a block of code for a specific number of times.
Break	The break statement is used to exit a loop or switch statement before it normally terminates.
Continue	The continue statement skips the current iteration and moves to the next iteration of the loop.
Operators	Operators are symbols that perform operations on variables and values.
Type-Casting	Type casting converts one data type into another. Implicit Casting (Widening): Automatically converts smaller data types to larger ones. Explicit Casting (Narrowing): Manually converts larger data types to smaller ones.
Function	A function (or method in Java) is a reusable block of code that performs a specific task.
Array	An array is a collection of elements of the same data type stored in contiguous memory locations.
String	A String is a sequence of characters, commonly used for text processing.
Bit Manipulation	Bit Manipulation involves operations on bits using bitwise operators (&, |, ^, ~, <<, >>).
Exceptions	An exception is an event that disrupts the normal flow of a program.

Explore all topics of OPPS Programming in Java

Class	A class is a blueprint or template for creating objects. It defines the properties (variables) and behaviors (methods) that an object can have.
Copy Constructor	A copy constructor is a special constructor used to create a new object as a copy of an existing object, ensuring that the new object has the same values as the original.
Parameteries Constructor	A parameterized constructor is a constructor that takes arguments to initialize an object with specific values at the time of its creation.
Non-Parameteries Constructor	A non-parameterized constructor (also called a default constructor) is a constructor that does not take any arguments and is used to initialize an object with default values.
Polymorphism	Polymorphism is the ability of a single function, method, or object to take multiple forms. It allows the same operation to be performed in different ways, typically through method overloading and method overriding.
Interface	An interface is a contract that defines a set of abstract methods that must be implemented by any class that adheres to it. It allows multiple classes to follow the same set of rules without enforcing implementation details.
Inheritence	Inheritance is the process by which a class (child/subclass) derives properties and behaviors from another class (parent/superclass). It promotes code reusability and hierarchy.
Abstraction	Abstraction is the concept of hiding implementation details and only showing the necessary features of an object. It allows users to interact with an object without needing to understand its complex internal workings.
Package	A package is a way to group related classes and interfaces together in an organized manner. It helps in preventing name conflicts and improving code maintainability.
Encapsulation	Encapsulation is the process of restricting direct access to certain details of an object and only allowing controlled access through public methods. It ensures data security and integrity.
Default Access Modifier	The default access modifier (also called package-private) means that a class, method, or variable is accessible only within the same package and not outside it.
Public Access Modifier	The public access modifier allows a class, method, or variable to be accessible from anywhere in the program, including different packages.
Private Access Modifier	The private access modifier restricts access to a class, method, or variable to only within the same class, making it inaccessible from outside the class.
Protected Access Modifier	The protected access modifier allows access within the same package and by subclasses in different packages, providing a balance between security and accessibility.
Static Keyword	The static keyword is used to define variables or methods that belong to the class rather than an instance of the class. Static members are shared among all instances of the class and can be accessed without creating an object.

Data Structures and Algorithms All topics

Bubble Sort	Bubble Sort is a simple sorting algorithm that repeatedly compares adjacent elements and swaps them if they are in the wrong order. This process continues until the array is sorted. It has a time complexity of O(n²) in the worst case.
Insertion Sort	Insertion Sort is a sorting algorithm that builds the sorted array one item at a time by picking the next element and placing it in its correct position. It is efficient for small or nearly sorted datasets, with a worst-case time complexity of O(n²).
Selection Sort	Selection Sort sorts an array by repeatedly finding the smallest element from the unsorted part and swapping it with the first unsorted element. It has a time complexity of O(n²).
Merge Sort	Merge Sort is a divide-and-conquer sorting algorithm that splits an array into smaller subarrays, sorts them recursively, and then merges them back together in sorted order. It has a time complexity of O(n log n).
Quick Sort	Quick Sort is a divide-and-conquer sorting algorithm that selects a pivot element, partitions the array into two subarrays (elements smaller and larger than the pivot), and recursively sorts them. It has an average time complexity of O(n log n).
Recursion	Recursion is a programming technique where a function calls itself to solve a problem. It breaks down complex problems into simpler subproblems and is commonly used in algorithms like factorial computation, Fibonacci sequence, and tree traversal.
ArrayList	An ArrayList is a dynamic array in Java that allows resizing and provides fast random access. Unlike regular arrays, it can grow or shrink dynamically as elements are added or removed.
LinkedList	A LinkedList is a data structure where elements (nodes) are stored in non-contiguous memory locations and are linked using pointers. It allows efficient insertions and deletions but has slower random access compared to an ArrayList.
Stack	A Stack is a linear data structure that follows the LIFO (Last In, First Out) principle. Elements are added (pushed) and removed (popped) from the top of the stack.
Queue	A Queue is a linear data structure that follows the FIFO (First In, First Out) principle. Elements are added at the rear and removed from the front.
Binary Tree	A Binary Tree is a hierarchical data structure in which each node has at most two children: a left child and a right child. It is used in searching, sorting, and hierarchical data representation.
Binary Search Tree	A Binary Search Tree (BST) is a special type of binary tree where the left child contains values smaller than the parent node, and the right child contains values greater than the parent node. It allows efficient searching, insertion, and deletion operations.
HashMap	A HashMap is a data structure that stores key-value pairs and allows fast access using a hash function. It provides an average time complexity of O(1) for search, insert, and delete operations.
HashSet	A HashSet is a collection that stores unique elements and does not allow duplicates. It is backed by a HashMap and provides an average time complexity of O(1) for basic operations.
Trie	A Trie (Prefix Tree) is a tree-based data structure used for storing and searching strings efficiently. It is commonly used in applications like autocomplete and dictionary lookups.
Graph	A Graph is a data structure consisting of nodes (vertices) and edges (connections between nodes). It can be directed or undirected and is widely used in networks, social connections, and pathfinding algorithms.

Solved Problems

Add Two Matrix

Array Rotation

Binary to Decimal

Subset of Int

Print Boundary Of Matrix

x to the power of n

Compare Similar Array

Combination Of Sum

Copy Array

Decimal to Binary

Determinant Of Matrix

Sum of Diagnoal of Matrix

Find Smallest in the Array

Find Largest in the Array

Find Distance of the String

Integer to Roman

Find Min and Max in Array

Find Normal and Trace of the Matrix

NQueen Problem

Alphabetical Characters Name to Mathamatical Digits

Roman to Integer

Ascending Sorting

Desending Sorting

Find Surface Area of Sphere

Spiral Order Matrix

Transpose of Matrix

Adult and Kiddish Finder

Calculator

Find Day Name by Day Number

Remove Dublicate Characters in String

Print Username

Tower of Hanoi

Subsequence

Unique Subsequence

Fibonacci Series

Keypad Combination

Move Maze

Permutations

Domino and Tromino Tiling

Sum of Nth Natural Number

Friends Pairing Problem

Reverse String

Print Table

Occurence of String

Topological Sorting

Prims Algoritham

Kosaraju Algorithm

Dijkstra Algorithms

Bellman Ford Algorithm

Articulation Point

Subarray Sum