Added Solution - GfG to GitHub

Difficulty: Medium/Next Greater Element/next-greater-element.cpp

@@ -0,0 +1,61 @@
+//{ Driver Code Starts
+#include <bits/stdc++.h>
+using namespace std;
+
+
+// } Driver Code Ends
+class Solution {
+  public:
+    // Function to find the next greater element for each element of the array.
+    vector<int> nextLargerElement(vector<int>& nums) {
+          int n = nums.size();
+    vector<int> result(n, -1); // Initialize the result array with -1
+    stack<int> s; // Stack to store indices of elements
+
+    for (int i = 0; i < n; ++i) {
+        // While the stack is not empty and the current element is greater than the element at the index stored in the stack
+        while (!s.empty() && nums[i] > nums[s.top()]) {
+            result[s.top()] = nums[i]; // Update the result for the element at the top of the stack
+            s.pop(); // Pop the index from the stack
+        }
+        s.push(i); // Push the current index onto the stack
+    }
+
+    return result;
+    }
+};
+
+//{ Driver Code Starts.
+
+int main() {
+    int t; // Number of test cases
+    cin >> t;
+    cin.ignore(); // Ignore the newline after reading t
+    while (t--) {
+        vector<int> a;
+        string input;
+
+        // Reading the entire input line for the array
+        getline(cin, input);
+        stringstream ss(input);
+        int num;
+        while (ss >> num)
+            a.push_back(num); // Read the array elements from input string
+
+        Solution obj;
+        vector<int> result = obj.nextLargerElement(a);
+
+        // Print the result in the required format
+        for (int i = 0; i < result.size(); i++) {
+            if (i != 0)
+                cout << " ";
+            cout << result[i];
+        }
+        cout << endl;        // Ensure new line after each test case output
+        cout << "~" << endl; // Ensure new line after each test case output
+    }
+
+    return 0;
+}
+
+// } Driver Code Ends