NetSkope Interview for SSE : Round 1
- Posted
- 5 Feb 2026
Summary
I interviewed for a Software Staff Engineer (SSE) position at NetSkope, where I discussed my projects and tackled the LeetCode problem "Backspace String Compare," proposing both O(N) and O(1) space solutions.
How it went
Interviewer discussed on the project and design of the project. What components I owned and the business impact.
Post that interviewer asked simple question : https://leetcode.com/problems/backspace-string-compare/description/
I provided solution using stack with O(N) time and space complexity. Interviewer asked for O(1) Space complexity. Moved ahead with two pointer approach but was not able to cleanly write the code. Interviewer was still happy with the approach and concluded the interview.
Questions asked (1)
- 01
Backspace String Compare
Data Structures & Algorithms · Medium
Open the problemI was asked to solve the problem of comparing two strings after applying backspaces (represented by '#'). I initially provided a solution with O(N) time and space complexity using a stack. The interviewer then challenged me to find an O(1) space solution.