Tekion Corp Software Engineer 2 Backend
- Experience
- 4.5 years
- Posted
- 9 May 2025
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
Hi
YOE 4.5+
1.https://leetcode.com/problems/minimum-equal-sum-of-two-arrays-after-replacing-zeros/description/
2.https://leetcode.com/problems/minimum-cost-to-make-array-equal/description/
able to solve 1 question
Verdict : Rejected
Questions asked (2)
- 01
Minimum Equal Sum of Two Arrays After Replacing Zeros
Data Structures & Algorithms · Medium
Open the problemYou are given two arrays
nums1andnums2consisting of non-negative integers. You have to choose an integerxand replace all occurrences of0innums1withx, and replace all occurrences of0innums2withx. After these replacements, the sum of elements innums1andnums2must be equal. Return the minimum possible equal sum. If it's not possible to make the sums equal, return -1. - 02
Minimum Cost to Make Array Equal
Data Structures & Algorithms · Hard
Open the problemYou are given two 0-indexed arrays
numsandcostof lengthneach. You can change any element ofnumsto any integerx. The cost of changingnums[i]toxis|nums[i] - x| * cost[i]. Return the minimum total cost such that all elements ofnumsbecome equal.