diff --git a/DataStructures/Graphs/A_Star.java b/DataStructures/Graphs/A_Star.java index 014161025..4116fce89 100644 --- a/DataStructures/Graphs/A_Star.java +++ b/DataStructures/Graphs/A_Star.java @@ -2,9 +2,8 @@ Time Complexity = O(E), where E is equal to the number of edges */ -package Graphs; +package DataStructures.Graphs; -import java.lang.reflect.Array; import java.util.*; public class A_Star { diff --git a/DataStructures/Graphs/DIJSKSTRAS_ALGORITHM.java b/DataStructures/Graphs/DIJSKSTRAS_ALGORITHM.java index d04a855e9..928281602 100644 --- a/DataStructures/Graphs/DIJSKSTRAS_ALGORITHM.java +++ b/DataStructures/Graphs/DIJSKSTRAS_ALGORITHM.java @@ -4,9 +4,6 @@ for better understanding */ package DataStructures.Graphs; -import java.util.*; -import java.io.*; - class dijkstras{ int k=9; diff --git a/DataStructures/Graphs/KahnsAlgorithm.java b/DataStructures/Graphs/KahnsAlgorithm.java index 0dfd2f8b3..eac840340 100644 --- a/DataStructures/Graphs/KahnsAlgorithm.java +++ b/DataStructures/Graphs/KahnsAlgorithm.java @@ -1,4 +1,4 @@ -package Graphs; +package DataStructures.Graphs; import java.util.ArrayList; import java.util.Map; @@ -104,7 +104,6 @@ class TopologicalSort>{ */ ArrayList topSortOrder(){ calculateInDegree(); - int count = 0; Queue q = new LinkedList(); for(E vertex: inDegree.keySet()){ diff --git a/DataStructures/Graphs/Kruskal.java b/DataStructures/Graphs/Kruskal.java index 941f30593..3c8f6e44c 100644 --- a/DataStructures/Graphs/Kruskal.java +++ b/DataStructures/Graphs/Kruskal.java @@ -1,3 +1,5 @@ +package DataStructures.Graphs; + // Problem -> Connect all the edges with the minimum cost. // Possible Solution -> Kruskal Algorithm (KA), KA finds the minimum-spanning-tree, which means, the // group of edges with the minimum sum of their weights that connect the whole graph. diff --git a/DataStructures/Lists/RemoveDuplicateNodes.java b/DataStructures/Lists/RemoveDuplicateNodes.java index 4eb12de29..944f7b174 100644 --- a/DataStructures/Lists/RemoveDuplicateNodes.java +++ b/DataStructures/Lists/RemoveDuplicateNodes.java @@ -1,7 +1,5 @@ package DataStructures.Lists; -import DataStructures.Lists.Node; - public class RemoveDuplicateNodes { public Node deleteDuplicates(Node head) { diff --git a/DataStructures/Queues/CircularQueue.java b/DataStructures/Queues/CircularQueue.java index 5e9bbe088..355cd8724 100644 --- a/DataStructures/Queues/CircularQueue.java +++ b/DataStructures/Queues/CircularQueue.java @@ -1,3 +1,5 @@ +package DataStructures.Queues; + //This program implements the concept of CircularQueue in Java //Link to the concept: (https://en.wikipedia.org/wiki/Circular_buffer) diff --git a/DataStructures/Trees/BSTIterative.java b/DataStructures/Trees/BSTIterative.java index 8c8e254be..7cf283db9 100644 --- a/DataStructures/Trees/BSTIterative.java +++ b/DataStructures/Trees/BSTIterative.java @@ -1,3 +1,5 @@ +package DataStructures.Trees; + /** * * diff --git a/DataStructures/Trees/BSTRecursive.java b/DataStructures/Trees/BSTRecursive.java index a228326b4..b6536a7b8 100644 --- a/DataStructures/Trees/BSTRecursive.java +++ b/DataStructures/Trees/BSTRecursive.java @@ -1,3 +1,5 @@ +package DataStructures.Trees; + /** * * diff --git a/DataStructures/Trees/LCA.java b/DataStructures/Trees/LCA.java index 0f3d63de3..ffadd6a97 100644 --- a/DataStructures/Trees/LCA.java +++ b/DataStructures/Trees/LCA.java @@ -1,4 +1,4 @@ -package Trees; +package DataStructures.Trees; import java.util.ArrayList; import java.util.Scanner; diff --git a/DivideAndConquer/BinaryExponentiation.java b/DivideAndConquer/BinaryExponentiation.java index b5844b8d9..623a30aeb 100644 --- a/DivideAndConquer/BinaryExponentiation.java +++ b/DivideAndConquer/BinaryExponentiation.java @@ -1,3 +1,5 @@ +package DivideAndConquer; + public class BinaryExponentiation { public static void main(String args[]) { diff --git a/DivideAndConquer/ClosestPair.java b/DivideAndConquer/ClosestPair.java index 48cbfc58a..48a2950e8 100644 --- a/DivideAndConquer/ClosestPair.java +++ b/DivideAndConquer/ClosestPair.java @@ -1,7 +1,5 @@ package DivideAndConquer; -import java.io.IOException; - /** * For a set of points in a coordinates system (10000 maximum), ClosestPair class calculates the two * closest points. diff --git a/DivideAndConquer/StrassenMatrixMultiplication.java b/DivideAndConquer/StrassenMatrixMultiplication.java index 2608d5a3b..6bd48b524 100644 --- a/DivideAndConquer/StrassenMatrixMultiplication.java +++ b/DivideAndConquer/StrassenMatrixMultiplication.java @@ -1,3 +1,5 @@ +package DivideAndConquer; + // Java Program to Implement Strassen Algorithm // Class Strassen matrix multiplication diff --git a/DynamicProgramming/DiceThrow.java b/DynamicProgramming/DiceThrow.java index 1bf1a715e..415f4a63c 100644 --- a/DynamicProgramming/DiceThrow.java +++ b/DynamicProgramming/DiceThrow.java @@ -1,3 +1,5 @@ +package DynamicProgramming; + // Given N dice each with M faces, numbered from 1 to M, find the number of ways to get sum X. // X is the summation of values on each face when all the dice are thrown. @@ -14,9 +16,6 @@ Following is implementation of Dynamic Programming approach. */ // Code ----> // Java program to find number of ways to get sum 'x' with 'n' // dice where every dice has 'm' faces -import java.util.*; -import java.lang.*; -import java.io.*; class DP { /* The main function that returns the number of ways to get sum 'x' with 'n' dice and 'm' with m faces. */ diff --git a/DynamicProgramming/LongestPalindromicSubsequence.java b/DynamicProgramming/LongestPalindromicSubsequence.java index a7a62891c..0626c208b 100644 --- a/DynamicProgramming/LongestPalindromicSubsequence.java +++ b/DynamicProgramming/LongestPalindromicSubsequence.java @@ -1,7 +1,4 @@ -package test; - -import java.io.*; -import java.util.*; +package DynamicProgramming; /** * Algorithm explanation https://www.educative.io/edpresso/longest-palindromic-subsequence-algorithm diff --git a/DynamicProgramming/LongestPalindromicSubstring.java b/DynamicProgramming/LongestPalindromicSubstring.java index 5bef01eb1..165256767 100644 --- a/DynamicProgramming/LongestPalindromicSubstring.java +++ b/DynamicProgramming/LongestPalindromicSubstring.java @@ -1,7 +1,4 @@ -package test; - -import java.io.*; -import java.util.*; +package DynamicProgramming; /* * Algorithm explanation https://leetcode.com/problems/longest-palindromic-substring/ diff --git a/DynamicProgramming/MinimumSumPartition.java b/DynamicProgramming/MinimumSumPartition.java index 745d22a1b..c47984dbc 100644 --- a/DynamicProgramming/MinimumSumPartition.java +++ b/DynamicProgramming/MinimumSumPartition.java @@ -15,9 +15,6 @@ Subset1 = {7, 46} ; sum of Subset1 = 53 Subset2 = {36, 40} ; sum of Subset2 = 76 */ -import java.io.*; -import java.util.*; - public class MinimumSumPartition { public static int subSet(int[] arr) { int n = arr.length; diff --git a/DynamicProgramming/PalindromicPartitioning.java b/DynamicProgramming/PalindromicPartitioning.java index c46616469..e11837622 100644 --- a/DynamicProgramming/PalindromicPartitioning.java +++ b/DynamicProgramming/PalindromicPartitioning.java @@ -1,4 +1,7 @@ package DynamicProgramming; + +import java.util.Scanner; + /** * @file * @brief Implements [Palindrome @@ -16,9 +19,6 @@ package DynamicProgramming; * "aba | b | bbabb | ababa" * @author [Syed] (https://github.com/roeticvampire) */ - -import java.util.Scanner; - public class PalindromicPartitioning { public static int minimalpartitions(String word){ @@ -31,7 +31,7 @@ public class PalindromicPartitioning { int[] minCuts = new int[len]; boolean[][] isPalindrome = new boolean[len][len]; - int i, j, k, L; // different looping variables + int i, j, L; // different looping variables // Every substring of length 1 is a palindrome for (i = 0; i < len; i++) { diff --git a/DynamicProgramming/ShortestCommonSupersequenceLength.java b/DynamicProgramming/ShortestCommonSupersequenceLength.java index bca31746b..8948bde50 100644 --- a/DynamicProgramming/ShortestCommonSupersequenceLength.java +++ b/DynamicProgramming/ShortestCommonSupersequenceLength.java @@ -1,3 +1,5 @@ +package DynamicProgramming; + // Java program to find length of the shortest supersequence class ShortestSuperSequence { diff --git a/DynamicProgramming/Sum_Of_Subset.java b/DynamicProgramming/Sum_Of_Subset.java index a1dc24b34..7faa11600 100644 --- a/DynamicProgramming/Sum_Of_Subset.java +++ b/DynamicProgramming/Sum_Of_Subset.java @@ -1,3 +1,5 @@ +package DynamicProgramming; + public class Sum_Of_Subset { public static void main(String[] args){ diff --git a/Maths/AutomorphicNumber.java b/Maths/AutomorphicNumber.java index 9308073cb..c0fac2a53 100644 --- a/Maths/AutomorphicNumber.java +++ b/Maths/AutomorphicNumber.java @@ -1,3 +1,5 @@ +package Maths; + /** * A number is said to be an Automorphic, if it is present in the last digit(s) of its square. * Example- Let the number be 25, its square is 625. diff --git a/Maths/CircularConvolutionFFT.java b/Maths/CircularConvolutionFFT.java index 6c7c2c7e1..dc207489e 100644 --- a/Maths/CircularConvolutionFFT.java +++ b/Maths/CircularConvolutionFFT.java @@ -1,4 +1,4 @@ -package com.maths; +package Maths; import java.util.ArrayList; diff --git a/Maths/Convolution.java b/Maths/Convolution.java index 42757dbb5..f96811735 100644 --- a/Maths/Convolution.java +++ b/Maths/Convolution.java @@ -1,4 +1,4 @@ -package com.maths; +package Maths; /** * Class for linear convolution of two discrete signals diff --git a/Maths/ConvolutionFFT.java b/Maths/ConvolutionFFT.java index f1d595087..e43db72af 100644 --- a/Maths/ConvolutionFFT.java +++ b/Maths/ConvolutionFFT.java @@ -1,4 +1,4 @@ -package com.maths; +package Maths; import java.util.ArrayList; diff --git a/Maths/FFT.java b/Maths/FFT.java index bdf8444e7..30c8cfbdf 100644 --- a/Maths/FFT.java +++ b/Maths/FFT.java @@ -1,4 +1,4 @@ -package com.maths; +package Maths; import java.util.ArrayList; import java.util.Collections; diff --git a/Maths/FFTBluestein.java b/Maths/FFTBluestein.java index 4a571916d..06e87b15b 100644 --- a/Maths/FFTBluestein.java +++ b/Maths/FFTBluestein.java @@ -1,4 +1,4 @@ -package com.maths; +package Maths; import java.util.ArrayList; diff --git a/Maths/GenericRoot.java b/Maths/GenericRoot.java index 090922034..67074177b 100644 --- a/Maths/GenericRoot.java +++ b/Maths/GenericRoot.java @@ -1,3 +1,5 @@ +package Maths; + /* * Algorithm explanation: https://technotip.com/6774/c-program-to-find-generic-root-of-a-number/#:~:text=Generic%20Root%3A%20of%20a%20number,get%20a%20single%2Ddigit%20output.&text=For%20Example%3A%20If%20user%20input,%2B%204%20%2B%205%20%3D%2015. */ diff --git a/Maths/KeithNumber.java b/Maths/KeithNumber.java index e0d2ec896..d4a3e83c8 100644 --- a/Maths/KeithNumber.java +++ b/Maths/KeithNumber.java @@ -1,4 +1,7 @@ -import java.util.*; +package Maths; + +import java.util.*; + class KeithNumber { //user-defined function that checks if the given number is Keith or not diff --git a/Maths/KrishnamurthyNumber.java b/Maths/KrishnamurthyNumber.java index 4d3d48aad..130914226 100644 --- a/Maths/KrishnamurthyNumber.java +++ b/Maths/KrishnamurthyNumber.java @@ -1,4 +1,4 @@ -//package Maths; +package Maths; /* This is a program to check if a number is a Krishnamurthy number or not. A number is a Krishnamurthy number if the sum of the factorials of the digits of the number is equal to the number itself. diff --git a/Maths/MagicSquare.java b/Maths/MagicSquare.java index 70cbaf060..289e8e7b8 100644 --- a/Maths/MagicSquare.java +++ b/Maths/MagicSquare.java @@ -1,4 +1,7 @@ +package Maths; + import java.util.*; + /*A magic square of order n is an arrangement of distinct n^2 integers,in a square, such that the n numbers in all rows, all columns, and both diagonals sum to the same constant. A magic square contains the integers from 1 to n^2.*/ public class MagicSquare { diff --git a/Maths/RomanNumeralUtil.java b/Maths/RomanNumeralUtil.java index 661a2878b..77a8c2965 100644 --- a/Maths/RomanNumeralUtil.java +++ b/Maths/RomanNumeralUtil.java @@ -1,3 +1,5 @@ +package Maths; + /** * Translates numbers into the Roman Numeral System. * diff --git a/Misc/TwoSumProblem.java b/Misc/TwoSumProblem.java index 33bfbf4d2..0bea06f39 100644 --- a/Misc/TwoSumProblem.java +++ b/Misc/TwoSumProblem.java @@ -1,5 +1,8 @@ +package Misc; + import java.util.*; import java.util.stream.Collectors; + public class TwoSumProblem { public static void main(String args[]) { diff --git a/Misc/WordBoggle.java b/Misc/WordBoggle.java index 2a87b0d6e..85f70d21f 100644 --- a/Misc/WordBoggle.java +++ b/Misc/WordBoggle.java @@ -1,3 +1,5 @@ +package Misc; + import java.util.*; public class WordBoggle { diff --git a/Others/Implementing_auto_completing_features_using_trie.java b/Others/Implementing_auto_completing_features_using_trie.java index 32d443b8a..e33c64386 100644 --- a/Others/Implementing_auto_completing_features_using_trie.java +++ b/Others/Implementing_auto_completing_features_using_trie.java @@ -1,13 +1,7 @@ package Others; - // Java Program to implement Auto-Complete // Feature using Trie - -import java.util.*; -import java.io.*; -import java.lang.*; - class Trieac { // Alphabet size (# of symbols) diff --git a/Others/RabinKarp.java b/Others/RabinKarp.java index 7dafa00c7..6f9adf8a2 100644 --- a/Others/RabinKarp.java +++ b/Others/RabinKarp.java @@ -1,3 +1,5 @@ +package Others; + /** @author Prateek Kumar Oraon (https://github.com/prateekKrOraon) */ import java.util.Scanner; diff --git a/Others/RestrictedTowerOfHanoi/Main/Hanoi.java b/Others/RestrictedTowerOfHanoi/Main/Hanoi.java index 585649276..ab9e5b415 100644 --- a/Others/RestrictedTowerOfHanoi/Main/Hanoi.java +++ b/Others/RestrictedTowerOfHanoi/Main/Hanoi.java @@ -1,3 +1,5 @@ +package Others.RestrictedTowerOfHanoi.Main; + import java.awt.*; import java.awt.event.*; import java.util.*; diff --git a/Others/StringMatchFiniteAutomata.java b/Others/StringMatchFiniteAutomata.java index a6d3fbab4..f534fa812 100644 --- a/Others/StringMatchFiniteAutomata.java +++ b/Others/StringMatchFiniteAutomata.java @@ -1,3 +1,5 @@ +package Others; + /** @author Prateek Kumar Oraon (https://github.com/prateekKrOraon) */ import java.util.Scanner; diff --git a/Searches/howManyTimesRotated.java b/Searches/HowManyTimesRotated.java similarity index 96% rename from Searches/howManyTimesRotated.java rename to Searches/HowManyTimesRotated.java index 487df2e51..2efe50174 100644 --- a/Searches/howManyTimesRotated.java +++ b/Searches/HowManyTimesRotated.java @@ -1,3 +1,7 @@ +package Searches; + +import java.util.*; + /* Problem Statement: Given an array, find out how many times it has to been rotated @@ -19,10 +23,7 @@ 1. [1,2,3,4] Number of rotations: 0 or 4(Both valid) 2. [15,17,2,3,5] Number of rotations: 3 */ - -import java.util.*; - -class howManyTimesRotated +class HowManyTimesRotated { public static void main(String[] args) { @@ -42,11 +43,11 @@ class howManyTimesRotated int low = 0; int high = a.length-1; int mid=0; // low + (high-low)/2 = (low + high)/2 - int i=0; + while(low<=high) { mid = low + (high-low)/2; - i++; + if(a[mid]