I was asked a boolean logic riddle: You are walking and arrive at a dead end with 2 doors. You must get past this, but you are told that only one door is correct, leading you on your path and the other door is not correct and leads to something perilous. In front of each door is a guard. One guard always tells the truth and the other always lies. You may ask one of the guards one question, and then you must pick your door and go through it. What question do you ask, which door do you pick based on the answer, and why? This is actually not that hard once you realize that it's a boolean algebra problem, but I was surprised that I was asked that question.
Sviluppatore Software Iii Interview Questions
1,279 sviluppatore software iii interview questions shared by candidates
Round 1 Q1. Find min element in a sorted array rotated at a non-given point. E.g. 4 5 0 1 2 3 Q2. Given a binary tree and two nodes, find if the two nodes are cousins on not. Round 2 Q1. Design Instagram. HLD design. Junit test cases. Q2. Spring Boot life cycle and IOC. Some Annotations. Q3. Singleton pattern. Q4. Read through a file of 100 lines using multithreading. Round 3 Q1. Container with most water Q2. Tell me a situation where you went above and beyond your work.
In technical round, I was asked one question each from the following topics Parallel programming - Related to threading, parent and child process order of execution. DBMS - How many joins are there in a relational database? SQL Query A brain teaser - In a bouquet the flowers are as follows: All but 2 are roses, all but 2 are tulips, all but 2 are daisies. So how many flowers are there in the bouquet?
I was tasked a coding question.
My experience as senior engineer
given a list of words, a starting word and an ending word, figure out the minimum single letter mutations using the words in the list to get from the starting word to the target.
1st round - DSA normal stack and linked list questions
particular use of some keywords in java .. that help with encapsulation and immutability.
The programming challenge was to print a diamond pattern to the screen. Similar to printing a staircase pattern, but mirrored and flipped.
Design your data structure with everything in o(1).
Viewing 241 - 250 interview questions