SentinelOne | SSE | Remote | Not Selected
- Result
- No Offer
- Experience
- 5 years
- Posted
- 7 Oct 2025
Summary
I recently interviewed with SentinelOne for their SSE role. After a 4-round process, I was not selected. The interview covered technical questions, system design, and behavioral topics.
How it went
I recently gave SSE interview for SentinelOne. There were total of 4 Rounds. YOE: 5.
1. Screening (1 Hr) - Selected
- Discussion about my current and past experience.
- 2 string related problems. One was about removing consecutive duplicates and print the remaining string and other was related to KMP Algorithm
2. Technical Round 1 (1 Hr) - Selected
- Interviewer asked me questions related to equals and hashcode method. What is the behavior of both the methods in custom and default implementation.
- How it is used in HashMap. How set works internally in Java.
- 1 DSA problem related to counting of most occuring element. Suggested three appraoches.
3. Technical Round 2 (1.5 Hr) - Selected
- 1 graph based DSA problem whose base was to basically find whether two nodes are connected or not. Explained and coded both DFS & DSU approaches
- Follow to the same problem, he asked to find the path with minimum node traversal
- 2nd problem was HLD to design Uber ride booking system
4. Manegerial Round (1 Hr) - Not Selected
- Asked 1 HLD problem to design URL Shortener
- Discussion around my past experience, what major things I developed in last 3 months etc.
Got a mail after 10 mins of interview that I was not shortlisted. Its okay for me. Nothing to worry.
Compensation they were offering:
Base: 32 LPA (After so much negotiation because my current base was low)
Bonus: 12%
RSU: 50k $ for 4 years
Questions asked (7)
- 01
Remove Consecutive Duplicates from String
Data Structures & Algorithms
One problem was about removing consecutive duplicates and print the remaining string.
- 02
KMP Algorithm Problem
Data Structures & Algorithms
Other was related to KMP Algorithm.
- 03
Most Occurring Element Counting
Data Structures & Algorithms
1 DSA problem related to counting of most occuring element. Suggested three approaches.
- 04
Graph Connectivity Check
Data Structures & Algorithms
1 graph based DSA problem whose base was to basically find whether two nodes are connected or not. Explained and coded both DFS & DSU approaches.
- 05
Minimum Node Traversal Path
Data Structures & Algorithms
Follow to the same problem, he asked to find the path with minimum node traversal.
- 06
Uber Ride Booking System Design
System Design
2nd problem was HLD to design Uber ride booking system.
- 07
URL Shortener Design
System Design
Asked 1 HLD problem to design URL Shortener.