✅💯🔥Simple Code📌🚀| 🔥✔️Easy to understand🎯 | 🎓🧠Beginner friendly🔥| O(n) Time Complexity💀💯
Solution tuntun mosi ki photo ke baad hai. Scroll Down\n\n# Code\njava []\nclass Solution {\n    public int[] nextGreaterElements(int[] nums) {\n        int n=n
Solution tuntun mosi ki photo ke baad hai. Scroll Down\n![fd9d3417-20fb-4e19-98fa-3dd39eeedf43_1723794694.932518.png](https://assets.leetcode.com/users/images/a492c0ef-bde0-4447-81e6-2ded326cd877_1724187540.6168394.png)\n# Code\n```java []\nclass Solution {\n    public int[] nextGreaterElements(int[] nums) {\n        int n=nums.length;\n        Stack<Integer> stac=new Stack();\n        int[] ans=new int[n];\n        Arrays.fill(ans, -1); int k=n-1;\n        for(int i=2*n-1; i>=0; i--){\n            while(!stac.isEmpty() && nums[i%n]>=stac.peek()){\n                stac.pop();\n            }\n            if(!stac.isEmpty() && i<n){\n                ans[i]=stac.peek();\n            }\n            stac.push(nums[i%n]);\n        }\n        return ans;\n    }\n}\n```\n![7be995b4-0cf4-4fa3-b48b-8086738ea4ba_1699897744.9062278.jpeg](https://assets.leetcode.com/users/images/fe5117c9-43b1-4ec8-8979-20c4c7f78d98_1721303757.4674635.jpeg)
['Array', 'Stack', 'C', 'Monotonic Stack', 'Python', 'C++', 'Java', 'JavaScript']