VOOZH
about
URL: https://www.geeksforgeeks.org/interview-experiences/vizury-interview-experience-set-2-1-5-years-experienced/
⇱ Vizury Interview Experience | Set 2 (1.5 Years Experienced) - GeeksforGeeks
👁 geeksforgeeks
Courses
Tutorials
Interview Prep
DSA
Practice Problems
C
C++
Java
Python
JavaScript
Data Science
Machine Learning
Courses
Linux
DevOps
Vizury Interview Experience | Set 2 (1.5 Years Experienced)
Last Updated :
11 Jul, 2025
Vizury I got contacted by a recruiter on LinkedIn for Bangalore location.
Telephonic round (DS and Algorithms) (1 Hour):
1) Print the level order traversal in reverse.
https://www.geeksforgeeks.org/dsa/reverse-level-order-traversal/
I gave Stack and Queue Solution. Then he asked if I can think in terms of recursion, which I was unable to.
2) Create the ancestor matrix of a tree.
https://www.geeksforgeeks.org/dsa/construct-ancestor-matrix-from-a-given-binary-tree/
3) Find k largest elements in an unsorted integer array.
https://www.geeksforgeeks.org/dsa/kth-smallest-largest-element-in-unsorted-array/
It was an easy interview and I got the call that day itself that I will have to go for F2F round at Vizury office.
F2F round (DS and Algorithms) (1 Hour):
1)
https://www.geeksforgeeks.org/dsa/given-array-strings-find-strings-can-chained-form-circle/
I struggled at first to formalize the approach, and finally, Graph + DFS solution. Took about 40-45 mins to explain the approach and code half the solution. 2)
https://www.geeksforgeeks.org/dsa/search-in-row-wise-and-column-wise-sorted-matrix/
I could not give the most optimal solution although I gave various other algorithms. Could not clear rounds further. Note: Both of the interviewers were very bad at giving hints as opposed to general coding interviews.
Comment
Article Tags:
Article Tags:
Interview Experiences
Vizury Interactive Solutions
Explore
DSA Tutorial
10 min read
System Design Tutorial
4 min read
Aptitude Questions and Answers
3 min read
Web Development Technologies
5 min read
AI, ML and Data Science Tutorial
3 min read
DevOps Tutorial
3 min read