Education: B.Tech in CS from IIT
Years of experience: 4+ years
Current Company : Top MNC
Current TC : 42 LPA
Location: Bangalore
Company : Harness
Position : Senior Software Engineer
Date : Dec '23
Round 1: PS/DS. Time: 60 mins
- Q1: find index in the array where sum of left subarray == right subarray, if not -1
- Q2: https://leetcode.com/problems/symmetric-tree/description/
- some project related questions
Focus areas :
Any local editor / IDE can be used
Proper working code for sample test cases
Dry run and time/space complexity analysis
Round 2: PS/DS. Time: 60 mins
-
Q1: Given list of integers sort the list based on number 1's present in binary representation of each number, maintain the original order if the number of 1's are same for any two integers
Example
Input - [ 3, 7, 8, 4 ]
Output -[ 8, 4, 3, 7]
similar to https://leetcode.com/problems/sort-integers-by-the-number-of-1-bits/description/ -
Q2. High level SQL queries(nested) to view particular data
Focus areas :
same as round 1
Round 3: PS/DS + HLD round. Time: ~60 mins
- Q1. Convert String inputPath = “/a/b/../c/./d/../e”; to a simplified path = “/a/c/e” just like in cmd.
- Q2. Distrubuted locking using Redis.
Round 4: Hiring Manager Screen. Time: ~40 mins
Focus areas :
- Project deep dive
- Cultural fit questions
Verdict: Selected
Offer: https://leetcode.com/discuss/compensation/4465807/Harness-or-Senior-Software-Engineer-or-Bangalore-or-Dec'23-Offer
Other interview experiences :
