回复: 0

DD noodles starting first experience

海外面经

doordash

theo28 2025-4-22 09:10:51 | 显示全部楼层 | 🔍试试Job多多

本楼：	👍 0	0% 100%	1 👎
全局：	1	50% 50%	1

2025(4-6月) 工程类 硕士全职@doordash - 网上海投 - 技术电面 | 😐 Neutral 😐 Average | Fail | 在职跳槽

注册一亩三分地论坛，查看更多干货！

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

x

Got email and scheduled first round of noodles.

Question was non traditional string based as below:

Given input string, find closest strings from list of strings that can form input string with max 2 re-arrangement. Do in linear time.
Got fail after 1 week. My solution that I gave. Dasher gave me 2 pointer solution and said mine not best. Please give rice. Here first time &#

您好！
本帖隐藏的内容需要积分高于 188 才可浏览
您当前积分为 0。
使用VIP即刻解锁阅读权限或查看其他获取积分的方式

游客，您好！
本帖隐藏的内容需要积分高于 188 才可浏览
您当前积分为 0。
VIP即刻解锁阅读权限或查看其他获取积分的方式

f og_word[i]!=word[i] and k>0:
            replacedword[i]=og_word[i]
            k-=1
      if replacedword==list(og_word):
         final.append(word)
Please give rice to me. 🙏🏽