Interview with PegaSystems Hyderabad

Pegasystems ask questions mainly on Java, for me following questions were asked during interview.
1.  Operator overloading presents in Java or not . Explain more about this.

2.  Overriding, how do you achieve polymorphism in java?

3.  String and Stringbuffer.

4.  Inner class and outer class concepts.

5.  Inheritance in Java: Given a programming problem by deriving class from  B to A .

6. Abstract class and interface: relate them and give a real time scenario.

Interview with TrueSparrow

I’ll edit about this today

Interview with Canvera Digital Technologies

I’ll edit today about this….

Interview with Amazon

No need to explain about Amazon……….

They have asked three questions and I have failed that time to answer them correctly.

Q1.  Write a program for finding maximum sum path from a Tree from leaf to Root from Binary Tree (Not a BST).

Ex.                                                                   (10)

/                       \

(12)                       (15)

/           \                   /         \

(16)         (17)         (5)          (8)

Result should be:  17 – 12 – 10

Q2. This question is really tough, i have tried but not achieved till now, please try to understand if you will not then let me know i’ll give more explanations.

In a given array, each element represents steps to move forward, now you have to find minimum elements to cover whole array.

Ex:  Array : {1, 3, 5, 8, 9, 6,7,5,9,1,11}

So the array’s length is 11. Traverse the array

1 so from 1 pointer can go only one step.

So it will reach 3 now from 3 pointer can move 5, 8, 9

now 5 can move 5 to 8, 9, 6, 7, 5

and from 8 pointer can move 9,6, 7, 5, 9, 1,11 it covers whole array.
So minimum hops will be 1 -> 3 -> 8

So you have to write a program fro finding this optimum path.

Missed: If 0 (Zero) occurs pointer can’t move forward.

Q3. it was simplest one: write a program for finding pair of sum from a given array for given sum.

Ex: Array : {2,3,4,1,5,6,0}

Sum = 6;

Results should be: (2,4), (1,5), (6,0)

Solve these and post it….happy coding.

Interview with Wallmart Labs, Bangalore

Wallmart Labs:  Through the innovative fusion of retail, social and mobile, @WalmartLabs is redefining Commerce for the largest retailer worldwide. We are a group comprised of the brightest technologists and businesspeople in the industry, excited about the limitless opportunities that this next generation of Commerce will bring to billions of people around the globe, all in an effort to help them save money and live better.

Date: 01 Sept, 2012
Best experience ever, they have asked so many questions.

1. write a program for finding duplicates from a array in O(n) complexity.

2. write a program for find nearest perfect square of given number.

Ex. number is given 13, then nearest perfect squares are 9 and 16. Then answer should be 16 because 16 is nearest to 13.

3. write a program for add two numbers without using mathematical operations.

Hint: you can use bit-wise operators, like : XOR, AND and OR.

4. How many types of contract do you use for web services.

5. If i want to avoid the execution of finally, what we can do ?

6. Singleton pattern in Java, how will you achieve singleton.

7. Write a query for second maximum in SQL.

8. Performance tuning or Query Optimization techniques in Java.

9. How will you create non-concrete (Which can’t be instantiate) class.

10. Indexing in SQL. Types of indexing and how will use it.

11. Significance of final keyword in Java.

12. Significance of static keyword in Java for methods and variables.

13. Which protocol do you use for web-services and web-server.

14. Architect data structure for 10 million records, where the records are totally RAW (can be string or numbers).

15.  Abstract class and final class.
Interview went good..lets see the results.

Interview with UrbanTouch

UrbanTouch.com serves an essential human need – to look beautiful. We offer only the best and biggest brands so you can remain assured of the quality of every item we sell. We aim to provide you an incredible shopping experience, a wide range of brands and excellent customer service.

Interview went good:
The only one question they have asked,

Q1. write the implementation of String trim function. trim removes the spaces from start and end of string.
Program should run in O(n) and it should be optimum.

 

Interview with Ask Laila Bangalore

Ask laila is Indian local search engine. Which is providing solutions for small vendors.

1. Define multiple inheritance in JAVA and how will you achieve.

2. List can contain duplicate values.

3. Write a program which demonstrate multi threading.

4. If i have a inner interface then how will implement the methods of this.

5. Create a abstract class and questions relating to this.

Interview with Azul Systems

Azul systems is a innovative company, they have developed a optimize JVM called Zing. Which redefined many basic functionalities of JVM, like garbage collection, Heap size, pausing etc.

This interview was a formal interview not much questions were asked relating to programming and concepts.

Only two questions were asked which are as follows.

1. Implement a MyLogger program which will have only once instance at a time but able to use by many threads and it should be thread safe. So that one user’s program can write at time.

2. Declare a singleton class in Java.

 

Interview with Aristocrat

Aristocrat is a gaming company based in Australia, this interview was a telephonic interview..I am writing here my experience.

1. How do you use function pointer in C and what’s the real world scenario for this.

2. If you have a BST with 1000 nodes then how much iteration you required to have for finding a value in worst case.

3. What would be the height of BST of 1000 nodes.

4. How do you create 2D matrix dynamically in C.

5. What are the differences in Java and C++.

6. How java is platform independent language.

7. What’s the use of port in Network Programming.

Amazon Interview on 11th August

Amazon Interview Experience:

 

It was awesome experience on 11th August, I never expected to reach till last but i could make it. But i have missed the job 😦 Lets see my next attempt will give me this opportunity.

 

Here i am sharing my written Test Exam:

 

Q1. Here two lists are given.

list1 = 2 > 4 > 5 > 6 > NULL:

list2 = 5 > 6 > 7 > NULL;

 

list3 =     3 > 0 > 2 > 3 > NULL;

 

This is called summation of link lists.

Constraint: Link list data node can contain only one digit.

 

Write: Input and Output data by dry running your program.

 

Q2. You have to find out maximum number by rearranging the digits of number.

 

Example: 2789

Output: 9872

 

Complexity: O(n)

 

Q3. Write a program for finding depth of BST (Binary Search Tree).

 

Write by Iterative and Recursion.

 

Q4. (a) Find output of program

int mingle(int a, int b)

{

    int c;

    c  = b /2;

 

if (b<=2)

cout<return a*2(b/2) + mingle(a,c);
}

int main(){
for(i=0;i<5 i=”i” p=”p”>{
     mingle(i+1,i-1)
}
}

(b)
Find out the bug in the following program.
findAanda(char * str, unsigned int len)
{
do
{
if(str[i]==’A’ || str[i] == ‘a’)
{
  ret++;
}
else
i++;
}
return ret;
}

Interview 1:
Q1. Define and explain about youtube.com web architecture.

Q2. write TEST data for maximum of subarray in a given array.

like
array = 2 10 40 68 49 10 11

Answer = 40 68 49

Interview 2:

Q1. Find loop in a link list and length of link list.

Q2. Find the given char string is a anagram or not

Solutions should be in O(n) complexity.

Interview 3:

Q1. Write a program for printing 1 0 1 0 1 0 from a array where 1 and 0 are distributed in random form.\

A = [1,1,1,0,0,0,1,0]

A = [1,0,1,0,1,0,1,0]

Q 2. In order traversal of a Tree using iterative method.

Interview 4:

Q1.  Write a program for printing a matrix in spinal order.

       | 2   4   6  |

A = | 5   8   9  |

       | 10 3   5  |

Values should print like this:

2 4 6 9 5 3 10 5 8

Q 2. I have forgot, as will remember i’ll post it here.

Please write your answers…

I’ll post the answers soon

Best of luck of your interviews