上一页 1 ··· 46 47 48 49 50 51 52 53 54 ··· 76 下一页
摘要: Write a SQL query to get the nth highest salary from the Employee table. + + + | Id | Salary | + + + | 1 | 100 | | 2 | 200 | | 3 | 300 | + + + For exa 阅读全文
posted @ 2019-11-21 13:52 Schwifty 阅读(143) 评论(0) 推荐(0)
摘要: Write a SQL query to get the second highest salary from the Employee table. + + + | Id | Salary | + + + | 1 | 100 | | 2 | 200 | | 3 | 300 | + + + For 阅读全文
posted @ 2019-11-21 13:32 Schwifty 阅读(111) 评论(0) 推荐(0)
摘要: The Employee table holds all employees. Every employee has an Id, a salary, and there is also a column for the department Id. + + + + + | Id | Name | 阅读全文
posted @ 2019-11-21 13:07 Schwifty 阅读(127) 评论(0) 推荐(0)
摘要: Table: Person + + + | Column Name | Type | + + + | PersonId | int | | FirstName | varchar | | LastName | varchar | + + + PersonId is the primary key c 阅读全文
posted @ 2019-11-21 13:07 Schwifty 阅读(199) 评论(0) 推荐(0)
摘要: Given a complete binary tree, count the number of nodes. Note: Definition of a complete binary tree from Wikipedia:In a complete binary tree every lev 阅读全文
posted @ 2019-11-21 11:44 Schwifty 阅读(204) 评论(0) 推荐(0)
摘要: There are a total of n courses you have to take, labeled from 0 to n-1. Some courses may have prerequisites, for example to take course 0 you have to 阅读全文
posted @ 2019-11-21 11:26 Schwifty 阅读(179) 评论(0) 推荐(0)
摘要: Given a string of numbers and operators, return all possible results from computing all the different possible ways to group numbers and operators. Th 阅读全文
posted @ 2019-11-20 14:10 Schwifty 阅读(140) 评论(0) 推荐(0)
摘要: Given a 2D binary matrix filled with 0's and 1's, find the largest square containing only 1's and return its area. Example: Input: 1 0 1 0 0 1 0 1 1 1 阅读全文
posted @ 2019-11-20 11:43 Schwifty 阅读(151) 评论(0) 推荐(0)
摘要: Given an array of n positive integers and a positive integer s, find the minimal length of a contiguous subarray of which the sum ≥ s. If there isn't 阅读全文
posted @ 2019-11-20 03:20 Schwifty 阅读(138) 评论(0) 推荐(0)
摘要: Implement a trie with insert, search, and startsWith methods. Example: Trie trie = new Trie(); trie.insert("apple"); trie.search("apple"); // returns 阅读全文
posted @ 2019-11-19 13:28 Schwifty 阅读(113) 评论(0) 推荐(0)
上一页 1 ··· 46 47 48 49 50 51 52 53 54 ··· 76 下一页