Minimum of stack at any point of time in O(1)
Software Development Engineer I Interview Questions
1,214 software development engineer i interview questions shared by candidates
Automation Framework DS questions
Find max sum of a subsequence in array such that adjacent elements don't need to be considered. There is a matrix composed of either "." or "#", we have to traverse through "." from top left cell to bottom right cell with minimum steps. the min steps cannot be more than k. We can move left, right, top, bottom in a step.
Can't share any questions due to NDA
If you are given to develop Kindle, and the user wants to search a word from the entire book, who will you search it.
A modified version of the Stock Buy-Sell problem.
1) Binary search, removing duplicate elements in an array, linked list with stack (Coding) 2) Fibonacci Series, pointers, recursion functions, problem solving questions 3) Automation framework like Selenium, test ng
React lifecycle, hooks, frontend LLD through UI comp building
Questions on Bit Manipulation, Operating Systems, and Computer Networks.
Variant of non reapeating no.
Viewing 511 - 520 interview questions