You have a list of strings create a map having strs as key and values as no. of occurences of vals in the string
Software Developer 2 Interview Questions
2,519 software developer 2 interview questions shared by candidates
“Why should we hire you over other candidates?”
I don't remember.
Can you explain how React hooks work and when you would use them?
A knight chess piece is on an MxN board at some starting square. Given another square, create an algorithm to find the number of moves it would take for the knight to get to the square. Analyze time and space complexity of algorithm.
1.windowHandle and windlowHandles and return type of each 2.Why windlowHandles has return type as SET 3.Where Oops concepts has been used in framework 4. What is difference between POM and page factory 5. Selenium code to get identify broken links 6 What is 403 status code 7. What is 502 status code 8. What is POJO class 9. Difference between abstraction and interface 10. Why string is immutable 11. One code snippet using the feature of “==” of java 12. WAP to reverse a string keeping the spaces intact 13. Database query to update a column 14. What is the difference between hashset and hash table 15. Inputting in a textfield without using selenium code 16. Several code snippets of java - tricky one 17. Explain super and this through code 18. Explain abstraction and interface through code and real life example for the same 19. Code to verify status code through rest assured 20. Diff between chrome options and desired capabilities Singleton class 21. Types of authentication used in api 22. Types of protocols in API
Micro services, Restful web services Java & Spring boot coding
Data structure ,algorithm and coding based on real scenario
She asked for binary search functionality which tells no exists in array or not. Generally we find mid element through (low+high)/ 2 so she asked to change that and use random function to decide mid. Binary search is performed on sorted array but here unsorted array is given. Two modifications are performed on binary search logic. 1) instead of sorted array, unsorted array has been given 2) Mid element is decided based on random function. Now we have to find out numbers from given array for which this function gives true result. Hint: Function will return true for value x, if all numbers on left side of x are small and all number on the right side of x are greater.
What do you know about Forward Service Corporation?
Viewing 131 - 140 interview questions