Two coding questions:
1. merge three sorted integer array
2. Convert Binary Search Tree to Sorted Doubly Linked List. Convert a BST to a sorted circular doubly-linked list in-place. Think of the left and right pointers as synonymous to the previous and next pointers in a doubly-linked list.

Question

Two coding questions: 
1. merge three sorted integer array
2. Convert Binary Search Tree to Sorted Doubly Linked List. Convert a BST to a sorted circular doubly-linked list in-place. Think of the left and right pointers as synonymous to the previous and next pointers in a doubly-linked list.

Meta

Meta Interview Question

Want the inside scoop on your own company?

Bowls

Followed companies

Job searches