Convert a **Binary Search Tree** to a sorted **Circular Doubly-Linked List** in place.

You can think of the left and right pointers as synonymous to the predecessor and successor pointers in a doubly-linked list. …

Convert a **Binary Search Tree** to a sorted **Circular Doubly-Linked List** in place.

You can think of the left and right pointers as synonymous to the predecessor and successor pointers in a doubly-linked list. …

We are given a list `schedule`

of employees, which represents the working time for each employee.

Each employee has a list of non-overlapping `Intervals`

, and these intervals are in sorted order.

Return the list of finite intervals representing **common, positive-length free time** for *all* employees, also in sorted order.

(Even…

We will go through Preorder/Postoder/Inorder Traversals in this article

Given the `root`

of a binary tree, return *the preorder traversal of its nodes' values*.

**Example 1:**

Given an array of strings `products`

and a string `searchWord`

. We want to design a system that suggests at most three product names from `products`

after each character of `searchWord`

is typed. Suggested products should have common prefix with the searchWord. …

Can you do this with Time O(N) and Space O(1)?

Given an array `arr`

of unique nonnegative integers, implement a function `getDifferentNumber`

that finds the smallest nonnegative integer that is NOT in the array.

Even if your programming language of choice doesn’t have that restriction (like Python), assume that the…

Can you solve this real Google Interview Question?

Design an iterator that supports the `peek`

operation on an existing iterator in addition to the `hasNext`

and the `next`

operations.

Implement the `PeekingIterator`

class:

`PeekingIterator(Iterator<int> nums)`

Initializes the object with the given integer iterator`iterator`

.`int next()`

Returns the next element…

There is an integer array `nums`

sorted in ascending order (with **distinct** values).

Prior to being passed to your function, `nums`

is **possibly rotated** at an unknown pivot index `k`

(`1 <= k < nums.length`

) such that the resulting array is `[nums[k], nums[k+1], ..., nums[n-1], nums[0], nums[1], ..., nums[k-1]]`

(**0-indexed**)…

The car manufacturer Honda holds their distribution system in the form of a tree (not necessarily binary). The root is the company itself, and every node in the tree represents a car distributor that receives cars from the parent node and ships them to its children nodes. The leaf nodes…

Given a 2D array `binaryMatrix`

of `0s`

and `1s`

, implement a function `getNumberOfIslands`

that returns the number of islands of `1s`

in `binaryMatrix`

.

An island is defined as a group of adjacent values that are all `1s`

. A cell in `binaryMatrix`

is considered adjacent to another cell if they are…