PayPal

OA - 3 question. First question was based on loops. Second question was based on binary search. Third question was very difficult. Tech 1 - Introduction: Find target sum. Add two linked lists.

The interview included direct coding questions about data structures and algorithms. These questions were of medium difficulty. Topics covered included the Trie data structure, graphs, and trees. Candidates needed to be quick in answering, as three

The interview was good and lasted for 45 minutes. I was first asked to introduce myself. Later, the interviewer shared their screen and asked questions related to binary search trees.