After Round 2 I Asked Interviewer How he would Solution for Above mentioned Q1 & Q2 questions of the Round 2 Technical Interview. Very Smartly Interviewer Did not take any effort to answer and also told me find it out by myself :)
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,192 softwareentwickler interview questions shared by candidates
Implement clearbit(int n, int p) function, p is the position of the bit to be cleared. Example : n is 13, p is 0. Binary representation of n : 1101. You need to clear the pth postion, means 0th position bit needs to be cleared.
Write a function to obtain a string with the binary representation of an integer
you have array with n elements. How would you do circular shift of k positions? Time and space complexity?
Write code to generate all possible case combinations of a given lower-cased string. (e.g. "0ab" -> ["0ab", "0aB", "0Ab", "0AB"])
If you had to change permissions to read/write all recursively in the unix terminal, how would you do it?
Why u chose IT? Why do want to join syntel?
Here is the brain teaser question: Given integers as 1, 2, 3, 4, ..., N. Every time you remove an alternative element until only one is left. If you reach the end, just do a rounding. Return the remaining element. For example, given 1,2,3,4,5,6, you remove 1, 3, 5 and then 2, 6. So the remaining element is 4. What is the remaining element if N is 2000?
Given a Binary Search Tree with integers at every node and an integer k, write code that decides whether or not there exists two nodes a and b such that a+b=k
A google doc link with questions ranging from JAVA, Logical and Quantitative aptitude and Verbal.
Viewing 511 - 520 interview questions