Assume that you are given the head and tail pointers of a doubly linked list where each node can also have a single child pointer to another similar doubly linked list. There are no cycles in this structure outside of the traditional double links. Write a procedure in C++ that flattens this structure into a single list.
Write a procedure in C that reverses the letters of a null-terminated string. Then write another procedure in C that reverses the words of a null-terminated sentence.
<Behavioral Questions> Q: When was the time that you had to work with a person that you did not like?
<Whiteboard Question> Q: Implement a stack or a queue (It can be done using an array or a linked list).
<Whiteboard Questions> Q: Implement a stack or a queue (It can be done using an array or a linked list).
<Whiteboard Questions> Q: Find where two linked lists intersect.
<Behavioral Questions> Q: When was the time you disagreed with someone?
<Behavioral Questions> Q: When was the time that you had to work with a person that you did not like?
<Behavioral Questions> Q: How did you learn coding?
<Data Structure Question> Q: How would you describe stack and queue to a kid?
Viewing 1 - 10 interview questions