tekion logo
Tekion· SDE II

Tekion Corp | SSE | DSA

Posted
29 Jun 2025
338 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.

How it went

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!

Questions asked (1)

  1. 01

    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.

    Open the problem

Know someone preparing? Send it to them:WhatsAppLinkedInX

Interviewed at Tekion recently?

Write up your rounds while you still remember the questions. It helps the next person more than you would think.

Share your experience
Discussion 0

Questions for the author, or how your own interview compared.

Join the discussion

Sign in with Google to comment or ask the author a question.

No comments yet

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