We’re preparing your current view and syncing the latest data.
Google SDE-1 Interview Sheet
| Problem | Difficulty | Status | Optional | Action |
|---|---|---|---|---|
| Valid Anagram | Medium | Unsolved | Required | |
| Group Anagrams | Medium | Unsolved | Required | |
| Longest Substring Without Repeating Characters | Medium | Unsolved | Required | |
| Minimum Window Substring | Medium | Unsolved | Required | |
| Valid Palindrome | Medium | Unsolved | Required | |
| Find All Anagrams In A String | Medium | Unsolved | Required | |
| Permutation in String | Medium | Unsolved | Required | |
| Longest Palindromic Substring | Medium | Unsolved | Required | |
| String to Integer (atoi) | Medium | Unsolved | Required | |
| Regular Expression Matching | Medium | Unsolved | Required |
Strings & Windows
Practice anagram grouping, substring windows, palindrome DP, and regex-level state thinking.
Completion
0%
Problems Remaining
10
Optional Problems
0