tekion logo
Tekion· Software Engineer 2 Backend

Tekion Corp Software Engineer 2 Backend

Experience
4.5 years
Posted
9 May 2025
315 reads

Summary

I interviewed for a Software Engineer 2 Backend position at Tekion Corp. I was given two LeetCode problems and managed to solve one of them. Unfortunately, I was rejected after the interview.

How it went

Questions asked (2)

  1. 01

    Minimum Equal Sum of Two Arrays After Replacing Zeros

    Data Structures & Algorithms · Medium

    You are given two arrays nums1 and nums2 consisting of non-negative integers. You have to choose an integer x and replace all occurrences of 0 in nums1 with x, and replace all occurrences of 0 in nums2 with x. After these replacements, the sum of elements in nums1 and nums2 must be equal. Return the minimum possible equal sum. If it's not possible to make the sums equal, return -1.

    Open the problem
  2. 02

    Minimum Cost to Make Array Equal

    Data Structures & Algorithms · Hard

    You are given two 0-indexed arrays nums and cost of length n each. You can change any element of nums to any integer x. The cost of changing nums[i] to x is |nums[i] - x| * cost[i]. Return the minimum total cost such that all elements of nums become equal.

    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!