I was asked to write a program to find common items between 2 lists.I used java to write the program. I wrote the program which was iterating the smaller array list and used contains. The Hiring manager argues with me saying that the code is not efficient enough because 'contains' method on arraylist would lead to o(n) and that would result in O(m*N)(which is incorrect) In the interview, I was not able to google it and I was taken aback when he was talking so assertively as I assumed that he understands java. However, after I hung up the phone I realized that I am indeed right and that the algorithm I created was very efficient. The interviewer came to the interview with a view to reject me. Its a waste of time. They should let subject mattter experts do the interviews, not the people with background in c/C++ interview java guys or the other way round. The hiring manager seemed very professorial background. I tried to tell recruiter to let them know the problem, but I do not think even she has any clue on how to approach.
Softwareentwickler Interview Questions
Softwareentwickler Interview Questions
Softwareentwickler sind besonders gefragt und diese Rolle kann auch sehr gute Verdienstmöglichkeiten und hohe Arbeitszufriedenheit bieten. Bei einem Vorstellungsgespräch für Softwareentwickler werden Ihnen wahrscheinlich Fragen zu Ihren Hard und Soft Skills sowie zum effizienten Projektmanagement gestellt.
Typische Bewerbungsfragen als Softwareentwickler (m/w/d) und wie Sie diese beantworten
Frage 1: Welche Art von Softwareentwicklung betreiben Sie derzeit?
Frage 2: Beschreiben Sie ein Entwicklungsproblem, das Sie hatten, und wie Sie es behoben haben.
Frage 3: Wie gehen Sie mit dem QA-Prozess um?
512,723 softwareentwickler interview questions shared by candidates
Unusual sort: sort an array A such that: A[0]<A[1]>A[2]<A[3]>A[4]<A[5].............
Implement a power function similar to pow() function of c.
You're given a binary tree and pointers to two nodes in the tree. Describe the fastest algorithm you can come up with to determine the closest common ancestor.
Write code that sorts a stack
Given a array of numbers, output the array like this: a1 <= a2 >= a3 <= a4 >= a5...
Find the number f set bits in an integer
Given two large files with 64-bit integers produce file with integers which are present in both files and estimate O(?) complexity of your algorithm.
Input is a 4x4 table with letters. One starts from any of the 16 elements and can move in one step to any of the 8 neighboring cells not visited before (up, down, left, right, up-left, etc, no hyperspace jumps between rows 1 & 4, columns 1 & 4). Every time step is made letter in that cell is added so a word is built as we walk. These generated words are looked up in external dictionary (function to look up in the dictionary is provided, I did not understand significance of this dictionary well) and the goal of the exercise is to output all words generated by all possible table walks and which are contained in the dictionary.
Phone Interview: i) Find the number of inversions in an array (describe & code) ii) Find collinear points in a given set of 2D points (describe & code)
Viewing 1171 - 1180 interview questions