Chapter 1. Arrays and Strings

1.1 Unique Characters of a String

1.2 Reverse String

1.3 Permutation String

1.4 Replace Spaces

1.5 Compress String

1.6 Rotate Image

1.7 Set Matrix Zeroes

1.8 String Rotation

Chapter 2. Linked Lists

2.1 Remove Duplicates from Unsorted List

2.2 Kth to Last Element of Linked List

2.3 Delete Node in a Linked List

2.4 Partition List

2.5 Add Two Numbers

2.6 Linked List Cycle

2.7 Palindrome Linked List

Chapter 3. Stacks and Queues

3.1 Implement Three Stacks using Array

3.2 Min Stack

3.3 Set of Stacks

3.4 Towers of Hanoi

3.5 Implement Queue using Two Stacks

3.6 Sort Stack

3.7 Adopt Animal

Chapter 4. Trees and Graphs

4.1 Balanced Binary Tree

4.2 Route between Two Nodes in Directed Graph

4.3 Create Minimal Binary Search Tree

4.4 Create List at Each Depth of Binary Tree

4.5 Validate Binary Search Tree

4.6 Find Next Node in a BST

4.7 Lowest Common Ancestor of a Binary Search Tree

4.8 Contain Tree

4.9 All Paths Sum

Chapter 5. Bit Manipulation

5.1 Insert Bits

5.2 Binary Representation of Real Number

5.3 Next Binary Representation

5.4 Explain Expression ((n & (n-1)) == 0)

5.5 Number of Converted Bits

5.6 Swap Odd and Even Bits

5.7 Find Missing Integer

5.8 Draw Horizonatal Line

Chapter 6. Brain Teasers

6.1 Find Heavy Bottle

6.2 Dominos on Chess Board

6.3 Water Jug

6.4 Blue Eyes People on Island

6.5 Drop Eggs

6.6 Toggle Lockers

Chapter 7. Mathematics and Probability

7.1 Basketball Shooting Game

7.2 Ants on Polygon

7.3 Line Intersection

7.4 Implement Multiply Subtract and Divide

7.5 A Line Cut Two Squares in Half

7.6 The Line Passes the Most Number of Points

7.7 The Number with Only Prime Factors

Chapter 8 Object-Oriented Design

8.1 Implement Blackjack

8.2 Call Center

8.3 Musical Jukebox

8.4 Parking Lot

8.5 Online Book Reader System

8.6 Jigsaw Puzzle

8.7 Chat Server

8.8 Othello Game

8.9 An In-memory File System

8.10 Implement a Hash Table

Chapter 9. Recursion and Dynamic Programming

9.1 Climbing Staircase

9.2 Robot Moving

9.3 Magic Index

9.4 Subsets

9.5 Permutations

9.6 Generate Parentheses

9.7 Paint Fill

9.8 Represent N Cents

9.9 Eight Queens

9.10 Stack Boxes

9.11 Parenthesize the Expression

Chapter 10. Scalability and Memory Limits

10.1 Client-facing Service

10.2 Data Structures for Large Social Network

10.3 Integer not Contain in the File

10.4 Find All Duplicates Elements

10.5 Web Crawler

10.6 Find Duplicate URLs

10.7 Simplified Search Engine

Chapter 11. Sorting and Searching

11.1 Merge Arrays

11.2 Sort Anagrams Array

11.3 Search in Rotated Sorted Array

11.4 Sort the File

11.5 Search Array with Empty Strings

11.6 Search a 2D Matrix

11.7 Tower of People in Circus

11.8 The Rank of Number

Chapter 12. Testing

12.1 Find Mistakes

12.2 Find the Reason of Crash

12.3 Test Move Method in a Chess Game

12.4 Test a Webpage

12.5 Test a Pen

12.6 Test an ATM

Chapter 13. C and C++

13.1 Print Last K Lines

13.2 Compare Hash Table and STL Map

13.3 Virtual Functions

13.4 Depp Copy and Shallow Copy

13.5 Volatile Keyword

13.6 Virtual Destructor

13.7 Node Pointer

13.8 Smart Pointer

13.9 Aligned Malloc and Free Function

13.10 Allocate a 2D Array

Chapter 14. Java

14.1 Private Constructor

14.2 Try-catch-finally Java

14.3 Final Finally Finalize

14.4 Templates

14.5 Object Reflection

14.6 CircularArray

Chapter 15. Databases

15.1 Renting Apartment

15.2 Renting Apartment II

15.3 Renting Apartment III

15.4 Types of Join

15.5 Denormalization

15.6 Entity Relationship Diagram

15.7 Student Grade

Chapter 16 Threads and Locks

16.1 Thread and Process

16.2 Measure Time in a Context Switch

16.3 Dining Philosophers

16.4 A Lock Without Deadlocks

16.5 Semphore

16.6 Synchronized Method

Chapter 17 Moderate

17.1 Swap Number In Place

17.2 Tic Tac Toe

17.3 Factorial Trailing Zeros

17.4 Maximum of Two Numbers

17.5 Game of Master Mind

17.6 Sort Array

17.7 English Phrase Describe Integer

17.8 Contiguous Sequence with Largest Sum

17.9 Word Frequency in a Book

17.10 Encode XML

17.11 Rand7 and Rand5

17.12 Sum to Specific Value

17.13 BiNode

17.14 Unconcatenate Words

Chapter 18 Hard

18.1 Add Two Numbers

18.2 Shuffle Cards

18.3 Randomly Generate Integers

18.4 Count Number of Two

18.5 Shortest Distance between Two Words

18.6 Smallest One Million Numbers

18.7 Longest Word

18.8 Search String

18.9 Find and Maintain the Median Value

18.10 Word Transform

18.11 Maximum Subsquare

18.12 Largest Sum Submatrix

18.13 Largest Rectangle of Letters

CareerCup All in One 题目汇总的更多相关文章

  1. CareerCup All in One 题目汇总 (未完待续...)

    Chapter 1. Arrays and Strings 1.1 Unique Characters of a String 1.2 Reverse String 1.3 Permutation S ...

  2. leetcode - 位运算题目汇总(下）

    接上文leetcode - 位运算题目汇总(上),继续来切leetcode中Bit Manipulation下的题目. Bitwise AND of Numbers Range 给出一个范围,[m, ...

  3. 2016年Web前端面试题目汇总

    转载: 2016年Web前端面试题目汇总 以下是收集一些面试中经常会遇到的经典面试题以及自己面试过程中未解决的问题,通过对知识的整理以及经验的总结,重新巩固自身的前端基础知识,如有错误或更好的答案,欢 ...

  4. 前端面试题目汇总摘录（JS 基础篇）

    JS 基础 JavaScript 的 typeof 返回那些数据类型 object number function boolean undefined string typeof null; // o ...

  5. LeetCode 11月第2周题目汇总

    开源地址:点击该链接 前言 最近比较忙,这周几乎没有刷题,只刷了6道题~ 题目汇总 0387_first_unique_character_in_a_string类似的题目比较多了,字符串中找出特别的 ...

  6. All LeetCode Questions List 题目汇总

    All LeetCode Questions List(Part of Answers, still updating) 题目汇总及部分答案(持续更新中) Leetcode problems clas ...

  7. Python—经典练手题目汇总

    Python-经典练手题目汇总 # 1.有1020个西瓜,第一天卖掉总数的一半后又多卖出两个,以后每天卖剩下的一半多两# 个,问几天以后能卖完? day=0 xg=1020 for i in rang ...

  8. 剑指 Offer 题目汇总索引

    剑指 Offer 总目录:(共50道大题) 1. 赋值运算符函数(或应说复制拷贝函数问题) 2. 实现 Singleton 模式 (C#) 3.二维数组中的查找 4.替换空格              ...

  9. tarjan 题目汇总（含解析）

    下面容许我偷个懒,洛谷上写过的blog我就不来再抄一遍了 洛谷P3436 [[POI2006]PRO-Professor Szu](别称:作死的老教授) 洛谷P4306 [[JSOI2010]连通数] ...

随机推荐

  1. Accounting Calendar template

    SELECT INITCAP (TO_CHAR (TO_DATE (&year || '-' || LPAD (ROWNUM, 2, '0'), 'yyyy-mm'), 'MON', 'NLS ...

  2. Java全栈程序员之09：IDEA+GitHub

    GitHub是源码托管站点,其依赖于Git这个源码管理工具来进行代码的托管.所以将我们的代码托管到GitHub之前,我们需要安装Git. 1.Git安装 可以通过输入git命令来确定是否在本机已经安装 ...

  3. echarts中tooltip提示框位置控制

    关键代码: position: function(point, params, dom, rect, size) { //其中point为当前鼠标的位置,size中有两个属性:viewSize和con ...

  4. 设置mysql 事务锁超时时间 innodb_lock_wait_timeout

    Mysql数据库采用InnoDB模式,默认参数:innodb_lock_wait_timeout设置锁等待的时间是50s,一旦数据库锁超过这个时间就会报错. mysql> SHOW GLOBAL ...

  5. html学习笔记之2——多媒体

    一:插件 插件可以通过 <object> 标签或者 <embed> 标签添加在页面中. <object width="400" height=&quo ...

  6. 【C++】C++中const与constexpr的比较

    先说结论相同点:const和consexpr都是用来定义常量的.不同点:const声明的常量,初始值引用的对象不一定是一个常量:constexpr声明的常量,初始值一定是常量表达式. constexp ...

  7. 自然语言处理中的N-Gram模型

    N-Gram(有时也称为N元模型)是自然语言处理中一个非常重要的概念,通常在NLP中,人们基于一定的语料库,可以利用N-Gram来预计或者评估一个句子是否合理.另外一方面,N-Gram的另外一个作用是 ...

  8. Effective Java 第三版——76. 争取保持失败原子性

    Tips 书中的源代码地址:https://github.com/jbloch/effective-java-3e-source-code 注意,书中的有些代码里方法是基于Java 9 API中的,所 ...

  9. csproj文件中copy指令的使用方式

    实际开发中有很多项目需要引用第三方的dll或者资源文件,且文件比较多,在运行时这些文件需要被拷贝到BIN目录. 使用VS自带的"复制到输出目录",似然方便,但是比较不零活,经过多次 ...

  10. [ci]容器ci索引

    伙计们: 有任何意见或建议或看不懂的请在对应的文章下留言(请注明上下文) 我会及时改动. 这是以前的一些在物理机上搞过 [ci]容器ci索引 http://www.cnblogs.com/iiiihe ...