Design a Data Structure SpecialStack that supports all the stack operations like push(), pop(), isEmpty(), isFull() and an additional operation getMin() which should return minimum element from the SpecialStack. All these operations of SpecialStack must be O(1). To implement SpecialStack, you should only use standard Stack data structure and no other data structure like arrays, list, etc.
Given an array, find there are 3 numbers have when we add them the value will equals a specified sum Example: {1,4,6,10,20,21} Sum=32, Result:true (1+10+21) Sum=65, Result:false
Write algorithm to compute the intersection of two arrays. What is the time complexity of this algorithm (using the big O notation)?
1. What is a virtual? 2. If class has virtual function, what happens in compile time and in run time? 3. What is a polymorphism? 4. Write the function that gets array of chars and returns number of elements with 3 bits ON, performance is important. 5. Write the function that draws a line from x1,y1 to x2,y2 6. You have very long function with many return statements. You have to determine how much time it runs.
Sum up integer array?
int getCount(int[] arr, int num)
1- Given an array of integers, positive and negative. find an interval in that array, whose elements constitutes the maximum sum
Recursively reverse a singly linked list.
See above for type of question?
How would you reverse the words in a string?
Viewing 1721 - 1730 interview questions