Freshworks SSE Interview
Summary
I applied to Freshworks through LinkedIn and completed four face-to-face interview rounds, including technical, bar raiser, and hiring manager discussions. I successfully received an offer within two days after the final round.
Full Experience
Application :
No referral.
I had initially applied for the role through LinkedIn using the "Easy Apply" option, filling in the necessary details. The following week, a recruiter reached out to me to confirm my availability for face to face interviews.
Interview Mode :
Face to Face 4 Rounds in total.
Interview :
Round 1 : [Technical]
- Basic introduction.
- Basic discussion on my current job role & responsibilities.
- Data structure and algorithms. 169 - Majority Element and 545 - Boundary Of Binary Tree (Easy-Medium). Expected solution needed to be time and space optimized.
Verdict : Selected for the next round.
Round 2 : [Technical]
- Basic Introduction.
- Basic discussion on my current job role & responsibilities.
- Basic questions on Java.
- Basic questions on OOPS concept.
- Basic questions on multi-threading.
- Basic design pattern and architecture questions.
- Intermediate questions regarding databases (Indexing, sharding & partitioning).
Verdict : Selected for the next round.
Round 3 : [Bar Raiser]
- Basic Introduction.
- Intermediate questions regarding databases (Indexing, sharding & partitioning).
- Low level discussion on databses and its use cases on real world systems.
Verdict : Selected for the next round.
Round 4 : [Hiring Manager Round]
- Basic Introduction.
- Deep dive into my current job role & responsibilities.
- Tons of behavioral questions.
Verdict : Selected (HR informed me within 2 day).
Compensation Details :
Interview Questions (2)
The boundary of a binary tree is the concatenation of the root, leftmost boundary, rightmost boundary, and leaves, in order. The leftmost boundary is the path from the root to the left-most node. The rightmost boundary is the path from the root to the right-most node. The leaves are all the nodes that are not part of the leftmost or rightmost boundary. Return a list of node values representing the boundary of the binary tree.