We’re preparing your current view and syncing the latest data.
Microsoft SDE-1 Interview Sheet
| Problem | Difficulty | Status | Optional | Action |
|---|---|---|---|---|
| Valid Anagram | Medium | Unsolved | Required | |
| Group Anagrams | Medium | Unsolved | Required | |
| Valid Palindrome | Medium | Unsolved | Required | |
| Longest Substring Without Repeating Characters | Medium | Unsolved | Required | |
| Minimum Window Substring | Medium | Unsolved | Required | |
| Longest Palindromic Substring | Medium | Unsolved | Required | |
| Valid Parentheses | Medium | Unsolved | Required | |
| Min Stack | Medium | Unsolved | Required | |
| Evaluate Reverse Polish Notation | Medium | Unsolved | Required | |
| Simplify Path | Medium | Unsolved | Required |
Strings & Stack State
Build reliable handling for strings, windows, parentheses, and expression-style stacks.
Completion
0%
Problems Remaining
10
Optional Problems
0