Given an array of n integers where n > 1, nums, return an array output such that output[i] is equal to the product of all the elements of nums except nums[i].

For example, a polynomial x^109 + 9x^5 − 2x^2 is most likely pronounced:

Given n items with size Ai, an integer m denotes the size of a backpack. How full you can fill this backpack?

Type URL in browser: www.google.com(domain)Find the nearest DNS server(Domain Name Service)Send http/https request to the IP addressWeb Server got the request and deliver it to HTTP server (port 80)HTTP server resend the request to Django, Rails, NodeJS based Web ApplicationWeb Application proces...

• [链接] • [链接] • [链接] • [链接] • [链接]• TopCoder Algorithm Tutorial: [链接] 其中几何算法的教程要仔细看• CC150: Cracking the Code Interview: [链接] 

Given two words (start and end), and a dictionary, find all shortest transformation sequence(s) from start to end, such that:

Singleton pattern is a design pattern that restricts the instantiation of a class to one object. This is useful when exactly one object is needed to coordinate actions across the system.

- DFS Backtracking Target Structure Actual Tree/Graph Structure Any type of structure where portions of the domain can be eliminated (Chess Board, matrix, implicit tree) Definition A specific form of backtracking related to searching tree/graph structures Traverse from the end and prune unaccepta...

The structure of Expression Tree is a binary tree to evaluate certain expressions.All leaves of the Expression Tree have an number string value. All non-leaves of the Expression Tree have an operator string value.

Database Intermediary: Memory -- In-memory DB(H2)SSD (Flash)Disk Param: IOPSLatencyThroughputCapacity -- persistence Utilization: Search, Retrieval, WHY NoSQL: Large Data → Large Box/Server → More small boxes Distributed DB: sharding (DB) → Read: Replication/Caching → Write: LSM Tree Solved: Scal...

Problem Write a program to solve a Sudoku puzzle by filling the empty cells. Empty cells are indicated by the character '.'. You may assume that there will be only one unique solution. Solution {代码...} {代码...}

评分标准 可行解 Work Solution 15% 特定问题 Special Case 20% 分析能力 Analysis 25% 权衡 Trade-off 15% 知识储备 Knowledge 25% SNAKE分析法 Scenario 哪些功能？Feature/Interface? Needs 多强的系统？Constrains/Hypothesis/QPS/DAU Application 主要组成模块？Service/Module Kilobyte 如何存储数据和访问？Data/...

Elements in a subset must be in non-descending order.The solution set must not contain duplicate subsets.

{代码...} {代码...}

Given a sequence of integers, find the longest increasing subsequence (LIS).

Given an integer array, sort it in ascending order. Use quick sort, merge sort, heap sort or any O(nlogn) algorithm.

Given a positive integer num, write a function which returns True if num is a perfect square else False.

Java is a high-level platform-independent object oriented programming language.

Given a string containing just the characters '(', ')', '{', '}', '[' and ']', determine if the input string is valid.

Design and implement a data structure for Least Recently Used (LRU) cache. It should support the following operations: get and set.

We've installed your MySQL database without a root password. To secure it run:

Reactive Extension JavaScript. It's a reactive streams library that allows you to work with asynchronous data streams. We represent asynchronous data streams using observable sequences.

The count-and-say sequence is the sequence of integers beginning as follows:

Each element in the result must be unique.The result can be in any order.

Returns the index of the first occurrence of needle in haystack, or -1 if needle is not part of haystack.

Write a function to find the longest common prefix string amongst an array of strings.

Determine whether an integer is a palindrome. Do this without extra space.

The string "PAYPALISHIRING" is written in a zigzag pattern on a given number of rows like this: (you may want to display this pattern in a fixed font for better legibility)

Compare two version numbers version1 and version2.If version1 > version2 return 1, if version1 < version2 return -1, otherwise return 0.

Given a binary tree, return the postorder traversal of its nodes' values.