Oath 面經

補發：
Oath Onsite --- Feb 15

---

Interview 1:

• Follow up question asked on campus:
  
  
  

code how to find first unique char in a string... he gave the answer... asked me to implement:

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

游客，您好！
本帖隐藏的内容需要积分高于 188 才可浏览
您当前积分为 0。
VIP即刻解锁阅读权限 或 查看其他获取积分的方式
Unlock interview details and practice with AI
Curated Interview Questions from Top Companies

der would be the same)

follow up:

• what if we find smaller or equal to... something like comparator chage the logic of comparision
  
  
• worst cases tree?? and stack overflow... (there is iterative sol, we just mentioned but not implementing this)
  
  
• early termination... parent pointer...