Add files via upload

Author: itsjinendrajain

14.OOP Part 1/2.Polynomial Class Problem.java

@@ -0,0 +1,105 @@
+//NOT MINE
+public class Polynomial {
+
+private int[] cof;
+private int deg;
+
+public Polynomial() {
+cof=new int[5];
+deg=-1;
+}
+public void setCoefficient(int deg,int coficient) {
+if(deg >=cof.length) {
+restructure(deg);
+}
+cof[deg]=coficient;
+if(deg >= this.deg) {
+this.deg=deg;
+}
+}
+public Polynomial add(Polynomial p) {
+
+Polynomial x=new Polynomial();
+
+int i=0,j=0,k=0;
+while(i < p.cof.length && j < this.cof.length) {
+x.setCoefficient(k, p.cof[i] + this.cof[i]);
+i++;
+j++;
+k++;
+}
+while(i<p.cof.length) {
+x.setCoefficient(k, p.cof[i]);
+k++;
+i++;
+}
+while(j<this.cof.length) {
+x.setCoefficient(k, this.cof[j]);
+k++;
+j++;
+}
+
+
+return x;
+
+}
+public Polynomial subtract(Polynomial p) {
+
+Polynomial x=new Polynomial();
+
+int i=0,j=0,k=0;
+while(i < p.cof.length && j < this.cof.length) {
+x.setCoefficient(k, this.cof[i] - p.cof[i] );
+i++;
+j++;
+k++;
+}
+while(i<p.cof.length) {
+x.setCoefficient(k, -p.cof[i]);
+k++;
+i++;
+}
+while(j<this.cof.length) {
+x.setCoefficient(k, this.cof[j]);
+k++;
+j++;
+}
+
+
+return x;
+
+}
+public Polynomial multiply(Polynomial p) {
+
+Polynomial x=new Polynomial();
+
+for(int i=0;i<p.cof.length;i++) {
+for(int j=0;j<this.cof.length;j++) {
+if(i + j <=x.deg)
+x.setCoefficient( i + j ,x.cof[i+j]+p.cof[i] * this.cof[j]);
+else
+x.setCoefficient(i + j ,p.cof[i] * this.cof[j]);
+}
+}
+return x;
+
+}
+public void print() {
+for(int i=0;i<cof.length;i++) {
+if(cof[i] !=0)
+System.out.print( cof[i] +"x"+ i +" ");
+}
+}
+private void restructure(int deg) {
+
+int[] temp=cof;
+cof=new int[deg + 1];
+for(int i=0;i<temp.length;i++) {
+cof[i]=temp[i];
+}
+}
+
+
+
+
+}

15.String/1.Count Words(ShortWay).java

@@ -0,0 +1,8 @@
+public class Solution {
+public static int countWords(String str) {
+ if(str.length()==0) return 0;
+ String[] s1=str.split(" ");
+ return s1.length;
+}
+
+}

15.String/1.Count Words.java

@@ -0,0 +1,15 @@
+public class Solution {
+
+public static int countWords(String str) {
+ if(str.length()==0) return 0;
+ 
+ int spaces=0;
+ 
+ for (int i = 0; i < str.length(); i++) 
+ if (str.charAt(i)==' ') spaces++;
+ 
+ 
+ return spaces+1;
+}
+
+}

15.String/2.String Palindrome.java

@@ -0,0 +1,14 @@
+
+public class Solution {
+
+public static boolean isPalindrome(String str) {
+ int len=str.length()-1;
+ String a= "";
+ for (int i = len; i >=0 ; i--) {
+ a+=(str.charAt(i));
+ }
+ // System.out.println(a);
+ return a.equals(str);
+}
+
+}

15.String/3.All substrings.java

@@ -0,0 +1,15 @@
+
+public class Solution {
+
+public static void printSubstrings(String str) {
+for (int i = 0; i < str.length(); i++) {
+ for (int j = i; j < str.length(); j++) {
+ for (int k = i; k <=j; k++) {
+ System.out.print(str.charAt(k));
+	}
+ System.out.println();
+	}
+	}
+}
+
+}

15.String/4.Reverse String Wordwise.java

@@ -0,0 +1,11 @@
+public class Solution {
+public static String reverseWordWise(String input) {
+ String[] arrOdStr=input.split(" ");
+ String reverseWord="";
+ for (int i = arrOdStr.length-1;i >=0 ; i--) {
+ reverseWord+=arrOdStr[i]+" ";
+ }
+ return reverseWord;
+
+}
+}

16.String Assignment/2.Remove Consecutive Duplicates.java

@@ -0,0 +1,18 @@
+
+public class Solution {
+
+public static String removeConsecutiveDuplicates(String str) {
+ StringBuilder a = new StringBuilder();
+ for (int i = 0; i < str.length() ; i++) {
+ a.append(str.charAt(i));
+ if (i<str.length()-1){
+ while (str.charAt(i) == str.charAt(i + 1)) {
+ i++;
+ if (i>=str.length()-1) break;
+ }
+ }
+ }
+ return a.toString();
+}
+
+}

16.String Assignment/3.Reverse Each Word.java

@@ -0,0 +1,16 @@
+
+public class Solution {
+
+public static String reverseEachWord(String str) {
+ String[] ArrStr=str.split(" ");
+ String mynewStr=new String("");
+ for (String s : ArrStr) {
+ for (int j = s.length() - 1; j >= 0; j--) {
+ mynewStr += s.charAt(j);
+ }
+ mynewStr += " ";
+ }
+ return mynewStr;
+}
+
+}

16.String Assignment/4.Remove character.java

@@ -0,0 +1,10 @@
+
+public class Solution {
+
+public static String removeAllOccurrencesOfChar(String str, char ch) {
+ String c1=""+ch;
+ return str.replace(c1,"");
+
+}
+
+}

16.String Assignment/5.Highest Occuring Character.java

@@ -0,0 +1,33 @@
+
+public class Solution {
+
+public static char highestOccuringChar(String str) {
+ char[] uniqueArr=new char[str.length()-1];
+ char MaxOcc=str.charAt(0);
+ int Bcount =1;
+ int count;
+ for (int i = 0; i < str.length(); i++) { count =0;
+ boolean skipThis=false;
+ for(char ele:uniqueArr){
+ if (str.charAt(i) == ele) {
+ skipThis = true;
+ break;
+ }
+ }
+
+ if (skipThis) continue;
+ else uniqueArr[i]=str.charAt(i);
+ 
+ for (int j = i; j < str.length(); j++) {
+ if (str.charAt(i)==str.charAt(j)) count++;
+ }
+
+ if (count>Bcount) {
+ MaxOcc=str.charAt(i);
+ Bcount=count;
+ }
+ }
+ return MaxOcc;
+}
+
+}