Bloomberg New Grad 上门挂经

Bloomberg NYC SWE New Grad Onsite Interview Questions
2 Technical Rounds

第一轮
Two Sum + w/o duplicates
Valid Anagram

第二轮
1D Candy Crush
Find right most nodes within n-ary tree

Got stuck on candy crush question. Ended up getting rejected within a day.

What is w/o? with or without? 有没有duplicate 好像没什么区别。