The interviewer introduced the task as a small operations tool for managing staff shifts. The question was Staff Time Tracking from Shift Logs: https://www.chillinterview.com/learn/coding-interview-questions/staff-time-tracking-from-shift-logs. I was given shi...
Showing 21-30 of 83 forum items
I took an online assessment on HackerRank, and neither question was directly from LeetCode. **Question 1:** This was similar to the Jump Game problem. Given an array, I had to start at index 0 and jump either one step to the right or jump by a prime number tha...
I was asked to implement the following functions: ``` int insertNewCustomer(double revenue) -> returns a customer ID int insertNewCustomer(double revenue, int referrerID) -> returns a customer ID Set<Integer> getLowestK(int k, double minTotalRevenue) -> return...
I was asked two coding problems. - Leetcode 116 - Leetcode 375
**Phone Screen**: Leetcode 79 The onsite interview consisted of four rounds. **Round 1:** The coding question was relatively simple, but I don't remember the specifics. I finished it in about 20 minutes. **Round 2:** This was an object-oriented design (OOD) qu...
The first question was LeetCode. The second question, which I hadn't seen before, was similar to climbing stairs. In this variation, I could take an elevator once at the beginning. Each floor has an energy gain e1 and a time t1 if I take the elevator. After th...
The online assessment included these two coding questions: 1. **Price Discount:** Given a `prices` array, find the first number to the right of each element that is smaller than the element itself. The difference between these two numbers is the discount. If t...
The question I got was: Given a sorted array containing positive and negative numbers, sort the array by the square of each number. I initially suggested a heap-based solution. The interviewer asked me to optimize it. I proposed a two-pointer approach, but the...
The problem description is as follows: A disk stores hierarchical data in the form of an undirected tree. The tree has `tree_nodes` nodes, numbered from `0` to `tree_nodes - 1`, with node `0` as the root. Each node stores a character given by the array `arr`,...
The interviewer asked whether I had worked with graph-like systems before starting the problem. The question was Signal Amplification Network: https://www.chillinterview.com/learn/coding-interview-questions/signal-amplification-network. I was given a network a...
