Optymizer

Role: Not Specified

College: Not Specified

Interview Date: February 15, 2023

Interview Type: Online Assessment (OA)

Result: Not Specified

Difficulty: Not Specified

Rounds: 1 round (Online Assessment)

Topics Asked: Data Structures (Hash Table, ArrayList), Algorithms (String Manipulation, Counting Pairs)

Experience:

This experience details the first round of an Online Assessment for Optmyzr. The assessment involved two coding questions, with a time limit of 1 hour.

Round 1: Online Assessment

The candidate only had to implement the functions for the given problems.

• **Coding Question 1: `findPairs(int[] nums, int k)`**

  Given an array of integers `nums` and an integer `k`, return the number of unique `k`-diff pairs in the array. A `k`-diff pair is an integer pair `(nums[i], nums[j])` where `i != j` and `abs(nums[i] - nums[j]) == k`. The solution provided used a `HashMap` to count frequencies and then iterate through the map to find pairs.

• **Coding Question 2: `spamOrNotSpam(ArrayList sentences, ArrayList spamwords)`**

  This question involved determining if sentences were "spam" based on a list of "spamwords". A sentence was considered spam if any spamword appeared two or more times within it. The solution used `ArrayList` for sentences and spamwords, and a `HashMap` to count word occurrences in each sentence after splitting and lowercasing.

The candidate was able to solve one of the questions and attempted the other.