由买买提看人间百态

boards

本页内容为未名空间相应帖子的节选和存档,一周内的贴子最多显示50字,超过一周显示500字 访问原贴
JobHunting版 - 微软面经
相关主题
copy link with random additional pointers[合集] M$ onsite 面经 (OFFICE组 SDE)
Facebook 2 轮电面面经 + 为第三轮求福本版1年以内的所有 面经题目,含帖子link [为大家方便]
How can one determine whether a singly linked list has a cycle?Bloomberg电话面经
关于找环的那道题目请问有面过arista networks的么?马上就要第二轮面试了,求教面经!
level order nodesyelp 面经
给一个大俗之一的面经吧。ebay电面面经,攒人品,求好运
一些面经pocket gems电面第二轮面经
M$ onsite 面经 (OFFICE组 SDE)a 面经
相关话题的讨论汇总
话题: list话题: node话题: clone话题: linked话题: 节点
进入JobHunting版参与讨论
1 (共1页)
s****t
发帖数: 467
1
刚面完,发面经攒rp
1. lead: find the most frequent word(s) in a Word doc. What are the things
you need to clarify before coding?
用hashtable,注意多个单词有相同最高频率的情况
2. dev: 1) clone a linked list (get an exactly same copy of the original
list)
2) clone a linked list with pointers not only to the next node, but
also to the node after the next
3) clone a linked list with two pointers, one to the next node, the
other to a random node in the list or null
对每个节点都新建一个相应的节点,再连起来
random指针那问,可以建一个表,存新老节点的
1 (共1页)
进入JobHunting版参与讨论
相关主题
a 面经level order nodes
L家onsite面经给一个大俗之一的面经吧。
zoosk software test engineer面经一些面经
报个Uber电面面经M$ onsite 面经 (OFFICE组 SDE)
copy link with random additional pointers[合集] M$ onsite 面经 (OFFICE组 SDE)
Facebook 2 轮电面面经 + 为第三轮求福本版1年以内的所有 面经题目,含帖子link [为大家方便]
How can one determine whether a singly linked list has a cycle?Bloomberg电话面经
关于找环的那道题目请问有面过arista networks的么?马上就要第二轮面试了,求教面经!
相关话题的讨论汇总
话题: list话题: node话题: clone话题: linked话题: 节点