If you didn't have to worry about time efficiency at all, but need a space efficiency of O(1), how do you check if an array has duplicate numbers?
Software Interview Questions
551,386 software interview questions shared by candidates
The question was basically inorder traversal- how would I write out the nodes of a binary tree from left to right
A file system search question, but using a set of predefined apis and data structures which included pre-populated files.
1.Add two numbers without using addition operator? 2.Print your name without using semicolon? 3.find maximum number in three numbers with conditional operator?
SQL (weight: 10%) Consider the table below: table A ( id integer primary key, name varchar(20), age integer ) Write a query to return the list of unique names from table A
Binary tree?
There is a list with words like: pin, pine, apple, pineapple. Go through the list and figure out which words are combinations of other words in the list, and which ones aren't
Given an array of character you must delete all the characters that got repeated 3 or more times consecutively and add " " in the end of the array for every deleted character Example "aaabbbcddddd"->"c "11 spaces "xxaaavbbbc" ->"xxvc " "xavvvarrrt"->"xaat " The problem must be solved in: O(1) memory O(n) time And you can't overwrite a cell in the array more than once
Given a list of points in the 2D xy plane, determine how many of those points can maximally exist on a line (not necessarily through the origin). So find the line that contains the most points, and return how many points are on that line.
Given a sum, find two numbers in an array with that sum.
Viewing 3031 - 3040 interview questions
See Interview Questions for Similar Jobs
Channel Sales ManagerManual TesterProgrammer AnalystMajor Account ExecutiveQa ManagerSenior SalesErp Implementation ConsultantConfiguration ManagerAccount Executive Mid MarketTechnical Support AssociateTest AnalystEngineer DeveloperFull Stack EngineerEntry Level Digital Signal Processing EngineerIt HeadIos DeveloperJava DeveloperEntry EngineerEntry Developer