Flexible work hours.
Manager gives space and time to learn anything.
Decent pay.
Requirements stop at a point.
1st Round – Online Coding * Contiguous elements in an array whose sum is k. * Convert sorted array to binary search tree. 2nd Round – Telephonic * Given an array of characters, find the longest continuous non-repeating sequence of characters
An online interview covered discussions on projects and concepts related to OS, OOP, and the time complexity of code. There were also a few DSA questions to solve. The interview lasted for 1 hour and 30 minutes.
They asked basic questions about OOPS concepts: polymorphism and StringBuffer. They then asked for code implementing bubble sort. Finally, they inquired about project details, specifically: * What I had done * My contribution to the project * Which
1st Round – Online Coding * Contiguous elements in an array whose sum is k. * Convert sorted array to binary search tree. 2nd Round – Telephonic * Given an array of characters, find the longest continuous non-repeating sequence of characters
An online interview covered discussions on projects and concepts related to OS, OOP, and the time complexity of code. There were also a few DSA questions to solve. The interview lasted for 1 hour and 30 minutes.
They asked basic questions about OOPS concepts: polymorphism and StringBuffer. They then asked for code implementing bubble sort. Finally, they inquired about project details, specifically: * What I had done * My contribution to the project * Which