Tekion Corp Software Engineer 2 - Tekion

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.

Full Experience

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

Interview Questions (2)

Minimum Equal Sum of Two Arrays After Replacing Zeros

Data Structures & AlgorithmsMedium

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.

Minimum Cost to Make Array Equal

Data Structures & AlgorithmsHard

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.

Help the Community

Tekion Corp Software Engineer 2 Backend

Summary

Full Experience

Interview Questions (2)

Join the Discussion

No comments yet