CareerCup

Question 2: Suppose there are n jobs and n workers. The cost paid to worker i to do job j is Ci,j. Each job is performed by only one worker and vice versa. Find a way to hire workers so that the total cost is minimal. Use design techniques to write algorithms to solve the above problem.
Question 3: Given a square grid of level n, each cell is assigned a natural number. At a cell, you can move to another cell in the following directions: down, to the right (the next cell next to the bottom and to the right). Find the path from the first cell (1,1) to the cell (n,n) such that the sum of the cells passing through is minimal. Design an algorithm to solve this problem.
Please help me solve these 2 questions!
Thank you so much

Hey everyone,

Over the last few months I've been helping my friends prepare for interviews at FAANG, since I was fortunate enough to receive offers when I applied myself a few years ago.

They've found my mocks really helpful in improving their technique, but when it comes to finding more people to do interviews with online they've really struggled - people they're partnered up with on existing platforms are often at a completely different level and can't test them like a real interviewer would.

So I decided to build something to help! mockme.io

The key idea with mockme is that instead of being matched with someone randomly, we use your LeetCode rating, previous experience (verified by LinkedIn) and other info to find a partner who can challenge you as a real interviewer would.

Would love to hear your thoughts, feedback, questions or any other comments Oh - and signup if you'd like to join the beta!

Hey peeps,

I am in the process of applying for a software job in which C# skills are required. Just wanted to know what are the commonly asked C# problems do interviewers ask to implement.

Hi,

Did anyone recently complete the Microsoft Online Technical Screen (OTS) and know what to expect? This is the 60 minutes online assessment on codility that comes after the recruiter screen. I am specifically looking for the type of questions they are asking to know what to prepare for.

You have an integer array. Starting from arr[startIndex], follow each element to the index it points to. You continue to do this until you find a cycle. Return the length of the cycle. If no cycle is found return -1

forexample {1, 0}, 0) => 2
{1, 2, 0}, 0) => 3

Hi
I am a student and in 2021 i will be passing out from school. I love coding and i am comfortable in java. I want to prepare for coding interviews and want to land a job at a top company. I really want to start my prep from now. Is it a good idea?

Hi,
I have received an email from Amazon recruiter that you got selected for SDM role. But it's been 2 weeks i didn't get offer details..Not sure why they are delaying it.. ?

Consider this C# Program. It reads lines from the standard input and and does some processing on them by calling processData.

The input is being read in from a file called input.txt, in this format:

22, Data Structures, 45
23, English, 52
22, English, 51
26, Data Structures, 72
23, Data Structures, 61
24, English, 81
Each line consists of three fields "Student ID," "Subject," and "Marks." "Student ID" and "Marks" are integers and "Subject" is a string that does not contain commas or newlines. There can be any number of students and up to 6 subjects.

Currently, the existing program reads the input, puts it into a data-structure, and calls a function/method processData on it. processData returns an integer that is printed to the output file. Unfortunately, processData currently does not do anything useful - it just returns 0.

You have to modify processData to compute the average marks scored across all subjects by the student with the lowest ID.

If your program is run with the input given above, it should print 48 because that is the average of the marks received by the student with ID 22 (which is the lowest ID).

Examples:
(((abc))) --> abc
(ab(c)) --> ab(c)
(abc09%(c)) --> abc09%(c)
ab(c) --> ab(c)
(ab)c --> (ab)c
abc(c)) → INVALID
(abc)(def) --> (abc)(def)
(abc)typ(def) --> (abc)typ(def)
((abc)(def)) --> (abc)(def)

I got 5-6 online assessments from Amazon , and I attended all the assessment. But no response from their end. It would be better if they would have given response. Its been demotivated when you try harded and you are not even informed. Its been 3 months.

Hi- I bought the book Cracking The Coding Interview. I am finding it hard to recreate these test practice questions in SAP ABAP language which is what I will be tested during my interview. Does anyone have any hints on this? I am not finding much resources online or even YouTube videos that describe how to prepare for this test using SAP ABAP. Thank you!

Cool Drink: Kenny loves Coca Cola.

- There are 'n' different shops in his colony from which he can buy coca cola.

- Each shop has different rate for the same coca cola bottle

- Kenny decided to buy his favorite cool drink for 'm' continuous days.

- Each day Kenny has 'p' money in his hand.

Find out from how many shops, Kenny can buy his favorite cool drink each day.

Prototype: Int[] find TotalShops(int input1, int[] input2 int input3, int] input4)

input1 - Total No. of shops in the colony
input2 - Rate of cool drink in each shop
input3 - No. of days, Kenny is going to buy the cool drink
input4 - Total money, Kenny has with him to buy cool drink, each day


output - No. of shops, in which, Kenny can buy cool drink, each day

Ex - input1 - 5
input2 - {3,10,8,6,11}
input3 - 4
input4 - {1,10,3,11}

output - {0,4,1,5}

write the functions char * reverse (char * nap, int n) - reverse the string nap except the character at position n (and its "symmetrical" equivalent) and return the inverted string as a result.
Example:

char tab[9]="abcdefgh";

cout << reverse(tab,3);

Output: hgfdecba // d is on same position

Hello,
I am 2019 passout from a tier 3 college with 9 months of experience right now. My coding skills are average and I work in Java.

Given an integer N, find the Nth number in the fibonacci series. Consider 0 and 1 to be the seed values. In a fibonacci series, each number ( Fibonacci number ) is the sum of the two preceding numbers. The series with 0 and 1 as seed values will go like- 0, 1, 1, 2, 3, 5… .

Input

The first line contains an integer T, depicting total number of test cases. Then following T lines contains an integer N.

Constraints:
1 ≤ T ≤ 50
1 ≤ N ≤ 50

Output

Space separated Nth fibonacci number for each N given in the input

You are asked q queries each of which can be of type 1 or type 2 Type 1 : Report the area of square of side S. Type 2 : Report the area of rectangle of sides L and R.

Input

The first line of the input contains single integer Q.
Next Q line contains the queries.
Each query first contains type of query
if query is of type one you are given a single integer S
if query is of type two you are given two integers L and R

Constraints
1 <= Q <= 25
1 <= T <= 2
1 <= S,L,R <= 1000

Output

Output Q line each containing answer to the asked query

Arrange the following growth rates in the increasing order.
O(n3),O(1),O(n2),O(nlogn),O(n2logn),Ω(n0.5),Ω(nlogn),Θ(n3),Θ(n0.5)

Hello Everyone, I want to know the functionality between vTable and vptr in C++. I have faced one interview on skype last week and Recruiter told me this question and i was not given the answer. I have checked on google to find it but still, I am confused. Can anyone know or suggest me some more c++ interview question. which is helpful for my upcoming interviews.

There is a function checkPassword() which takes a password and return an int which represents the number of correct characters at the correct position in that password.

Write a function findPassword() which takes a list of passwords and returns the correct password or null if it doesn't find the correct password. It can make calls to checkPassword() function but it is a very expensive function so the goal is to minimize the calls to checkPassword().

Assume all passwords are of same length.

Example:-
If correct password = abcd
calling checkPassword("axyz") would return 1

Sample Input =
String[] passwords = {"xxyz","axyz", "xbyz","abyz","axyd","xycd"}
System.out.println("password = "+findPassword(passwords));

Sample Output:-
password = abcd

The question asks us to write a method that tells if one string is a permutation of the other. Looking at the solution it looks like the function tells if 2 strings are anagrams and not permutations. For example the function will return true for "dog" and "dgo". Am I missing something?