Cracking Google’s Software Engineer Interview: Solving the Longest Substring Challenge

Google | Software Engineer | Interview Experience

Interview Date: Not specified
Result: Not specified
Difficulty: Not specified

Interview Process

I had a two-part interview at Google. The first part was focused on coding, where I was asked to solve a problem about finding the longest substring without repeating characters. The interviewer was really helpful and provided hints when I got stuck. After that, we moved on to behavioral questions, where the interviewer asked about my experience working in teams and how I handle conflict.

Technical Questions

  1. Longest Substring Without Repeating Characters (Sliding Window, Hash Table)

Tips & Insights

Overall, I felt it went well!