cpp program

dscmsit · Oct 16, 2022 · 4996794 · 4996794
1 parent bf37bdf
commit 4996794
Show file tree

Hide file tree

Showing 25 changed files with 35 additions and 35 deletions.
diff --git a/BestTimetoBuyandSell_Stocks2.cpp → leetcode/BestTimetoBuyandSell_Stocks2.cpp b/BestTimetoBuyandSell_Stocks2.cpp → leetcode/BestTimetoBuyandSell_Stocks2.cpp
diff --git a/BestTimetoBuyandSell_Stocks3.cpp → leetcode/BestTimetoBuyandSell_Stocks3.cpp b/BestTimetoBuyandSell_Stocks3.cpp → leetcode/BestTimetoBuyandSell_Stocks3.cpp
diff --git a/Cat&Mouse2.cpp → leetcode/Cat&Mouse2.cpp b/Cat&Mouse2.cpp → leetcode/Cat&Mouse2.cpp
diff --git a/LeetcodePivotArray.cpp → leetcode/LeetcodePivotArray.cpp b/LeetcodePivotArray.cpp → leetcode/LeetcodePivotArray.cpp
diff --git a/Linear Search in C++.cpp → leetcode/Linear Search in C++.cpp b/Linear Search in C++.cpp → leetcode/Linear Search in C++.cpp
diff --git a/LowestCommonAncestorBT.cpp → leetcode/LowestCommonAncestorBT.cpp b/LowestCommonAncestorBT.cpp → leetcode/LowestCommonAncestorBT.cpp
diff --git a/MaximalRectangle.cpp → leetcode/MaximalRectangle.cpp b/MaximalRectangle.cpp → leetcode/MaximalRectangle.cpp
diff --git a/MaximumSubarray.cpp → leetcode/MaximumSubarray.cpp b/MaximumSubarray.cpp → leetcode/MaximumSubarray.cpp
diff --git a/MedianOfTwoSortedArrays.cpp → leetcode/MedianOfTwoSortedArrays.cpp b/MedianOfTwoSortedArrays.cpp → leetcode/MedianOfTwoSortedArrays.cpp
diff --git a/Minimum Interval to Include Each Query.cpp → ...inimum Interval to Include Each Query.cpp b/Minimum Interval to Include Each Query.cpp → ...inimum Interval to Include Each Query.cpp
diff --git a/N-queens.cpp → leetcode/N-queens.cpp b/N-queens.cpp → leetcode/N-queens.cpp
diff --git a/N-queens2.cpp → leetcode/N-queens2.cpp b/N-queens2.cpp → leetcode/N-queens2.cpp
diff --git a/NumberofIslands.cpp → leetcode/NumberofIslands.cpp b/NumberofIslands.cpp → leetcode/NumberofIslands.cpp
diff --git a/PalindromeLinkedList.cpp → leetcode/PalindromeLinkedList.cpp b/PalindromeLinkedList.cpp → leetcode/PalindromeLinkedList.cpp
diff --git a/Pigeonhole_sort.cpp → leetcode/Pigeonhole_sort.cpp b/Pigeonhole_sort.cpp → leetcode/Pigeonhole_sort.cpp
diff --git a/ReverseLinkedList.cpp → leetcode/ReverseLinkedList.cpp b/ReverseLinkedList.cpp → leetcode/ReverseLinkedList.cpp
diff --git a/Search2DMatrix2.cpp → leetcode/Search2DMatrix2.cpp b/Search2DMatrix2.cpp → leetcode/Search2DMatrix2.cpp
diff --git a/SearchinRotatedSortedArray.cpp → leetcode/SearchinRotatedSortedArray.cpp b/SearchinRotatedSortedArray.cpp → leetcode/SearchinRotatedSortedArray.cpp
diff --git a/Subsets.cpp → leetcode/Subsets.cpp b/Subsets.cpp → leetcode/Subsets.cpp
diff --git a/Subsets2.cpp → leetcode/Subsets2.cpp b/Subsets2.cpp → leetcode/Subsets2.cpp
diff --git a/binarySearch.cpp → leetcode/binarySearch.cpp b/binarySearch.cpp → leetcode/binarySearch.cpp
diff --git a/leetcode/findthedifference.cpp b/leetcode/findthedifference.cpp
diff --git a/floyd_warshal.cpp → leetcode/floyd_warshal.cpp b/floyd_warshal.cpp → leetcode/floyd_warshal.cpp
diff --git a/rectanglepattern.cpp → leetcode/rectanglepattern.cpp b/rectanglepattern.cpp → leetcode/rectanglepattern.cpp
diff --git a/reverseTwopointer.cpp → leetcode/reverseTwopointer.cpp b/reverseTwopointer.cpp → leetcode/reverseTwopointer.cpp
@@ -1,36 +1,36 @@
-// To reverse array of given data using two poiter approach
-// Created by Vatsal Jha on 12th October 2022
-#include <iostream>
-using namespace std;
-void reverseArray(int arr[], int n)
-{
-    int s = 0;
-    int e = n - 1;
-    while (s <= e)
-    {
-        int temp = arr[s];
-        arr[s] = arr[e];
-        arr[e] = temp;
-        s++;
-        e--;
-    }
-    cout << "after reversing" << endl;
-    for (int i = 0; i < n; i++)
-    {
-        cout << arr[i] << " ";
-    }
-    cout << endl;
-}
-int main()
-{
-    int arr[] = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10};
-    int k = sizeof(arr) / sizeof(int);
-    cout << "before reversing=" << endl;
-    for (int i = 0; i < k; i++)
-    {
-        cout << arr[i] << " ";
-    }
-    cout << endl;
-    reverseArray(arr, k);
-    return 0;
+// To reverse array of given data using two poiter approach
+// Created by Vatsal Jha on 12th October 2022
+#include <iostream>
+using namespace std;
+void reverseArray(int arr[], int n)
+{
+    int s = 0;
+    int e = n - 1;
+    while (s <= e)
+    {
+        int temp = arr[s];
+        arr[s] = arr[e];
+        arr[e] = temp;
+        s++;
+        e--;
+    }
+    cout << "after reversing" << endl;
+    for (int i = 0; i < n; i++)
+    {
+        cout << arr[i] << " ";
+    }
+    cout << endl;
+}
+int main()
+{
+    int arr[] = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10};
+    int k = sizeof(arr) / sizeof(int);
+    cout << "before reversing=" << endl;
+    for (int i = 0; i < k; i++)
+    {
+        cout << arr[i] << " ";
+    }
+    cout << endl;
+    reverseArray(arr, k);
+    return 0;
 }