CareerCup

whats the trending in Digital marketing 2020?

Are you facing a problem with your Roku live streaming device? Want to get customer support to fix them? Call at toll-free Roku Helpline number +1(844)-539-9831for the instant Roku technical support. Get in touch with us for the best Roku Services.
Complete the Roku setup and troubleshooting process with ease through iguruservices.com technical support. For more updates call us @ +1(844)-539-9831.

For Fun

Agree

The question is basically on trees
1
2 3
4 5 6 7

You can lock any node, Once the node is locked all the ancestors and descendents of that node are also locked. You cannot acquire a lock on a node which is already locked.

You can unlock the node on which you have acquired a lock.


Implement it using multithreading.

Rakesh and mahesh are brothers born in may
But they celebrate their birthday in june
Why so??
Hint: Name does'nt matter u can take any other names

Given K sorted (ascending) arrays with N elements in each array, implement an iterator for iterating over the elements of the arrays in ascending order.

The constructor receives all of the input as array of arrays.

You need to implement the MyIterator class with a constructor and the following methods:

class MyIterator<T> {
	T next();
	boolean hasNext();
}

You are allowed to use only O(K) extra space with this class.

example:
input:

[[1,5,7], [2,3,10],[4,6,9]]

The iterator should return:

1,2,3,4,5,6,7,9,10

Aghori Mahakal Tantrik

Why do we get the tickets on Kuwait airways?

Melbourne Cabs Service is a locally operated business that possesses an extensive fleet of commercial vehicles to meet your diverse transportation requirements, from airport transfers to corporate travels and sightseeing tours to name a few.We commit ourselves to delivering the service you deserve and not merely the one you need. With various models of cars and maxi cabs on our fleet, we can deliver on justabout any ground transportation requirement, Limotransfers in melbourne

What are the ways to solve relationship problems with the help of vasikaran specialist astrologer?

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.

Problem:
1. Given a Mix of all types of characters which includes Special characters, Numbers, String in a Log file.
for eg: "HappyI%&&87Christmas %%$^%&NewYear"
2. Get the largest substring which
"contains the Characters in Even Position followed by a Special Character and
then a meaningful word should be coming up"

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!

There is a 2D matrix of 0s and 1s that depicts the number of rooms that can be formed by a co-working space company like WeWork based on the values. 1 means open space for room and 0 means wall. We need to group as many 1s and possible to form the largest and minimum number of rooms.

E.g.
Number of Rows = 5, Number of Columns = 5
00010
01110
01100
01101
00011

Output: 4

Input 2:
4
3

001
111
011
100

Output: 4

A startup website has a lot of real-time traffic . I want to see the real-time view (refreshed every 1 min) of top 20 users by hit count within last 10 mins. Full distributed system, I have to resolve all the concurrency issues.

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

Here is a question from the "Cracking The Coding Interview" book with a twist.

Implement a method to perform basic string compression using the counts of repeated characters. (p. 73 5th edition)

The twist: the string can also contain digits. Think of encoding and decode protocol. How the compression can be reversed properly?

For example, ab2ccccd -> ab24cd

Please have a look at the following pseudo-code. Please note that the syntax may be completely different from any of programming languages you know. More specifically, indentation does not matter in this code, ":=" denotes the substitution, "=" is the equal comparator, and the condition in FOR statement is boundary-inclusive.

========
Initial state of an array "a":

[[4, 2, 4, 2],
[4, NULL, 4, 2],
[2, NULL, 8, 2],
[16, NULL, 4, NULL]]

========
Main function:

FUNCTION foo()
FOR y := 0 to 3
FOR x := 0 to 3
IF a[x+1][y] != NULL
IF a[x+1][y] = a[x][y]
a[x][y] := a[x][y]*2
a[x+1][y] := NULL
END IF
IF a[x][y] = NULL
a[x][y] := a[x+1][y]
a[x+1][y] := NULL
END IF
END IF
END FOR
END FOR
END FUNCTION

What is the issue with the above code?

How would you fix it?

Lal Kitab Remedies For Financial Problems

Given a matrix, find all its combinations by row. For example,

[a, b, c]
[d, e, f]
[x, y, z]

its combinations are adx, ady, adz, bdx, …. cfy, cfz

Rearrange a LinkedList:

Before : a->x->b->y->c->z
After : a->b->c->z->y->x

A list of relation is given. We need to express the relation in a single line with the largest unit leftmost.
eg.
a = 10b
b=5c
c = 20a
e=20d

Output should be:
a=10b=25e=50c=500d

A list of relation is given. We need to express the relation in a single line with the largest unit leftmost.
eg.
a = 10b
b=5c
c = 20a
e=20d

a=10b=25e=50c=500d

Views are not lifecycle aware that's true but what more? In modern development there is hardly any difference.

What is a different between view & fragment in modern android development. (Interviewer was not happy with answer related "lifecycle awareness")

ZB Hospital is a state of the art medical facility equipped the latest medical treatment facilities

ZB Hospital is a state of the art medical facility equipped the latest medical treatment facilities?

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)?