Add new Sol

Author: coderjojo

CodeChef/MARCHB/1.cpp

@@ -0,0 +1,50 @@
+
+	#include <bits/stdc++.h>
+	#include <cstdio>
+	#include <cstring>
+	#include <cmath>
+	#include <cstring>
+	#include <chrono>
+	#include <complex>
+	#define endl "\n"
+	#define ll long long int
+	#define vi vector<int>
+	#define vll vector<ll>
+	#define vvi vector < vi >
+	#define pii pair<int,int>
+	#define pll pair<long long, long long>
+	#define mod 1000000007
+	#define inf 1000000000000000001;
+	#define all(c) c.begin(),c.end()
+	#define mp(x,y) make_pair(x,y)
+	#define mem(a,val) memset(a,val,sizeof(a))
+	#define eb emplace_back
+	#define f first
+	#define s second
+	
+	using namespace std;
+	int main()
+	{
+		std::ios::sync_with_stdio(false);
+		int T;
+		cin>>T;
+		// cin.ignore(); must be there when using getline(cin, s)
+		while(T--)
+		{
+			int n,m;
+			cin>>n>>m;
+
+			int arr[n], arr1[n]; 
+
+			std::map<int, int> m;
+			for(int i = 0; i < n; i++)
+				cin>>arr[i];
+
+			for(i)
+
+
+
+
+		}
+		return 0;
+	}

CodeSignal/Edge of the ocean/matrixElementSum.cpp

@@ -0,0 +1,24 @@
+int matrixElementsSum(std::vector<std::vector<int>> matrix) {
+    int sum = 0;
+
+    for(int i=0 ;i<matrix.size()-1;i++){
+    for(int j = 0 ;j<matrix[i].size();j++){
+
+        
+        if(matrix[i][j]==0){
+            matrix[i+1][j]=0;
+            }
+        }
+    }
+
+  for(int i=0 ;i<matrix.size();i++){
+    for(auto x : matrix[i]){
+        if(x!=0)
+            sum+=x;
+        }
+    }
+
+
+return sum ;
+
+}

CodeSignal/InteviewQuestions/firstDuplicate.cpp

@@ -0,0 +1,15 @@
+int firstDuplicate(std::vector<int> a) {
+  map<int, int> mp;
+  map<int,int>::iterator it;
+   for(int i = 0; i < a.size(); i++){
+    it = mp.find(a[i]);
+    if(it != mp.end()){
+    return a[i];
+    }
+    else
+    mp.emplace(a[i],1);
+    }
+    return -1;
+
+  
+}

CodeSignal/SmoothSailing/firstDuplicate.cpp

@@ -0,0 +1,15 @@
+int firstDuplicate(std::vector<int> a) {
+  map<int, int> mp;
+  map<int,int>::iterator it;
+   for(int i = 0; i < a.size(); i++){
+    it = mp.find(a[i]);
+    if(it != mp.end()){
+    return a[i];
+    }
+    else
+    mp.emplace(a[i],1);
+    }
+    return -1;
+
+  
+}

Language/Java/Book.class

@@ -0,0 +1,56 @@
+import java.io.*;
+
+class Employee implements Serializable{
+	public int id;
+	public String name;
+
+	public Employee(int id, String name){
+		this.id = id;
+		this.name = name;
+	} 
+}
+
+public class Exp2{
+	public static void main(String[] args) {
+		try{
+
+			Employee e1 = new Employee(1, "Vedant");
+
+			FileOutputStream file = new FileOutputStream("output.ser");
+			ObjectOutputStream out = new ObjectOutputStream(file);
+
+			out.writeObject(e1);
+
+			out.close();
+			file.close();
+
+			System.out.println("Object has been serialized");
+
+		} catch(IOException ex){
+			System.out.println("Io Occured");
+		}
+
+		try{
+			FileInputStream file = new FileInputStream("output.ser");
+			ObjectInputStream in = new ObjectInputStream(file);
+
+			Employee e2 = null;
+			e2 = (Employee)in.readObject();
+
+			in.close();
+			file.close();
+
+			System.out.println("Object Deserialized");
+
+			System.out.println(e2.id);
+			System.out.println(e2.name);
+		}
+		catch(IOException ex){
+			System.out.println("IOExp caught");
+		}
+		catch(ClassNotFoundException ex){
+			System.out.println("Class Not Fount Exp");
+
+		}
+	}
+}

Language/Java/Employee.class

@@ -0,0 +1,44 @@
+import java.io.*;
+import java.util.*;
+
+public class FileOp{
+	public static void main(String[] args) {
+		String str = "";
+		//BufferedReader br = null;
+	    try{
+
+	    	LineNumberReader rd = new LineNumberReader(new InputStreamReader(new FileInputStream("file.txt"),"UTF-8"));
+
+	    	while(((str = rd.readLine()) != null) && rd.getLineNumber() < 5){
+	    		System.out.println(str);
+	    	}
+
+	    	rd.close();
+
+	    }catch(FileNotFoundException e){
+	    	System.err.println("File not found");
+	    }
+	    catch(IOException e){
+	    	System.err.println("Unble to read the file");
+	    }
+
+	    try{
+
+	    	String l_word="";
+	    	String curr;
+
+	    	Scanner sc = new Scanner(new File("file.txt"));
+
+	    	while(sc.hasNext()){
+	    		curr = sc.next();
+
+	    		if(curr.length() > l_word.length())
+	    			l_word = curr;		
+	    	}
+
+	    	System.out.println("Longest Word: "+l_word);
+	    }catch(FileNotFoundException e){
+	    	System.err.println("File not found");
+	    }
+	}
+}