CareerCup

NCON Turbines - Top Turbine Manufacturing Companies in India

#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.