Skip to content

yiguanxian/interview

BranchesTags

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

6 Commits
1-Two Sum.py
1-Two Sum.py
 
 
10-Regular Expression Matching.py
10-Regular Expression Matching.py
 
 
11-Container With Most Water.py
11-Container With Most Water.py
 
 
12-Integer to Roman.py
12-Integer to Roman.py
 
 
2-Add Two Numbers.py
2-Add Two Numbers.py
 
 
3-Longest Substring Without Repeating Characters.py
3-Longest Substring Without Repeating Characters.py
 
 
4-Median of Two Sorted Arrays.py
4-Median of Two Sorted Arrays.py
 
 
5-Longest Palindromic Substring.py
5-Longest Palindromic Substring.py
 
 
6-ZigZag Conversion.py
6-ZigZag Conversion.py
 
 
7-Reverse Integer.py
7-Reverse Integer.py
 
 
8-String to Integer (atoi).py
8-String to Integer (atoi).py
 
 
9- Palindrome Number.py
9- Palindrome Number.py
 
 
94-Binary Tree Inorder Traversal.py
94-Binary Tree Inorder Traversal.py
 
 
README.md
README.md
 
 
conv2Dforward.py
conv2Dforward.py
 
 

Repository files navigation

interview

主要记录面试经验

算法岗位面试官想要的是基础扎实的人。

第一轮笔试：基本算法，建议刷LeetCode 第二轮面试：1.介绍在读期间的项目：目标检测？那能否手推或阐述你所用的检测算法。要求：非常熟练yolo算法，甚至能手推。 2.能阐述或手推其他常见机器学习算法,比如：SVM。
面试收藏：
https://github.com/imhuay/Algorithm_Interview_Notes-Chinese

About

leetcode刷题python

Resources

Readme
Activity

Stars

1 star

Watchers

0 watching

Forks

0 forks
Report repository

Releases

No releases published

Packages

No packages published

Languages