CareerCup

#include <stdio.h>
#include <stdlib.h>
#include <assert.h>

void my_free(char *p) {
free(p);
p = NULL;
}

int main() {
char *p = (char*) malloc(100);
my_free(p);
assert(p == NULL);
}

Will this code work? or crash

insert node to Binary search tree(BST) both recursively and iteratively.

Come up with a low-level design for an In-Memory Database.

Given a stream of integers where probability of a smaller number being first in stream is more than probability of larger number in stream.

Implement a method that returns true if you have already seen that element in stream otherwise return false.

eg. stream could look like 1,2,3,5,6,11,7,3......
more examples - 3,4,1,2,5,9,22,12

---
I explained using a hashset but that solution was not viable because of the space requirement.
I don't think I handled this question well. So would love people's opinion on it.

design an ip blocking system

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

As we all know that poker cards have four suites: Spades, Hearts, Clubs and Diamonds with figures from 1 to 13.
Now you are given a set of poker cards, you can pick any one card as the first card. And except for the first card, you can only pick the card that has the same suit or figure with the previous one.
Return the max number of cards you can.
For example: [(H, 3), (H, 4), (S, 4), (D, 5), (D, 1)], it returns 3 as follows: (H,3)-->(H,4)-->(S,4)

Hey anyone got the 90 minutes online assessment test from Amazon for MBA interns? I would like to know what type of questions they ask in the assessment. I need an example if any one of you attended it.

Your input is a double array, and you can use *, +, -, and () parenthesis anywhere to create and output the maximum possible value.

Ex:
input is {3,4,5,1} --> output: 72
input is {1,1,1,5} --> output: 15

Follow up, if there are numbers <0


Already posted question ( 3yrs back)
my doubt is can we solve this using multiplication only ( special case 0 and 1 we need to use addition for these alone

ie. if ar[i]==1
max(result*ar[i-1]+1,result*ar[i+1]+1)
)

Now given any number of balls, you have to tell how many times you have to weigh at minimum to find which ball is the heavier one?

What are the steps of the algorithm with order O(m log (mn)) for finding k-th smallest element (or median) of 2D array [1..M] [1..N] where each row of this matrix is sorted and independent from all other rows (ascending order, distinct elements)?

there are 3 tables :
Movie = {movie_id, .....}
Actor = {actor_id, gender, .....}
Movie_Actor = {movie_id, actor_id,....}
Find the pair of movie actor ( male) and actress ( female) who appeared in most movies together.

Tablea Order = {order_id, order_timestamp, total_sale_amount, ....}
Note => Trimmed Mean = remove top and bottom 5 percentile data to remove outliers. Take the average of middle 90% of the data.
you can use function percentile(Col_name, 0.95)
output should look like => {Date, raw_average, trimmed_average}

Phone number for Malwarebytes premium support

Power list has the following conditions
first element should b1
Next L2 element should be 2
Next L3 element should be 3
Next L4 element should be 4
Next L5 element should be 5
Next L6 element should be 6
Next L7 element should be 7
Next L6 element should be 6
...
Next L1 should be 1

e.g.,
1 2 3 4 5 6 6 7 6 5 4 3 2 1 -- power list
1 2 3 4 5 6 7 6 5 4 3 2 11 - not a power list since last two elements are 1 .

Wrte a code to find out whether arr [] represents a power list or not.

in Cracking the coding interview book 6th edition page 42 says that O(5 * 2^n + 1000 * N^100) = O(2^n)... I tried a sample code and got n^100 is greater than 2^n...

Can we write a Fixed LOD inside a Fixed LOD.

There is Tableu dashboard on Production server and you dont have access to it. You have this dashboard with staging data(not production data). This dashboard has performance issue. How will you fix this problem.

Employee Salary Department
A 1000 IT
B 2000 IT
C 3000 IT
D 4000 HR
E 2000 HR
F 1500 IT
G 7000 HR
Write a query to get results like below -
Employee Salary Next highest salary(in same department) Department
A 1000 2000 IT
B 2000 3000 IT
.
.
E 2000 4000 HR

House No Members
1100 John, mary, kim, ash
1101 Dan, Roger, kee
Write a query to get in below format-
House No Person
1100 john
1100 mary
1100 kim
1100 ash
1101 Dan
1101 roger
1101 kee

If ( a = True){
If (b = True){
Approve credit card;
}
Else {
Disapprove credit card;
}
}
Else {
If(C=False){
IF(D=True){
Approve Credit card;
}
else {
Diapprove credit card;
}
}
}
Simplify above written code.

While designing a Table in database, how will you determine its performance?

Given n number of persons in a park. One of them is having a virus. But we don't know whom. Also, the position of all persons is given. A contaminated person can spread it up to d distance. When the best case (Spread is minimum) and the worst case(Spread is maximum) would occur?e.g.
N=5
Position=[1, 3, 5, 9, 14]
d=5

Given a binary tree, find the maximum product path.
In other words, find the path inside the binary tree which has maximum product.

Sum of series (n/1) + (n/2) + (n/3) + (n/4) +…….+ (n/n). 1 <= n <= 10^12

You are driving a bus along a highway, full of rowdy, hyper, thirsty students and a soda fountain machine. Each minute that a student is on your bus, that student drinks one ounce of soda. Your goal is to drop the students off quickly, so that the total amount of soda consumed by all students is as small as possible.You know how many students will get off of the bus at each exit. Your bus begins somewhere along the highway (probably not at either end) and moves at a constant speed of 37.4 miles per hour. You must drive the bus along the highway; however, you may drive forward to one exit then backward to an exit in the opposite direction, switching as often as you like. (You can stop the bus, drop off students, and turn around instantaneously.)Describe an efficient algorithm to drop the students off so that they drink as little soda as possible. Your input consists of the bus route (a list of the exits, together with the travel time between successive exits), the number of students you will drop off at each exit, and the current location of your bus (which you may assume is an exit). How would you approach this problem

Write test Case for Amazon search plugin with a drop-down, search text box and submit button

Amazon website was working fine till yesterday.
//However in last 24 hours, the order processing(Delivery Estimates) has been taking longer than usual.

Write Test data for the program which finds the distance between 2 given character of a sentence.
// SAMPLE INPUT: findDistance("Ajay is here", A, h) => 10

Question 2) You have given a 2D binary matrix of size M[N-1][N-1]. Consider 1's as a
path and 0's as a deadend. The person starts from M[0][0] and needs to reach at point
M[N-1][N-1]. He can either move forward and down. You need to calculate the path to
reach the destination.

M[N][N] = 1 0 0 0
1 1 0 0
0 1 1 0
1 1 1 1