Tekion Corp | SSE | DSA

tekion logo
tekion
SDE II
June 29, 20256 reads

Summary

I interviewed at Tekion Corp for an SSE role, which involved a DSA discussion. I was given a problem similar to 'Shortest Subarray with Sum At Least K' with a variation to return indices. I used a sliding window pattern but did not pass the interview.

Full Experience

1 hour of DSA discussion. I was given below problem to solve with slight variation, instead of returning the length, I had to return the start and the end indices of the subarray.

https://leetcode.com/problems/shortest-subarray-with-sum-at-least-k/description/

I solved using sliding window pattern, but didn't work out as I received rejection email a day later.

Hope this helps to anyone!

Interview Questions (1)

Q1
Shortest Subarray with Sum At Least K (Return Indices)
Data Structures & Algorithms

I was given the problem 'Shortest Subarray with Sum At Least K' with a slight variation: instead of returning the length, I had to return the start and the end indices of the subarray.

Discussion (0)

Share your thoughts and ask questions

Join the Discussion

Sign in with Google to share your thoughts and ask questions

No comments yet

Be the first to share your thoughts and start the discussion!