Given a two dimensional array of positive integers, write an algorithm that will find any initial indices that have a value of 0 and replace their entire row and column with zeroes.
Software Engineer 2 Interview Questions
665,666 software engineer 2 interview questions shared by candidates
Please note the process may vary for your case- 1. Initial phone interview: non technical. 2. On site group interview: Need to provide presentation in front of groups to share what you can offer the company, why do you choose this company to join, describe one of your previous project experience. You need to complete this presentation within 3 minutes. They will judge how you can communicate with the clients/team-mates by this interview step. 3. Online technical test: You will be provided an online technical test link via email which will contain several technical questions to be completed within a given time. Questions will check your basics in .NET/C#/OOP/SQL/MVC etc. 4. Technical interview: I cannot tell the details of this test as I haven't faced this step.
Collection Generics List vs dictionary Class with get set property..write method to retrieve data from them with list Identity column Cluster and non cluster index Group by vs having SQL query Top 5 salary from different 10 departments Repeated word in string Replace repeated word Pseudo code for Hospital and doctor working
If you have a sorted array that is initialized with size 100, the values stored would be for example 1, 2, 3,.... ect. Describe an algorithm that would check if there is a duplicate number and if so return it.
Came up with a program to take a string and printed the characters that appear more than once in the exact order as they are in the original string.
Write a program to convert a string written as JAVA variable to C++ variable and vice-versa. Input : this_is_a_variable Output: thisIsAVariable
Given an array with duplicate elements give an algorithm to get the count of distinct elements in the array
Given a tree where every right node is a leaf, meaning that it can only extend on the left side, invert it such that the leftmost node is now the root, and all of the previous left nodes are now on the right side. The former right nodes will be on the left side.
A couple tricky questions. One required writing a modified binary search, the other dealt with data structures and how to efficiently check if a given set of numbers contained two numbers summing to some other number x.
Viewing 1391 - 1400 interview questions
See Interview Questions for Similar Jobs
Software Engineer 2018Software Design EngineerSoftware Engineer Co-opSoftware Engineer TraineeSoftware Development Engineer AmazonSoftware EngineeringSw EngineerSoftware Engineer EntrySoftware Development Engineer New GradSoftware Engineering AssociateSenior Application EngineerSenior Software Engineer ContractSystems Software EngineerSoftware Engineer Tools DeveloperEngineer SoftwareControl Software EngineerSoftware Engineer AtSenior Applications Engineer