Pony.ai is an autonomous vehicle technology company co-located in Silicon Valley, Beijing, and Guangzhou.

It has got a 3.7* rating on Glassdoor and is considered one of the best product-based companies. It is highly regarded for its work-life balance.

They provide good training as well which will be beneficial in future too. You can practice the below questions collected from Pony.ai** **Interview Experience for the interview. We have collected past frequently asked questions from Pony.ai Interview Experience for your reference.

Categories of Questions

## Pony.ai Array Questions

**Question 1. Check if Two given Matrices are Identical** Problem Statement Given two matrices, we will write a function to check whether the two matrices are identical or not. That is, if all the elements in the respective positions of the two matrices are the same, then we say that they are identical. Input Format The first line containing ...

## Pony.ai Tree Questions

**Question 2. Lowest Common Ancestor** Given the root of a binary tree and two nodes n1 and n2, find the LCA(Lowest Common Ancestor) of the nodes. Example What is Lowest Common Ancestor(LCA)? The ancestors of a node n are the nodes present in the path between root and node. Consider the binary tree shown in ...

## Pony.ai Matrix Questions

**Question 3. Check if Two given Matrices are Identical** Problem Statement Given two matrices, we will write a function to check whether the two matrices are identical or not. That is, if all the elements in the respective positions of the two matrices are the same, then we say that they are identical. Input Format The first line containing ...

## Pony.ai Other Questions

**Question 4. Minimum Sideway Jumps LeetCode Solution** Problem Statement Minimum Sideway Jumps LeetCode Solution – There is a 3 lane road of length n that consists of n + 1 points labeled from 0 to n. A frog starts at point 0 in the second lane and wants to jump to point n. However, there could be obstacles along the way. You are given an array obstacles of length n + 1 where each obstacles[i] (ranging from 0 to 3) ...