Skip to main content
🔒 Preview mode. The first 15 Foundations lessons are free; this one is Pro. Start a 7-day trial to unlock the editor, AI hints and the rest of the curriculum. Card required, cancel any time in Dashboard.Start 7-day trial →
← CoursesInterview PrepModule 3 · Trees, Graphs, BFS/DFS · RecapStack: monotonic stack (next greater)write45 / 104
+125 XP
Task
📝 **Task:** Write `next_greater(nums)` returning, for each index, the next greater element to its right (or -1). Print `next_greater([2,1,2,4,3,1])`. Expected: [4, 2, 4, -1, -1, -1] 📋 Edit the starter code. Tests run automatically. 💡 **Hint:** Re-read the theory if stuck.
✏️ Write your code here
🐍
Loading Python...
One-time download (~1 MB). Then it runs instantly.
📊 Result
Press Run to see result...

💬 Discussion

Be the first to ask a question or share a tip.
Sign in to join the discussion. Reading is free.
Loading discussion…