回复: 0
收起左侧

stackline  codesignal最新oa

本楼:   👍  0
0%
0%
0   👎
全局:   367
86%
14%
60

2025(1-3月) 码农类General 本科 全职@stackline - 网上海投 - 在线笔试  | 😐 Neutral 😐 AverageOther | 在职跳槽

注册一亩三分地论坛,查看更多干货!

您需要 登录 才可以下载或查看附件。没有帐号?注册账号

x

70分钟总共4道题

  • You are given an array of positive integers numbers, and a number range represented by an array Range consisting of two positive integers ( nRange [0] <= nRange [1] ). Return the lowest value in numbers which explictly falls between the number range (excluding the endpoints) - i.e., Range [0] < numbers [i] < nRange [11. If there is no such value, return o. Note: You are not expected to provide the most optimal solution, but a solution with time complexity not worse than (numbers. length') will fit within the execution time limit.
  • Imagine you're visiting a theme park that offers a special shuttle service to transport guests around the park. The shuttle operates on a specific timetable listed as an array of strings shuttle_times, representing different times throughout the day when the shuttle arrives at your current location. You also have a string current_time representing what the time is right now. Your task is to determine how long you need to wait until the next shuttle arrives. If no more shuttles will arrive today, the function should return "-1" TINGS Time is denoted in a string format of нн: M (using a 24-hour clock). Shuttle arrival times are organized in chronological order. Note that a shuttle departs exactly when it arrives; if a shuttle was scheduled earlier than the current_time, it has already left. Note: You are not expected to provide the most optimal s
    您好!
    本帖隐藏的内容需要积分高于 188 才可浏览
    您当前积分为 0。
    使用VIP即刻解锁阅读权限或查看其他获取积分的方式
    游客,您好!
    本帖隐藏的内容需要积分高于 188 才可浏览
    您当前积分为 0。
    VIP即刻解锁阅读权限查看其他获取积分的方式
    [i] can have one of the following two forms: RY ES [0, i, x]. In this case, you need to assign a [i] the value of *
( a [i] = x ). [1, x] . In this case, you need to find the total number of pairs of
indices i and j such that a[il + b[jl = x . Perform the given queries in order and return an array containing the results of the queries of the type [1, x]

评分

参与人数 2大米 +12 收起 理由
AllRightThen + 2 很有用的信息!
清道神君 + 10 欢迎分享你知道的情况,会给更多大米奖励!

查看全部评分


上一篇:TikTok OA面经(2025.01.18-01.22)
下一篇:Amazon Fungible OA 后秒拒
您需要登录后才可以回帖 登录 | 注册账号
隐私提醒:
  • ☑ 禁止发布广告,拉群,贴个人联系方式:找人请去🔗同学同事飞友,拉群请去🔗拉群结伴,广告请去🔗跳蚤市场,和 🔗租房广告|找室友
  • ☑ 论坛内容在发帖 30 分钟内可以编辑,过后则不能删帖。为防止被骚扰甚至人肉,不要公开留微信等联系方式,如有需求请以论坛私信方式发送。
  • ☑ 干货版块可免费使用 🔗超级匿名:面经(美国面经、中国面经、数科面经、PM面经),抖包袱(美国、中国)和录取汇报、定位选校版
  • ☑ 查阅全站 🔗各种匿名方法

本版积分规则

Advertisement
>
快速回复 返回顶部 返回列表