CareerCup

What is the next number in the series 76,24,54,115

Describe the Flyweight and Visitor design pattern with example

You have a vector of 128 floats (float data[128]) in shared memory, an environment with 8 threads and a convenient function called barrier() that will block on each thread until it will be signaled by all 8 threads (a simple semaphore of 8 elements).

Write a pseudo-C parallel function that calculates the sum of all 128 elements storing it inside data[0]; the function can alter/destroy the content of the other 127 elements of data[].

thread_id goes from 0 to 7: it is constant and unique for each of the 8 threads.

Consider the following 3D scene representing an old town's main square:
• A single statue
o static geometry, high polygon count
o low complexity fragment shader
• A particle system simulating smoke
o animated, rendered as a large set of points
• A small set of characters
o animated geometry, medium polygon count
o medium complexity fragment shader
• A large set of buildings
o static geometry, low polygon count
o low complexity fragment shader
• A background image/skybox
• The camera/viewpoint is continuously moving within the scene.

How would you render the statue - by itself – using OpenGL to achieve maximum vertex performance (vertices/second)?

How would you render the particle system - by itself - using OpenGL to achieve maximum vertex performance (vertices/second)?

How would you render the scene - as a whole - most efficiently on a GPU using OpenGL?

Given that the 3D scene was being rendered correctly but that you wanted to improve the performance further, how would you determine if the main performance limitation/bottleneck was located in the application, in the vertex processing stage, or in the fragment processing stage?

There are cards and each card has an identity. e.g. HC1 has ID 1, this ID also represents the cost of the card. Your sister already have some cards and you want to gift her cards which she do not have already. Program is to return the max number of cards you can buy for her.

Constraint : You have amount d, and want to buy as many distinct card as you can.

e.g. Sister Cards = [2, 3, 5], D : 7 Card you buy : 1, 4

Output : 2

You have been given a special and normal status of alphabets.

e.g. “01111001111111111011111111” represents “abcdefghijklmnopqrstuvwxyz”. Here 0 represents normal character and 1 represents special character.

Given an Input String S and a number k, find the maximum continuous sub array with maximum k number of number elements. There is no constraint on special character.

e.g.

S = “giraffe”, K = 1, “011110011111111110111111”

Output : 3

How ?

normal characters : a, g, f

one of the possible solution : gir (as this has only one normal character)

Given a binary String which represents the target state. Minimum number of flips needed to convert a same size Binary String (with all 0’s) to target state. A flip also causes all the right bits to be flipped.

e.g.

Input : 00101 (Represents Target)

Output : 3

Explanation :

00000 -> 00111 -> 00100 -> 00101

Given a level K , you have to find out the sum of data of all the nodes at level K in a binary tree. Input is given as:
(P(C()())(C()())) P is for Parent, C is for child. if parent has one child : (P(C()())()) if parent has no child : (P()())

Create Valid html from below input.

String str="abcde"

points:- [{0,2,b},

{2,4,u}]

output : <b>ab<u>c</u></b><u>de</u>

Explanation:- character from 0 to 2 index should be bold, 2 to 4 index should be underline. Tricky point is that character at index 2 should be both bold and underline.

N cows are standing at the origin on x-axis, each cow has some appetite, in other word hunger index. A cow can sleep of 1 unit of time or eat for one unit of time or move left or move right. There are some vessels placed on the x-axis, they are having infinite supply of fiod. Find minimum time in which all cows appetite would be filled.

Input:
cow Apetitte = {1,1}
Vessle locations = {-1,1}
Answer would be 2 since both cow can go in different direction they would eat for one seconds. One second for moving and one second for eating.

This problem looks to be similar to rotten eggs/tomatoes.

how to find the fastest xor of large subarray or given range?

print(reduce(xor,arry[qury[1]-1:qury[-1]]))

but it's not working for larger input

Design a voting system. 100M users will be logging in within a window of 24h (not necessarily uniformly). Every user will be able to choose from a fixed list of options. If the user has already voted the system should not let them to vote a second time. Additional constraint: only the first 100K votes are accepted. If the quota is exceeded any attempt to vote should be rejected.

A special palindrome is a palindrome of size N which contains atmost K distinct characters such that any prefix between the size 2 to N-1 is not a palindrome.
You need to count the number of special palindromes
For example, abba is a special palindrome with N=4 and K=2 and ababa is not a special palindrome because aba is a palindrome and its a prefix of ababa.
If N=3, K=3, possible special palindromes are aba, aca, bab, bcb, cac and cbc. So answer will be 6.

Input format
Two integers N and K

Output format
Answer modulo 10^9+9

Constraints
1<=N,K<=10^9

Sample TC
3 3

Output
6

Given a length n, count the number of strings of length n that can be made using ‘a’, ‘b’ and ‘c’ with at-most one ‘b’ and two ‘c’s allowed.

Next Sunday is Ayan’s 4th birthday and a lot of guests are invited for his birthday celebration. All of them are getting gifts for Ayan and his y-1 number of siblings. There are x number of guests coming to the party and each of them presented each kid some integer number of gifts (possibly zero). The guests are numbered with integers from 1 to x and all kids are numbered with integers from 1 to y. For all 1 ≤i ≤x the minimum number of gifts, which i-th guest presented to some kid is equal to gi and for all 1 ≤j ≤y the maximum number of gifts, which j-th kid received from some guest is equal to kj.

Let ai,j be the number of gifts which the i-th guest give to the j-th kid. Then gi is equal exactly to the minimum among values ai,1,ai,2,…,ai,y and kj is equal exactly to the maximum among values g1,j,g2,j,…,gx,j.



You are interested in the minimum total number of gifts that guests could present, so you need to minimize the sum of ai,j for all (i,j) such that 1 ≤i ≤x and 1 ≤j ≤y. You are given the numbers g1,…,gx and k1,…,ky, determine this number.

Input Format

The first line contains two integers x and y, separated with space — the number of guests and kids, respectively (2≤x,y≤100000). The second line contains x integers g1,…,gx, separated by spaces — gi is equal to the minimum number of gifts, which i-th guest presented to some kid (0≤gi≤1000). The third line contains y integers k1,…,ky, separated by spaces — kj is equal to the maximum number of gifts, which j-th kid received from some guest (0≤kj≤1000).

Output Format

If the described situation is impossible, print −1. In another case, print the minimum total number of gifts, which guests could have presented and all conditions could have satisfied.

Sample Input

3 2

1 2 1

3 4

Sample Output

12

Mr. Stark is the owner of Stark industries, a manufacturer of weaponry.

A local Mafia group has hijacked one of the factories in the desert.

The mafias want to transport the weapons from the factory to their base camp, and use a single truck to do it.

But, every kilometer the truck travels with the weapons, one weapon falls off and breaks. The truck can only travel integral values of distance, and will lose 1 weapon for every km travelled.

The weapons can be unloaded at any point from the truck, and can be picked up again later.

Given the number of weapons X, max capacity of the truck Y and distance between the factory and the base Z, find the maximum number of weapons that can be transferred intact from the factory to the mafia base.



Function Description:

findMaxWeapons function takes the following parameters:

X - the number of weapons

Y - max capacity of the truck

Z - distance between the factory and the base

you are given string of digits, a value x and N. you have to divide that string in ((i-1)*x+1,min(i*x)) parts.

for example a String is ="1234567891" and x=5,N=10 then

there will be 2 partition of string since x=5
[12345] end [67891]

you have to find kth min number from these combinations. for example k=3 then ans should be 17

combination will happen like every digit from 1st partition will concanate with other partition digits

so if there were three partition for string 123456789 then it could be like

[123][456][789]

and if k=3 then ans would be 149

recently I came across one good design question. I need your thoughts how to proceed. Assume a big IT hub, like any co-work space / Microsoft / amazxon/ google etc office (which has multiple floors , each floor has multiple meeting rooms , work stations etc) . At any point of time , an admin should be able to know 1. how many people are there in that facility 2. How many people at each floor wise 3. If he chooses any cons room, he must be able to fetch how many people in that conf room at that time . This normally used for any kind of evacuation etc

I tried with http protocol , but interviewer said http is over kill , he hints on some IoT communication etc .. however , want to know what is the best way to solve it

A string can contain only a, b or c. There cannot be 2 consecutive same character. First and the last character cannot be the same. Now given a string with ‘a’, ‘b’, ‘c’ or ‘?’. We need to find the string replacing ‘?’ that satisfy the above conditions. For multiple-answer display lexicographically smallest string. For no answer possible display “Not Possible”.

repeat string n^n times without using extra space

Design and implement rate limiter for limiting api calls for a service distributed multiple users.

Design data structures which support millions of products coming in streaming manner, we need to find at any moment what are top n products at any day

You run a linux binary provided by a customer and don’t get any output. The customer assures you it should provide output. You don’t have the source code for this binary. How would you debug this? What tools / techniques can you use ? *

A customer raises a support ticket as they have a serious situation which has caused them data loss. You determine the issue is a bug in the product which is already fixed in a later version. Please write a response to the customer support ticket.

As you know, most Operating Systems are written in Java, what’s special about pointers in Java ? *

How would I store 100 million documents (~40 Gigabytes) in 32 Gigabytes of RAM? The documents are in JSON format. In other words how do couchbase, redis, and mongodb work in memory?

A co-ordinate plane was given. On each point (x, y) there are x+y number of apples on it. A person is standing on (0, 0) and he wants to buy a square plot having N number of apples inside it (including the periphery). Question was to return the value of perimeter of that square plot given N.

+27655765355 SSD MONEY CLEANING CHEMICAL +27655765355 BLACK MONEY IN JOHANNESBURG, OMAN, SAUDI ARABIA, SUDAN, Somalia ,Zimbabwe Botswana

We are specialized in the production and distribution of ssd chemical solution used to clean all types of black notes any color currency, stain and deface bank notes. Our team are highly qualified and are always ready to handle the cleaning perfectly. Our solutions are 100 % pure and some of them are listed below.

buy-calcium-oxide-online

buy-first-grade-counterfeit-bank-notes

buy-high-quality-seconal-sodium-here

buy-liquid-red-mercury-online-at-the-best-price

buy-money-developer-machines-at-reasonable-prices-from-us

buy-pk58-solution

buy-ssd-activation-powder-online

buy-ssd-chemical-solution-at-affordable-prices

buy-undetectable-euros-bank-notes-online

get-the-best-black-money-cleaning-chemical-solution

product=high-quality-vectrol-paste-for-sale

ssd-universal-chemical-solution-sale
We need the above information for easy communication.
* Note that our customers privacy is our main concern.
Tel: +27655765355
Email:makintu211@gmail.com

A dictionary is combination of characters from a-z. let's say a=1,b=2.. and so on z=26. you are given n and k. you have to find sum of length k from given combination.
for example n=51 and k=3 then your answer should be =axz
as there can be many combination for given sum so it is suggested to print those string which comes first in dictonary