Given two arrays, sorted in non decreasing order you can take 1 element from array1 and 1 element from array2, and their sum would be let's say x, find the k'th smallest x
Sde Interview Questions
16,644 sde interview questions shared by candidates
data structures and algorithms and general computer questions
Js round, React round and a HM round
Focused on the core subjects like OS, OOPS, DBMS, and also on DS Algo problem-solving.
Why Do You Want to Work Here?
What are your hobbies and how you get time to do that?
There six question asked in two round and 2 of them was quite easy (one was on array and other was one stacks) and two were on the medium side (tree and graph) and two were on the difficult side ( DP and tree)
Given values of key and time and value. update relative keys in time and then give value of the key at given time type query.
Complete oop, dsa in depth and security during payments
In Coding Round Question was about simple BFS implementation.
Viewing 1331 - 1340 interview questions
See Interview Questions for Similar Jobs
Ruby DeveloperRuby On Rails DeveloperRuby On Rails Software EngineerSoftware TraineeSoftware Engineer C#Ruby On Rails Ror GithubRails DeveloperSoftware Engineer Front EndSoftware Engineer Developer Entry Level Ruby On RaSoftware Developer Entry LevelSoftware Developer FresherSoftware Engineer CoopSenior Ruby On Rails DeveloperJunior Ruby On Rails DeveloperSoftware Applications DeveloperSoftware Engineer Web DeveloperPhp Software DeveloperSoftware Engineer Ux