the second interview question: design a malloc function that guarantees that the address it returns is a multiplicand of 64. after that design a free function that takes such address and frees all allocated memory. both the functions can be implemented using the built in malloc and free, using a little tweek.
q2) delete a node in a linked list given a pointer to the node we want to delete (can be done in O(1)).
FIRST QUESTION: Write a function that gets a matrix of integers as a parameter and returns the socend largest integer, but you should loop the matrix only once, and consider all edge cases (including one row, one column, one value in all elements and so forth. (you need too think aboat them yourself but I mentioned almost all of them) need to solve in c.
Second question group lead- you have 1Mb of memory, implement the functions malloc and free in C (of course not using the stdlib functions). How much memory your implementing requires? and how much of the 1Mb is actually left for the user? Remember malloc need to return an Pointer to an address and free gets a pointer and frees it.
Third question team lead- desighn a data structure that supports get, set, setAll in O(1).
First question team lead - implement atoi in C. Edge cases!
Got 2 coding questions regarding algorithms and data structures
In the first one you need to implement a binary search in a binary-search tree, pretty straightforward.
In the third question, you need to correct mistakes in an almost-finished system's code.
In the second question, you get some methods in a library and must call them properly to get the system to run.
Viewing 1891 - 1900 interview questions