commit

Author: pradeepkumar24rk

TrainingProblems/CombinationNumbers.java …rayBasedProblems/CombinationNumbers.javaTrainingProblems/CombinationNumbers.java renamed to ArrayBasedProblems/CombinationNumbers.java TrainingProblems/CombinationNumbers.java renamed to ArrayBasedProblems/CombinationNumbers.java

@@ -1,3 +1,4 @@
+package ArrayBasedProblems;
 import java.util.Scanner;
 
 public class CombinationNumbers {

TrainingProblems/CountingSubsequence.java …ayBasedProblems/CountingSubsequence.javaTrainingProblems/CountingSubsequence.java renamed to ArrayBasedProblems/CountingSubsequence.java TrainingProblems/CountingSubsequence.java renamed to ArrayBasedProblems/CountingSubsequence.java

@@ -1,3 +1,4 @@
+package ArrayBasedProblems;
 public class CountingSubsequence {
     public static void main(String[] args) {
 

…oblems/LargestSumContiguousSubarray.java …oblems/LargestSumContiguousSubarray.javaTrainingProblems/LargestSumContiguousSubarray.java renamed to ArrayBasedProblems/LargestSumContiguousSubarray.java TrainingProblems/LargestSumContiguousSubarray.java renamed to ArrayBasedProblems/LargestSumContiguousSubarray.java

@@ -1,3 +1,4 @@
+package ArrayBasedProblems;
 //time complexity O(n3) cubic
 
 public class LargestSumContiguousSubarray {

…ingProblems/LargestSumOfSubsequence.java …sedProblems/LargestSumOfSubsequence.javaTrainingProblems/LargestSumOfSubsequence.java renamed to ArrayBasedProblems/LargestSumOfSubsequence.java TrainingProblems/LargestSumOfSubsequence.java renamed to ArrayBasedProblems/LargestSumOfSubsequence.java

@@ -1,3 +1,4 @@
+package ArrayBasedProblems;
 public class LargestSumOfSubsequence {
     public static void main(String[] args) {
         int a[] = { 1, 2, 3, 4, 5 }, n = 5, count = (1 << n) - 1;

TrainingProblems/SubSequenceInArray.java …rayBasedProblems/SubSequenceInArray.javaTrainingProblems/SubSequenceInArray.java renamed to ArrayBasedProblems/SubSequenceInArray.java TrainingProblems/SubSequenceInArray.java renamed to ArrayBasedProblems/SubSequenceInArray.java

@@ -1,3 +1,4 @@
+package ArrayBasedProblems;
 public class SubSequenceInArray {
     public static void main(String[] args) {
         int a[]={5,3,1,6,2},sumOfSquence=6,n=a.length,total=(1<<n)-1,count=0;

TrainingProblems/AdjacentStringSwap.java …ingBasedProblems/AdjacentStringSwap.javaTrainingProblems/AdjacentStringSwap.java renamed to StringBasedProblems/AdjacentStringSwap.java TrainingProblems/AdjacentStringSwap.java renamed to StringBasedProblems/AdjacentStringSwap.java

@@ -1,6 +1,10 @@
+package StringBasedProblems;
 public class AdjacentStringSwap {
     public static void main(String[] args) {
         String org="new project";
+        int j=0;
+        for(int i=0;i<org.length();i++){}
+        
 
     }
 

StringBasedProblems/CinemaCharacter.java

@@ -0,0 +1,62 @@
+package StringBasedProblems;
+import java.util.Scanner;
+
+public class CinemaCharacter {
+    public static void main(String[] args) {
+        Scanner sc=new Scanner(System.in);
+        String s=sc.next();
+        char a[]=s.toCharArray();
+        int n=a.length;
+        for(int i=1;i<n;i++){
+            int j=i-1;
+            char temp=a[i];
+            while(j>=0 && temp<a[j])
+            {
+                a[j+1]=a[j];
+                j--;
+            }
+            a[j+1]=temp;
+        }
+        System.out.println(String.valueOf(a));
+        
+        int count=1,p=0;
+        char temp=a[0];
+        for(int i=0;i<n-1;i++){
+            if(a[i]==a[i+1])
+                count++;
+            else
+                count=1;
+            if(count>p){
+                temp=a[i];
+                p=count;
+            }
+        }
+        
+        System.out.println(temp);
+        sc.close();
+    }
+}
+
+// testcase 1
+
+// input
+
+// ddcccdcaaa               which character is more time appeared and less ASCII key value
+
+// output
+
+// c                        here c character is more time appeared
+
+
+
+
+
+// testcase 2
+
+//input
+
+// aaaadddbbbb              here a and b are equal times appeared but a is less ASCII value
+
+//output
+
+//a

TrainingProblems/ReverseString.java StringBasedProblems/ReverseString.javaTrainingProblems/ReverseString.java renamed to StringBasedProblems/ReverseString.java

@@ -1,3 +1,4 @@
+package StringBasedProblems;
 //output
 //tce jo++rpwen
 

TrainingProblems/SubSequenceInString.java …ngBasedProblems/SubSequenceInString.javaTrainingProblems/SubSequenceInString.java renamed to StringBasedProblems/SubSequenceInString.java TrainingProblems/SubSequenceInString.java renamed to StringBasedProblems/SubSequenceInString.java

@@ -1,3 +1,4 @@
+package StringBasedProblems;
 public class SubSequenceInString {
     public static void main(String[] args) {
         String s="abcd";