Sofi Online Assessment Questions

#347 Top K Frequent Elements

LeetCode #347: Top K Frequent Elements. Difficulty: Medium. Topics: Array, Hash Table, Divide and Conquer, Sorting, Heap (Priority Queue), Bucket Sort, Counting, Quickselect. Asked at SoFi in the last 6 months.

#380 Insert Delete GetRandom O(1)

LeetCode #380: Insert Delete GetRandom O(1). Difficulty: Medium. Topics: Array, Hash Table, Math, Design, Randomized. Asked at SoFi in the last 6 months.

Count completed trips from vehicle event logs (entry -> road -> exit)

## Problem You are given text logs for multiple vehicles (each record includes a license plate and an event type). Event types are: `entry`, `road`, `exit`. A **trip** is counted when the **same plat

LeetCode 1198 — Find Smallest Common Element in All Rows

Given an `m x n` integer matrix `mat` where each row is sorted in **non-decreasing** order, find the smallest integer that appears in **every row**. - Return the smallest such integer if it exists. -

Implement Button-Triggered Fetch with Lazy Loading in Vanilla JavaScript

## Task: Implement Button-Triggered Fetch + Lazy Loading in Vanilla JavaScript (No Frameworks) On a simple web page (you may build on the previous HTML structure), implement **vanilla JavaScript** lo

Build a Search Bar with HTML/CSS (No Framework)

## Task: Build a Search Bar UI Using Only HTML + CSS (No Frameworks) Implement a search bar UI using **only HTML and CSS** (no frameworks or component libraries). ### Functional & structural require

K-th Unique Maximum from Two Sorted Arrays

## Problem: K-th Unique Maximum from Two Sorted Arrays Given two **ascending sorted** integer arrays `A` and `B` (each may contain duplicates) and an integer `K`, return the `K`-th element in the seq

RunCollection: Simulate chance of matching or beating personal best

### Coding: Monte Carlo probability that an in-progress run matches or beats the personal best You are implementing a statistics system for obstacle-course racing. - A `Course` has `obstacle_count`

Second Most Frequent Tag from Flattened Triples

## Problem: Find the Second Most Frequent Tag from a Flattened String List You are given a string list `arr` whose elements repeat in the following fixed order: ``` [id1, name1, tag1, id2, name2, ta

Design a Multi-threaded Task Executor with Extensible Task Types (Semaphore-based)

## Problem: Design and Implement an Extensible Multi-threaded Task Executor (Semaphore-based) You are given a Java `TaskExecutor` skeleton and must implement a **multi-threaded task executor** using