Code on matrix manipulation, question was tough and time was too less
Sde Interview Questions
16,615 sde interview questions shared by candidates
Find a pair in BST with a given sum. If not present return -1.
describe about different sorting algorithms u know?
Given two strings, if the same character is in the same locations, output 2; if the same character exists in different place, output 1; else, output 0.
Right view of binary tree
Binary Tree – Distance b/w two given nodes. Give me the situations where you failed and pushed back. Tell me the hardest task done by you till now and how you solved it.
1. N ropes Problem 2. Next Greater Element
Leetcode Medium around preprocessing C++ file comments.
Implementation of the next permutation on an array of integers.
It consists of aptitude from time, distance and speed. Profit and loss, average, Percentage and reasoning. There were two coding as well. 1. Find if one tree is a subtree of another. 2. Matrix multiplication.
Viewing 1261 - 1270 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