CareerCup

What function will be called when we have an uncaught exception?

What do vectors represent?

. In sequence point, how will the overloaded operators behave like?

What is the output of this program?
#include <iostream>
using namespace std;
int main()
{
int a[2][4] = {3, 6, 9, 12, 15, 18, 21, 24};
cout << *(a[1] + 2) << *(*(a + 1) + 2) << 2[1[a]];
return 0;
}

16. What is the meaning of the following declaration?
int(*p[5])();

In the absence of an exit condition in a recursive function, what will be the error?

Which function restores the environment saved by the most recent invocation of the setjmp() macro in
the same invocation of the program?

Suppose we transfer a file written on a little endian machine to a big endian machine and there is no
transformation from little endian to big endian, then what happens?

Write the correct declaration of setjmp().

The sequential order used to interpret a range of bytes in the memory of a computer is known as _____

The population of Chennai city Decreases at a rate of 10%pa. If the population was 400000 at the end of
the year 2017 then what will be its population after 3 yrs?

A Bag contains 6 red balls and 4 yellow balls. Three balls are picked at random what is the probability
At most 2 is red?

Two Trains start at the same time from a & b and proceed towards b & a at 36kmph & 42kmph
respectively. When they meet, it is found that one train has moved 48km more than the order. What is
the distance between a and b?

The average weight of 3 men A,B and C is 84kg. another man, D, joins the group, and the average
weight becomes 80kg. if another man, E, whose weight 3kg more than that of D, replaces A, then
average weight of B,C,D and E becomes 79kg.The weight of A is?

The present age of a father is 3 year more than three times the age of his son.3year hence, father's age
will be 10year more than twice the age of the son. The father's present age is?

Design a graph problem, given an function getFriend(int user) which returns all the users 1st degree friends, write a function to check:

1. whether two users are first-level, second-level and third-level connections
2. function that outputs a users 2nd degree and 3rd degree friends

sys design: alerting and monitoring system with different granularities : 1 hour, 1 day etc

Design a graph problem, given an function getFriend(int user) which returns all the users 1st degree friends, write a function to check:

1. whether two users are first-level, second-level and third-level connections
2. function that outputs a users 2nd degree and 3rd degree friends

You are in charge of designing a small, in-memory social network, with the basic functionality of adding friendship
between two people via an AddFriendship function, and a GetSuggestedFriends function for a particular user in the
network. The criteria is to pick someone with whom the given user has the most number of friends in common.

Start by discussing the most suitable data structure, and implement all the objects and functions.

text = 'ABCDEFGHIJ'
output = '"A""

Design a system to efficiently find 10 top selling products on an online shopping site at a given time with a time window of say 20 minutes.

Say, every second 100 products buy count getting updated.

Which data structure && algorithm would be the best to design such kind of systems ?

Given an integer array and an integer K, find the number of sub arrays in which all elements are less than K.

Follow up -
Given an integer array and an integer K, find the number of non overlapping unordered pairs of sub arrays in which all elements are less than K.

You are given a series of arithmetic equations as a string, such as:

y = x + 1
5 = x + 3
10 = z + y + 2
The equations use addition only and are separated by newlines. Return a mapping of all variables to their values. If it's not possible, then return null. In this example, you should return:

{
x: 2,
y: 3,
z: 5
}

Given a board game of N x M size. A domino is of size 1 x 2 and can be rotated to make it 2 x 1. A player can place a domino in any of the available position. When a player is not able to place a domino, he loses. An AI is created to play against the user. The AI selects a random position in the board and places the domino there. Improve this AI. What solution will be the best when board size is small and what if the board size is large.


Anyone has any idea how to have a solution to this problem?

Given a set of integers, the task is to divide it into two sets S1 and S2 such that the absolute difference between their sums is minimum.
If there is a set S with n elements, then if we assume Subset1 has m elements, Subset2 must have n-m elements and the value of abs(sum(Subset1) – sum(Subset2)) should be minimum.

Given an array of sets find the one that does not belong:
example: [[a,b,c,d], [a,b,f,g], [a,b,h,i], [j,k,l,m]]
output: [j,k,l,m]

We can see above that the first three sets have a subset [a,b,c] and the last one does not. Note: There may be a case where the outlier set does have elements contained in the input group. In this case we have the find the set that has the least in common with the other sets.

Q. find the number of ways a string can be formed from a matrix of characters.
It can start forming a word from any position in mat[i][j] and can go in any unvisited direction from the 8 directions available across every cell [i][j].

sample case :

input:

N = 3 (length of string)
string = fit

matrix :
fitptoke
orliguek
ifefunef
tforitis

output: 5

explanation:
num of ways to make 'fit' from matrix chars are 5 as given below sequence:
(0,0) (0,1)(0,2)
(2,1) (2,0)(3,0)
(2,3) (1,3)(0,4)
(3,1) (2,0)(3,0)
(2,3) (3,4)(3,5)


How can we solve it efficiently without doing DFS across every position [i][j], which makes time complexity exponential?
Is there a better way possible in terms of time complexity? Maybe caching of values or something!

What to do when we are poor on coding

Class A has two data members which are instances of class B and class C. Class B needs an instance of class C to be created. We have to create an instance of object A on stack like 'A objA' in main function. 'new' operator should not be used anywhere.no objects on the heap

Given a list of 2d points, if any two points have distance(straight line) <= k , group them together. For example. [P1,P2,P3], P1 to P2 <=k, P2 to p3<=k, p1 to p3>k. they are still in the same group. (distance relationship is chainable ) ask how many groups can you find ? I can think of N^2 time complexity with union and find. but how to do better than that? maybe NlogN or O(N)?