思维导图备注

資料結構與演算法/leetcode/lintcode題解
首页 白天 夜间 BookChat 小程序 小程序 阅读
  • 书签 我的书签
  • 添加书签 添加书签 移除书签 移除书签

Appendix I Interview and Resume

浏览 675 扫码 分享 2018-05-09 20:11:43
  • Appendix I Interview and Resume

    Appendix I Interview and Resume

    本章主要總結一些技術面試和撰寫履歷方面的注意事項。

    上一篇:
    下一篇:
    • 书签
    • 添加书签 移除书签
    • Preface
    • FAQ
      • Guidelines for Contributing
      • Contributors
    • Part I - Basics
    • Basics Data Structure
      • String
      • Linked List
      • Binary Tree
      • Huffman Compression
      • Queue
      • Heap
      • Stack
      • Set
      • Map
      • Graph
    • Basics Sorting
      • Bubble Sort
      • Selection Sort
      • Insertion Sort
      • Merge Sort
      • Quick Sort
      • Heap Sort
      • Bucket Sort
      • Counting Sort
      • Radix Sort
    • Basics Algorithm
      • Divide and Conquer
      • Binary Search
      • Math
        • Greatest Common Divisor
        • Prime
      • Knapsack
      • Counting Problem
      • Probability
        • Shuffle
      • Bitmap
    • Basics Misc
      • Bit Manipulation
    • Part II - Coding
    • String
      • strStr
      • Two Strings Are Anagrams
      • Compare Strings
      • Anagrams
      • Longest Common Substring
      • Rotate String
      • Reverse Words in a String
      • Valid Palindrome
      • Longest Palindromic Substring
      • Space Replacement
      • Wildcard Matching
      • Length of Last Word
      • Count and Say
    • Integer Array
      • Remove Element
      • Zero Sum Subarray
      • Subarray Sum K
      • Subarray Sum Closest
      • Recover Rotated Sorted Array
      • Product of Array Exclude Itself
      • Partition Array
      • First Missing Positive
      • 2 Sum
      • 3 Sum
      • 3 Sum Closest
      • Remove Duplicates from Sorted Array
      • Remove Duplicates from Sorted Array II
      • Merge Sorted Array
      • Merge Sorted Array II
      • Median
      • Partition Array by Odd and Even
      • Kth Largest Element
    • Binary Search
      • Binary Search
      • Search Insert Position
      • Search for a Range
      • First Bad Version
      • Search a 2D Matrix
      • Search a 2D Matrix II
      • Find Peak Element
      • Search in Rotated Sorted Array
      • Search in Rotated Sorted Array II
      • Find Minimum in Rotated Sorted Array
      • Find Minimum in Rotated Sorted Array II
      • Median of two Sorted Arrays
      • Sqrt x
      • Wood Cut
    • Math and Bit Manipulation
      • Single Number
      • Single Number II
      • Single Number III
      • O1 Check Power of 2
      • Convert Integer A to Integer B
      • Factorial Trailing Zeroes
      • Unique Binary Search Trees
      • Update Bits
      • Fast Power
      • Hash Function
      • Count 1 in Binary
      • Fibonacci
      • A plus B Problem
      • Print Numbers by Recursion
      • Majority Number
      • Majority Number II
      • Majority Number III
      • Digit Counts
      • Ugly Number
      • Plus One
    • Linked List
      • Remove Duplicates from Sorted List
      • Remove Duplicates from Sorted List II
      • Remove Duplicates from Unsorted List
      • Partition List
      • Add Two Numbers
      • Two Lists Sum Advanced
      • Remove Nth Node From End of List
      • Linked List Cycle
      • Linked List Cycle II
      • Reverse Linked List
      • Reverse Linked List II
      • Merge Two Sorted Lists
      • Merge k Sorted Lists
      • Reorder List
      • Copy List with Random Pointer
      • Sort List
      • Insertion Sort List
      • Palindrome Linked List
      • Delete Node in the Middle of Singly Linked List
      • LRU Cache
      • Rotate List
      • Swap Nodes in Pairs
      • Remove Linked List Elements
    • Binary Tree
      • Binary Tree Preorder Traversal
      • Binary Tree Inorder Traversal
      • Binary Tree Postorder Traversal
      • Binary Tree Level Order Traversal
      • Binary Tree Level Order Traversal II
      • Maximum Depth of Binary Tree
      • Balanced Binary Tree
      • Binary Tree Maximum Path Sum
      • Lowest Common Ancestor
      • Invert Binary Tree
      • Diameter of a Binary Tree
      • Construct Binary Tree from Preorder and Inorder Traversal
      • Construct Binary Tree from Inorder and Postorder Traversal
      • Subtree
      • Binary Tree Zigzag Level Order Traversal
      • Binary Tree Serialization
    • Binary Search Tree
      • Insert Node in a Binary Search Tree
      • Validate Binary Search Tree
      • Search Range in Binary Search Tree
      • Convert Sorted Array to Binary Search Tree
      • Convert Sorted List to Binary Search Tree
      • Binary Search Tree Iterator
    • Exhaustive Search
      • Subsets
      • Unique Subsets
      • Permutations
      • Unique Permutations
      • Next Permutation
      • Previous Permuation
      • Permutation Index
      • Permutation Index II
      • Permutation Sequence
      • Unique Binary Search Trees II
      • Palindrome Partitioning
      • Combinations
      • Combination Sum
      • Combination Sum II
      • Minimum Depth of Binary Tree
      • Word Search
    • Dynamic Programming
      • Triangle
      • Backpack
      • Backpack II
      • Minimum Path Sum
      • Unique Paths
      • Unique Paths II
      • Climbing Stairs
      • Jump Game
      • Word Break
      • Longest Increasing Subsequence
      • Palindrome Partitioning II
      • Longest Common Subsequence
      • Edit Distance
      • Jump Game II
      • Best Time to Buy and Sell Stock
      • Best Time to Buy and Sell Stock II
      • Best Time to Buy and Sell Stock III
      • Best Time to Buy and Sell Stock IV
      • Distinct Subsequences
      • Interleaving String
      • Maximum Subarray
      • Maximum Subarray II
      • Longest Increasing Continuous subsequence
      • Longest Increasing Continuous subsequence II
      • Egg Dropping Puzzle
      • Maximal Square
    • Graph
      • Find the Connected Component in the Undirected Graph
      • Route Between Two Nodes in Graph
      • Topological Sorting
      • Word Ladder
      • Bipartial Graph Part I
    • Data Structure
      • Implement Queue by Two Stacks
      • Min Stack
      • Sliding Window Maximum
      • Longest Words
      • Heapify
      • Kth Smallest Number in Sorted Matrix
    • Problem Misc
      • Nuts and Bolts Problem
      • String to Integer
      • Insert Interval
      • Merge Intervals
      • Minimum Subarray
      • Matrix Zigzag Traversal
      • Valid Sudoku
      • Add Binary
      • Reverse Integer
      • Gray Code
      • Find the Missing Number
      • N Queens
      • N Queens II
      • Minimum Window Substring
      • Continuous Subarray Sum
      • Continuous Subarray Sum II
      • Longest Consecutive Sequence
    • Part III - Contest
    • Google APAC
      • APAC 2015 Round B
        • Problem A. Password Attacker
      • APAC 2016 Round D
        • Problem A. Dynamic Grid
    • Microsoft
      • Microsoft 2015 April
        • Problem A. Magic Box
        • Problem B. Professor Q’s Software
        • Problem C. Islands Travel
        • Problem D. Recruitment
      • Microsoft 2015 April 2
        • Problem A. Lucky Substrings
        • Problem B. Numeric Keypad
        • Problem C. Spring Outing
      • Microsoft 2015 September 2
        • Problem A. Farthest Point
    • Appendix I Interview and Resume
      • Interview
      • Resume
    • Appendix II System Design
      • The System Design Process
      • Statistics
      • System Architecture
      • Scalability
    • Tags
    暂无相关搜索结果！

      本文档使用 BookStack 构建

      展开/收起文章目录

      分享，让知识传承更久远

      文章二维码

      手机扫一扫，轻松掌上读

      文档下载

      • 普通下载
      • 下载码下载(免登录无限下载)
      你与大神的距离，只差一个APP
      APP下载
      请下载您需要的格式的文档，随时随地，享受汲取知识的乐趣！
      PDF文档 EPUB文档 MOBI文档
      温馨提示 每天每在网站阅读学习一分钟时长可下载一本电子书，每天连续签到可增加阅读时长
      下载码方式下载：免费、免登录、无限制。 免费获取下载码

      微信小程序阅读

      BookChat 微信小程序阅读
      您与他人的薪资差距，只差一个随时随地学习的小程序

      书签列表

        阅读记录

        阅读进度: 0.00% ( 0/0 ) 重置阅读进度