# Recent questions tagged placement-questions

1
Given an array of $n$ elements find the maximum continuous sum in it. For example consider the below array of $n=6$. 23 4 -10 2 15 1 Answer is 35.
1 vote
2
Write an object oriented code for representing boolean expressions and then a function for checking the equivalence of two boolean expressions.
3
Given an arithmetic expression involving *, + only write an object oriented code for its representation and evaluation
4
Write a function (proper programming code) for multiplying two integers without using '*' operator and considering all corner cases.
5
Given an input string of length $n$, find the maximum length of the substring containing maximum $k$ unique characters. For example, for "abbcdaadcd" and $k=2$ answer will be 4 for the substring "daad".
6
Given an array with possible repeating elements you have to rearrange such that elements are alternatively decreasing and increasing (strict increase/decrease). For example, suppose the given array is 1 1 2 3 4 5 one possible answer would be 2 1 3 1 5 4. Assumption: Solution do exist for any given input. Hint: Try to avoid sorting.
7
The information about an array used in program will be stored in Symbol Table Activation Record Both (A) and (B) Dope Vector
1 vote
8
According to me first we sort the array in O(nlogn) time and then in O(k) time , find the product , so total time complexity is O(nlogn) , so am I right or can it be done in lesser time ?
9
1 vote