🚀 20-Sep-2020

Author: sureshmangs

README.md

@@ -22,6 +22,8 @@
 
   - [Codeforces](competitive%20programming/codeforces)
 
+  - [CSES Problems](competitive%20programming/cses)
+  
   - [Leetcode](competitive%20programming/leetcode)
 
     - [2020 June Challenge](competitive%20programming/leetcode/2020-June-Challenge)
@@ -30,6 +32,8 @@
 
     - [2020 August Challenge](competitive%20programming/leetcode/2020-August-Challenge)
 
+    - [2020 September Challenge](competitive%20programming/leetcode/2020-September-Challenge)
+    
 * [Dynamic Programming](dynamic%20programming)
 
 * [Graph](graph)

competitive programming/leetcode/1291. Sequential Digits.cpp

@@ -0,0 +1,51 @@
+An integer has sequential digits if and only if each digit in the number is one more than the previous digit.
+
+Return a sorted list of all the integers in the range [low, high] inclusive that have sequential digits.
+
+
+
+Example 1:
+
+Input: low = 100, high = 300
+Output: [123,234]
+Example 2:
+
+Input: low = 1000, high = 13000
+Output: [1234,2345,3456,4567,5678,6789,12345]
+
+
+Constraints:
+
+10 <= low <= high <= 10^9
+
+
+
+
+
+
+
+
+
+
+class Solution {
+public:
+    vector<int> sequentialDigits(int low, int high) {
+        vector<int> res;
+        queue<int> q;
+        for(int i=1;i<=9;i++)
+            q.push(i);
+
+        while(!q.empty()){
+            int num=q.front();
+            q.pop();
+            if(num>=low && num<=high)
+                res.push_back(num);
+            if(num>high) break;
+            int d=num%10;
+            if(d<9){
+                q.push((num*10)+d+1);
+            }
+        }
+        return res;
+    }
+};

competitive programming/leetcode/1592. Rearrange Spaces Between Words.cpp

@@ -0,0 +1,93 @@
+You are given a string text of words that are placed among some number of spaces. Each word consists of one or more lowercase English letters and are separated by at least one space. It's guaranteed that text contains at least one word.
+
+Rearrange the spaces so that there is an equal number of spaces between every pair of adjacent words and that number is maximized. If you cannot redistribute all the spaces equally, place the extra spaces at the end, meaning the returned string should be the same length as text.
+
+Return the string after rearranging the spaces.
+
+
+
+Example 1:
+
+Input: text = "  this   is  a sentence "
+Output: "this   is   a   sentence"
+Explanation: There are a total of 9 spaces and 4 words. We can evenly divide the 9 spaces between the words: 9 / (4-1) = 3 spaces.
+Example 2:
+
+Input: text = " practice   makes   perfect"
+Output: "practice   makes   perfect "
+Explanation: There are a total of 7 spaces and 3 words. 7 / (3-1) = 3 spaces plus 1 extra space. We place this extra space at the end of the string.
+Example 3:
+
+Input: text = "hello   world"
+Output: "hello   world"
+Example 4:
+
+Input: text = "  walks  udp package   into  bar a"
+Output: "walks  udp  package  into  bar  a "
+Example 5:
+
+Input: text = "a"
+Output: "a"
+
+
+Constraints:
+
+1 <= text.length <= 100
+text consists of lowercase English letters and ' '.
+text contains at least one word.
+
+
+
+
+
+
+
+
+
+
+class Solution {
+public:
+    string reorderSpaces(string text) {
+        int n=text.length();
+
+        int sp=0, word=0;;
+
+        for(int i=0;i<n;i++){
+            if(text[i]==' ')
+                sp++;
+        }
+
+        string res, tmp;
+        stringstream ss(text);
+        while(ss>>tmp){
+            word++;
+        }
+
+        if(word==1){
+            if(sp==0) return text;
+            res+=tmp;
+            res.append(sp, ' ');
+            return res;
+        }
+
+        int spa=sp/(word-1);
+
+        stringstream s(text);
+
+        tmp="";
+        res="";
+
+        while(s>>tmp){
+            res+=tmp;
+            res.append(spa, ' ');
+        }
+
+        res=res.substr(0, res.length()-spa);
+
+        if(sp%(word-1)!=0){
+            res.append(sp%(word-1), ' ');
+        }
+
+        return res;
+    }
+};

competitive programming/leetcode/2020-September-Challenge/Day-19-Sequential Digits.cpp

@@ -0,0 +1,52 @@
+
+An integer has sequential digits if and only if each digit in the number is one more than the previous digit.
+
+Return a sorted list of all the integers in the range [low, high] inclusive that have sequential digits.
+
+
+
+Example 1:
+
+Input: low = 100, high = 300
+Output: [123,234]
+Example 2:
+
+Input: low = 1000, high = 13000
+Output: [1234,2345,3456,4567,5678,6789,12345]
+
+
+Constraints:
+
+10 <= low <= high <= 10^9
+
+
+
+
+
+
+
+
+
+
+class Solution {
+public:
+    vector<int> sequentialDigits(int low, int high) {
+        vector<int> res;
+        queue<int> q;
+        for(int i=1;i<=9;i++)
+            q.push(i);
+
+        while(!q.empty()){
+            int num=q.front();
+            q.pop();
+            if(num>=low && num<=high)
+                res.push_back(num);
+            if(num>high) break;
+            int d=num%10;
+            if(d<9){
+                q.push((num*10)+d+1);
+            }
+        }
+        return res;
+    }
+};