題目如下：

Given the root of a binary tree, return an array of the largest value in each row of the tree (0-indexed).

題目如下：

Given two arrays, write a function to compute their intersection.

題目如下：

Write a SQL query for a report that provides the following information for each person in the Person table, regardless if there is an address for each of those people:

FirstName, LastName, City, State

題目如下：

Given two integers dividend and divisor, divide two integers without using multiplication, division and mod operator.

Return the quotient after dividing dividend by divisor.

The integer division should truncate toward zero, which means losing its fractional part. For example, truncate(8.345) = 8 and truncate(-2.7335) = -2.

題目如下：

And then read line by line: "PAHNAPLSIIGYIR"

Write the code that will take a string and make this conversion given a number of rows:

string convert(string s, int numRows);

題目如下：

Given a 32-bit signed integer, reverse digits of an integer.

題目如下：

Given a string s, find the length of the longest substring without repeating characters.

題目如下：

You are given two non-empty linked lists representing two non-negative integers. The digits are stored in reverse order and each of their nodes contain a single digit. Add the two numbers and return it as a linked list.

You may assume the two numbers do not contain any leading zero, except the number 0 itself.

題目如下：

Given an array of integers nums and an integer target, return indices of the two numbers such that they add up to target.

You may assume that each input would have exactly one solution, and you may not use the same element twice.

You can return the answer in any order.

前同事今天面試的題目，我稍微改了題目敘述。😁