GeeksforGeeks
Question
·
Nov 2019
Snapdeal Interview Experience
Question Details
Round 1:1.Find the top view of binary tree.2.Sort an array containing only digit 1, 2 and 3 in O(n) time.3.E.g 2, 1, 1, 3, 2, 1, 2 Output : 1, 1, 1, 2, 2, 2, 34. Print 1, ...
Full Details
🔒
Unlock all Snapdeal questions
Full insider details, leaked discussions, and candidate experiences.
Get full access — $100 a year, unlimited accessAbout This Question
This is a reported interview question from a snapdeal interview for a data eng role during the phone screen round reported in 2019.
It covers the following topics: Trees, Binary Tree, Arrays, Graph, Graphs, Hash Table .
Topics
More Snapdeal Interview Questions
GeeksforGeeks
Snapdeal Recruitment Process
GeeksforGeeks
SnapDeal Interview Experience | Set 17 (For SDET)
GeeksforGeeks
Snapdeal Interview Experience | Set 16 (Off-Campus for Software Development Engineer)
GeeksforGeeks
Snapdeal Interview Experience | Set 14 (For Software Engineer)
GeeksforGeeks
Snapdeal Interview Experience | Set 11 (On Campus)