CareerCup

What would be the sample class design of notification system?

What would be the sample class design of tic tac toe game?

What would be the sample class design of Outlook like meeting scheduler?

How to reset my hotmail password?

<p>We are well-versed with all the email technologies that are being used in the world today. If you are using <a href="https://www.sbcgloballogin.com/">SBC Mail</a>, which recently has stopped working, then there is no need to hit the panic button and create more problems. Just call us to know the fix.&nbsp;</p>

Vijay is a mapper in NA team he mapped 350 listings from 8 am in the morning to 12pm. Post lunch she felt sleepy and could only map 150 listings from 2 pm to 5pm. Averaging the mappings for entire day how many mappings can she do in an hour?

write a main program to take snapshots of VMs
Input: List of VMs(vmId: String), list of SLAs -> there is one-to-one mapping from VM to SLA

class SLA {
int freq_in_mins;
}

vm1 -> sla1{30 mins}
vm2 -> sla2{60 mins}

Constraints:
1) You can use takeSnapshot(vmId: String) -> Synchronous - I/O
2) If you start a snapshot of VM(with sla1) at time t0 and if it finishes at time t1, then the next snapshot should be scheduled at t1+sla1.freq_in_mins


vm1 at 00:00 and vm2 at 00:00
00:10 and 00:15

vm1 -> 00:10 + 30 = 00:40

write a class that 1) calculates the average of the stream, 2) provides an API read the average.

Handle overflows as the numbers can be very large and not fit into double/long.

...

For a given amount of currency, find the minimum set of bills. The currency set is the following: 0.01, 0.05, 0.1, 0.25, 1, 5, 10, 20, 50, and 100. For example, for 21.28, 1 20 bill, and 1 1 bill, and 1 0.25 bill and 3 0.01 bills.

Given two string check if they can be made equivalent by performing some operations on one or both string.

swapEven:swap a character at an even-numbered index with a character at another even-numbered index

swapOdd:swap a character at an odd-numbered index with a character at another odd-numbered index

Given : s="cdab" , x="abcd"
s -> cdab ->swap a and c ->adcb (swapEven)-> swap b and d (swapOdd) -> s="abcd" = x="abcd"

Given: s="dcba" , x="abcd"
no amount of operation will move character from an odd index to even index, so the two string will never be equals

Given: s="abcd" ,x="abcdcd"
x length to big so will never be equals

Given an array of lower case strings, the task is to find the number of strings that are special equivalent.
Two strings are special equivalent if they can be made equivalent by performing some operations on one or both string

swapEven : swap a character at an even-numbered index with a character at another even-numbered index

swapOdd : swap a character at an odd-numbered index with a character at another odd-numbered index


Input : arr = {"abcd", "cbad", "bacd"}
Output : 2
The 2nd string can be converted to the 1st by swapping
the first and third characters. So there are 2 distinct
strings as the third string cannot be converted to the
first.


string input[] = {"abcd", "acbd", "adcb", "cdba",
"bcda", "badc"};
ans =4

Given an array of lower case strings, the task is to find the number of strings that are distinct.
Two strings are distinct if they can be made equivalent by performing some operations on one or both string

swapEven : swap a character at an even-numbered index with a character at another even-numbered index

swapOdd : swap a character at an odd-numbered index with a character at another odd-numbered index


Input : arr = {"abcd", "cbad", "bacd"}
Output : 2
The 2nd string can be converted to the 1st by swapping
the first and third characters. So there are 2 distinct
strings as the third string cannot be converted to the
first.


string input[] = {"abcd", "acbd", "adcb", "cdba",
"bcda", "badc"};
ans =4

roadrunner login, 1-800-627-5045, twc login

There are 3 threads. 1 is producer thread. 2 consumer threads. There is 1 buffer. Producer writes to the buffer. Consumers consume from buffer. How to synchronise between them so that consumers consume from buffer one after another, that is, the number of tokens that consumer thread1 consumes is same as number of tokens consumer thread2 consumes. Answer in c,linux

Connect to Expert 1-800-980-183 Bigpond Webmail Login Australia

design an email job that would deliver high number of emails and will work on a really old and slow hardware.

how to design a system to fast lookup cars on the market according to the user's geo position.

Find top 10 most frequent words in the past hour, day and month from twitter service. Given a streaming data such as tweets from twitter service, the objective is to find the top 10 frequent words in the past hour, day and past month at any instant of time.

Iam trying to send the directed graph in a request payload as
{
"data":[
{
"source": "A", "target": "B", "distance":6
},
{
"source": "A", "target": "E", "distance":4
},
{
"source": "B", "target": "A", "distance":6
},
{
"source": "B", "target": "C", "distance":2
},
{
"source": "B", "target": "D", "distance":4
},
]
}
How can I save this in database and perform the operations as to get the shortestpath between the points(Iam using java,spring boot )

Iam passing directed graph as the request payload
{
"data":[
{
"source": "A", "target": "B", "distance":6
},
{
"source": "A", "target": "E", "distance":4
},
{
"source": "B", "target": "A", "distance":6
},
{
"source": "B", "target": "C", "distance":2
},
{
"source": "B", "target": "D", "distance":4
},
]
}
How can i save the graph in the database using java .Here Iam using spring boot

Binance Support +1-800-571-6109 Binance customer service

Iam passing the graph in the Post request body as
{
"data":[
{
"source": "A", "target": "B", "distance":6
},
{
"source": "A", "target": "E", "distance":4
},
{
"source": "B", "target": "A", "distance":6
},
{
"source": "B", "target": "C", "distance":2
},
{
"source": "B", "target": "D", "distance":4
},
{
"source": "C", "target": "B", "distance":3
},
{
"source": "C", "target": "D", "distance":1
},
]
}

How can I save the graph in the database and used it for to find the shortest path between the nodes?

How to connect wireless HP printer to Laptop?

How to unblock Friends without Blocker users?

How to Facebook account hacked?

How Recover Facebook Account?

Given two two integer arrays. Find the longest common subsequence.
eg: a =[1 5 2 6 3 7], b = [5 6 7 1 2 3]. return [1 2 3] or [5 6 7]

Question : Given a set of N numbers [1,N], partition them into 2 disjoint subsets based on a set of K queries.
Each query is of the type (n1, n2) where n1 and n2 are distinct numbers from the set and n1 and n2
belong to opposite subsets.

Example:

Input:

Input:
N = 4
K = [(1, 2), (1, 3), (2, 4)]

Output:
Set 1 : (1,4)
Set 2 : (2,3)

Given two arrays. One is for tasks (Processes) and each element depicts the amount of cores required to run the task. 2nd array is an array of CPU where each element depicts the no of cores in it.We have to tell how many maximum number of tasks can be allocated. Example: Task: [3, 5, 7], Cores: [1, 3, 5] . Here only task 0 and 1 can be allocated to CPU 1 and 2 . So, answer=2.