Twilio interview experience Real time questions & tips from candidates to crack your interview
Software Engineer
Twilio
3 rounds | 6 Coding
problems
Rejected
Interview preparation journey
Journey
I started coding in 11th grade at my school. I solved coding challenges on various platforms daily and participated in every possible hackathon to develop my skills.
Application story
The company visited your campus for placements, where they first conducted an online assessment and then called us for the interview.
Why selected/rejected for the role?
I think I was rejected because I was unable to answer all the questions correctly within the given time during the interview.
Preparation
Duration: 3 Months
Topics: Data Structures, Pointers, OOPS, System Design, Algorithms, Dynamic Programming
Tip 1: Practice at least 250 questions.
Tip 2: For example, complete at least two projects.
Application process
Where: Campus
Eligibility: Above 7 CGPA
Tip 1: Keep your resume concise and clear. List your projects and internships with a brief description and the year of completion. Mention the programming languages you are proficient in, along with other technical skills you excel at. Avoid including anything you are not confident about. Highlight the topics you are truly strong in.
Tip 2: Be honest and include only those skills and experiences in your resume that you genuinely know. Adding anything unfamiliar may have a negative impact if questioned about it during the interview.
Interview rounds
01
Round
Easy
Video Call
Duration60 Minutes
Interview date14 Jan 2023
Coding problem2
1. Encode and Decode
Easy
15m average time
85% success
0/40
Asked in companies
Tiny URL is an online URL shortening service, where you get a short version of a given URL as a substitute.
Your task is to design encode the original URL “S”, into a tiny URL and decode the previously encoded tiny URL into the original URL.
Example:
S= “https://youtu.be/dQw4w9WgXcQ”, can be encoded to TinyUrl “http://tinyurl.com/abcdef”, then in future queries “http://tinyurl.com/abcdef” can be decoded into “https://youtu.be/dQw4w9WgXcQ”
Note:
The URL given to you for decoding will always be one of the URLs you have already returned after encoding in the past.
The encoded URL should strictly be of the format “http://tinyurl.com/abcdef”, where instead of “abcdef” you can have any alphanumeric code of length 6.
Problem approach
- Pick the first character from the source string.
- Append the selected character to the destination string.
- Count the number of consecutive occurrences of the selected character and append the count to the destination string.
- Move to the next character and repeat steps 2 and 3 until the end of the string is reached.
2. Technical Question
- How can a database affect the scalability and performance of a system?
Problem approach
Tip 1: Make sure to study the basics of system design.
Tip 2: Develop a good understanding of caching, scalability, database indexing, etc.
02
Round
Easy
Video Call
Duration60 Minutes
Interview date14 Jan 2023
Coding problem3
1. Trapping Rain Water
Moderate
15m average time
80% success
0/80
Asked in companies
You have been given a long type array/list 'arr’ of size 'n’.
It represents an elevation map wherein 'arr[i]’ denotes the elevation of the 'ith' bar.
Print the total amount of rainwater that can be trapped in these elevations.
Note :
The width of each bar is the same and is equal to 1.
Example:
Input: ‘n’ = 6, ‘arr’ = [3, 0, 0, 2, 0, 4].
Output: 10
Explanation: Refer to the image for better comprehension:
Note :
You don't need to print anything. It has already been taken care of. Just implement the given function.
2. Merge Point of Two Linked Lists
Moderate
0/80
Asked in companies
Given two singly linked lists, 'FIRST_HEAD' and 'SECOND_HEAD'. Your task is to find the 'MERGING POINT' i.e. the data of the node at which merging starts. If there is no merging, return -1.
For example:-
The given Linked Lists are merging at node c1.
In this case, c1 is 'MERGING POINT'.
Problem approach
Traverse both linked lists once to determine which one is longer.
Connect the tail of the longer list to its head.
Now, start from the head of the shorter linked list using two pointers, as done in the cycle detection algorithm.
Find the point where both pointers meet.
Reset one of the pointers to the head of the shorter linked list.
Now, move both pointers at the same speed (one step at a time).
The point where they meet is the merge point.
3. Find Number Of Islands
Moderate
34m average time
60% success
0/80
Asked in companies
You are given a 2-dimensional array/list having N rows and M columns, which is filled with ones(1) and zeroes(0). 1 signifies land, and 0 signifies water.
A cell is said to be connected to another cell, if one cell lies immediately next to the other cell, in any of the eight directions (two vertical, two horizontal, and four diagonals).
A group of connected cells having value 1 is called an island. Your task is to find the number of such islands present in the matrix.
Problem approach
- We will maintain an array called "islands" to record the number of islands visited.
- Traverse through each element of the grid.
- If an element is land (grid[i][j] == 1) and has not been visited, increment the islands count and change the value of that element to water (0).
- Convert all adjacent land elements to water (0).
03
Round
Easy
HR Round
Duration60 Minutes
Interview date14 Jan 2023
Coding problem1
1. Basic HR Questions
- Tell me about yourself.
- Why should I hire you?
- What are your strengths and weaknesses?
- Why do you want to work at our company?
- What is the difference between confidence and overconfidence?
Here's your problem of the day 
Solving this problem will increase your chance to get selected in this company
Skill covered: Programming
How do you remove whitespace from the start of a string?
Choose another skill to practice
Similar interview experiences
SDE - 1
3 rounds | 7 problems
Interviewed by Twilio
Rejected
1244 views
1 comments
0 upvotes
SDE - 1
4 rounds | 8 problems
Interviewed by Amazon
Selected 8963 views
0 comments
0 upvotes
SDE - Intern
1 rounds | 3 problems
Interviewed by Amazon
Selected 3502 views
0 comments
0 upvotes
SDE - 2
4 rounds | 6 problems
Interviewed by Expedia Group
Selected 2764 views
0 comments
0 upvotes
Companies with similar interview experiences
Software Engineer
3 rounds | 7 problems
Interviewed by Optum
Selected 7977 views
1 comments
0 upvotes
Software Engineer
5 rounds | 5 problems
Interviewed by Microsoft
Selected 10148 views
1 comments
0 upvotes
Software Engineer
2 rounds | 4 problems
Interviewed by Amazon
Selected 4448 views
1 comments
0 upvotes