google logo
Google· SDE II

Google L4 Telephone Screen

Posted
7 Apr 2025
327 reads

Summary

I had a telephone screen with Google for an L4 role where I was presented with the 'Linear Chess' problem.

How it went

Linear Chess


Given two strings, start and target. Is it possible to reach target from start given the conditions.

  1. String can contain "L", "R" or "_".
  2. L denotes a left pawn which can move only in left direction, R denotes a right pawn which can move only in right direction.
  3. Pawns can't capture or jump over other pawns.

Example : start = "LL" target = "L_L_" output - True

Questions asked (1)

  1. 01

    Linear Chess

    Data Structures & Algorithms

    Given two strings, start and target. Is it possible to reach target from start given the conditions.

    1. String can contain "L", "R" or "_".
    2. L denotes a left pawn which can move only in left direction, R denotes a right pawn which can move only in right direction.
    3. Pawns can't capture or jump over other pawns.

    Example : start = "LL" target = "L_L_" output - True

Know someone preparing? Send it to them:WhatsAppLinkedInX

Interviewed at Google recently?

Write up your rounds while you still remember the questions. It helps the next person more than you would think.

Share your experience
Discussion 0

Questions for the author, or how your own interview compared.

Join the discussion

Sign in with Google to comment or ask the author a question.

No comments yet

Be the first to share your thoughts and start the discussion!