• Crack Google Interview Roadmap

• Google Cracker Sheet

• Google Questions-InterviewBit

Google has a total of 7 rounds. First two are telephonic interviews where the interviewer mostly asks one medium or two easy Algo DS problems to the candidate and the candidate has 45 minutes to solve the problems. However if the performance in Kickstart is good, these rounds are skipped and you directly move to the next rounds. Next we have 5 onsite interviews out of which 4 are Algo DS interviews and 1 is Googliness interview, Googliness interview is mostly a behavioral interview.

• Resume Selection/Shortlisting

• Technical Phone Interview-Two Rounds

  • These are two 45 minutes interviews on the phone where the interviewer shares a Google Doc with the candidate and asks either a medium problem or two easy problems of Algorithms and DS. It is expected that the candidate first explains the solution of the problem to the interviewer and then codes the problem on google doc within the time of the interview. (Suggestion: Practice writing the code on google doc if you have any interview coming up as it is a different experience compared to writing the code in any text editor).

• Coding Rounds-Three or Four Rounds

  • These are 45 minute interviews where the interviewer shares a Google Doc with the candidate and asks Medium to Hard problems of Algorithms and DS. It is expected that the candidate first explains the solution of the problem to the interviewer and then codes the problem on google doc within the time of the interview.

• Googliness Interviews-One Round

  • It’s mostly the behavioral interview to check the cultural fitness of the candidate in the company.

• Hiring Committee

  • After Interviews: Once the interviews are over, the recruiter will contact you with the feedback of the interviews, if the performance is good and the interviews are cleared your profile goes to the different teams in Google for the team matching round.

• Team Matching

  • In the team matching round the team understands your work style and your interests and you can understand their requirements and the work expectations of the team.

• Result

  • Hired: Once the team and you both are comfortable and ready to start, the offer letter is prepared and shared with you by the recruiters and you are HIRED!

• Graphs
  • 1. Representation
    • 1. List.cpp
    • 2. Matrix.cpp
  • 2. BFS
    • 1. Boredom.cpp
    • 2. WordLadder2.cpp
    • 3. MultiSourceBFS.cpp
    • 4. ValidBFS.cpp
  • 3. DFS
    • 1. JourneyToTheMoon.cpp
    • 2. DFSwithStoppingCondition.cpp
    • 3. ConnectedComponents.cpp
    • 4. ReconstructItinerary.cpp
  • 4. CycleDetection
    • 1. DetectCycleUnirectedGraph.cpp
    • 2. DetectCycleDirectedGraph.cpp
    • 3. IsBipartite.cpp
    • 4. LengthOfSmallestCycle.cpp
    • 5. DetectCyclesin2DGrid.cpp
    • 6. Maximum Employees to Be Invited to a Meeting.cpp
  • 5. Topological Sort
    • 1. TopologicalBFS.cpp
    • 2. TopologicalDFS.cpp
    • 3. GameRoutes.cpp
    • 4. LargestColorValueInADirectedGraph.cpp
  • 6. MST
    • 1. Kruskals.cpp
    • 2. Prims.cpp
  • 7. DSU
    • 1. DSUSnippetClass.cpp
    • 2. Redundant Connection II.cpp
  • 8. Shortest Paths Algo
    • 1. Dijkstras.cpp
    • 2. BellmanFord.cpp
    • 3. FLoydWarshall.cpp
  • 9. StronglyConnected
    • 1. Kosarju.cpp
  • 10. Articulation Point and Bridges
    • 1. CutEdges.cpp
    • 2. CutVertex.cpp
  • Readme.md
• Dynamic Programming
  • 1. Barcode.cpp
  • 2. CherryPick.cpp
  • 3. Digit DP-MagicNumbers.cpp
  • Readme.md
• SegmentTree
  • 1. SegmentTreeSnippetClass.cpp
  • 2. Xenia.cpp
  • Readme.md
• Rolling hash
  • 1. Rabin_carp.cpp
• Rest of the Topic
  • Readme.md
• README.md