Added author

Vishal023 · Vishal023 · commit 26f3a18a522d · 2020-05-25T10:22:12.000+05:30
diff --git a/Arrays/MinAdjacentDifferenceCircularArray.java b/Arrays/MinAdjacentDifferenceCircularArray.java
@@ -2,10 +2,13 @@
 
 import java.io.BufferedReader;
 import java.io.IOException;
-import java.io.InputStream;
 import java.io.InputStreamReader;
 import java.util.StringTokenizer;
 
+
+/**
+ * @author Vishal Singh */
+
 public class MinAdjacentDifferenceCircularArray {
     static class FastReader{
         BufferedReader br;
diff --git a/Arrays/ReverserArrayInGroup.java b/Arrays/ReverserArrayInGroup.java
@@ -1,6 +1,8 @@
 package SummerTrainingGFG.Arrays;
 
 import java.util.ArrayList;
+/**
+ * @author Vishal Singh */
 
 public class ReverserArrayInGroup {
     public static ArrayList<Integer> reverseInGroups(ArrayList<Integer> mv, int n, int k) {
diff --git a/Arrays/RotateArray.java b/Arrays/RotateArray.java
@@ -1,4 +1,6 @@
 package SummerTrainingGFG.Arrays;
+/**
+ * @author Vishal Singh */
 
 public class RotateArray {
     static void reverse(int arr[],int low,int high){
diff --git a/Arrays/StrongestNeighbour.java b/Arrays/StrongestNeighbour.java
@@ -1,4 +1,7 @@
 package SummerTrainingGFG.Arrays;
+/**
+ * @author Vishal Singh */
+
 public class StrongestNeighbour {
 
     static void maximumAdjacent(int sizeOfArray, int[] arr){
diff --git a/BitManipulation/BinaryToGray.java b/BitManipulation/BinaryToGray.java
@@ -1,4 +1,6 @@
 package SummerTrainingGFG.BitManipulation;
+/**
+ * @author Vishal Singh */
 
 public class BinaryToGray {
     static void convert(int n){
diff --git a/BitManipulation/CheckKthBitSetOrNot.java b/BitManipulation/CheckKthBitSetOrNot.java
@@ -1,4 +1,6 @@
 package SummerTrainingGFG.BitManipulation;
+/**
+ * @author Vishal Singh */
 
 public class CheckKthBitSetOrNot {
     static void kthBitLeftShift(int n, int k){
diff --git a/BitManipulation/CheckPowerOfTwo.java b/BitManipulation/CheckPowerOfTwo.java
@@ -1,4 +1,6 @@
 package SummerTrainingGFG.BitManipulation;
+/**
+ * @author Vishal Singh */
 
 public class CheckPowerOfTwo {
     public static void main(String[] args) {
diff --git a/BitManipulation/CountSetBits.java b/BitManipulation/CountSetBits.java
@@ -1,4 +1,6 @@
 package SummerTrainingGFG.BitManipulation;
+/**
+ * @author Vishal Singh */
 
 public class CountSetBits {
     /*
diff --git a/BitManipulation/DivideAndMultiply.java b/BitManipulation/DivideAndMultiply.java
@@ -1,4 +1,6 @@
 package SummerTrainingGFG.BitManipulation;
+/**
+ * @author Vishal Singh */
 
 public class DivideAndMultiply {
     public static void main(String[] args) {
diff --git a/BitManipulation/FirstBitFromRight.java b/BitManipulation/FirstBitFromRight.java
@@ -1,4 +1,6 @@
 package SummerTrainingGFG.BitManipulation;
+/**
+ * @author Vishal Singh */
 
 public class FirstBitFromRight {
     static int firstBit(int n){
diff --git a/BitManipulation/FlipBits.java b/BitManipulation/FlipBits.java
@@ -1,4 +1,6 @@
 package SummerTrainingGFG.BitManipulation;
+/**
+ * @author Vishal Singh */
 
 public class FlipBits {
     public static void main(String[] args) {
diff --git a/BitManipulation/LogBase2.java b/BitManipulation/LogBase2.java
@@ -1,4 +1,6 @@
 package SummerTrainingGFG.BitManipulation;
+/**
+ * @author Vishal Singh */
 
 public class LogBase2 {
     //only for 32 bit
diff --git a/BitManipulation/LongestConsecutiveOnes.java b/BitManipulation/LongestConsecutiveOnes.java
@@ -1,4 +1,6 @@
 package SummerTrainingGFG.BitManipulation;
+/**
+ * @author Vishal Singh */
 
 public class LongestConsecutiveOnes {
     static int maxConsecutiveOnes(int x) {
diff --git a/BitManipulation/MSB.java b/BitManipulation/MSB.java
@@ -1,4 +1,6 @@
 package SummerTrainingGFG.BitManipulation;
+/**
+ * @author Vishal Singh */
 
 public class MSB{
     public static void main(String[] args) {
diff --git a/BitManipulation/MissingNumber.java b/BitManipulation/MissingNumber.java
@@ -1,4 +1,6 @@
 package SummerTrainingGFG.BitManipulation;
+/**
+ * @author Vishal Singh */
 
 public class MissingNumber {
     public static void main(String[] args) {
diff --git a/BitManipulation/OneOddOccuring.java b/BitManipulation/OneOddOccuring.java
@@ -1,4 +1,6 @@
 package SummerTrainingGFG.BitManipulation;
+/**
+ * @author Vishal Singh */
 
 public class OneOddOccuring {
     public static void main(String[] args) {
diff --git a/BitManipulation/Practice/Practice.java b/BitManipulation/Practice/Practice.java
@@ -1,4 +1,6 @@
 package SummerTrainingGFG.BitManipulation.Practice;
+/**
+ * @author Vishal Singh */
 
 public class Practice {
     public static void main(String[] args) {
diff --git a/BitManipulation/SetBit.java b/BitManipulation/SetBit.java
@@ -1,4 +1,6 @@
 package SummerTrainingGFG.BitManipulation;
+/**
+ * @author Vishal Singh */
 
 public class SetBit {
     public static void main(String[] args) {
diff --git a/BitManipulation/SwapNumbers.java b/BitManipulation/SwapNumbers.java
@@ -1,4 +1,6 @@
 package SummerTrainingGFG.BitManipulation;
+/**
+ * @author Vishal Singh */
 
 public class SwapNumbers {
     public static void main(String[] args) {
diff --git a/BitManipulation/ToggleBits.java b/BitManipulation/ToggleBits.java
@@ -1,4 +1,6 @@
 package SummerTrainingGFG.BitManipulation;
+/**
+ * @author Vishal Singh */
 
 public class ToggleBits {
     public static void main(String[] args) {
diff --git a/BitManipulation/TwoOddOccuring.java b/BitManipulation/TwoOddOccuring.java
diff --git a/BitManipulation/Unset.java b/BitManipulation/Unset.java
@@ -1,4 +1,6 @@
 package SummerTrainingGFG.BitManipulation;
+/**
+ * @author Vishal Singh */
 
 public class Unset {
     public static void main(String[] args) {
diff --git a/Contest/ConversionToOne.java b/Contest/ConversionToOne.java
@@ -4,6 +4,8 @@
 import java.io.IOException;
 import java.io.InputStreamReader;
 import java.util.StringTokenizer;
+/**
+ * @author Vishal Singh*/
 
 public class ConversionToOne {
     static class FastReader{
diff --git a/Contest/GetTheShadow.java b/Contest/GetTheShadow.java
@@ -4,6 +4,8 @@
 import java.io.IOException;
 import java.io.InputStreamReader;
 import java.util.StringTokenizer;
+/**
+ * @author Vishal Singh */
 
 public class GetTheShadow {
     static class FastReader{
diff --git a/Contest/NearestPerfectSquare.java b/Contest/NearestPerfectSquare.java
@@ -2,8 +2,9 @@
 import java.io.BufferedReader;
 import java.io.IOException;
 import java.io.InputStreamReader;
-import java.util.Map;
 import java.util.StringTokenizer;
+/**
+ * @author Vishal Singh */
 
 public class NearestPerfectSquare {
     static class FastReader
diff --git a/Mathematics/LastTermOfGP.java b/Mathematics/LastTermOfGP.java
@@ -1,4 +1,6 @@
 package SummerTrainingGFG.Mathematics;
+/**
+ * @author Vishal Singh */
 
 public class LastTermOfGP {
     public static void main(String[] args) {
diff --git a/Mathematics/NumberOfDigitsInANumber.java b/Mathematics/NumberOfDigitsInANumber.java
@@ -1,4 +1,6 @@
 package SummerTrainingGFG.Mathematics;
+/**
+ * @author Vishal Singh */
 
 public class NumberOfDigitsInANumber {
     public static void main(String[] args) {
diff --git a/Mathematics/PrimeNumber.java b/Mathematics/PrimeNumber.java
@@ -1,4 +1,6 @@
 package SummerTrainingGFG.Mathematics;
+/**
+ * @author Vishal Singh */
 
 public class PrimeNumber {
     static boolean isPrime(int n){
diff --git a/Miscellaneous/FactorialDigits.java b/Miscellaneous/FactorialDigits.java
@@ -1,6 +1,8 @@
 package SummerTrainingGFG.Miscellaneous;
 
 import java.math.BigInteger;
+/**
+ * @author Vishal Singh */
 
 public class FactorialDigits {
     static BigInteger fact(BigInteger num){
diff --git a/Miscellaneous/NaturalNumbers.java b/Miscellaneous/NaturalNumbers.java
@@ -1,4 +1,6 @@
 package SummerTrainingGFG.Miscellaneous;
+/**
+ * @author Vishal Singh */
 
 public class NaturalNumbers {
     static int sum(int n){
diff --git a/Miscellaneous/QuadraticEquation.java b/Miscellaneous/QuadraticEquation.java
@@ -1,6 +1,8 @@
 package SummerTrainingGFG.Miscellaneous;
 
 //User function Template for Java
+/**
+ * @author Vishal Singh */
 
 public class QuadraticEquation
 {
diff --git a/Recursion/JosephusProblem.java b/Recursion/JosephusProblem.java
@@ -1,5 +1,6 @@
 package SummerTrainingGFG.Recursion;
-
+/**
+ * @author Vishal Singh */
 public class JosephusProblem {
     static int kill(int n, int k){
         if (n == 1){
diff --git a/Recursion/PossibleWordsFromPhoneDigits.java b/Recursion/PossibleWordsFromPhoneDigits.java
@@ -1,5 +1,8 @@
 package SummerTrainingGFG.Recursion;
+/**
+ * @author Vishal Singh */
 
+/*______________________________________________ Incomplete __________________________________*/
 public class PossibleWordsFromPhoneDigits {
     static void  possibleWords(int a[],int n){
         final String arr[] = {
diff --git a/Recursion/RodCutting.java b/Recursion/RodCutting.java
@@ -1,5 +1,6 @@
 package SummerTrainingGFG.Recursion;
-
+/**
+ * @author Vishal Singh */
 public class RodCutting {
     static int maxCuts(int n,int a,int b,int c){
 
diff --git a/Recursion/StringPalindrome.java b/Recursion/StringPalindrome.java
@@ -1,5 +1,6 @@
 package SummerTrainingGFG.Recursion;
-
+/**
+ * @author Vishal Singh */
 public class StringPalindrome {
     static boolean isPalindrome(String str,int start,int end){
         if (start>end){
diff --git a/Recursion/SubsetOfString.java b/Recursion/SubsetOfString.java
@@ -1,5 +1,6 @@
 package SummerTrainingGFG.Recursion;
-
+/**
+ * @author Vishal Singh */
 public class SubsetOfString {
     static void subset(String str, String curr, int index){
         if (index == str.length()){
diff --git a/Recursion/SubsetSumArray.java b/Recursion/SubsetSumArray.java
@@ -1,5 +1,6 @@
 package SummerTrainingGFG.Recursion;
-
+/**
+ * @author Vishal Singh */
 public class SubsetSumArray {
     static int subSetSum(int[] arr, int n, int sum){
         if (n == 0){
diff --git a/Recursion/TowerOfHanoi.java b/Recursion/TowerOfHanoi.java
@@ -1,5 +1,6 @@
 package SummerTrainingGFG.Recursion;
-
+/**
+ * @author Vishal Singh */
 public class TowerOfHanoi {
     static void tower(int n,char a,char b,char c){
         if (n == 1){
diff --git a/Searching/TwoPointerApproach.java b/Searching/TwoPointerApproach.java
@@ -1,11 +1,12 @@
 package SummerTrainingGFG.Searching;
 
-import java.util.HashMap;
-
 /**
+ * @author Vishal Singh */
+
+/*
  * Given a sorted array and a sum find if there is a pair with given sum*/
-class PairSum{
 
+class PairSum{
     boolean findPairSumExistence(int[] arr, int sum){
         int left = 0;
         int right = arr.length-1;

Original file line number	Diff line number	Diff line change
`@@ -1,6 +1,8 @@`
`1`	`1`	`package SummerTrainingGFG.Miscellaneous;`
`2`	`2`
`3`	`3`	`//User function Template for Java`
	`4`	`+/**`
	`5`	`+ * @author Vishal Singh */`
`4`	`6`
`5`	`7`	`public class QuadraticEquation`
`6`	`8`	`{`