From e92b082532d18bbb9dc7cd1911561bd6e6becaf6 Mon Sep 17 00:00:00 2001 From: Suvojit Ghosh Date: Sat, 16 Oct 2021 20:14:11 +0530 Subject: [PATCH 1/3] Adding Solution for 1866 --- solutions/1866.java | 28 ++++++++++++++++++++++++++++ 1 file changed, 28 insertions(+) create mode 100644 solutions/1866.java diff --git a/solutions/1866.java b/solutions/1866.java new file mode 100644 index 0000000..de386f8 --- /dev/null +++ b/solutions/1866.java @@ -0,0 +1,28 @@ +class Solution { + public boolean findRotation(int[][] mat, int[][] target) { + for(int i=1;i<=4;i++){ + if(Arrays.deepEquals(mat,target)) + return true; + mat=rotate(mat); + } + return false; + } + static int[][] rotate(int[][] m){ + int temp,n=m.length; + int[][] ans=new int[n][n]; + for(int i=0;i Date: Sat, 16 Oct 2021 20:26:09 +0530 Subject: [PATCH 2/3] Adding Solution for 1854 --- solutions/1854.java | 23 +++++++++++++++++++++++ 1 file changed, 23 insertions(+) create mode 100644 solutions/1854.java diff --git a/solutions/1854.java b/solutions/1854.java new file mode 100644 index 0000000..7f852c7 --- /dev/null +++ b/solutions/1854.java @@ -0,0 +1,23 @@ +class Solution { + public int maximumPopulation(int[][] logs) { + int[] year=new int[2051];int max=0; + for(int[] i:logs){ + year[i[0]]+=1; + year[i[1]]-=1; + if(i[1]>max) + max=i[1]; + } + int[] prefix=new int[max+1]; + for(int i=1950;i<=max;i++){ + prefix[i]=prefix[i-1]+year[i]; + } + int my=0,m=0; + for(int i=1950;i<=max;i++){ + if(m Date: Sat, 16 Oct 2021 20:35:39 +0530 Subject: [PATCH 3/3] Adding solution for 1859 --- solutions/1859.java | 25 +++++++++++++++++++++++++ 1 file changed, 25 insertions(+) create mode 100644 solutions/1859.java diff --git a/solutions/1859.java b/solutions/1859.java new file mode 100644 index 0000000..271678f --- /dev/null +++ b/solutions/1859.java @@ -0,0 +1,25 @@ +class Solution { + public String sortSentence(String s) { + String[] word=s.split(" "); + int i=0; + while(i