A problem based on binary search + divide and conquer
Mts Interview Questions
501 mts interview questions shared by candidates
Current role
1. C/C++ 2. Data Structures 3. Algorithms
The process started with me introducing myself and reviewing my CV. He then questioned me about my DBMS project for which he made me complete an ER diagram. Questions around Operating system (Deadlocks and Semaphores). DSA question was traversing a binary tree in zig zag form.
Tell which button will turn on which light bulb , divide cake into 8 pieces with three cut only
Check if a linked list is a circular linked list
3. He asked me to insert a node in the middle of the linked list. given a linked list 1,2,4,5 insert 3 in this linked list.
Coding: Questions based on strings in any language, Sorting methods OS: Semaphores, Threads (Different ways it's used and how they are created) Deadlock CN: TCP/IP, TCP vs UDP python: lambda vs function C: Pointers, extern, static
Basic Javascript questions in the first round. In the second round - [[{x:20, y:0},{x:30, y:10}],[{x:30, y:10},{x:10, y:20}],[{x:10, y:20},{x:35, y:40}]] // Check Continuous line or Not
Mix of algorithm/data structure style questions.
Viewing 11 - 20 interview questions
See Interview Questions for Similar Jobs
Software Development Engineer KindleStaff Systems EngineerMicrosoft ConsultantSr Network EngineerComputer Systems EngineerMathematicianAdvisory EngineerTech ConsultantServer Systems EngineerComputer EngineeringTechnical Support Engineer Amazon Web ServicesComputer Science EngineerConsulting EngineerPower System StudiesComputer EngineerComputer ScienceIp Telephony EngineerComputer Science Coop