Agoda | 6 yrs experience | Bangkok
- Location
- bangkok
- Experience
- 6 years
- Posted
- 21 Apr 2023
Summary
I recently interviewed at Agoda for a role in Bangkok, bringing 6 years of experience. The interview process included two rounds, covering SQL, data structures, algorithms, and fundamental design principles.
How it went
I recently had an interview experience with Agoda for a role in Bangkok, bringing 6 years of experience to the table. The process was structured into two main rounds.
Round 1: Technical Screening
This round focused heavily on problem-solving, covering SQL, linked lists, and string manipulation. I was asked to:
- Write an SQL query to find the customer with the most orders.
- Implement a function to add two numbers represented by linked lists in reverse order.
- Sort characters in a string by their frequency of occurrence.
Round 2: Design and Concepts
The second round delved into more theoretical and design-oriented questions. We discussed concepts like Dependency Injection and Inheritance. There was also a Low-Level Design (LLD) problem that required the use of a Set-like data structure.
Questions asked (3)
- 01
Find Customer with Most Orders (SQL)
Other
Write an SQL query to find the customer_number for the customer who has placed the largest number of orders.
Orders table:
+---------------+-----------------+ | order_number | customer_number | +---------------+-----------------+ | 1 | 1 | | 2 | 2 | | 3 | 3 | | 4 | 3 | | 5 | 5 | +---------------+-----------------+ - 02
Add Two Numbers (Linked Lists)
Data Structures & Algorithms · Medium
You are given two non-empty linked lists representing two non-negative integers. The digits are stored in reverse order, and each of their nodes contains a single digit. Add the two numbers and return the sum as a linked list.
Input: l1 = [2,4,3], l2 = [5,6,4]
Output: [7,0,8]
Explanation: 342 + 465 = 807.
Input: l1 = [0], l2 = [0]
Output: [0] - 03
Sort Characters by Frequency
Data Structures & Algorithms · Medium
Sort characters by frequency of occurrence.
Input: s = "tree"
Output: "eert"
Input: s = "aabb"
Output: "bbaa"