2. Reverse a sinlgy linked list, without any use of built in collections or any dependencies.(Implement linked list on your own. do not use java.util package methods) Input : 9 -> 4 -> 2 -> 8 Ouput : 8 -> 2 -> 4 -> 9 3. Find the given two strings are anagrams. isAnagram("apple", "orange"); -> false isAnagram("worth", "throw"); -> true isAnagram("foo", "fun"); -> false 1.[7,1,4,2,0,5,2,9,3] Impl a quick sorting algorithm and explain its space and time complexities in detail
reverse a linked list when head is given as input.
There was a gaming puzzle to solve
Why do you want to work at Microsoft?
BFS based leetcode medium level problem
The design questions made sense for the role (unfortunately I was not aware of the role since I was a general applicant). The two technical questions were not on leetcode but custom questions the interviewers had which were actually not bad.
Design a circular linked list, this was hidden in a problem statement.
Program to store values in disk and ram maintaining a queue data structure
Round - 1 Problem solving round --------- 1. Linked list 2. Render 3. Dispatcher 4. Aggregation and composition 5. GPU Programming 6. Trees, Binary tree, BST 7. Convert a Binary Tree into its Mirror Tree - Complexity, test cases 8. Boundary Traversal of binary tree - Complexity, test cases 9. Threads 10. Semaphore 11. Mutex 12. Challenges faced while coding 13. Rest my current project related questions
coding round 1 1. given 4 arrays nameOfProducts, priceOfProducts, nameOfProductSold, sellingPriceOfProduct. count the products sold at price different from purchasing. 2. count of employees in each department sorted by count and also display 0 if no employee in some department 3. make a get request to given api and return data after some processing 4. length of sub array which contains element which has maximum frequency [ 1 2 3 2 0 3] => ans 3 sub array [2 3 2] Round 2 1. Rest vs Soap and when to use which 2. how to authenticate restapi 3. explain jwt 4 noSql vs Sql when to use which 5 encryption algorithm
Viewing 1691 - 1700 interview questions