Merge branch 'smv1999:master' into master

Author: vishvarana

Arrays/RunningSumOf1dArray.cpp

@@ -0,0 +1,47 @@
+/*Question:-
+Given an array nums. We define a running sum of an array as runningSum[i] = sum(nums[0]…nums[i]).
+
+Return the running sum of nums.
+
+ 
+
+Example 1:
+
+Input: nums = [1,2,3,4]
+Output: [1,3,6,10]
+Explanation: Running sum is obtained as follows: [1, 1+2, 1+2+3, 1+2+3+4].
+Example 2:
+
+Input: nums = [1,1,1,1,1]
+Output: [1,2,3,4,5]
+Explanation: Running sum is obtained as follows: [1, 1+1, 1+1+1, 1+1+1+1, 1+1+1+1+1].
+Constraints:
+
+1 <= nums.length <= 1000
+-10^6 <= nums[i] <= 10^6
+*/
+#include<bits/stdc++.h>
+using namespace std;
+vector<int> runningSum(vector<int>& nums) {
+        for(int i=1;i<nums.size();i++){
+            nums[i]+=nums[i-1];
+        }
+        return nums;//returning the array
+    }
+int main(){
+vector<int> nums;//to store elements
+int n,element;
+cin>>n;
+ for (int i = 0; i < n; i++)
+    {
+        cin>>element;
+       nums.push_back(element);//storeing the elements
+    }
+vector<int> result=runningSum(nums);//calling the fuction to return the running sum of array
+for (int i = 0; i < result.size(); i++)
+{
+    cout<<result[i]<<",";//print the elements of running sum array
+}
+
+return 0;
+}

Arrays/move_zeroes_end_1traversal.cpp

@@ -0,0 +1,44 @@
+//Move all zeros to End
+//Given an integer array nums, move all 0's to the end of it while maintaining the relative order of the non-zero elements.
+//Approach 2
+//O(n) O(1)
+
+
+// i/p: n=5, 0 1 0 3 12
+// o/p: 1 3 12 0 0
+
+// Here we replace another loop with count
+
+#include<iostream>
+using namespace std;
+void moveToEnd(int arr[],int n)
+{
+	int count=0;
+	for(int i=0;i<n;i++)
+	{
+		if(arr[i]!=0)
+		{
+			//if we get 0 we ignore it
+			//and if we get non zero we swap with count which point at 0
+			swap(arr[i],arr[count]); 
+			count++;				 
+									
+		}
+	}
+}
+
+int main()
+{
+	int n,i;
+	cout<<"Enter the number of elements in array\n";
+	cin>>n;
+	int arr[n];
+	cout<<"Enter the elements in array\n";
+	for(i=0;i<n;i++)
+	  cin>>arr[i];
+	moveToEnd(arr,n);
+	cout<<"Array having zeroes at end\n";
+	for(i=0;i<n;i++)
+	  cout<<arr[i]<<" ";
+
+}

Arrays/move_zeroes_end_2traversal.cpp

@@ -0,0 +1,56 @@
+//Move all zeros to End
+//Given an integer array nums, move all 0's to the end of it while maintaining the relative order of the non-zero elements.
+//Approach 1
+//O(n^2) O(1)
+
+// i/p: n=5, 0 1 0 3 12
+// o/p: 1 3 12 0 0
+
+/*
+Brute froce approach
+n=5
+traversals :
+0 0 1 2 3
+1 0 0 2 3
+1 2 0 0 3
+1 2 3 0 0
+*/
+
+#include<iostream>
+using namespace std;
+void moveToEnd(int arr[],int n)
+{
+	for(int i=0;i<n;i++)
+	{
+	  //We 1st find is there any 0 present
+	  if(arr[i]==0)				
+	   {
+	   for(int j=i+1;j<n;j++){
+		//if non zero then swap with ith 0
+		if(arr[j]!=0)		
+		{
+	         //swap both
+		 swap(arr[i],arr[j]); 
+		 break;
+		}
+	     }	   
+	  }
+	}
+}
+
+
+int main()
+{
+	int n,i;
+	cout<<"Enter the number of elements in array\n";
+	cin>>n;
+	int arr[n];
+	cout<<"Enter the elements in array\n";
+	for(i=0;i<n;i++)
+	  cin>>arr[i];
+	moveToEnd(arr,n);
+	cout<<"Array having zeroes at end\n";
+	for(i=0;i<n;i++)
+	  cout<<arr[i]<<" ";
+
+}