push latest code

Author: Mohit Jain

.vscode/tasks.json

@@ -0,0 +1,28 @@
+{
+    "tasks": [
+        {
+            "type": "cppbuild",
+            "label": "C/C++: clang++ build active file",
+            "command": "/usr/bin/clang++",
+            "args": [
+                "-fdiagnostics-color=always",
+                "-g",
+                "${file}",
+                "-o",
+                "${fileDirname}/${fileBasenameNoExtension}"
+            ],
+            "options": {
+                "cwd": "${fileDirname}"
+            },
+            "problemMatcher": [
+                "$gcc"
+            ],
+            "group": {
+                "kind": "build",
+                "isDefault": true
+            },
+            "detail": "Task generated by Debugger."
+        }
+    ],
+    "version": "2.0.0"
+}

covid-pandemic

@@ -2,6 +2,13 @@
 using namespace std;
 
 int main() {
+
+	#ifndef ONLINE_JUDGE
+    // for getting input from input.txt
+    freopen("input.txt", "r", stdin);
+    // for writing output to output.txt
+    freopen("output.txt", "w", stdout);
+#endif
     int t,count1,n,num,count0;
     bool flag;
 	cin>>t;

covid-pandemic.cpp

@@ -0,0 +1,5 @@
+3
+92 022
+82 12
+77 13
+2 false numeric

hash-code.cpp

@@ -0,0 +1,32 @@
+#include<iostream>
+#include<bits/stdc++.h>
+
+using namespace std;
+
+int main() {
+	int t;
+	cin>>t;
+	while(t--){
+		int n;
+		cin>>n;
+		int *a = new int[n];
+		for(int i=0;i<n;i++) {
+			cin>>a[i];
+		}
+		int ans = INT_MIN;
+		int maxSumSoFar = 0;
+
+		for(int i=0; i <n;i++) {
+			maxSumSoFar += a[i];
+            if(maxSumSoFar<0){
+				maxSumSoFar = 0;
+			}
+			if(maxSumSoFar>ans ){
+				ans = maxSumSoFar;
+			}
+         
+		}
+       cout<<ans<<endl;
+	}
+	return 0;
+}

input.txt

@@ -0,0 +1,20 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<!DOCTYPE plist PUBLIC "-//Apple Computer//DTD PLIST 1.0//EN" "http://www.apple.com/DTDs/PropertyList-1.0.dtd">
+<plist version="1.0">
+	<dict>
+		<key>CFBundleDevelopmentRegion</key>
+		<string>English</string>
+		<key>CFBundleIdentifier</key>
+		<string>com.apple.xcode.dsym.maxSubArraySum</string>
+		<key>CFBundleInfoDictionaryVersion</key>
+		<string>6.0</string>
+		<key>CFBundlePackageType</key>
+		<string>dSYM</string>
+		<key>CFBundleSignature</key>
+		<string>????</string>
+		<key>CFBundleShortVersionString</key>
+		<string>1.0</string>
+		<key>CFBundleVersion</key>
+		<string>1</string>
+	</dict>
+</plist>

maxSubArraySum

@@ -0,0 +1,3 @@
+82 12
+77 13
+92 022

maxSubArraySum.cpp

@@ -0,0 +1,98 @@
+#include <iostream>
+#include <cstring>
+#include <algorithm>
+
+
+using namespace std;
+
+
+string extractStringAtKey(string str, int key) {
+
+	char *s = strtok((char*)str.c_str()," ");
+
+	while(key>1) {
+		s = strtok(NULL, " ");
+		key--;
+
+	}
+	return (string)s;
+}
+
+int convertToInt(string s){
+	int ans = 0;
+	int p =1;
+	for(int i = s.length()-1;i >=0;i--) {
+		ans += ((s[i]-'0') *p);
+		 // ans += (stoi(s[i])*p);
+		// ans += (atoi(s[i])*p);
+		 p = p*10;
+	}
+	return ans;
+}
+
+bool numericCompare(pair<string,string> s1, pair<string,string> s2) {
+	string key1 = s1.second;
+	string key2 = s2.second;
+
+	return convertToInt(key1) < convertToInt(key2) ; 
+}
+bool lexicoCompare(pair<string,string> s1, pair<string,string> s2) {
+	string key1 = s1.second;
+	string key2 = s2.second;
+
+	return key1 < key2 ; 
+}
+int main() {
+
+   #ifndef ONLINE_JUDGE
+    // for getting input from input.txt
+    freopen("input.txt", "r", stdin);
+    // for writing output to output.txt
+    freopen("output.txt", "w", stdout);
+#endif
+
+    int n;
+    cin>>n;
+
+    cin.get();
+
+    string a[100];
+
+    for(int i= 0; i < n; i++) getline(cin,a[i]);
+    
+    int key;
+
+    
+    
+
+
+    string reversal, ordering;
+    cin>>key>>reversal>>ordering;
+    
+
+    pair<string,string> strPair[100];
+
+    for(int i=0;i<n;i++){
+    	strPair[i].first = a[i];
+    	strPair[i].second = extractStringAtKey(a[i],key);
+    }
+   if(ordering == "numeric"){
+    sort(strPair,strPair+n,numericCompare);
+   } else {
+   	sort(strPair,strPair+n,lexicoCompare);
+   }
+  if(reversal == "true") {
+  	for(int i=0; i<n/2;i++) {
+  		swap(strPair[i],strPair[n-i-1]);
+  	}
+  }
+
+
+
+for(int i=0;i<n;i++) {
+	cout<<strPair[i].first<<endl ;
+}
+
+  return 0;
+}
+

maxSubArraySum.dSYM/Contents/Info.plist

@@ -0,0 +1,47 @@
+// Take as input a two-d array. Wave print it column-wise.
+
+// Input Format
+// Two integers M(row) and N(colomn) and further M * N integers(2-d array numbers).
+
+// Constraints
+// Both M and N are between 1 to 10.
+
+// Output Format
+// All M * N integers seperated by commas with 'END' wriiten in the end(as shown in example).
+
+// Sample Input
+// 4 4
+// 11 12 13 14
+// 21 22 23 24
+// 31 32 33 34
+// 41 42 43 44
+// Sample Output
+// 11, 21, 31, 41, 42, 32, 22, 12, 13, 23, 33, 43, 44, 34, 24, 14
+#include<bits/stdc++.h>
+
+using namespace std;
+
+int main() {
+ int m,n;
+ cin>>m>>n;
+ int **a = new int*[m];
+ for(int i=0;i<m;i++){
+     a[i] = new int[n];
+ }
+ for(int i=0;i<m;i++){
+     for(int j=0;j<n;j++){
+         cin>>a[i][j];
+     }
+ }
+ for(int j=0;j<n;j++){
+     if(j%2==0){
+         for(int i=0;i<m;i++) cout<<a[i][j]<<", ";
+     }else{
+         for(int i=m-1;i>=0;i--) cout<<a[i][j]<<", ";
+
+     }
+ }
+ cout<<"END";
+  return 0;
+
+}