Technical Interview at Zluri

zluri logo
zluri
Rejected
October 13, 20244 reads

Summary

I recently interviewed at Zluri for a technical role, which involved a single DSA round with two questions. Unfortunately, I was unable to solve the second question, leading to my rejection.

Full Experience

I was contacted by HR at Zluri and scheduled for a technical interview over the weekend. The first round was a DSA round, lasting 1 hour, and involved two algorithmic problems. The first question was about balancing weights on a barbell with a minimum weight satisfaction condition. For the second question, I was given a standard LeetCode problem involving letter combinations of a phone number. I struggled with the second question and ultimately couldn't solve it, which resulted in my rejection.

Interview Questions (2)

Q1
Barbell Weight Balancing
Data Structures & Algorithms

You are given an array of weights. There is a person in the gym who sets a minimum weight they need to lift, let's call it minWeightToSatisfy. The task is to determine if it's possible to partition the given array of weights into two subsets (representing the left and right sides of a barbell) such that:

  1. The sum of weights in the left subset equals the sum of weights in the right subset.
  2. This common sum (for both left and right sides) is at least `minWeightToSatisfy`.
  3. Each weight from the input array can be used at most once.

Examples:

  • `minWeightToSatisfy : 20`, `Weights : [2,2,4,5,5, 5]`      Expected Ans: `False`
  • `minWeightToSatisfy : 20`, `Weights : [2,2,4,4,4,5,5, 5]`      Expected Ans: `False` (Illustrates that even if sums match like `5+4+2` on one side and `2+4+5` on other, they might not meet `minWeightToSatisfy` or use available weights correctly)
Q2
Letter Combinations of a Phone Number
Data Structures & AlgorithmsMedium

Given a string containing digits from 2-9 inclusive, return all possible letter combinations that the number could represent. Return the answer in any order. A mapping of digits to letters (just like on the telephone buttons) is given. Note that 1 does not map to any letters.

Example 1: Input: digits = "23" Output: ["ad","ae","af","bd","be","bf","cd","ce","cf"]

Example 2: Input: digits = "" Output: []

Example 3: Input: digits = "2" Output: ["a","b","c"]

Discussion (0)

Share your thoughts and ask questions

Join the Discussion

Sign in with Google to share your thoughts and ask questions

No comments yet

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