# LeetCode vs. LintCode Table

| Problem                             | LeetCode ID                                                                                         | LintCode ID                                                                                     |
| ----------------------------------- | --------------------------------------------------------------------------------------------------- | ----------------------------------------------------------------------------------------------- |
| Search in Rotated Sorted Array      | [33](https://leetcode.com/problems/search-in-rotated-sorted-array/)                                 | [62](/algo/binary-search/search-in-rotated-sorted-array.md):white\_check\_mark:                 |
| Reverse Linked List                 | [206](/algo/linked-list/reverse-linked-list.md):white\_check\_mark:                                 | [35](https://www.lintcode.com/problem/35/)                                                      |
| Linked List Cycle                   | [141](/algo/linked-list/linked-list-cycle.md):white\_check\_mark:                                   | [102](https://www.lintcode.com/problem/102/)                                                    |
| Linked List Cycle II                | [142](/algo/linked-list/linked-list-cycle-ii.md):white\_check\_mark:                                | [103](https://www.lintcode.com/problem/103/)                                                    |
| Maximum Depth of Binary Tree        | [104](/algo/binary-tree/2.-classical-questions/maximum-depth-of-binary-tree.md):white\_check\_mark: | [97](https://www.lintcode.com/problem/97/)                                                      |
| Invert Binary Tree                  | [226](/algo/binary-tree/2.-classical-questions/invert-binary-tree.md):white\_check\_mark:           | [175](https://www.lintcode.com/problem/175/)                                                    |
| Binary Tree Paths                   | [257](/algo/binary-tree/2.-classical-questions/binary-tree-paths.md):white\_check\_mark:            | [480](https://www.lintcode.com/problem/480/)                                                    |
| Binary Tree Preorder Traversal      | [144](/algo/binary-tree/1.-traversal/binary-tree-preorder-traversal.md):white\_check\_mark:         | [66](https://www.lintcode.com/problem/66/)                                                      |
| Binary Tree Inorder Traversal       | [94](/algo/binary-tree/1.-traversal/binary-tree-inorder-traversal.md):white\_check\_mark:           | [67](https://www.lintcode.com/problem/67/)                                                      |
| Binary Tree Postorder Traversal     | [145](/algo/binary-tree/1.-traversal/binary-tree-postorder-traversal.md):white\_check\_mark:        | [68](https://www.lintcode.com/problem/68/)                                                      |
| Minimum Depth of Binary Tree        | [111](/algo/binary-tree/1.-traversal/minimum-depth-of-binary-tree.md):white\_check\_mark:           | [155](https://www.lintcode.com/problem/155/)                                                    |
| Balanced Binary Tree                | [110](/algo/binary-tree/4.-divide-and-conquer/balanced-binary-tree.md):white\_check\_mark:          | [93](https://www.lintcode.com/problem/93/)                                                      |
| Sort Colors                         | [75](/algo/sorting/sort-colors-1.md):white\_check\_mark:                                            | [148](https://www.lintcode.com/problem/148/)                                                    |
| Remove Duplicates from Sorted Array | [26](/algo/two-pointers/remove-duplicates-from-sorted-array.md):white\_check\_mark:                 | [100](https://www.lintcode.com/problem/100/)                                                    |
| Two Sum II - Input array is sorted  | [167](/algo/two-pointers/two-sum-ii-input-array-is-sorted.md):white\_check\_mark:                   | [608](https://www.lintcode.com/problem/608/)                                                    |
| Reverse Words in a String           | [151](/algo/string/reverse-words-in-a-string.md):white\_check\_mark:                                | [53](https://www.lintcode.com/problem/53/)                                                      |
| Valid Anagram                       | [242](/algo/hash-table/valid-anagram.md):white\_check\_mark:                                        | [158](https://www.lintcode.com/problem/158/)                                                    |
| Contiguous Array                    | [525](/algo/hash-table/contiguous-array.md):white\_check\_mark:                                     | [994](https://www.lintcode.com/problem/994/)                                                    |
| Two Sum                             | [1](/algo/hash-table/two-sum.md):white\_check\_mark:                                                | [56](https://www.lintcode.com/problem/56/)                                                      |
| Merge Two Sorted Lists              | [21](https://leetcode.com/problems/merge-two-sorted-lists/)                                         | [165](/algo/linked-list/merge-two-sorted-lists.md):white\_check\_mark:                          |
| Reverse Linked List II              | [92](https://leetcode.com/problems/reverse-linked-list-ii/)                                         | [36](/algo/linked-list/reverse-linked-list-ii.md):white\_check\_mark:                           |
| LRU Cache                           | [146](https://leetcode.com/problems/lru-cache/)                                                     | [134](/algo/linked-list/lru-cache.md):white\_check\_mark:                                       |
| Validate Binary Search Tree         | [98](/algo/binary-tree/3.-binary-search-tree/validate-binary-search-tree.md):white\_check\_mark:    | [95](https://www.lintcode.com/problem/95/)                                                      |
| Trim a Binary Search Tree           | [699](https://leetcode.com/problems/trim-a-binary-search-tree/)                                     | [701](/algo/binary-tree/3.-binary-search-tree/trim-a-binary-search-tree.md):white\_check\_mark: |
| Implement Stack by Two Queues       | [225](https://leetcode.com/problems/implement-stack-using-queues/)                                  | [546](/algo/queue-and-stack/implement-stack-by-two-queues.md):white\_check\_mark:               |
| Implement Queue by Two Stacks       | [232](https://leetcode.com/problems/implement-queue-using-stacks/)                                  | [40](/algo/queue-and-stack/implement-queue-by-two-stacks.md):white\_check\_mark:                |


---

# Agent Instructions: Querying This Documentation

If you need additional information that is not directly available in this page, you can query the documentation dynamically by asking a question.

Perform an HTTP GET request on the current page URL with the `ask` query parameter:

```
GET https://blog.yushunchen.com/algo/leetcode-vs.-lintcode-table.md?ask=<question>
```

The question should be specific, self-contained, and written in natural language.
The response will contain a direct answer to the question and relevant excerpts and sources from the documentation.

Use this mechanism when the answer is not explicitly present in the current page, you need clarification or additional context, or you want to retrieve related documentation sections.