Skip to content

A diverse collection of Java programs and algorithms covering data structures, encryption techniques, sorting algorithms, and more. Perfect for students, educators, and developers looking to explore fundamental and advanced computer science concepts.

Notifications You must be signed in to change notification settings

Shrinkhal01/JAVA-PROGRAMS

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

72 Commits
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

🌳 TreeHelp

This repository contains a diverse collection of Java programs and algorithms. The programs cover various data structures, sorting algorithms, encryption techniques, and other fundamental computer science concepts. This project is an excellent resource for students, educators, and developers looking to enhance their understanding of Java and its applications.

📂 Files and Directories

  • treehelp/: Directory containing files related to binary trees and related helper classes.

    • BinaryTree.java: Implementation of a binary tree.
    • Main.class: Compiled class file for the main program.
    • Main.java: Main program to test binary tree operations.
    • treehelper$Node.class: Compiled class file for the Node helper class.
    • treehelper.class: Compiled class file for the tree helper.
    • treehelper.java: Helper class for binary tree operations.
  • Miscellaneous Java Programs:

    • 2sum.java: Implementation of the two-sum problem.
    • Alterar.java: A sample Java program.
    • Array.java: Basic array operations.
    • AtomicDouble.java: Implementation of atomic double operations.
    • Binarytree.java: Another implementation of a binary tree.
    • Bubblesort.java: Implementation of bubble sort algorithm.
    • CC.java: A sample Java program.
    • CircularQ.java: Implementation of a circular queue.
    • CustomArray.java: Custom array operations.
    • CycleL.java: Implementation of cycle detection in linked lists.
    • Digits.java: A program to manipulate digits.
    • Eencrypter2.java, Encrypter.java, Encrypterto.java, Encryptertwo.java: Various encryption implementations.
    • Fate.java: A sample Java program.
    • Fdate.java: Date manipulation in Java.
    • GFG.java: GeeksforGeeks sample program.
    • Kadanes.java: Implementation of Kadane's algorithm.
    • LEADERPROBLEM.java: Solution to the leader problem in arrays.
    • LINKEDLIST.java: Linked list implementation.
    • Leaderp.java: Another implementation related to the leader problem.
    • Maxcone.java: Max cone problem.
    • Mergearrays.java: Merging arrays.
    • OOPS.java: Object-oriented programming concepts.
    • Printdvsr.java: Printing divisors of a number.
    • PriorityQ.java, PriotityQ.java: Implementation of priority queue.
    • QUEU.java: Basic queue operations.
    • QueueLL.java: Queue using linked lists.
    • QueueUsingStacks.java: Queue implementation using stacks.
    • Quicksort.java: Implementation of quick sort algorithm.
    • RSA.java: RSA encryption algorithm.
    • Repitiona.java: Handling repetitions in arrays.
    • Rotatea189.java: Rotating arrays.
    • Sample.java: A sample Java program.
    • Sdate.java: Date operations.
    • Stack1.java: Basic stack operations.
    • TDate.java, TTime.java: Date and time operations.
    • Tsum.java: Implementation of three-sum problem.
    • arraymerge.java: Merging arrays.
    • arrayrev.java: Reversing arrays.
    • bank_management.java: Bank management system.
    • binarysearch.java: Implementation of binary search algorithm.
    • cyclell.java: Cycle detection in linked lists.
    • duplctLL.java: Handling duplicates in linked lists.
    • findduplicate.java: Finding duplicates in arrays.
    • insertion.java: Insertion sort algorithm.
    • intersection.java, intersectionpoint.java: Finding intersections.
    • invtriangle.java: Inverting a triangle pattern.
    • kadanalgo.java: Kadane's algorithm.
    • linkedlist.java: Linked list implementation.
    • longcons.java: Finding longest consecutive sequence.
    • majority.java: Finding the majority element.
    • matrix.java: Matrix operations.
    • maxarray.java: Finding maximum in arrays.
    • mergell.java: Merging linked lists.
    • mergesortar.java: Merge sort algorithm.
    • middleel.java: Finding the middle element in linked lists.
    • numberLL.java: Operations on linked lists with numbers.
    • operatorovr.java: Operator overloading in Java.
    • p1.java: A sample Java program.
    • palindromeLL.java: Palindrome check in linked lists.
    • pattern.java, pattern2.java: Generating patterns.
    • pbq.java: Priority-based queue.
    • plnmladd.java: Polynomial addition.
    • posteval.java: Postfix evaluation.
    • postpre.java: Postfix and prefix operations.
    • queueint.java: Queue operations with integers.
    • rectangle.java: Rectangle operations.
    • remdup.java: Removing duplicates.
    • reversear.java: Reversing arrays.
    • revqueue.java: Reversing queues.
    • rotate90.java: Rotating matrices by 90 degrees.
    • rotatear.java: Rotating arrays.
    • secar.java: Second largest element in arrays.
    • secondlrg.java: Finding the second largest element.
    • segregatezo.java: Segregating zeros and ones.
    • selectionsort.java: Selection sort algorithm.
    • setrc.java, setrczero.java: Setting rows and columns.
    • sgrgtzo.java: Segregating zeros.
    • shape.java, shapee.java: Shape-related operations.
    • simpleq.java, simpleque.java: Simple queue operations.
    • simplestack.java: Simple stack operations.
    • solid.java: Solid shapes operations.
    • sortzot.java: Sorting zeros, ones, and twos.
    • stackarray.java: Stack implementation using arrays.
    • stock121.java: Stock span problem.
    • subarraysm.java: Subarray sum problem.
    • threesum.java, thsum.java: Three-sum problem.

⚙️ Installation and Setup

  1. Clone the repository to your local machine:
    git clone https://github.com/your-username/treehelp.git
    cd treehelp

(a).Compile any of the Java files using javac:

javac BinaryTree.java

(b) Run the compiled Java program

java BinaryTree

🛠 Using the Programs

Each file in this repository is a standalone Java program. You can explore the code, modify it, and run it to see how different algorithms and data structures work. For programs that require input, you can provide input through the console.

🤝 Contributing

Contributions are welcome! If you have any suggestions, bug fixes, or new features to add, feel free to open an issue or submit a pull request.

  1. Fork the repo
  2. Create a branch:
git checkout -b feature-newProgram
  1. Commit your changes:
git commit -m 'Add new program'
  1. Push to the branch:
git push origin feature-newProgram
  1. Submit a pull request

📜 License

This project is licensed under the MIT License. See the LICENSE file for more d

About

A diverse collection of Java programs and algorithms covering data structures, encryption techniques, sorting algorithms, and more. Perfect for students, educators, and developers looking to explore fundamental and advanced computer science concepts.

Topics

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages