https://github.com/ysh329/sword-x-offer
66 classic and common interview problems from 《剑指offer》 with multiple-method-CPP solutions, and common data structure summary, etc
https://github.com/ysh329/sword-x-offer
algorithm cpp data-structure interview-questions onsite-interview
Last synced: 19 days ago
JSON representation
66 classic and common interview problems from 《剑指offer》 with multiple-method-CPP solutions, and common data structure summary, etc
- Host: GitHub
- URL: https://github.com/ysh329/sword-x-offer
- Owner: ysh329
- Created: 2018-04-23T12:18:49.000Z (about 7 years ago)
- Default Branch: master
- Last Pushed: 2021-03-10T06:19:16.000Z (about 4 years ago)
- Last Synced: 2025-05-05T21:16:05.316Z (19 days ago)
- Topics: algorithm, cpp, data-structure, interview-questions, onsite-interview
- Homepage:
- Size: 1.33 MB
- Stars: 20
- Watchers: 3
- Forks: 3
- Open Issues: 4
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
真正的希望必定存在于甘心赴死的绝望中
# sword-x-offer
sword-x-offer not only contains 66 common && classic interview programming problems but also others like common data structure summary based in language CPP etc. Particularly, each problem has multiple solutions.
## Content
1. [Problem Set](#1)
1.1 [Ordered List](#1.1)
1.2 [Topic List](#1.2)
1.2.1 binary-search
1.2.2 linked-list
1.2.3 binary-tree
1.2.4 dynamic programming
2. [Data Structure(TODO)](#2)
2.1 binary-search
2.2 linked-list
2.3 string
2.4 tree
2.5 sort
2.6 graph
3. [Language CPP(TODO)](#3)
3.1 Style: Google C++ Style Guide
3.2 Common C/C++ questions
3.3 gcc five minute
3.4 basic cpp language
3.5 system design
3.6 [Deep Learning questions](https://github.com/Ewenwan/MVision)
4. [Project Based Learning](./project-based-learning/)
5. [License](#5)
6. [Acknowledge](#6)
1.Problem Set
1.1 Ordered List
| id | problem | topic | difficulty | OJ link | similarity |
|:---:|:--------------------------------|:----------:|:---------------|:-----------:|:-------------------------|
| 01 | [find-value-in-matrix][problem01] |binary-search | ★★★ | [nowcoder][nowcoder01] | |
| 02 | [replace-space][problem02] |string | ★★★ |[nowcoder][nowcoder02] | |
| 03 | [print-linked-list-from-tail][problem03] |linked-list | ★★★ | [nowcoder][nowcoder03] | |
| 04 | [reconstruct-binary-tree][problem04] |tree | ★★★★ | [nowcoder][nowcoder04] | |
| 05 | [stack-operation-based-two-queues][problem05] |queue | ★★ | [nowcoder][nowcoder05] | |
| 06 | [min-num-in-reverse-array][problem06] |array | ★★ | [nowcoder][nowcoder06] | |
| 07 | [fibonacci-sequence][problem07] |loop/recursion,dp | ★★ | [nowcoder][nowcoder07] | |
| 08 | [jump-floor][problem08] |loop/recursion,dp | ★★ | [nowcoder][nowcoder08] | |
| 09 | [jump-floor-II][problem09] |loop/recursion| ★★ | [nowcoder][nowcoder09] | |
| 10 | [rectangle-cover][problem10] |loop/recursion| ★★★ | [nowcoder][nowcoder10] | |
| 11 | [number-of-one-in-binary][problem11] |bit-manipulation |★★★ | [nowcoder][nowcoder11] | |
| 12 | [integer-power-of-number][problem12] | |★★★ | [nowcoder][nowcoder12] | |
| 13 | [reorder-array-as-odd-number-is-in-the-front][problem13] |array |★★★| [nowcoder][nowcoder13] | |
| 14 | [countdown-k-node-in-linked-list][problem14] |linked-list |★★ | [nowcoder][nowcoder14] | |
| 15 | [reverse-linked-list][problem15] |linked-list |★★★ | [nowcoder][nowcoder15] | |
| 16 | [merge-two-sorted-linked-list][problem16] |linked-list |★★★ | [nowcoder][nowcoder16] | |
| 17 | [judge-the-substructure-of-a-binary-tree][problem17] |tree |★★★★ | [nowcoder][nowcoder17] | |
| 18 | [mirror-of-binary-tree][problem18] |tree | ★★★★ | [nowcoder][nowcoder18] | |
| 19 | [print-matrix-clockwise][problem19] |array |★★★★ | [nowcoder][nowcoder19] | |
| 20 | [stack-contain-min-func][problem20] |stack |★★★ | [nowcoder][nowcoder20] | |
| 21 | [push-and-pop-sequence-of-stack][problem21] |stack |★★★★ | [nowcoder][nowcoder21] | |
| 22 | [print-binary-tree-from-top-to-bottom][problem22] |tree |★★★ | [nowcoder][nowcoder22] | |
| 23 | [postorder-traversal-of-binary-search-tree][problem23] |tree |★★★★ | [nowcoder][nowcoder23] | |
| 24 | [target-length-path-of-binary-tree][problem24] |tree |★★★★ | [nowcoder][nowcoder24] | |
| 25 | [replication-of-complex-linked-list][problem25] |linked-list |★★★★ | [nowcoder][nowcoder25] | |
| 26 | [convert-binary-search-tree-to-bi-directional-linked-list][problem26] |tree,linked-list|★★★★ | [nowcoder][nowcoder26] | |
| 27 | [string-permutation][problem27] |string,math |★★★★ | [nowcoder][nowcoder27] | |
| 28 | [the-number-occurs-more-than-half][problem28] |array | ★★★ | [nowcoder][nowcoder28] | |
| 29 | [k-minimum-number][problem29] |array,heap |★★★★ | [nowcoder][nowcoder29] | |
| 30 | [the-largest-sum-of-consecutive-subarrays][problem30] |greedy,dp | ★★★★ | [nowcoder][nowcoder30] | |
| 31 | [number-of-1-between-1-and-n][problem31] |math | ★★★★ | [nowcoder][nowcoder31] | |
| 32 | [arrange-the-array-into-the-smallest-number][problem32] | |★★★ | [nowcoder][nowcoder32] | |
| 33 | [ugly-number][problem33] |math |★★| [nowcoder][nowcoder33] | |
| 34 | [first-character-that-appears-only-once][problem34] |array,hash-table |★★| [nowcoder][nowcoder34] | |
| 35 | [inverse-pairs-in-array][problem35] |array,math |★★★★★| [nowcoder][nowcoder35] | |
| 36 | [find-first-common-node-in-two-linked-lists][problem36] |linked-list |★★★ | [nowcoder][nowcoder36] | |
| 37 | [number-of-occurrences-in-the-sorted-array][problem37] |array,hash-table | ★★ | [nowcoder][nowcoder37] | |
| 38 | [depth-of-binary-tree][problem38] |tree | ★★ | [nowcoder][nowcoder38] | |
| 39 | [judge-balanced-binary-tree][problem39] |tree |★★★★ | [nowcoder][nowcoder39] | |
| 40 | [find-num-appear-once-in-array][problem40] |array,hash-table |★★★★ |[nowcoder][nowcoder40] | |
| 41 | [sum-s-of-continuous-positive-sequence][problem41] | |★★ | [nowcoder][nowcoder41] | |
| 42 | [two-sum][problem42] | | ★★ | [nowcoder][nowcoder42] | |
| 43 | [left-rotate-string][problem43] |string | ★★★ | [nowcoder][nowcoder43] | |
| 44 | [reverse-words-in-sentence][problem44] |string |★★★★ | [nowcoder][nowcoder44] | |
| 45 | [is-poker-continuous][problem45] | |★★★ | [nowcoder][nowcoder45] | |
| 46 | [the-last-number-in-the-circle][problem46] |math |★★★★ | [nowcoder][nowcoder46] | |
| 47 | [sum-from-1-to-n][problem47] | |★★ | [nowcoder][nowcoder47] | |
| 48 | [sum-of-two-numbers][problem48] |bit-manipulation|★★★ | [nowcoder][nowcoder48] | |
| 49 | [str-to-int][problem49] |string,array |★★★★ | [nowcoder][nowcoder49] | |
| 50 | [duplicate-number-in-array][problem50] |array,hash-table |★★★ | [nowcoder][nowcoder50] | |
| 51 | [construct-multiply-triangle][problem51] |array |★★ | [nowcoder][nowcoder51] | |
| 52 | [regular-expression-match][problem52] |string |★★★★ | [nowcoder][nowcoder52] | |
| 53 | [numeric-string][problem53] |string |★★★★ | [nowcoder][nowcoder53] | |
| 54 | [first-appearing-once-in-str-stream][problem54] |string |★★ | [nowcoder][nowcoder54] | |
| 55 | [entry-of-loop-linked-list][problem55] |linked-list |★★★ | [nowcoder][nowcoder55] | |
| 56 | [delete-duplication-in-linked-list][problem56] |linked-list |★★★★ | [nowcoder][nowcoder56] | |
| 57 | [next-node-of-binary-tree][problem57] |tree |★★★★ | [nowcoder][nowcoder57] | |
| 58 | [is-symmetrical-binary-tree][problem58] |tree |★★★ | [nowcoder][nowcoder58] | |
| 59 | [print-binary-tree-layer-by-layer][problem59] |tree |★★★ | [nowcoder][nowcoder59] | |
| 60 | [print-binary-tree-layer-by-layer-II][problem60] |tree |★★★ | [nowcoder][nowcoder60] | |
| 61 | [serialize-binary-tree][problem61] |tree |★★★★ |[nowcoder][nowcoder61] | |
| 62 | [kth-node-of-binary-search-tree][problem62] |tree | ★★★★ |[nowcoder][nowcoder62] | |
| 63 | [get-median-of-num-stream][problem63] |tree |★★★ |[nowcoder][nowcoder63] | |
| 64 | [max-in-sliding-window][problem64] |stack/queue |★★★ | [nowcoder][nowcoder64] | |
| 65 | [path-in-matrix][problem65] |backtracking |★★★★| [nowcoder][nowcoder65] | |
| 66 | [range-of-robot][problem66] |backtracking |★★★★| [nowcoder][nowcoder66] | |
1.2 Topic List
#### Binary Search
- [01-find-value-in-matrix][problem01]
#### Linked List
- [03-print-linked-list-from-tail][problem03]
- [14-countdown-k-node-in-linked-list][problem14]
- [15-reverse-linked-list][problem15]
- [16-merge-two-sorted-linked-list][problem16]
- [25-replication-of-complex-linked-list][problem25]
- [26-convert-binary-search-tree-to-bi-directional-linked-list][problem26]
- [36-find-first-common-node-in-two-linked-lists][problem36]
- [55-entry-of-loop-linked-list][problem55]
- [56-delete-duplication-in-linked-list][problem56]
#### Binary Tree
- [04-reconstruct-binary-tree][problem04]
- [17-judge-the-substructure-of-a-binary-tree][problem17]
- [18-mirror-of-binary-tree][problem18]
- [22-print-binary-tree-from-top-to-bottom][problem22]
- [23-postorder-traversal-of-binary-search-tree][problem23]
- [24-target-length-path-of-binary-tree][problem24]
- [26-convert-binary-search-tree-to-bi-directional-linked-list][problem26]
- [38-depth-of-binary-tree][problem38]
- [39-judge-balanced-binary-tree][problem39]
- [57-next-node-of-binary-tree][problem57]
- [58-is-symmetrical-binary-tree][problem58]
- [59-print-binary-tree-layer-by-layer][problem59]
- [60-print-binary-tree-layer-by-layer-II][problem60]
- [61-serialize-binary-tree][problem61]
- [62-kth-node-of-binary-search-tree][problem62]
- [63-get-median-of-num-stream][problem63]
#### Dynamic Programming
- [07-fibonacci-sequence][problem07]
- [30-the-largest-sum-of-consecutive-subarrays][problem07]
- [51-construct-multiply-triangle][problem51]
- [52-regular-expression-match][problem52]
2.Data Structure
- [binary-search](./data-structure/binary-search.md)
- [linked-list](./data-structure/linked-list.md)
- [string](./data-structure/string.md)
- [tree](./data-structure/tree.md)
- [sort](./data-structure/sort.md)
- [graph](./data-structure/graph.md)
3.Language CPP
- Style: [Google C++ Style Guide](http://google.github.io/styleguide/cppguide.html)
- [Common C/C++ questions-I](./lang-cpp/common-questions-I.md)
- [Common C/C++ questions-II](./lang-cpp/common-questions-II.md)
- [lexdene/gcc_five_minute: gcc五分钟系列](https://github.com/lexdene/gcc_five_minute)
- basic cpp language: [lang-cpp](./lang-cpp)
- [soulmachine/system-design: 系统设计面试题精选](https://github.com/soulmachine/system-design)
- [donnemartin/system-design-primer](https://github.com/donnemartin/system-design-primer)
5.License
Apache License 2.0.
6.Acknowledgement
Solutions in sword-x-offer are mainly from the forum of [nowcoder](https://www.nowcoder.com) and book [《剑指offer》](https://www.amazon.cn/dp/B00FF1Y0FU). Particularly, I learned a lot from the forum of nowcoder.
Project-based-learning is from [this repo.](https://github.com/tuvtran/project-based-learning), which is under MIT License.
## Judge Script
```shell
#!bin/bash
while true;
do
./data
./std
./test
if diff std.out test.out;then
echo AC
else
echo WA
exit 0
fi
done
```
[problem01]: ./sword-x-offer/01-find-value-in-matrix "二维数组中的查找 "
[problem02]: ./sword-x-offer/02-replace-space "替换空格 "
[problem03]: ./sword-x-offer/03-print-linked-list-from-tail "从尾到头打印链表 "
[problem04]: ./sword-x-offer/04-reconstruct-binary-tree "重建二叉树 "
[problem05]: ./sword-x-offer/05-stack-operation-based-two-queues "用两个栈实现队列 "
[problem06]: ./sword-x-offer/06-min-num-in-reverse-array "旋转数组的最小数字 "
[problem07]: ./sword-x-offer/07-fibonacci-sequence "斐波那契数列 "
[problem08]: ./sword-x-offer/08-jump-floor "跳台阶 "
[problem09]: ./sword-x-offer/09-jump-floor-II "变态跳台阶 "
[problem10]: ./sword-x-offer/10-rectangle-cover "矩形覆盖 "
[problem11]: ./sword-x-offer/11-number-of-one-in-binary "二进制中1的个数 "
[problem12]: ./sword-x-offer/12-integer-power-of-number "数值的整数次方 "
[problem13]: ./sword-x-offer/13-reorder-array-as-odd-number-is-in-the-front "调整数组顺序使奇数位于偶数前面 "
[problem14]: ./sword-x-offer/14-countdown-k-node-in-linked-list "链表中倒数第k个结点 "
[problem15]: ./sword-x-offer/15-reverse-linked-list "反转链表 "
[problem16]: ./sword-x-offer/16-merge-two-sorted-linked-list "合并两个排序的链表 "
[problem17]: ./sword-x-offer/17-judge-the-substructure-of-a-binary-tree "树的子结构 "
[problem18]: ./sword-x-offer/18-mirror-of-binary-tree "二叉树的镜像 "
[problem19]: ./sword-x-offer/19-print-matrix-clockwise "顺时针打印矩阵 "
[problem20]: ./sword-x-offer/20-stack-contain-min-func "包含min函数的栈 "
[problem21]: ./sword-x-offer/21-push-and-pop-sequence-of-stack "栈的压入、弹出序列 "
[problem22]: ./sword-x-offer/22-print-binary-tree-from-top-to-bottom "从上往下打印二叉树 "
[problem23]: ./sword-x-offer/23-postorder-traversal-of-binary-search-tree "二叉搜索树的后序遍历序列 "
[problem24]: ./sword-x-offer/24-target-length-path-of-binary-tree "二叉树中和为某一值的路径 "
[problem25]: ./sword-x-offer/25-replication-of-complex-linked-list "复杂链表的复制 "
[problem26]: ./sword-x-offer/26-convert-binary-search-tree-to-bi-directional-linked-list "二叉搜索树与双向链表 "
[problem27]: ./sword-x-offer/27-string-permutation "字符串的排列 "
[problem28]: ./sword-x-offer/28-the-number-occurs-more-than-half "数组中出现次数超过一半的数字 "
[problem29]: ./sword-x-offer/29-k-minimum-number "最小的K个数 "
[problem30]: ./sword-x-offer/30-the-largest-sum-of-consecutive-subarrays "连续子数组的最大和 "
[problem31]: ./sword-x-offer/31-number-of-1-between-1-and-n "整数中1出现的次数（从1到n整数中1出现的次数） "
[problem32]: ./sword-x-offer/32-arrange-the-array-into-the-smallest-number "把数组排成最小的数 "
[problem33]: ./sword-x-offer/33-ugly-number "丑数 "
[problem34]: ./sword-x-offer/34-the-first-character-that-appears-only-once "第一个只出现一次的字符位置 "
[problem35]: ./sword-x-offer/35-inverse-pairs-in-array "数组中的逆序对 "
[problem36]: ./sword-x-offer/36-find-first-common-node-in-two-linked-lists "两个链表的第一个公共结点 "
[problem37]: ./sword-x-offer/37-the-number-of-occurrences-in-the-sorted-array "数字在排序数组中出现的次数 "
[problem38]: ./sword-x-offer/38-the-depth-of-binary-tree "二叉树的深度 "
[problem39]: ./sword-x-offer/39-judge-balanced-binary-tree "平衡二叉树 "
[problem40]: ./sword-x-offer/40-find-num-appear-once-in-array "数组中只出现一次的数字 "
[problem41]: ./sword-x-offer/41-sum-s-of-continuous-positive-sequence "和为S的连续正数序列 "
[problem42]: ./sword-x-offer/42-two-sum "和为S的两个数字 "
[problem43]: ./sword-x-offer/43-left-rotate-string "左旋转字符串 "
[problem44]: ./sword-x-offer/44-reverse-words-in-sentence "翻转单词顺序列 "
[problem45]: ./sword-x-offer/45-is-poker-continuous "扑克牌顺子 "
[problem46]: ./sword-x-offer/46-the-last-number-in-the-circle "孩子们的游戏(圆圈中最后剩下的数) "
[problem47]: ./sword-x-offer/47-sum-from-1-to-n "求1+2+3+...+n "
[problem48]: ./sword-x-offer/48-sum-of-two-numbers "不用加减乘除做加法 "
[problem49]: ./sword-x-offer/49-str-to-int "把字符串转换成整数 "
[problem50]: ./sword-x-offer/50-duplicate-number-in-array "数组中重复的数字 "
[problem51]: ./sword-x-offer/51-construct-multiply-triangle "构建乘积数组 "
[problem52]: ./sword-x-offer/52-regular-expression-match "正则表达式匹配 "
[problem53]: ./sword-x-offer/53-numeric-string "表示数值的字符串 "
[problem54]: ./sword-x-offer/54-first-appearing-once-in-str-stream "字符流中第一个不重复的字符 "
[problem55]: ./sword-x-offer/55-entry-of-loop-linked-list "链表中环的入口结点 "
[problem56]: ./sword-x-offer/56-delete-duplication-in-linked-list "删除链表中重复的结点 "
[problem57]: ./sword-x-offer/57-next-node-of-binary-tree "二叉树的下一个结点 "
[problem58]: ./sword-x-offer/58-is-symmetrical-binary-tree "对称的二叉树 "
[problem59]: ./sword-x-offer/59-print-binary-tree-layer-by-layer "按之字形顺序打印二叉树 "
[problem60]: ./sword-x-offer/60-print-binary-tree-layer-by-layer-II "把二叉树打印成多行 "
[problem61]: ./sword-x-offer/61-serialize-binary-tree "序列化二叉树 "
[problem62]: ./sword-x-offer/62-kth-node-of-binary-search-tree "二叉搜索树的第k个结点 "
[problem63]: ./sword-x-offer/63-get-median-of-num-stream "数据流中的中位数 "
[problem64]: ./sword-x-offer/64-max-in-sliding-window "滑动窗口的最大值 "
[problem65]: ./sword-x-offer/65-path-in-matrix "矩阵中的路径 "
[problem66]: ./sword-x-offer/66-range-of-robot "机器人的运动范围 "
[nowcoder01]: https://www.nowcoder.com/practice/abc3fe2ce8e146608e868a70efebf62e?tpId=13&tqId=11154&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking
[nowcoder02]: https://www.nowcoder.com/practice/4060ac7e3e404ad1a894ef3e17650423?tpId=13&tqId=11155&tPage=1&rp=1&ru=%2Fta%2Fcoding-interviews&qru=%2Fta%2Fcoding-interviews%2Fquestion-ranking
[nowcoder03]: https://www.nowcoder.com/practice/d0267f7f55b3412ba93bd35cfa8e8035?tpId=13&tqId=11156&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking
[nowcoder04]: https://www.nowcoder.com/practice/8a19cbe657394eeaac2f6ea9b0f6fcf6?tpId=13&tqId=11157&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking
[nowcoder05]: https://www.nowcoder.com/practice/54275ddae22f475981afa2244dd448c6?tpId=13&tqId=11158&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking
[nowcoder06]: https://www.nowcoder.com/practice/9f3231a991af4f55b95579b44b7a01ba?tpId=13&tqId=11159&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking
[nowcoder07]: https://www.nowcoder.com/practice/c6c7742f5ba7442aada113136ddea0c3?tpId=13&tqId=11160&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking
[nowcoder08]: https://www.nowcoder.com/practice/8c82a5b80378478f9484d87d1c5f12a4?tpId=13&tqId=11161&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking
[nowcoder09]: https://www.nowcoder.com/practice/22243d016f6b47f2a6928b4313c85387?tpId=13&tqId=11162&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking
[nowcoder10]: https://www.nowcoder.com/practice/72a5a919508a4251859fb2cfb987a0e6?tpId=13&tqId=11163&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking
[nowcoder11]: https://www.nowcoder.com/practice/8ee967e43c2c4ec193b040ea7fbb10b8?tpId=13&tqId=11164&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking
[nowcoder12]: https://www.nowcoder.com/practice/1a834e5e3e1a4b7ba251417554e07c00?tpId=13&tqId=11165&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking
[nowcoder13]: https://www.nowcoder.com/practice/beb5aa231adc45b2a5dcc5b62c93f593?tpId=13&tqId=11166&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking
[nowcoder14]: https://www.nowcoder.com/practice/529d3ae5a407492994ad2a246518148a?tpId=13&tqId=11167&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking
[nowcoder15]: https://www.nowcoder.com/practice/75e878df47f24fdc9dc3e400ec6058ca?tpId=13&tqId=11168&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking
[nowcoder16]: https://www.nowcoder.com/practice/d8b6b4358f774294a89de2a6ac4d9337?tpId=13&tqId=11169&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking
[nowcoder17]: https://www.nowcoder.com/practice/6e196c44c7004d15b1610b9afca8bd88?tpId=13&tqId=11170&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking
[nowcoder18]: https://www.nowcoder.com/practice/564f4c26aa584921bc75623e48ca3011?tpId=13&tqId=11171&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking
[nowcoder19]: https://www.nowcoder.com/practice/9b4c81a02cd34f76be2659fa0d54342a?tpId=13&tqId=11172&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking
[nowcoder20]: https://www.nowcoder.com/practice/4c776177d2c04c2494f2555c9fcc1e49?tpId=13&tqId=11173&tPage=1&rp=1&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking
[nowcoder21]: https://www.nowcoder.com/practice/d77d11405cc7470d82554cb392585106?tpId=13&tqId=11174&tPage=2&rp=2&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking
[nowcoder22]: https://www.nowcoder.com/practice/7fe2212963db4790b57431d9ed259701?tpId=13&tqId=11175&tPage=2&rp=2&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking
[nowcoder23]: https://www.nowcoder.com/practice/a861533d45854474ac791d90e447bafd?tpId=13&tqId=11176&tPage=2&rp=2&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking
[nowcoder24]: https://www.nowcoder.com/practice/b736e784e3e34731af99065031301bca?tpId=13&tqId=11177&tPage=2&rp=2&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking
[nowcoder25]: https://www.nowcoder.com/practice/f836b2c43afc4b35ad6adc41ec941dba?tpId=13&tqId=11178&tPage=2&rp=2&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking
[nowcoder26]: https://www.nowcoder.com/practice/947f6eb80d944a84850b0538bf0ec3a5?tpId=13&tqId=11179&tPage=2&rp=2&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking
[nowcoder27]: https://www.nowcoder.com/practice/fe6b651b66ae47d7acce78ffdd9a96c7?tpId=13&tqId=11180&tPage=2&rp=2&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking
[nowcoder28]: https://www.nowcoder.com/practice/e8a1b01a2df14cb2b228b30ee6a92163?tpId=13&tqId=11181&tPage=2&rp=2&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking
[nowcoder29]: https://www.nowcoder.com/practice/6a296eb82cf844ca8539b57c23e6e9bf?tpId=13&tqId=11182&tPage=2&rp=2&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking
[nowcoder30]: https://www.nowcoder.com/practice/459bd355da1549fa8a49e350bf3df484?tpId=13&tqId=11183&tPage=2&rp=2&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking
[nowcoder31]: https://www.nowcoder.com/practice/bd7f978302044eee894445e244c7eee6?tpId=13&tqId=11184&tPage=2&rp=2&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking
[nowcoder32]: https://www.nowcoder.com/practice/8fecd3f8ba334add803bf2a06af1b993?tpId=13&tqId=11185&tPage=2&rp=2&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking
[nowcoder33]: https://www.nowcoder.com/practice/6aa9e04fc3794f68acf8778237ba065b?tpId=13&tqId=11186&tPage=2&rp=2&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking
[nowcoder34]: https://www.nowcoder.com/practice/1c82e8cf713b4bbeb2a5b31cf5b0417c?tpId=13&tqId=11187&tPage=2&rp=2&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking
[nowcoder35]: https://www.nowcoder.com/practice/96bd6684e04a44eb80e6a68efc0ec6c5?tpId=13&tqId=11188&tPage=2&rp=2&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking
[nowcoder36]: https://www.nowcoder.com/practice/6ab1d9a29e88450685099d45c9e31e46?tpId=13&tqId=11189&tPage=2&rp=2&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking
[nowcoder37]: https://www.nowcoder.com/practice/70610bf967994b22bb1c26f9ae901fa2?tpId=13&tqId=11190&tPage=2&rp=2&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking
[nowcoder38]: https://www.nowcoder.com/practice/435fb86331474282a3499955f0a41e8b?tpId=13&tqId=11191&tPage=2&rp=2&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking
[nowcoder39]: https://www.nowcoder.com/practice/8b3b95850edb4115918ecebdf1b4d222?tpId=13&tqId=11192&tPage=2&rp=2&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking
[nowcoder40]: https://www.nowcoder.com/practice/e02fdb54d7524710a7d664d082bb7811?tpId=13&tqId=11193&tPage=2&rp=2&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking
[nowcoder41]: https://www.nowcoder.com/practice/c451a3fd84b64cb19485dad758a55ebe?tpId=13&tqId=11194&tPage=3&rp=3&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking
[nowcoder42]: https://www.nowcoder.com/practice/390da4f7a00f44bea7c2f3d19491311b?tpId=13&tqId=11195&tPage=3&rp=3&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking
[nowcoder43]: https://www.nowcoder.com/practice/12d959b108cb42b1ab72cef4d36af5ec?tpId=13&tqId=11196&tPage=3&rp=3&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking
[nowcoder44]: https://www.nowcoder.com/practice/3194a4f4cf814f63919d0790578d51f3?tpId=13&tqId=11197&tPage=3&rp=3&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking
[nowcoder45]: https://www.nowcoder.com/practice/762836f4d43d43ca9deb273b3de8e1f4?tpId=13&tqId=11198&tPage=3&rp=3&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking
[nowcoder46]: https://www.nowcoder.com/practice/f78a359491e64a50bce2d89cff857eb6?tpId=13&tqId=11199&tPage=3&rp=3&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking
[nowcoder47]: https://www.nowcoder.com/practice/7a0da8fc483247ff8800059e12d7caf1?tpId=13&tqId=11200&tPage=3&rp=3&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking
[nowcoder48]: https://www.nowcoder.com/practice/59ac416b4b944300b617d4f7f111b215?tpId=13&tqId=11201&tPage=3&rp=3&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking
[nowcoder49]: https://www.nowcoder.com/practice/1277c681251b4372bdef344468e4f26e?tpId=13&tqId=11202&tPage=3&rp=3&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking
[nowcoder50]: https://www.nowcoder.com/practice/623a5ac0ea5b4e5f95552655361ae0a8?tpId=13&tqId=11203&tPage=3&rp=3&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking
[nowcoder51]: https://www.nowcoder.com/practice/94a4d381a68b47b7a8bed86f2975db46?tpId=13&tqId=11204&tPage=3&rp=3&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking
[nowcoder52]: https://www.nowcoder.com/practice/45327ae22b7b413ea21df13ee7d6429c?tpId=13&tqId=11205&tPage=3&rp=3&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking
[nowcoder53]: https://www.nowcoder.com/practice/6f8c901d091949a5837e24bb82a731f2?tpId=13&tqId=11206&tPage=3&rp=3&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking
[nowcoder54]: https://www.nowcoder.com/practice/00de97733b8e4f97a3fb5c680ee10720?tpId=13&tqId=11207&tPage=3&rp=3&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking
[nowcoder55]: https://www.nowcoder.com/practice/253d2c59ec3e4bc68da16833f79a38e4?tpId=13&tqId=11208&tPage=3&rp=3&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking
[nowcoder56]: https://www.nowcoder.com/practice/fc533c45b73a41b0b44ccba763f866ef?tpId=13&tqId=11209&tPage=3&rp=3&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking
[nowcoder57]: https://www.nowcoder.com/practice/9023a0c988684a53960365b889ceaf5e?tpId=13&tqId=11210&tPage=3&rp=3&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking
[nowcoder58]: https://www.nowcoder.com/practice/ff05d44dfdb04e1d83bdbdab320efbcb?tpId=13&tqId=11211&tPage=3&rp=3&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking
[nowcoder59]: https://www.nowcoder.com/practice/91b69814117f4e8097390d107d2efbe0?tpId=13&tqId=11212&tPage=3&rp=3&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking
[nowcoder60]: https://www.nowcoder.com/practice/445c44d982d04483b04a54f298796288?tpId=13&tqId=11213&tPage=3&rp=3&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking
[nowcoder61]: https://www.nowcoder.com/practice/cf7e25aa97c04cc1a68c8f040e71fb84?tpId=13&tqId=11214&tPage=4&rp=4&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking
[nowcoder62]: https://www.nowcoder.com/practice/ef068f602dde4d28aab2b210e859150a?tpId=13&tqId=11215&tPage=4&rp=4&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking
[nowcoder63]: https://www.nowcoder.com/practice/9be0172896bd43948f8a32fb954e1be1?tpId=13&tqId=11216&tPage=4&rp=4&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking
[nowcoder64]: https://www.nowcoder.com/practice/1624bc35a45c42c0bc17d17fa0cba788?tpId=13&tqId=11217&tPage=4&rp=4&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking
[nowcoder65]: https://www.nowcoder.com/practice/c61c6999eecb4b8f88a98f66b273a3cc?tpId=13&tqId=11218&tPage=4&rp=4&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking
[nowcoder66]: https://www.nowcoder.com/practice/6e5207314b5241fb83f2329e89fdecc8?tpId=13&tqId=11219&tPage=4&rp=4&ru=/ta/coding-interviews&qru=/ta/coding-interviews/question-ranking