Merge pull request #26 from naaam-h-siddhu/main

organized CPP code and added new folder wise code

Author: gantavyamalviya

CPP/Leetcode- Longest Substring Without Repeating Characters.cpp renamed to CPP/Problems/Leetcode- Longest Substring Without Repeating Characters.cpp

@@ -0,0 +1,25 @@
+#include<bits/stdc++.h>
+using namespace std;
+int all_pair(int arr[], int n){
+	for (int i = 0; i < n; ++i)
+	{
+		for (int j=i+1 ; j < n; ++j)
+		{
+			cout<<arr[i]<<", "<<arr[j]<<endl;
+		}
+	}
+	return 0;
+}
+
+int main(){
+		int n;
+		cin>>n;
+		int arr[n];
+		for (int i = 0; i < n; ++i)
+		{
+			cin>>arr[i];
+		}
+		all_pair(arr, n);
+
+	return 0;
+}

CPP/Leetcode-141-linked-list-cycle.cpp renamed to CPP/Problems/Leetcode-141-linked-list-cycle.cpp

@@ -0,0 +1,35 @@
+#include<bits/stdc++.h>
+using namespace std;
+int main(){
+	int n,m;
+	cin>>n>>m;
+	// char arr[n];
+	// for (int i = 0; i < n; ++i)
+	// {
+	// 	cin>>arr[i];
+	// }
+	// for (int i = 0; i < n; ++i)
+	// {
+	// 	cout<<arr[i];
+	// }
+
+
+	//2D array
+	int arr[n][m];
+	for (int i = 0; i < n; ++i)
+	{
+		for (int j = 0; j < m; ++j)
+		{
+			cin>>arr[i][j];
+		}
+	}
+	for (int i = 0; i < n; ++i)
+	{
+		for (int j = 0; j < m; ++j)
+		{
+			cout<<arr[i][j]<<" ";
+		}
+		cout<<endl;
+	}
+	return 0;
+}

CPP/Leetcode-148-sort-list.cpp renamed to CPP/Problems/Leetcode-148-sort-list.cpp

@@ -0,0 +1,38 @@
+#include<bits/stdc++.h>
+using namespace std;
+int largestsubarray_sum(int arr[],int n){
+	int largest_sum;
+	for (int i = 0; i < n; ++i)
+	{
+		for (int j = i; j < n; ++j)
+		{	
+			int super_sum=0;
+			for (int k = i; k <= j; ++k)
+			{
+				super_sum+=arr[k];
+			}
+			largest_sum= max(largest_sum,super_sum);
+			
+		}
+	}
+	return largest_sum;
+}
+void initial(){
+	#ifndef ONLINE_JUDGE
+	freopen("input.txt", "r", stdin);
+	freopen("output.txt", "w", stdout);
+	#endif
+}
+int main(){
+	initial();
+	int n;
+	cin>>n;
+	int arr[n];
+	for (int i = 0; i < n; ++i)
+	{
+		cin>>arr[i];
+	}
+	cout<<largestsubarray_sum(arr,n);
+
+	return 0;
+}

CPP/Leetcode-21-merge-two-sorted-lists renamed to CPP/Problems/Leetcode-21-merge-two-sorted-lists

@@ -0,0 +1,31 @@
+#include <bits/stdc++.h>
+using namespace std;
+
+#define ll long long
+#define pb push_back
+#define mod 1000000007
+#define endl '\n'
+void printarr(int arr[][1000],int n,int m){
+    for (int i = 0; i < n; i++) {
+        for (int j = 0; j < m; j++) {
+            cout<<arr[i][j]<<" ";
+        }
+       cout<<endl; 
+    }
+}
+int main(){
+    cin.tie(0)->sync_with_stdio(0);
+    int arr[1000][1000];
+    int n,m;
+    cin >>n>>m;
+    for (int i = 0; i < n; i++) {
+        for (int j = 0; j < m; j++) {
+            cin>>arr[i][j];
+        }
+        
+    }
+    printarr(arr,n,m);
+    return 0;
+}
+
+

CPP/Leetcode-34-find-first-and-last-position-of-element-in-sorted-array.cpp renamed to CPP/Problems/Leetcode-34-find-first-and-last-position-of-element-in-sorted-array.cpp

@@ -0,0 +1,37 @@
+#include<bits/stdc++.h>
+using namespace std;
+int kadane(int arr[], int n){
+	int current=0;
+	int largest=0;
+	for (int i = 0; i < n; ++i)
+	{
+		current+=arr[i];
+		if(current<0){
+			current=0;
+		}
+		largest= max(current,largest);
+	}
+	return largest; 
+}
+void initial(){
+	#ifndef ONLINE_JUDGE
+	freopen("input.txt", "r", stdin);
+	freopen("output.txt", "w", stdout);
+	#endif
+}
+int main(){
+	
+	int n;
+	cin>>n;
+	int arr[n];
+	for (int i = 0; i < n; ++i)
+	{
+		cin>>arr[i];
+	}
+	cout<<kadane(arr, n)<<endl;
+
+
+
+
+	return 0;
+}

CPP/Leetcode-First Missing Positive.cpp renamed to CPP/Problems/Leetcode-First Missing Positive.cpp

@@ -0,0 +1,54 @@
+// #include<bits/stdc++.h>
+// using namespace std;
+// void initial(){
+// #ifndef ONLINE_JUDGE
+// freopen("input.txt", "r", stdin);
+// freopen("output.txt", "w", stdout);
+// #endif
+// }
+// int main(){
+// 	initial();
+// 	int a[]={112,113,44,555,77665,787654};
+// 	int n= sizeof(a)/ sizeof(int);
+// 	cout<<"maximum ="<<*max_element(a,a+n);
+// 	return 0;
+// }
+
+
+
+
+#include<bits/stdc++.h>
+using namespace std;
+int max_arr(int arr[],int n){
+	int max=arr[0];
+
+	for (int i = 1; i < n; ++i)
+	{
+		if (max<arr[i])
+		{
+			max=arr[i];
+		}
+
+	}
+	cout<<max<<endl;
+
+	return 0 ;
+}
+void initial(){
+#ifndef ONLINE_JUDGE
+freopen("input.txt", "r", stdin);
+freopen("output.txt", "w", stdout);
+#endif
+}
+int main(){
+	initial();
+	int arr[]={12,13,14,15,17776,177};
+	int n = sizeof(arr)/ sizeof(int );
+
+
+
+
+
+	max_arr(arr,n);
+	return 0;
+}

CPP/Leetcode-The-Skyline-Problem.cpp renamed to CPP/Problems/Leetcode-The-Skyline-Problem.cpp

@@ -0,0 +1,31 @@
+#include<bits/stdc++.h>
+using namespace std;
+const int n= 1e3+ 10;
+int arr[n][n];
+long long pr[n][n];
+int main(){
+int arr[n][n];
+
+int n;
+cin>>n;		
+for (int i = 1; i <= n; ++i)
+{
+	for (int j = 1; j <=n; ++j)
+	{
+		cin>>arr[i][j];
+		pr[i][j]=arr[i][j]+pr[i-1][j]+pr[i][j-1]-pr[i-1][j-1];
+	}
+}
+int t;
+cin>>t;
+while(t--){
+	int a,b,c,d;
+	cin>>a>>b>>c>>d;
+
+	cout<<pr[c][d]-pr[a-1][d]-pr[c][b-1]+pr[a-1][b-1]<<endl;
+	
+}
+
+
+return 0;
+}

CPP/Leetcode56-Merge_Intervals renamed to CPP/Problems/Leetcode56-Merge_Intervals

@@ -0,0 +1,30 @@
+#include<bits/stdc++.h>
+#define ll long long
+#define pb push_back
+#define fr(a,b) for(int i=a;i<b;i++)
+#define vfr(i,a,b) for(int i=a;i<b;i++)
+#define mod 1000000007
+#define read(x) int x;cin>>x
+const int N=1e5+10;
+int arr[N];
+
+using namespace std;
+int main(){
+	read(n);
+	for (int i = 1; i <=n; ++i)
+	{
+		cin>>arr[i];
+	}
+	read(t);
+	while(t--){
+		read(l);read(r);
+		ll sum=0;
+		for (int i = l; i <= r; ++i)
+		{
+			sum+=arr[i];
+		}			
+		cout<<sum<<endl;
+	}
+
+	return 0;
+}

CPP/Leetcode74-Search_a_2D_Matrix renamed to CPP/Problems/Leetcode74-Search_a_2D_Matrix

@@ -0,0 +1,38 @@
+#include<bits/stdc++.h>
+using namespace std;
+int prefix_sum(int arr[],int n){
+	int largest_sum;
+	for (int i = 0; i < n; ++i)
+	{
+		for (int j = i; j < n; ++j)
+		{	
+			int super_sum=0;
+			for (int k = i; k <= j; ++k)
+			{
+				super_sum+=arr[k];
+			}
+			largest_sum= max(largest_sum,super_sum);
+			
+		}
+	}
+	return largest_sum;
+}ii
+void initial(){
+	#ifndef ONLINE_JUDGE
+	freopen("input.txt", "r", stdin);
+	freopen("output.txt", "w", stdout);
+	#endif
+}
+int main(){
+	initial();
+	int n;
+	cin>>n;
+	int arr[n];
+	for (int i = 0; i < n; ++i)
+	{
+		cin>>arr[i];
+	}
+	cout<<prefix_sum(arr,n);
+
+	return 0;
+}

CPP/Rotate Image renamed to CPP/Problems/Rotate Image

@@ -0,0 +1,31 @@
+		#include<bits/stdc++.h>
+		using namespace std;
+		int reverse(int arr[], int n){
+			int s=0;
+			int e= n-1;
+			while(s<=e){
+				swap(arr[s],arr[e]);
+				s+=1;
+				e-=1;
+			}
+			return 0;
+		}
+		void initial(){
+		#ifndef ONLINE_JUDGE
+		freopen("input.txt", "r", stdin);
+		freopen("output.txt", "w", stdout);
+		#endif
+		}
+		int main(){
+		initial();
+		int arr[]={12,55,66,77,97,987};
+		int n= sizeof(arr)/ sizeof(int);
+		reverse(arr,n);
+		for (int i = 0; i < n; ++i)
+		{
+			cout<<arr[i]<<endl;
+		}
+		
+
+		return 0;
+		}