Below
are a list of certain questions that some of my friends and I were
asked during an interview for the SDE position.

It was an amazing experience. Though they tend to focus PRIMARILY on Data Structures throughout, they also give good weightage to your Problem Analyzing Skills and OS.

1. Given a dictionary with limited words. Check if the string given to you is a composite of two words which are already present in the dictionary.

2. Given a single linked list of certain nodes. Switch adjacent nodes. Eg. 1 2 3 4 will be 2 1 4 3.

3. What is the function of the 'finally' block in Java ? Under what conditions does the finally block not get executed, if this is possible?

4. Display all the nodes at the same level in a tree.

5. Given a binary search tree. Traverse only the left sub-tree.

6. Given a n-ary tree. Devise an algo which determines the position at which the 3rd B is present from the given index in constant time complexity.

Try it for binary tree.

What is hashing. What is constant time complexity?

Which are the data structures which have constant time complexity. HINT - they both use indexes?

The preprocessor method will use what data structures to ensure the getA() or getB() function will determine the 3rd B's position in constant time complexity.

7. Is {a, n, d} a palindrome ? If you are given a random string, is it a palindrome or not ?

8. Implementation of AVL tree.

P. S. The tech panels which came down for the interviews are amazingly helpful and vastly experienced. So you better work you're arse off if you wanna pass all 3 tech rounds + telephonic interview!

It was an amazing experience. Though they tend to focus PRIMARILY on Data Structures throughout, they also give good weightage to your Problem Analyzing Skills and OS.

1. Given a dictionary with limited words. Check if the string given to you is a composite of two words which are already present in the dictionary.

2. Given a single linked list of certain nodes. Switch adjacent nodes. Eg. 1 2 3 4 will be 2 1 4 3.

3. What is the function of the 'finally' block in Java ? Under what conditions does the finally block not get executed, if this is possible?

4. Display all the nodes at the same level in a tree.

5. Given a binary search tree. Traverse only the left sub-tree.

6. Given a n-ary tree. Devise an algo which determines the position at which the 3rd B is present from the given index in constant time complexity.

Try it for binary tree.

What is hashing. What is constant time complexity?

Which are the data structures which have constant time complexity. HINT - they both use indexes?

The preprocessor method will use what data structures to ensure the getA() or getB() function will determine the 3rd B's position in constant time complexity.

7. Is {a, n, d} a palindrome ? If you are given a random string, is it a palindrome or not ?

8. Implementation of AVL tree.

P. S. The tech panels which came down for the interviews are amazingly helpful and vastly experienced. So you better work you're arse off if you wanna pass all 3 tech rounds + telephonic interview!

## No comments:

## Post a Comment