Technical Interview at Josh Technology

Hi, Its Suraj Jeswara, a Computer Engineer. I had my technical interview under Josh technologies on 29.03.17 conducted by Amcat

at BP Poddar Institute of Management & Technology. The technical interview was basically comprised of an online and a written test. The test was far more challenging than anticipated at the beginning. The online test was comprised of quantitative aptitude, computer programming and automata. The quants portion was kinda the one we encounter in Amcat examination. Easy but time crux do exists. In automata section only 2 questions were to be done in 45. Seems pretty easy but I vouch if you are not in flow with coding you can not solve a single one. I could do a pattern problem.

Question : Print the following pattern

1

3*2

4*5*6

10*9*8*7

11*12*13*14*15

For n rows… we were suppose to run and compile it against the test cases provided.

The 2nd one was on linked list and unfortunetly I couldn’t dispose it on time. The computer programing part was like the one appeared in Amcat papers but a bit more complicated. One of the question that I can recall is.:

Question: what will be the output of:

Printf(“%d”, printf(“%d”, 1234);

Then after all this a 45 min written round took place. We were suppose to write the functions to perform certain computations. Let me share a question from this session.

Question: Write a function which takes an array and a value as an argument. It returns 1 if any 2 values of the array when added gives the value passed, Else it returns - 1. .For example
the function signature is :
addtwonumbers(int A[],int k)
where,
A[]={4,6,1,7,9}
K passed be 15
since, 6+9=15.
1 returned.

The question seems very simple but the twist was that the solution must have a O(n) time complexity. I did it and one more question on linked list which is too lengthy to be shared . Rest were beyond my scope in that trifle of time.

Hope u guys got some serious idea about the pattern. What I will suggest is that go through pointers, linked list and binary tree concepts often, It may help in lots of campuses and will fetch you a better job.

Coding and solving critical computations is highly essential. You people can refer to geekforgeeks (http://www.geeksforgeeks.org/data-structures/) and hackeearth (https://www.hackerearth.com/)  to keep practicing coding and off course an all round development was done by EDUFUN .