LC & CF Update

Author: Tanjim131

Codeforces/1000/E33-2-B.cpp

@@ -0,0 +1,23 @@
+#include <iostream>
+#include <vector>
+
+using namespace std;
+
+int main(int argc, char const *argv[])
+{
+ vector <int> beautiful;
+ for(int i = 1 ; ; ++i){
+ int num = ((1 << i) - 1) * (1 << (i - 1));
+ if(num > 1e5) break;
+ beautiful.emplace_back(num);
+ }
+ int n;
+ cin >> n;
+ for(int i = beautiful.size() - 1 ; i >= 0 ; --i){
+ if(n % beautiful[i] == 0){
+ cout << beautiful[i] << '\n';
+ break;
+ }
+ }
+ return 0;
+}

LeetCode/Easy/1021 - Remove Outermost Parentheses.cpp

@@ -0,0 +1,23 @@
+class Solution {
+public:
+ string removeOuterParentheses(string S) {
+ string modified; 
+ modified.reserve(S.length());
+ for(int i = 0, opened = 0, closed = 0 ; i < S.length() ; ++i){
+ if(S[i] == '(') {
+ if(opened++){ // discard leading parentheses
+ modified += S[i]; 
+ }
+ }
+ else {
+ ++closed;
+ modified += S[i];
+ }
+ if(opened == closed){
+ opened = closed = 0;
+ modified.pop_back(); // discard trailing parentheses
+ }
+ }
+ return modified;
+ }
+};

LeetCode/Easy/1266 - Minimum Time Visiting All Points.cpp

@@ -0,0 +1,17 @@
+class Solution {
+public:
+ int minTimeToVisitAllPoints(vector<vector<int>>& points) {
+ int t = 0;
+ for(int i = 0 ; i < points.size() - 1 ; ++i){
+ int cx = points[i][0];
+ int cy = points[i][1];
+ int nx = points[i + 1][0];
+ int ny = points[i + 1][1];
+ int dx = abs(cx - nx);
+ int dy = abs(cy - ny);
+ int m = min(dx, dy);
+ t += dx + dy - m;
+ }
+ return t;
+ }
+};

LeetCode/Easy/1323 - Maximum 69 Number.cpp

@@ -0,0 +1,13 @@
+class Solution {
+public:
+ int maximum69Number (int num) {
+ string s = to_string(num);
+ for(int i = 0 ; i < s.length() ; ++i){
+ if(s[i] == '6') {
+ s[i] = '9';
+ break;
+ }
+ }
+ return stoi(s);
+ }
+};

LeetCode/Easy/1572 - Matrix Diagonal Sum.cpp

@@ -0,0 +1,12 @@
+class Solution {
+public:
+ int diagonalSum(vector<vector<int>>& mat) {
+ int sum = 0;
+ for(int i = 0, j = 0 ; i < mat.size() ; ++i, ++j){
+ int ltr = j, rtl = mat.size() - 1 - j;
+ sum += mat[i][ltr];
+ if(ltr != rtl) sum += mat[i][rtl];
+ }
+ return sum;
+ }
+};

LeetCode/Easy/709 - To Lower Case.cpp

@@ -0,0 +1,11 @@
+class Solution {
+public:
+ string toLowerCase(string str) {
+ for(int i = 0 ; i < str.length() ; ++i){
+ if(str[i] >= 'A' && str[i] <= 'Z'){
+ str[i] -= 'A' - 'a';
+ }
+ }
+ return str;
+ }
+};