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
Developer Interview Questions
268,925 developer interview questions shared by candidates
Write a program to convert a string written as JAVA variable to C++ variable and vice-versa. Input : this_is_a_variable Output: thisIsAVariable
1. Find coordinates of intersection A rectangle is called rectilinear if its edges are all parallel to coordinated axes. Such a rectangle can be described by specifying the coordinated of its lower-left and upper-right corners. Write a function: function solution($K,$L,$M,$N,$P,$Q,$R,$S); that given eight integers representing two rectilinear rectangles (one with lower-left corner (K,L) and upper right corner (M,N), and another with lower-left corner (P,Q) and upper-right corner (R,S)), returns the area of the sum of the rectangles. If the rectangles intersect the area of the intersection should be counted only once. The function should return -1 if the area of the sum exceeds 2,147,483,647. For example Given Integers: K= -4 L = 1 M = 2 N = 6 P = 0 Q = -1 R = 4 S = 3 **the function should return 42** * The area of the First rectangle is 30 and the area of the second rectangle is 16 and the area of their intersection is 4. Assume that * K,L,M,N,P,Q,R and S are integers within the range [-2147483648...2147483647]. * K<M * L<N * P<R * Q<S
a brain teaser question: you have two balls and one 100-story building. What is minimum tries to figure out which floor will break the ball if a ball is dropped from that floor.
count the number of duplicates in a binary tree in O(n) time O(1) space.
What was your most challenging bug you fixed?
2.Write a C/C++ program to compute sum of N numbers.
How do you reverse a linked list
Given two arrays of sorted integers, how would you find the minimum difference in O(n) time.
Given a list of 1,000,000 integer (1 to 1,000,000 with no repeat), how to sort the list with only 1 mb of memory space.
Viewing 421 - 430 interview questions