Блог пользователя utkarsh_108

Автор utkarsh_108, история, 2 месяца назад, По-английски

In this blog, I will explain how to ace the Google interview for a Software Engineering (SWE) intern position, including how to prepare and approach problem-solving effectively

I am an upcoming SWE intern in Google so I am credible enough to answer this question based on my experience and understanding of the interview process.

Interview Tips

  • Make it a habit to write your code on Notepad or Google Docs, This is important because the autocomplete features and other helpful coding tools that you may rely on during your regular coding sessions will not be available in the interview setting
  • Ensure your variable names are as descriptive and meaningful as possible to improve code readability and help the interviewer follow your logic.
    Don't use 
    int n=arr.size() use instead int arraySize=arr.size();
    for(int i=0;i<n;i++) use instead for(arrayIndex=0;arrayIndex<arraySize;arrayIndex++)
  • Speak about what you are doing while writing code, so that the interviewer does not lose interest and does not feel bored. Also, do not hesitate to take hints if you are stuck somewhere.
  • Make sure to carefully read the problem statement to avoid wasting time-solving the wrong question or misunderstanding key requirements.
  • If you don't understand any part of the problem statement, ask the interviewer for clarification. This won't leave a negative impression
  • Declare functions that perform specific tasks, increasing code readability and making your solution easier to follow and maintain and make the function name which is related to what it does.
    Don't use 
    int f(int a,int b) use instead int sumOfNumber(int number1,int number2)
  • Make sure you have a better understanding of the time complexity of each data structure, such as map, unordered map, set, unordered set, and disjoint set union, etc as this will help you analyze their time complexities effectively.
  • practice important topics related to graphs, as they are highly valued in interviews. Google particularly favors graph-related problems, so it is essential to prepare these topics thoroughly to ensure a strong understanding and proficiency.
    topics:
    depth-first search,breadth-first search, shortest path algorithm, toposort, disjoint-set-union etc.

I have documented the strategy I used during my Google interview, highlighting the key approaches and techniques that helped me succeed.

If you have any questions regarding the strategies I've shared, I warmly welcome you to ask them in the comments or in instagram. I'm here to help and provide any clarification you may need! instagram

I truly hope you find this information enjoyable and helpful in your preparation journey.

  • Проголосовать: нравится
  • -31
  • Проголосовать: не нравится

»
2 месяца назад, # |
  Проголосовать: нравится +27 Проголосовать: не нравится

"for(int i=0;i<n;i++) use instead for(arrayIndex=0;arrayIndex<arraySize;arrayIndex++)"

The rest is generic advice, but this is actual nightmare fuel.

»
2 месяца назад, # |
  Проголосовать: нравится 0 Проголосовать: не нравится

Thanks sir, to the point advice!!!