1. A question set is given to you and you have to generate (question numbers are in an array) generate different set of question paper for k students.

2. Given an array of integers, find out number of ways in which you can select increasing subsequences of length k(k “abcababceced” (2 ‘c’ are removed)

After removing repeated substring of length 2: “abcababceced” –> “abcabceced” (substring “ab” is removed) and so on.

3. You are given a 1D array of integers, such as:

int[] array = [3,4,7,2,2,6,0,9];

Suppose you need to treat this array as a 2D table with a given number of rows.

You want to sum the columns of the table.

One value of numRows is 4..in that case the resultant array would look like

what if numRows==4?

3 4

7 2

2 6

0 9

—-

12 21

4. Given an unsorted array, find the longest consecutive elements sequence.

Ex: 5 7 3 4 9 10 1 15 12

Ans: 3 4 5

5. You have to create a graph in most efficient way from relationship of nodes read from txt file.

text file contains information like:

node_id weight node_id

node_id weight node_id

…..

// which means two nodes are connected with some weight. (undirected)

There are around 600K such information for about 65000 nodes.

Aim is to create a a subgraph for a given node_id. i.e for that node_id find ALL successor nodes with level mentioned i.e form a subgraph for that node.

6. Given ‘n’ no of sets and each set is of a variable size. Find out the cross product of these ‘n’ of sets.

For eg. {1,2} , {3,4} , {5,6,7} these are the three sets.The cross product of these sets would be as below.

{1,3,5},{1,3,6},{1,3,7},{1,4,5},{1,4,6},{1,4,7},{2,3,5},{2,3,6},{2,3,7},{2,4,5},{2,4,6},{2,4,7}.

7. Given an array of integers, find out number of ways in which you can select increasing subsequences of length k(k<=n).

eg array is 1 4 6 2 5 & k=3

Output: 3

Sequences: 1 4 6, 1 4 5, 1 2 5

8. Sorry posted this question as a repetition of question 1.

9. Given a binary matrix of N X N of integers , you need to return only unique rows of binary arrays

eg:

0 1 0 0 1

1 0 1 1 0

0 1 0 0 1

1 1 1 0 0

ans:

0 1 0 0 1

1 0 1 1 0

1 1 1 0 0

10. Given an array of size n wherein elements keep on increasing monotonically upto a certain location after which they keep on decreasing monotonically, then again keep on increasing, then decreasing again and so on. Sort the array in O(n) and O(1).

### Challenge others to solve

### Like this:

Like Loading...

## Recent Activity