Input (stdin)The program reads the input line by line. Each line must be one of the following message types: • A print represents a trade that took place on the exchange: • A volume check is a request to report the total traded quantities of a security in the preceding minute, as well as its…

You have been tasked with creating an exchange where traders can buy and sell Sea Shells. The program reads incoming orders and emits trades. Input (stdin) – the input is a stream of limit orders. Each line is a separate order identified by its line number (starting at 1), with space-delimited fields: Examples: Processing orders…

A Kac ring is a dynamical system defined as follows: Part 1: Implement a Kac ring with the following interface: Brief summary: Simulate a circular system where balls move one step each tick and flip color only when leaving a marked slot. Build an object with step() and an O(1) color() that returns (white−black)/N(white –…

The program reads the input line by line from stdin.Each line is exactly one of the following message types: Fields (space-delimited): An order is: Output For each volume-check for security S at time T, emit exactly one line: Where: A volume-check response must be printed immediately before reading the next input line. For each order…

Ski season is approaching! You work at a ski resort and must ensure the slopes are fully covered with snow. You have a slope with indices from 0…N, and a collection of snow-making machines installed along the slope.Each machine is a tuple (index, range) meaning the machine sits at index and can cover the slope…

Problem (verbatim) Design a data structure that supports insert, delete, search, and getRandom in constant time. Use a dynamic array + hash map (value → index). The VOprep team has long accompanied candidates through various major company OAs and VOs, including Tiktok, Google, Amazon, Citadel, SIG, providing real-time voice assistance, remote practice, and interview pacing reminders to…

Given an array of positive integers nums and an integer k,return true if nums has a continuous subarray whose sum equals k. Examples: Since all numbers are positive, we can use a sliding window: This works in O(n) because the two pointers only move forward. The VOprep team has long accompanied candidates through various major company OAs…

You are given a string s.You can convert s to a palindrome by adding characters in front of it.Return the shortest palindrome you can form by performing this transformation. Input:s = “aacecaaa” Output:”aaacecaaa” The task is to create the shortest palindrome by adding characters only to the front of the given string. Main idea: Optimal…

Given a string s, return true if it is a palindrome, or false otherwise. Input:s = “aba” Output:true This problem checks whether a string is a palindrome, meaning it reads the same forward and backward. Typical approach: Runs in O(n) time and O(1) space (two-pointer approach). The VOprep team has long accompanied candidates through various major company…

A unique character is one that appears only once in a string.Given a string consisting of lowercase English letters only, return the index of the first occurrence of a unique character in the string using 1-based indexing.If the string does not contain any unique character, return -1. Example:s = “statistics”The unique characters are [a, c],…