Google TPS in less than a month
Google TPS in Less Than a Month: A Journey into DSA Preparation
Hello fellow leetcoders!
I’m thrilled to share that I have a Technical Phone Screen (TPS) scheduled with Google in their Bangalore office for early careers in the first week of January. As someone who is fairly new to Data Structures and Algorithms (DSA), this is both an exciting and nerve-wracking opportunity.
About Me
I primarily work in scientific software development, which has given me a solid foundation in programming but not much exposure to algorithmic problem-solving. Recently, I received an interview invite from Google, and I thought, why not seize the opportunity? In preparation, I’ve completed about 120 LeetCode problems, mostly from the well-curated LeetCode Interview 150 set.
My Preparation Strategy
With just a month to prepare, I’m reaching out to this community for insights into crafting an effective study plan. Here’s what I’m considering, and I’d love to hear your feedback or any additional tips you might have.
1. Identify Weak Areas
First, I need to assess my current skill level. I plan to categorize the problems I’ve solved into different topics such as arrays, strings, trees, and dynamic programming. This will help me identify areas where I need more practice.
2. Daily Problem Solving
I aim to solve at least 3-5 problems daily, focusing on a mix of easy, medium, and hard problems. I’ll also revisit the problems I found challenging and ensure I understand the underlying concepts.
3. Mock Interviews
Simulating the interview environment is crucial. I’ll be using platforms like Pramp or interviewing.io to practice live coding with peers. This will help me improve my communication skills and get accustomed to thinking aloud during problem-solving.
4. Study Algorithms and Data Structures
While solving problems is vital, understanding the theory behind algorithms is equally important. I plan to dedicate time to study key algorithms and data structures, including:
- Sorting and searching algorithms
- Dynamic programming concepts
- Graph algorithms (DFS, BFS, Dijkstra’s)
- Trees (binary trees, binary search trees, heaps)
5. Review and Revise
I’ll maintain a journal to note down the key takeaways from each problem I solve. This will serve as a quick reference guide for revision as the interview date approaches.
Call for Experience
I’m particularly interested in hearing from anyone who was once at a similar level of DSA proficiency and successfully cracked the Google interview. How did you structure your preparation? What resources did you find most helpful? Any specific problem sets you would recommend focusing on?
Conclusion
I’m viewing this interview as a significant learning opportunity, and I’m ready to grind as hard as necessary to prepare for it. Your insights and experiences would be invaluable in helping me plan my preparation effectively. Let’s discuss and help each other grow in our DSA journey!
Looking forward to your comments and suggestions!
Happy coding!