CareerCup All in One 题目汇总

简介:

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

本文转自博客园Grandyang的博客,原文链接:题目汇总CareerCup All in One ,如需转载请自行联系原博主。

相关文章
|
SpringCloudAlibaba 网络协议 Cloud Native
Spring Cloud Alibaba-全面详解(学习总结---从入门到深化)
Spring Cloud Alibaba致力于提供微服务开发的一站式解决方案。
16044 3
Spring Cloud Alibaba-全面详解(学习总结---从入门到深化)
|
SQL Prometheus 监控
数据库连接池选型 Druid vs HikariCP
springboot 现在官方默认的数据库连接池是 HikariCP,HikariCP的性能从测试的数据上来看也是最高的。
数据库连接池选型 Druid vs HikariCP
|
消息中间件 SQL 存储
超详细的RabbitMQ入门,看这篇就够了!
RabbitMQ入门,看这篇就够了
220083 69
|
11月前
|
Linux iOS开发 MacOS
deepseek部署的详细步骤和方法,基于Ollama获取顶级推理能力!
DeepSeek基于Ollama部署教程,助你免费获取顶级推理能力。首先访问ollama.com下载并安装适用于macOS、Linux或Windows的Ollama版本。运行Ollama后,在官网搜索“deepseek”,选择适合你电脑配置的模型大小(如1.5b、7b等)。通过终端命令(如ollama run deepseek-r1:1.5b)启动模型,等待下载完成即可开始使用。退出模型时输入/bye。详细步骤如下图所示,轻松打造你的最强大脑。
14769 86
|
数据采集 人工智能 运维
《文档智能 & RAG让AI大模型更懂业务》解决方案体验评测
【10月更文挑战第11天】随着人工智能技术的不断进步,AI在各个领域的应用也愈发广泛。近期,我有幸接触并部署了《文档智能 & RAG让AI大模型更懂业务》这一创新性解决方案。该方案旨在通过结合文档智能处理和检索增强生成(Retrieval-Augmented Generation, RAG)技术来提升AI大模型对特定业务知识的理解能力。接下来,我将从多个角度分享我的体验与思考。
300 2
|
安全 文件存储 iOS开发
告别痕迹:远程桌面连接历史和凭据的清零指南
【8月更文挑战第18天】使用远程桌面后,为保障安全隐私,需清除连接历史及凭据。在Windows中,可通过注册表编辑器删除HKEY_CURRENT_USER\Software\Microsoft\Terminal Server Client\Default下的MRU键值来清除历史记录;macOS下则需移步至“~/Library/Application Support/Apple/Remote Desktop”删除“Clients.plist”。清除凭据方面,Windows用户应访问“控制面板”中的“凭据管理器”删除相应条目;macOS用户需利用“钥匙串访问”应用找出并移除相关条目。
3944 3
|
数据可视化 算法
Simulink-Simscape仿真环境配置
Simulink-Simscape仿真环境配置
437 1
|
前端开发 JavaScript 开发者
超实用开源前端商城模板,助力电商项目飞速启航!免费直接可用!
分享一款精心设计的开源前端商城模板,涵盖商品展示、购物车、订单处理、用户登录注册等核心功能,使用HTML、CSS、JS和jQuery构建,结构清晰,适合新手和资深开发者,助力电商项目快速启动。
884 0
超实用开源前端商城模板,助力电商项目飞速启航!免费直接可用!
|
网络协议 安全 Python
python实现对网络流量分析
Python提供多种工具进行网络流量分析,如`pcap`库用于实时捕包,`dpkt`库用于解码数据包,以及`Scapy`库进行高级分析。
1009 1