tekion logo
Tekion· Associate Software Engineer

Tekion Associate Software Engineer Questions- 2021

Result
Ongoing
Posted
7 Jul 2021
309 reads

Summary

I successfully navigated an online HackerEarth test, passing the initial screening to proceed to a technical interview round. Although my performance in the technical round was average, I received an invitation for the subsequent interview stage.

How it went

I applied for the Associate Software Engineer role at Tekion through a referral I got via LinkedIn. About ten days later, I received an email inviting me to an online HackerEarth test.

The HackerEarth test was 1.5 hours long and consisted of 10 MCQs, primarily covering OOPs, DBMS, time/space complexity, and code output, along with 2 coding questions. The MCQs were of easy-medium difficulty, and the coding questions were medium-hard. My camera was off throughout the test. For the first coding question, which was LeetCode's 'Find the Minimum Number of Fibonacci Numbers Whose Sum Is K,' I managed to solve it completely, and all test cases passed. For the second coding question, I wrote some code, but unfortunately, it didn't pass all the test cases. Despite this, I received a positive result and an invite for the next round after two days.

Round 1 was a one-hour session with a single coding question, which was LeetCode's 'Combination Sum.' I approached it with a recursive solution and implemented it. When the interviewer asked if I could optimize the solution, I struggled and couldn't find a better approach. Overall, I felt my performance in this interview was average.

Questions asked (2)

  1. 01

    Find the Minimum Number of Fibonacci Numbers Whose Sum Is K

    Data Structures & Algorithms · Medium

    Given an integer k, return the minimum number of Fibonacci numbers whose sum is equal to k. The same Fibonacci number can be used multiple times. The Fibonacci numbers are generated using the formula F(0) = 0, F(1) = 1, F(n) = F(n - 1) + F(n - 2) for n > 1.

    Open the problem
  2. 02

    Combination Sum

    Data Structures & Algorithms · Medium

    Given an array of distinct integers candidates and a target integer target, return a list of all unique combinations of candidates where the chosen numbers sum to target. You may return the combinations in any order. The same number may be chosen from candidates an unlimited number of times.

    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!