Skip to main content
← CoursesInterview PrepModule 1 · Big-O & Easy PatternsRecursion: backtracking permutationswrite13 / 100
💬 Discuss🧪 Playground+100 XP
Task
📝 **Task:** Write `permutations(nums)` that returns ALL orderings of `nums` as a list of lists. Print `permutations([1, 2, 3])`. 📋 Implement the function above. Test cases run automatically. 💡 **Hint:** Re-read the theory if you get stuck — the pattern is right there.

Keep going

✏️ Write your code here
🐍
Loading Python...
First visit only — ~5-10s. Stays cached afterward.
📊 Result
Press Run to see result...
📣 Help someone learn PythonShare this lesson with a friend — the first 15 are free, no signup.Tweet

💬 Discussion

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