Java Data Structures and Algorithms

Welcome to the Java Data Structures and Algorithms repository! This project is a comprehensive implementation of various Data Structures and Algorithms in Java, covering both fundamental concepts and advanced techniques.

Introduction

This repository serves as a resource for learning and implementing Data Structures and Algorithms in Java. Whether you are a beginner or an experienced developer looking to refresh your knowledge, this project provides examples and explanations for each topic.

Data Structures

Arrays

Basic array operations and manipulations.

Linked Lists

Singly linked lists, doubly linked lists, and circular linked lists.

Stacks

Implementation of stacks and common operations.

Queues

Different types of queues, including priority queues.

Trees

Binary trees, binary search trees (BST), and AVL trees.

Graphs

Representation of graphs and common algorithms like DFS and BFS.

Hash Tables

Basic hash table implementation and collision handling.

Heaps

Min and max heaps and heap sort.

Algorithms

Sorting

Bubble sort, selection sort, merge sort, quicksort, etc.

Searching

Linear search, binary search, and variations.

Recursion

Understanding and implementing recursive algorithms.

Dynamic Programming

Solving problems using dynamic programming techniques.

Greedy Algorithms

Solving optimization problems using greedy strategies.

Backtracking

Solving problems by exploring all possible solutions.

Graph Algorithms

Dijkstra's algorithm, Kruskal's algorithm, etc.

Advanced Data Structures

Trie

Trie data structure for efficient string manipulation.

Segment Tree

Building and querying segment trees.

Disjoint Set Union (Union-Find)

Efficiently merging and finding disjoint sets.

Binary Indexed Tree (Fenwick Tree)

Handling range queries and updates efficiently.

Usage

Clone the repository and explore the Java implementations of various Data Structures and Algorithms. Each folder contains detailed explanations and examples.

Contributing

Feel free to contribute by adding new implementations, optimizing existing code, or providing clearer explanations. Follow the contribution guidelines to get started.

License

This project is licensed under the MIT License.

Name		Name	Last commit message	Last commit date
Latest commit History 1 Commit
10 Type Promotion		10 Type Promotion
11 Question ( VARIABLES & DATA TYPE ) (i)		11 Question ( VARIABLES & DATA TYPE ) (i)
11 Question ( VARIABLES & DATA TYPE ) (ii)		11 Question ( VARIABLES & DATA TYPE ) (ii)
11 Question ( VARIABLES & DATA TYPE ) (iii)		11 Question ( VARIABLES & DATA TYPE ) (iii)
12 Arithmetic Operator		12 Arithmetic Operator
13 Unary Operator ( Increment & Decrement Operator )		13 Unary Operator ( Increment & Decrement Operator )
14 Relational Operator		14 Relational Operator
15 Logical Operator		15 Logical Operator
16 Assignment Operator		16 Assignment Operator
17 ( if - else Statement )		17 ( if - else Statement )
18 ( Print the Largest of 2 Number )		18 ( Print the Largest of 2 Number )
19 ( Print if number is Odd or Even )		19 ( Print if number is Odd or Even )
2 DataType		2 DataType
20 ( Else - if Statement )		20 ( Else - if Statement )
21 ( Income Tax Calculator )		21 ( Income Tax Calculator )
22 ( Print the largest of 3 num )		22 ( Print the largest of 3 num )
23 ( Ternary Operators )		23 ( Ternary Operators )
24 (Check if a student will Pass or Fail )		24 (Check if a student will Pass or Fail )
25 ( Switch Statement )		25 ( Switch Statement )
26 ( Calculator using Switch Case )		26 ( Calculator using Switch Case )
27 ( Check the number is Positive or Negative )		27 ( Check the number is Positive or Negative )
28 ( fever measering using temprature )		28 ( fever measering using temprature )
29 ( Using (1-7) switch case print week name )		29 ( Using (1-7) switch case print week name )
3 Sum of Two number		3 Sum of Two number
30 ( Year is leap year )		30 ( Year is leap year )
31 ( While Loop )		31 ( While Loop )
32 ( print no 1 to 10 )		32 ( print no 1 to 10 )
33 ( Print number 1 to n )		33 ( Print number 1 to n )
34 ( For Loop )		34 ( For Loop )
34 ( Sum of n natural number )		34 ( Sum of n natural number )
35 ( Print Square Pattern )		35 ( Print Square Pattern )
36 ( Print Reverse of a number )		36 ( Print Reverse of a number )
37 ( Reverse the given number )		37 ( Reverse the given number )
38 ( Do While Loop )		38 ( Do While Loop )
39 ( Break Keyword )		39 ( Break Keyword )
4 INPUT IN JAVA		4 INPUT IN JAVA
40 ( Break Question Practise)		40 ( Break Question Practise)
41 ( Continue Keyword )		41 ( Continue Keyword )
42 (Question of Continue Keyword )		42 (Question of Continue Keyword )
43 ( Check Number is Prime Or Not)		43 ( Check Number is Prime Or Not)
44 ( Read set of Integer and Print sum of odd and even Integer)		44 ( Read set of Integer and Print sum of odd and even Integer)
45 ( factorial of n number )		45 ( factorial of n number )
46 ( Pattern Printing )		46 ( Pattern Printing )
47 ( Pattern Inverted Star )		47 ( Pattern Inverted Star )
48 ( Half - Pyramid Pattern )		48 ( Half - Pyramid Pattern )
49 (Pattern character print)		49 (Pattern character print)
5 SUM OF A&B USING SCANNER CLASS		5 SUM OF A&B USING SCANNER CLASS
50 ( Function )		50 ( Function )
51 ( Syntax with parameters )		51 ( Syntax with parameters )
52 ( Product of a and b)		52 ( Product of a and b)
52 (call by value)		52 (call by value)
53 ( Factorial of n )		53 ( Factorial of n )
54 ( Binomial coffiecent )		54 ( Binomial coffiecent )
55 ( function Overloading Using Parameter )		55 ( function Overloading Using Parameter )
56 ( funtion Overloading uisng Data Type )		56 ( funtion Overloading uisng Data Type )
57( check Prime no using function )		57( check Prime no using function )
58 ( All Prime num in Range )		58 ( All Prime num in Range )
58 (Binary to Decimal Conversion)		58 (Binary to Decimal Conversion)
59 (Decimal to Binary Conversion)		59 (Decimal to Binary Conversion)
6 PRODUCT OF A_B		6 PRODUCT OF A_B
60 ( practise1 )		60 ( practise1 )
61 ( practise 2)		61 ( practise 2)
62 ( practise 3 )		62 ( practise 3 )
63 ( Practise 4 )		63 ( Practise 4 )
64 (advance Pattern 1 )		64 (advance Pattern 1 )
65 ( advance Pattern 2)		65 ( advance Pattern 2)
66 (advance pattern 3)		66 (advance pattern 3)
67 (advance Pattern 4)		67 (advance Pattern 4)
68 (advance pattern 5)		68 (advance pattern 5)
69		69
7 Area of Circle		7 Area of Circle
70 ( advance pattern 7)		70 ( advance pattern 7)
71(advance pattern 8)		71(advance pattern 8)
72 (advance pattern 9)		72 (advance pattern 9)
73 (advance pattern 10 )		73 (advance pattern 10 )
74 (advance pattern 11)		74 (advance pattern 11)
75 ( Arrays as function Argument )		75 ( Arrays as function Argument )
76 (Linear Search)		76 (Linear Search)
77 ( Largest in Array)		77 ( Largest in Array)
78 (Binary Search)		78 (Binary Search)
79(Reverse an array)		79(Reverse an array)
8 Type Conversion		8 Type Conversion
80 ( Pairs in Array)		80 ( Pairs in Array)
81 ( print Sub array )		81 ( print Sub array )
82 ( max Sub Array-sum )		82 ( max Sub Array-sum )
83(Sub Array pre-fixSum)		83(Sub Array pre-fixSum)
84(max_Subarray kadans sum)		84(max_Subarray kadans sum)
85(Trapped Rain Water)		85(Trapped Rain Water)
86 (Stock buy and sell)		86 (Stock buy and sell)
87 (Bubble Sort)		87 (Bubble Sort)
88 (Selection sort)		88 (Selection sort)
89 (Insertion Sort)		89 (Insertion Sort)
9 Type Casting		9 Type Casting
90 (Counting sort )		90 (Counting sort )
Array		Array
DiagonalSum		DiagonalSum
Ne.java		Ne.java
Program		Program
Spiral Matrix		Spiral Matrix
StaireCaseSearch		StaireCaseSearch

Provide feedback

Saved searches

Use saved searches to filter your results more quickly

Repository files navigation

Java Data Structures and Algorithms

Table of Contents

Introduction

Data Structures

Arrays

Linked Lists

Stacks

Queues

Trees

Graphs

Hash Tables

Heaps

Algorithms

Sorting

Searching

Recursion

Dynamic Programming

Greedy Algorithms

Backtracking

Graph Algorithms

Advanced Data Structures

Trie

Segment Tree

Disjoint Set Union (Union-Find)

Binary Indexed Tree (Fenwick Tree)

Usage

Contributing

License

About

Releases

Packages

Languages

License

saurabh-maurya1/Practise-DSA-main

Folders and files

Latest commit

History

Repository files navigation

Java Data Structures and Algorithms

Table of Contents

Introduction

Data Structures

Arrays

Linked Lists

Stacks

Queues

Trees

Graphs

Hash Tables

Heaps

Algorithms

Sorting

Searching

Recursion

Dynamic Programming

Greedy Algorithms

Backtracking

Graph Algorithms

Advanced Data Structures

Trie

Segment Tree

Disjoint Set Union (Union-Find)

Binary Indexed Tree (Fenwick Tree)

Usage

Contributing

License

About

Topics

Resources

License

Stars

Watchers

Forks

Releases

Packages 0

Languages

Packages