|
|
@@ -1,5 +1,6 @@
|
|
|
|
|
|
-##Quiz 1
|
|
|
+## Quiz 1
|
|
|
+
|
|
|
There is a table World
|
|
|
|
|
|
+-----------------+------------+------------+--------------+---------------+
|
|
|
@@ -23,7 +24,8 @@ For example, according to the above table, we should output:
|
|
|
| Algeria | 37100000 | 2381741 |
|
|
|
+--------------+-------------+--------------+
|
|
|
|
|
|
-##Quiz 2
|
|
|
+## Quiz 2
|
|
|
+
|
|
|
Suppose that a website contains two tables, the Customers table and the Orders table. Write a SQL query to find all customers who never order anything. _(183. Customers Who Never Order)_
|
|
|
|
|
|
Table: Customers.
|
|
|
@@ -53,7 +55,7 @@ Using the above tables as example, return the following:
|
|
|
| Max |
|
|
|
+-----------+
|
|
|
|
|
|
-##Quiz 3
|
|
|
+## Quiz 3
|
|
|
|
|
|
You're given strings J representing the types of stones that are jewels, and S representing the stones you have. Each character in S is a type of stone you have. You want to know how many of the stones you have are also jewels.
|
|
|
|
|
|
@@ -76,7 +78,7 @@ The letters in J are guaranteed distinct, and all characters in J and S are lett
|
|
|
def num_jewels_in_stones(j, s)
|
|
|
end
|
|
|
|
|
|
-##Quiz 4
|
|
|
+## Quiz 4
|
|
|
|
|
|
Initially, there is a Robot at position (0, 0). Given a sequence of its moves, judge if this robot makes a circle, which means it moves back to the original place.
|
|
|
|
