VO Prep
  • 🏠 Home
  • 📘 Cases
  • 🔵 About us
  • 🪙 Services & Prices
  • 📨 Contact Us
  • English
    • English
    • 中文 (中国)
  • 🏠 Home
  • 📘 Cases
  • 🔵 About us
  • 🪙 Services & Prices
  • 📨 Contact Us
  • English
    • English
    • 中文 (中国)
  1. Home
  2. VO
  3. Article list
Bloomberg Interview Question: Design a Double-Ended Queue with O(1) Operations

bloomberg Bloomberg Interview Question: Design a Double-Ended Queue with O(1) Operations

This Bloomberg question asks you to design a deque-like data structure that supports inserting and removing from both ends, plus querying its size, all in constant time. The natural approach is to use a doubly linked list (or dynamic circular array) and maintain head, tail, and size fields so each operation touches only a few…

9 Views 0 Comments
bloomberg 2025-12-11
Google Interview Question: Find the Spine Tag (Square of 1s) in a Bookshelf Matrix

Google Google Interview Question: Find the Spine Tag (Square of 1s) in a Bookshelf Matrix

This Google interview problem simplifies a computer vision task: given a frame represented as an m×n matrix of 0s and 1s, where a spine tag corresponds to a square submatrix of 1s, determine how to detect that square quickly and efficiently. The challenge typically lies in finding the top-left coordinate and size of the square…

12 Views 0 Comments
Google 2025-12-09
Google Interview Question: Latest Arrival Time to Catch Evacuation Flight

Google Google Interview Question: Latest Arrival Time to Catch Evacuation Flight

This Google interview problem describes an evacuation scenario: multiple flights leave the island tomorrow, and every islander has their own arrival time at the airport. Assuming planes fill up in departure-time order and seats are taken by whoever arrives earlier, you must compute the latest time you personally can arrive at the airport and still…

12 Views 0 Comments
Google 2025-12-09
Google Interview Question: String Matching With Transliteration

Google Google Interview Question: String Matching With Transliteration

This Google problem asks you to determine whether a“needle”appears in a“haystack,”but with a twist: non-standard characters such as é, ë, æ, or å must be converted according to a given transliteration map before matching. The map can map one character to multiple English characters (e.g., “æ” → “ae”), so matching is not just one-to-one replacement…

12 Views 0 Comments
Google 2025-12-09
Google Interview Question: Implement a Restaurant Waitlist Data Structure

Google Google Interview Question: Implement a Restaurant Waitlist Data Structure

“””Implement a restaurant waitlist data structure. It should support the following features: A party of customers can join the waitlist.A previously joined party can leave the waitlist at any time.The restaurant can ask the data structure for the first party that fits a given table size (a table size is given as an argument).“”” This…

14 Views 0 Comments
Google 2025-12-09
Google Interview Question: Implement an Aligned Memory Allocator and Free Function

Google Google Interview Question: Implement an Aligned Memory Allocator and Free Function

“””Write a memory allocation function (and corresponding free function)that returns a block of memory aligned to the specified alignment value.You may assume that the alignment is a power of 2 (1, 2, 4, 8, 16, …).“”” This Google systems-level question asks you to implement your own malloc-like function that guarantees the returned pointer is aligned…

12 Views 0 Comments
Google 2025-12-09
Google Interview Question: Implement Multiple Software Timers on a Single Hardware Timer

Google Google Interview Question: Implement Multiple Software Timers on a Single Hardware Timer

“””We have an embedded environment with a very simple operating system. Part of the facilities provided to us is a single hardware timer.The goal is to implement multiple timers, each with their own callback, based on this single timer.The hardware timer can be set with the following function:void set_hw_timer(int relative_timeout_ms);After relative_timeout_ms milliseconds have elapsed, the…

9 Views 0 Comments
Google 2025-12-09
Google Interview Question: Descending Tree Definition and Operations

Google Google Interview Question: Descending Tree Definition and Operations

“””// Write a node class to be used in a tree. A Node should contain exactly one integer and have zero or more children.“”” “””Define: a “descending tree” is a tree such that for each node n, the value of n is larger than the value of any descendant of n. Write a function that…

12 Views 0 Comments
Google 2025-12-09
Google Interview Question: Split the Gold Chain Fairly After Donating One Link

Google Google Interview Question: Split the Gold Chain Fairly After Donating One Link

“””You and a friend have received a special gold chain as a gift.The chain links each have an integer weight, not necessarily the same.You and your friend must choose one of the links to be removed and provided to charity, after which the chain will be reconnected.After that, you can choose one place along the…

9 Views 0 Comments
Google 2025-12-09
Google Interview Question: Top N Most Talkative Users from Chat Logs

Google Google Interview Question: Top N Most Talkative Users from Chat Logs

“””Imagine a log file that abridges chats. An example chat might be: 10:00 <john> hi!10:01 <maria> hello!10:07 <john> can you link the design? where john said 6 total words and maria said 1. Your goal is to present the top N most talkative users in descending order. You need to write a function that takes…

11 Views 0 Comments
Google 2025-12-09
  • «
  • 1
  • 2
  • 3
  • 4
  • 5
  • ...
  • 15
  • »
Cases search

Contact me

  • Telegram. https://t.me/csoahelp
  • Whatsapp. +1 818 923 6994
  • Email.csonsitehelp@gmail.com
  • Wechat. csvohelp
wechat

------- WeChat QR Code↑ -----

In order to ensure that I contact and evaluate your interview and assignment as soon as possible, please indicate your specific requirements for the interview and assignment.

Code Guaranteed Unique 100% Plagiarism Free

Complete Confidentiality 100% Confidentiality

Guaranteed Quality 100% Quality Assurance

Friendly reminder

My Google rankings are based on quality and word-of-mouth, not the same as paid rankings with an Ad logo. Programhelp's rankings have never needed to be paid to make a presence.

Adobe
Amazon
Apple
Atlassian
Block
bloomberg
Circle
coinbase
Doordash
Google
LinkedIn
Meta
Microsoft
NVIDIA
OA
openai
Oracle
paloalto
Pinterest
Robinhood
Roblox
Snowflake
Stripe
Tesla
Tiktok
Two Sigma
VO
voleon
Copyright © 2010-2028 All Rights Reserved. Designed by:VOprep.com
 Theme by Puock