Question d’entretien chez Dolat Capital

Q1. Quick sort algorithm and Merge sort algorithm and which one is better on linked list. Q2. Dynamic memory allocation and use cases of malloc, calloc, realloc and new. Q3. Some codes were given on pointers and few questions were asked. Q4. One Problem was given which required topological sort approach.