Google | L3 | June 2019

Round 1:

  • Given a grid and you're allowed to move right and up. Find the shortest path from point A to point B.
  • Given a grid and you're allowed to move right and up. Find all possible ways to reach from point A to point B.
  • You're in 2D plane, you can move as per following rules:
    x + 1, y + 1
    x + 1, y - 1
    x + 1, y
    Find no of ways to go from 0, 0 to w, 0

Round 2: [Behavioural Round]

  • When did you have a conflict with your manager ?
  • The most complex feature you've built ?
  • Your strength's and weaknesses.
  • If somebody on your team refuses to attend meetings at night, how will you handle it ?
  • If your team is out of ideas, how will you try to bring new ideas ?
  • One person who've influenced you and you look upto him ?

Round 3:

  • You're given M stacks of coins, you've to pick N coins. Find the maximum value you can take.
  • Tree Game

Round 4:
- The problem boiled down to walks in a graph. If a node appears twice in a walk in a graph then it's called a critical node. Find all such nodes.
- You're given a transformation rules which defines what letters can come after a letter.

  • a - ei
  • e - i
  • i - aeiou
  • o - u
  • u - aeio
    You're given a number N. Find all the words can be generated using above rule with length N. For eg. 3 length words can be 'aei' or 'oue' etc.
Comments (4)