Find the number of 1 or 0 in a binary formated int.
Software Engineer Interviews
Software Engineer Interview Questions
Software engineers write programs to design and develop computer software. Interviews are highly technical, so come ready to work through coding problems and math brainteasers. The specific questions you are asked will depend on what type of programming position you are looking for. Try researching a specific software discipline such as web development, application development, or system development.
Top Software Engineer Interview Questions & How to Answer
Question #1: How would you describe your programming task process?
Question #2: Which programming languages do you know and prefer?
Question 3: What is an example of a successful project that you completed?
419,816 software engineer interview questions shared by candidates
What was the one project you work on?
Why Ebay?
Talk about yourself. Difference between string buffer and string builder, difference between string and String buffer. Leet code Coding example.
Basic puzzles like i) given two buckets of 4 and 7 liters.. how can you get 5 liters. ii) some sorting and searching algo questions
Using the characters on a telephone dial, give all the permutation of strings for given digits.
Write a program in Java to assess a given string whether it complies with following patterns. Return true if a given string complies with these patterns else false. N = N1 + N2 N>= N1 >= N2 where N is the Nth element in the string or element at Nth position; N1 is the (N-1) element in the string & N2 is the (N-2) element in the string. Example 1: 224610 Elements in this string are 2, 2, 4, 6, 10. First Set: 2+2=4 (N2=2; N1=2 & N= 4); Second Set: 2+4=6 (N2=2; N1=4 & N=6); Third Set: 4+6=10 (N2=4; N1=6 & N= 10) Example 2: 1112233558 Elements in this string are 1, 11, 12, 23, 35, 58 Example 3: 1101102203 Elements in this string are 1, 101, 102, 203
Given a set of numbers 1-100, find the missing one.
You have a cake. you need to cut that cake into 8 pieces using three cuts only.
Write an algorithm to determine if a given string contains a balanced number of parentheses (e.g. balanced = "[[]][]", unbalanced = "[[]"). If balanced, return the count of balanced pairs, otherwise return -1.
Viewing 3051 - 3060 interview questions