Add files via upload

Author: rajeshsvec

Week6/A-Strings/AllSubStrings.txt

@@ -0,0 +1,19 @@
+
+public class Solution {
+
+	public static void printSubstrings(String str) {
+		//Your code goes here
+		for(int i=0;i<str.length();i++)
+		{
+			String res="";
+		for(int j=i;j<str.length();j++)
+		{
+			res = res + str.charAt(j);
+			System.out.println(res);
+		}	
+		
+		res="";
+		}
+	}
+
+}

Week6/A-Strings/Assignment6a/CheckPermutation.txt

@@ -0,0 +1,42 @@
+import java.util.HashMap;
+public class Solution {
+
+	public static boolean isPermutation(String str1, String str2) {
+		//Your code goes here
+		HashMap <Character,Integer> hm=new HashMap<>();
+		int l1=str1.length();
+		int l2=str2.length();
+		for(int i=0;i<l1;i++)
+		{
+			char c=str1.charAt(i);
+			if(!(hm.containsKey(c)))
+			{
+				hm.put(c,1);
+				
+			}
+			else{
+				int v=hm.get(c);
+				hm.put(c,v+1);
+			}
+		}
+		for(int i=0;i<l2;i++)
+		{
+			char c=str2.charAt(i);
+			if(!(hm.containsKey(c)))
+			{
+				return false;
+			}
+			int v=hm.get(c);
+			v-=1;
+			if(v!=0){
+			hm.put(c,v);
+			}
+			else{
+				hm.remove(c);
+			}
+			
+		}
+		return hm.isEmpty();
+	}
+
+}

Week6/A-Strings/Assignment6a/CompressTheString.txt

@@ -0,0 +1,32 @@
+public class Solution {
+	public static String getCompressedString(String str) {
+		// Write your code here.
+		int l=str.length();
+		int count=0;
+		String res="";
+		int j=0;
+		for(int i=0;i<l;i++)
+		{
+			char c=str.charAt(i);
+			res+=c;
+			count=0;
+			for( j=i;j<l;j++)
+			{
+				if(c==str.charAt(j))
+				{
+					count+=1;
+				}
+				else{
+					break;
+				}
+			}
+			if(count!=1)
+			{
+			res+=count;
+			}
+			i=j-1;
+		}
+		return res;
+	}
+
+}

Week6/A-Strings/Assignment6a/HighOccuringCharacter.txt

@@ -0,0 +1,37 @@
+import java.util.HashMap;
+public class Solution {
+
+	public static char highestOccuringChar(String str) {
+		//Your code goes here
+		int l=str.length(),max=-1;
+		char ch=' ';
+		HashMap<Character,Integer> hash=new HashMap<>();
+		for(int i=0;i<l;i++)
+		{
+			char c=str.charAt(i);
+			int cou=1;
+			if(!(hash.containsKey(c)))
+			{
+				hash.put(c,1);
+			}
+			else{
+				cou=hash.get(c);
+				hash.put(c,cou+1);
+			}
+			
+				
+		}
+		for(int j=0;j<l;j++)
+			{
+				char c=str.charAt(j);
+				int count=hash.get(c);
+				if(max<count)
+			{
+				max=count;
+				ch=c;
+			}
+			}
+		return ch;
+	}
+
+}w

Week6/A-Strings/Assignment6a/RemoveCharacter.txt

@@ -0,0 +1,18 @@
+
+public class Solution {
+
+	public static String removeAllOccurrencesOfChar(String str, char ch) {
+		// Your code goes here
+		String temp="";
+		for(int i=0;i<str.length();i++)
+		{
+			char c=str.charAt(i);
+			if(c!=ch)
+			{
+				temp+=c;
+			}
+		}
+		return temp;
+	}
+
+}

Week6/A-Strings/Assignment6a/RemoveConsecutiveDuplicates.txt

@@ -0,0 +1,21 @@
+
+public class Solution {
+
+	public static String removeConsecutiveDuplicates(String str)
+	 {
+		//Your code goes here
+		String st=""+str.charAt(0);
+		for(int i=1;i<str.length();i++)
+		{
+			char c=str.charAt(i);
+			
+			char c2=st.charAt(st.length()-1);
+			if(c!=c2)
+			{
+				st = st + c;
+			}
+		}
+		return st;
+	}
+
+}

Week6/A-Strings/CountWords.txt

@@ -0,0 +1,12 @@
+
+public class Solution {
+
+	public static int countWords(String str)
+	 {	
+		//Your code goes here
+		String s[]=str.split(" ");
+		int len=s.length;
+		return len;
+	}
+
+}

Week6/A-Strings/ReverseEachWord.txt

@@ -0,0 +1,26 @@
+
+public class Solution {
+
+	public static String reverseEachWord(String str)
+	 {
+		//Your code goes here
+		str=str.trim();
+		String s="";
+		String res="";
+		for(int i=0;i<str.length();i++)
+		{
+			if(str.charAt(i)==' ')
+			{
+				res=res+s+" ";
+				s="";
+			}
+			else{
+			s=str.charAt(i)+s;
+			}
+
+		}
+		res=res+s;
+		return res.trim();
+	}
+
+}

Week6/A-Strings/StringPalindrome.txt

@@ -0,0 +1,21 @@
+
+public class Solution {
+
+	public static boolean isPalindrome(String str) {
+		//Your code goes here
+		int i=0,j=str.length()-1;
+		while(i<j)
+		{
+			if(str.charAt(i)!=(str.charAt(j)))
+			{
+				return false;
+			}
+			else{
+			i+=1;
+			j-=1;
+			}
+		}
+		return true;
+	}
+
+}

Week6/A-Strings/StringReverse.txt

@@ -0,0 +1,17 @@
+import java.util.* ;
+import java.io.*; 
+
+class Solution {
+
+  public static String stringReverse(char[] arr)
+   {
+    // Write your code here.
+    String s="";
+    for(int i=0;i<arr.length;i++)
+    {
+      s = arr[i] + s;
+    }
+    return s;
+
+  }
+}

Week6/B-Two Dimensional Arrays/Assignment6b/PrintLikeAWave.txt

@@ -0,0 +1,34 @@
+
+public class Solution {
+
+	public static void wavePrint(int mat[][]){
+		//Your code goes here
+		int n=mat.length;
+		if(n==0)
+		{
+			return;
+		}
+		int m=mat[0].length;
+		int sum=-1;
+		for(int i=0;i<m;i++)
+		{
+			sum=0;
+			if(i%2==1)
+			{
+				for(int j=n-1;j>=0;j--)
+				{
+					System.out.print(mat[j][i]+" ");
+				}
+			}
+			else{
+			for(int j=0;j<n;j++)
+			{
+				System.out.print(mat[j][i]+" ");
+			}
+			}
+			
+		}
+		return;
+	}
+
+}

Week6/B-Two Dimensional Arrays/Assignment6b/RowWiseSum.txt

@@ -0,0 +1,32 @@
+import java.util.ArrayList;
+public class Solution {
+
+	public static void rowWiseSum(int[][] mat)
+	 {
+		//Your code goes here
+		int n=mat.length;
+		if(n==0)
+		{
+			return;
+		}
+		int m=mat[0].length;
+		int arr[]=new int[n];
+		int sum=-1,k=-1;
+		for(int i=0;i<n;i++)
+		{
+			sum=0;
+			for(int j=0;j<m;j++)
+			{
+				sum+=mat[i][j];
+			}
+			arr[k+=1]=sum;
+		}
+		for(int i=0;i<n;i++)
+		{
+			System.out.print(arr[i]+" ");
+		}
+		System.out.println();
+		return;
+	}
+
+}

Week6/B-Two Dimensional Arrays/Assignment6b/TotalSumOnTheBDs.txt

@@ -0,0 +1,34 @@
+
+public class Solution {
+
+	public static void totalSum(int[][] mat) {
+		//Your code goes here
+		int n=mat.length;
+		if(n==0)
+		{
+			System.out.println("0");
+			return;
+		}
+		int sum=0;
+		for(int i=0;i<n;i++)
+		{
+			for(int j=0;j<n;j++)
+			{
+				if(i==0 || j==0 ||  i==n-1 || j==n-1)
+				{
+					sum+=mat[i][j];
+				}
+				else if(i==j || (i+j+1)==n )
+				{
+					sum+=mat[i][j];
+				}
+				else{
+					sum+=0;
+				}
+			}
+		}
+		System.out.println(sum);
+		return;
+	}
+
+}

Week6/B-Two Dimensional Arrays/Assignment6b/TransposeOfAMatrix.txt

@@ -0,0 +1,19 @@
+import java.util.* ;
+import java.io.*; 
+ 
+public class Solution {
+
+	public static int[][] transpose(int m, int n, int[][] mat) {
+		// Write your code here
+		int temp[][]=new int[n][m];
+		for(int i=0;i<n;i++)
+		{
+			for(int j=0;j<m;j++)
+			{
+				temp[i][j]=mat[j][i];
+			}
+		}
+		return temp;
+	}
+
+}