Answers to the most common puzzles in Interviews PART-3

-
Here are the answers for my last post of Common puzzles in Interviews.


1. Planes will not collide if they all move in same direction (Clockwise or AntiClockwise). So each plane has 2 choice , either clockwise or anticlockwise. So for all the planes we will have 2^5  possibilities.

Below are the possibilities for all five planes where C denotes Clockwise and A denotes AntiClockwise

CCCCA
CCCAA
CCAAA
:
:
:
:
CCCCC
:
:
:
AAAAA
:
:
AAAAC

So in all we have 32 possibilities and out of those 32 only 2 possible combination (AAAAA & CCCCC) will not result into collision.

So probability of planes not getting collide is 2/32 = 1/16.

2. The next number in series is 23.

2 11 -> 2+(1+1) = 4
4 15 -> 4+(1+5) = 10
10 13 -> 10+(1+3) = 14
14 18 -> 14+(1+8) = 23

3. So in one day the net time increased is 1/2 - 1/3 = 0.17 minutes .
Clock will become 5 minutes faster in
0.17 * days = 5
days = 5/0.17 = 29.4 days ~ 30 days.
So the date will be 30th of May.

4 . The next number in series is 256
1/5 -> 5^1 = 5
3/6 -> 3^6 = 216

Similarly, 4^4 = 256

5. Singapore is 10 hours behind brazil and dubai is 6 hours behind brazil. So Dubai is 4 hours ahead of Singapore.

So if you travelled for 6 hours , you will reach dubai at 15:00 PM dubai time.

After that you travel for 15 hours 15 minutes to Brazil , so you will reach brazil at 12:15 PM next day brazil time.

Please let me know in comments if you have different answers or approach.

Comments

Post a Comment

Popular posts from this blog

Tricky Questions or Puzzles in C

-
This post is about the Tricky Questions   or code snippet in C or C++ asked in most of the Interviews   (See Interview Experience ) by some of the good companies. You may know probably the right concept but it will not strike you at the interview and to crack all those Interview Questions  you should know some of them beforehand. If you are applying for Job related to JAVA then checkout the blog post  Tricky Questions in JAVA . 1) what will be the output of the following Printf function.   printf("%d",printf("%d",printf("%d",printf("%s","ILOVECPROGRAM")))); Ans-ILOVECPROGRAM1321 The above printf line gives output like this because printf returns the number of character successfully written in the output. So the inner printf("%s","ILOVECPROGRAM") writes 13 characters to the output so the outer printf function will print 13 and as 13 is of 2 characters so the next outer printf function will print 2 and then
Read more

Program to uncompress a string ie a2b3c4 to aabbbcccc

-
Below is the program to uncompress a string #include<stdio.h> #include<conio.h> #include<stdlib.h> int main() { char str[100]="a2b3c4d8u7"; for(int i=0;str[i]!='\0';i++) { if(i%2!=0) { for(int j=0;j<atoi(&str[i]);j++) { printf("%c",str[i-1]); } } } getch(); } Want to become a Data Engineer? Check out below blog posts  1.  5 Key Skills Every Data Engineer needs in 2023 2.  How to prepare for Data Engineering Interviews 3.  Top 25 Data Engineer Questions
Read more

Programs and Puzzles in technical interviews i faced

-
Image
I have attended interview of nearly 10 companies in my campus placements and sharing their experiences with you,though i did not got selected in any of the companies but i had great experience facing their interviews and it might help you as well in preparation of interviews.Here are some of the puzzles and programs asked to me in interview in some of the good companies. CHECK-OUT the VIDEO of  Technical Interview for SAP Labs, CA Tech & HP R&D 1) SAP Labs I attended sap lab online test in my college through campus placements.It had 3 sections,the first one is usual aptitude questions which i would say were little tricky to solve.The second section was Programming test in which you were provided snippet of code and you have to complete the code (See Tricky Code Snippets  ).The code are from different data structures like Binary Tree, AVL Tree etc.Then the third section had questions from Database,OS and Networks.After 2-3 hours we got the result and i was shortlisted
Read more