Position: Bloomberg NYC SWE New Grad\n\n**Round 1:**\n* https://leetcode.com/problems/two-sum/ + w/o duplicates\n* https://leetcode.com/problems/valid-anagram/\n\n**Round 2:**\n* [1D Candy Crush](https://leetcode.com/discuss/interview-question/380650/)\n* Find right most nodes within n-ary tree\n\n\nGot stuck on candy crush question. Ended up getting rejected within a day. Amazing experience, very nice interviewers! Would love to give this another shot somertime down the road.

Position: Bloomberg NYC SWE New Grad\n\nRound 1:\n https://leetcode.com/problems/two-sum/ + w/o duplicates\n https://leetcode.com/problems/valid-anagram/\n\nRou