{"componentChunkName":"component---src-pages-videos-coding-interview-index-zh-js","path":"/zh/videos/coding-interview/","result":{"data":{"site":{"siteMetadata":{"title":"LaiOffer","description":"Develop technical knowledge. Improve programming skills. Build your career in software engineering.","url":"https://www.laioffer.com"}},"videoSection":{"edges":[{"node":{"name":"FLAG 高频精选面试题讲解        ","description":{"description":"Google、Facebook、LinkedIn等公司资深程序员、面试官亲自讲解高频面试题、LeetCode经典题目。内容涵盖动态规划DP、深度优先搜索DFS、宽度优先搜索BFS、递归Recursion等算法必考点。从暴力解法到最优解，带你一步一步优化算法。讲解面试题的实现细节和应用，帮助你理解算法背后的工业界需求。"},"path":"/zh/videos/coding-interview"}}]},"videos":{"edges":[{"node":{"title":"习题161 - One Edit Distance","path":"/zh/videos/2018-08-08-161-one-edit-distance/","id":"9c50fdf8-da6e-5526-9bac-a08dc2c28ed3","contentful_id":"1qvE36uuHCMeEWY6qqkkcG","date":"2018-08-08T17:00-08:00","featured":true,"node_locale":"zh","sectionId":"coding-interview","section":"FLAG 高频精选面试题讲解","tags":["Facebook","Snap","Uber","Twitter","字符串"],"videoDuration":"08:44","description":{"description":"LeetCode 161 - One Edit Distance | Facebook, Snap, Uber, Twitter 高频面试题 | 考点：字符串"},"thumbnail":{"id":"4cd3249e-9264-5d79-b138-153a9a2afc88","resolutions":{"width":800,"height":550,"src":"//images.ctfassets.net/04k2xg9gplcj/6jBuBR4K5yaeKoUUu06Kg0/de86a89a62e291293204f7adf52130c0/WechatIMG243.jpeg?w=800&h=550&q=50&fit=fill","srcSet":""}},"thumbnailAlt":"LeetCode 161, One Edit Distance","body":{"id":"300df840-a32d-540a-9d8b-9911f0741e66","body":"Facebook, Snap, Uber, Twitter 高频面试题\n\n考点：字符串\n\n难度：中等"}}},{"node":{"title":"习题138 - Copy List with Random Pointer","path":"/zh/videos/2018-08-01-138-copy-list-with-random-pointer/","id":"10031be1-ea99-51b0-a38a-8995cdefc3ba","contentful_id":"41tEe4dalyK2asMoQa4yMo","date":"2018-08-01T17:00-08:00","featured":false,"node_locale":"zh","sectionId":"coding-interview","section":"FLAG 高频精选面试题讲解","tags":["Bloomberg","Uber","Amazon","Microsoft","哈希表","链表"],"videoDuration":"16:08","description":{"description":"LeetCode 138 - Copy list with random pointer | Bloomberg, Uber, Amazon, Microsoft 高频面试题 | 考点：哈希表、链表"},"thumbnail":{"id":"5767b56f-d58a-57bd-a319-a4e67aab8032","resolutions":{"width":800,"height":550,"src":"//images.ctfassets.net/04k2xg9gplcj/6QNXOZGpXO6eGuCMWqeqsg/dc88bb5e1e7235d38e60de9ce75eb123/WechatIMG244.jpeg?w=800&h=550&q=50&fit=fill","srcSet":""}},"thumbnailAlt":"LeetCode 138, Copy List with Random Pointer","body":{"id":"c074333a-25e8-5400-9c32-469f0ec7684f","body":"Bloomberg, Uber, Amazon, Microsoft 面试题\n\n考点：哈希表、链表\n\n难度：中等"}}},{"node":{"title":"习题220 - Contains Duplicate III","path":"/zh/videos/2018-07-23-220-contains-duplicate-3/","id":"38fb41e4-5a6c-59b9-9b6f-b4d23d8aa947","contentful_id":"1TPTGkGV2EKc6YkWo6e4U8","date":"2018-07-23T17:00-08:00","featured":false,"node_locale":"zh","sectionId":"coding-interview","section":"FLAG 高频精选面试题讲解","tags":["Airbnb","二叉搜索树","Bucket","Sliding Window"],"videoDuration":"25:12","description":{"description":"LeetCode 220 - Contains Duplicate III | Airbnb 高频面试题 | 考点：LeetCode 220 - 二叉搜索树，Bucket，Sliding Window"},"thumbnail":{"id":"988e77ad-aa19-5a6a-bbf4-27fdfd383c2b","resolutions":{"width":800,"height":550,"src":"//images.ctfassets.net/04k2xg9gplcj/53OsgwYZlYiiIeomiEeeaG/e352a4d94ec86b43fbfa1c59e8450547/WechatIMG232.jpeg?w=800&h=550&q=50&fit=fill","srcSet":""}},"thumbnailAlt":"LeetCode 220, 包含重复元素 III","body":{"id":"e3ad9b22-a198-5fab-a62d-e7e21ab43c73","body":"Airbnb 面试题\n\n考点：二叉搜索树、Bucket、滑动窗口问题\n\n难度：中等"}}},{"node":{"title":"习题652 - Find Duplicate Subtrees","path":"/zh/videos/2018-06-18-652-find-duplicate-subtrees/","id":"9719320c-2b1d-57b4-8b51-22395e8b9362","contentful_id":"6oPqn2Gdyw8AokqsUAEGci","date":"2018-06-18T17:00-08:00","featured":true,"node_locale":"zh","sectionId":"coding-interview","section":"FLAG 高频精选面试题讲解","tags":["Airbnb","树"],"videoDuration":"20:28","description":{"description":"LeetCode 652 - Find the duplicate Subtrees | Google高频面试题 | 考点：树"},"thumbnail":{"id":"e2f865ac-9bd5-5bae-b891-ecec46e5feb6","resolutions":{"width":800,"height":550,"src":"//images.ctfassets.net/04k2xg9gplcj/4oUaToTXuMcqkG4kYY2oOs/4ada90835912be4c6ee1aec91c6864c5/652.jpg?w=800&h=550&q=50&fit=fill","srcSet":""}},"thumbnailAlt":"Problem 652, 找到重复的子树","body":{"id":"3360d6f6-0a88-5bff-be3f-a545b0f150e6","body":"Google 高频面试题\n\n考点：树\n\n难度：中等"}}},{"node":{"title":"习题23 - Merge K Sorted Lists","path":"/zh/videos/2018-07-09-merge-k-sorted-lists/","id":"d3e5b7e2-e948-50f6-8f02-54fae5b39d19","contentful_id":"f4LCFtE5NuCM2Im8oYC0s","date":"2018-07-09T17:00-08:00","featured":false,"node_locale":"zh","sectionId":"coding-interview","section":"FLAG 高频精选面试题讲解","tags":["Google","Facebook","Microsoft","Amazon","Uber","LinkedIn","Airbnb","Twitter","链表","分治法","堆"],"videoDuration":"16:01","description":{"description":"LeetCode 23 - Merge K Sorted Lists | Google, Facebook, Microsoft, Amazon, Uber, LinkedIn, Airbnb, Twitter 高频面试题 | 考点：Linked List 链表, Divide and Conquer 分治法, Heap 堆"},"thumbnail":{"id":"3842e54a-8ea2-58ff-af54-fa72ef63b933","resolutions":{"width":800,"height":550,"src":"//images.ctfassets.net/04k2xg9gplcj/3N6IMrHaGQYACM4WiccwaC/fb97065fd64e2ca1de34754309a753ee/23-thumbnail.jpg?w=800&h=550&q=50&fit=fill","srcSet":""}},"thumbnailAlt":"习题23, merge k sorted lists","body":{"id":"37ec9fc1-a7d3-51c0-a2aa-8df5c0241905","body":"Google, Facebook, Microsoft, Amazon, Uber, LinkedIn, Airbnb, Twitter 高频面试题\n\n考点：Linked List 链表, Divide and Conquer 分治法, Heap 堆\n\n难度：困难"}}},{"node":{"title":"习题56 - Merge Intervals","path":"/zh/videos/2018-07-03-56-merge-intervals/","id":"372eada9-9ade-504a-9990-5ed7c06428c5","contentful_id":"26I8vhtVDiyK8MUKmaSU08","date":"2018-07-03T17:00-08:00","featured":false,"node_locale":"zh","sectionId":"coding-interview","section":"FLAG 高频精选面试题讲解","tags":["Google","Facebook","Microsoft","Bloomberg","LinkedIn","Twitter","Yelp","搜索"],"videoDuration":"24:14","description":{"description":"LeetCode 56 - Merge Intervals | Google, Facebook, Microsoft, Bloomberg, LinkedIn, Twitter, Yelp高频面试题 | 考点：Sort 搜索"},"thumbnail":{"id":"f3b02d31-0f11-5261-9bda-9d53b0cd1a21","resolutions":{"width":800,"height":550,"src":"//images.ctfassets.net/04k2xg9gplcj/2tMO9zf4POGCwsEqoGe8gY/cf0ff346306a36a550103b2c69cb0d87/56.jpg?w=800&h=550&q=50&fit=fill","srcSet":""}},"thumbnailAlt":"习题56, merge intervals","body":{"id":"327c53e1-8c2c-597e-b90e-2a6378b389dd","body":"Google, Facebook, Microsoft, Bloomberg, LinkedIn, Twitter, Yelp高频面试题\n\n考点：Sort 搜索\n\n难度：中等\n\n"}}},{"node":{"title":"习题17 - Letter Combinations of A Phone Number","path":"/zh/videos/2018-06-25-17-letter-combinations-of-a-phone-number/","id":"65cf4193-d521-52ed-bd2a-54af4a1536c2","contentful_id":"HObWvPUJGgaqiSiOuaa6K","date":"2018-06-25T17:00-08:00","featured":false,"node_locale":"zh","sectionId":"coding-interview","section":"FLAG 高频精选面试题讲解","tags":["Google","Facebook","Amazon","Uber","Backtracking","字符串"],"videoDuration":"26:48","description":{"description":"LeetCode 17 - Letter Combinations of A Phone Number | Google, Facebook, Amazon, Uber高频面试题 | 考点：Backtracking, String 字符串"},"thumbnail":{"id":"a7961a4d-7bae-550e-ae48-909bf46530d4","resolutions":{"width":800,"height":550,"src":"//images.ctfassets.net/04k2xg9gplcj/3r47Q9gwRWYSiSWsyoeayS/52a64076359e1604eadbc7750affeef2/17.jpg?w=800&h=550&q=50&fit=fill","srcSet":""}},"thumbnailAlt":"习题17, 电话号码的字母组合","body":{"id":"cabcfac8-74c2-5b72-b947-5cf7615bba34","body":"Google, Facebook, Amazon, Uber高频面试题\n\n考点：Backtracking, String 字符串\n\n难度：中等"}}},{"node":{"title":"习题450 - Delete Node in a BST","path":"/zh/videos/2018-06-13-450-delete-node-in-a-bst/","id":"faf254fe-e41b-5d48-b5a6-024095a6254f","contentful_id":"b2eNXHmccEiaAmcIQIuca","date":"2018-06-13T17:00-08:00","featured":false,"node_locale":"zh","sectionId":"coding-interview","section":"FLAG 高频精选面试题讲解","tags":["Airbnb","Uber","树"],"videoDuration":"11:40","description":{"description":"LeetCode 450 - Delete Node in a BST | Google, Uber 高频面试题 | 考点：树"},"thumbnail":{"id":"2a6783c4-dfdf-5fd8-9acc-e1131a917708","resolutions":{"width":800,"height":550,"src":"//images.ctfassets.net/04k2xg9gplcj/2BzKVDlGz6sUMwyEqsek8i/dff97076feb081836fe2d94f8481fc56/450.jpg?w=800&h=550&q=50&fit=fill","srcSet":""}},"thumbnailAlt":"LeetCode 450, 在平衡搜索树中删除节点","body":{"id":"9a97a70c-817c-58e8-80c2-0aebcc4b058c","body":"Google, Uber 高频面试题\n\n考点：树\n\n难度：中等"}}},{"node":{"title":"习题219 - Contains Duplicate II","path":"/zh/videos/2018-06-06-219-contains-duplicate-2/","id":"c1c0c8d8-b6d3-5bc7-8314-d6c82d93ec7a","contentful_id":"1K8jGtne8sQEa8AG4m6UcI","date":"2018-06-06T17:00-08:00","featured":false,"node_locale":"zh","sectionId":"coding-interview","section":"FLAG 高频精选面试题讲解","tags":["Airbnb","数组","哈希表","Sliding Window"],"videoDuration":"12:09","description":{"description":"LeetCode 219 - Contains Duplicate II | Airbnb 高频面试题 | 考点：数组、哈希表、滑动窗口问题"},"thumbnail":{"id":"4f413788-148a-5780-b8bd-9a2f4ca8d456","resolutions":{"width":800,"height":550,"src":"//images.ctfassets.net/04k2xg9gplcj/32uZ67i8dqWqYiKi6esKgG/918027865e813dfb21974416af84ab0a/219.jpg?w=800&h=550&q=50&fit=fill","srcSet":""}},"thumbnailAlt":"LeetCode 219, 包含重复元素 II","body":{"id":"27e59635-82dc-5bc3-8eab-70c4335cf55f","body":"Airbnb 面试题\n\n考点：数组、哈希表、滑动窗口问题\n\n难度：简单"}}},{"node":{"title":"习题 503 - Next Greater Element II","path":"/zh/videos/2018-05-29-503-next-greater-element/","id":"ff67cf38-1f00-5a7f-b644-139ab7304965","contentful_id":"3qt3ooMfdYUWguU8YyI4wu","date":"2018-05-29T15:00-08:00","featured":false,"node_locale":"zh","sectionId":"coding-interview","section":"FLAG 高频精选面试题讲解","tags":["Google","数组","单调栈"],"videoDuration":"22:21","description":{"description":"LeetCode 503 - Next Greater Element II | Google 高频面试题 | 考点：数组、单调栈"},"thumbnail":{"id":"cdc64dfd-b84e-5aca-8a5a-48a1bac00f4a","resolutions":{"width":800,"height":550,"src":"//images.ctfassets.net/04k2xg9gplcj/5vZaRrUydy2GY0soEYasC0/17a3528ffc9ca5b3ea0eb9415b4208b3/503.jpg?w=800&h=550&q=50&fit=fill","srcSet":""}},"thumbnailAlt":"LeetCode 503, 下一最大元素 II","body":{"id":"96d084d8-544d-5fbd-9412-096d56793014","body":"Google面试题\n\n考点：数组、单调栈\n\n难度：中等"}}},{"node":{"title":"习题 200 - Number of Islands","path":"/zh/videos/2018-04-11-200-number-of-islands/","id":"96eb4f0e-1e7b-53f2-85ff-df827d7a0d05","contentful_id":"266jm1kYygqWAA2s62KcsK","date":"2018-04-11T12:00-08:00","featured":false,"node_locale":"zh","sectionId":"coding-interview","section":"FLAG 高频精选面试题讲解","tags":["Google","Facebook","Microsoft","Amazon","深度优先搜索","宽度优先搜索","Union Find"],"videoDuration":"23:10","description":{"description":"LeetCode 200 - number of islands | Google，Facebook, Microsoft, Amazon 高频面试题 | 考点：深度优先搜索、宽度优先搜索、Union Find"},"thumbnail":{"id":"e14f33f2-cb40-5499-b150-df0a4c7508ac","resolutions":{"width":800,"height":550,"src":"//images.ctfassets.net/04k2xg9gplcj/3QwzYUnoz6eAggsGgiayIe/c8b8d11fcadb6482fe707f0b63d34f81/200.jpg?w=800&h=550&q=50&fit=fill","srcSet":""}},"thumbnailAlt":"LeetCode 200，岛屿数量","body":{"id":"35c3c995-7b97-5127-aeca-68088d97e6c2","body":"Google, Faceboo, Microsoft, Amazon 面试题\n\n考点：深度优先搜索 DfS, 宽度优先搜索 BFS, Union Find\n\n难度：中等"}}},{"node":{"title":"习题 277 - Find the Celebrity","path":"/zh/videos/2018-05-07-277-find-the-celebrity/","id":"38bfd71a-370c-590b-b9fc-a0ac0eddce03","contentful_id":"2xiylBHVFGAgGoI6OmWYOs","date":"2018-05-07T14:00-08:00","featured":false,"node_locale":"zh","sectionId":"coding-interview","section":"FLAG 高频精选面试题讲解","tags":["Google","Facebook","Graph"],"videoDuration":"21:01","description":{"description":"LeetCode 277 - Find the Celebrity | Facebook, LinkedIn 高频面试题 | 考点：Graph"},"thumbnail":{"id":"c63331d7-329c-5c36-987a-4c32672251cf","resolutions":{"width":800,"height":550,"src":"//images.ctfassets.net/04k2xg9gplcj/1gPeI1K7hkqAMmCuQEKMa8/d8b6eef84ad3f05b1e12c29aae5bca74/277.jpg?w=800&h=550&q=50&fit=fill","srcSet":""}},"thumbnailAlt":"LeetCode 277, 找到明星","body":{"id":"c134b02b-83b2-5974-87f7-c233d5818f56","body":"Facebook, LinkedIn 面试题\n\n考点：Graph\n\n难度：中等"}}},{"node":{"title":"习题 332 - Reconstruct Itinerary","path":"/zh/videos/2018-03-14-332-reconstruct-itinerary/","id":"6be665a8-183f-575d-ac99-5b7a2b993648","contentful_id":"6KeV8uBBCMKi2wOKgieuoO","date":"2018-03-14T04:29-08:00","featured":true,"node_locale":"zh","sectionId":"coding-interview","section":"FLAG 高频精选面试题讲解","tags":["Google","Yelp","图论","深度优先搜索"],"videoDuration":"14:31","description":{"description":"LeetCode 332 - Reconstruct Itinerary | Google, Yelp高频面试题 | 考点：图论, 深度优先搜索"},"thumbnail":{"id":"92f55a27-ac6e-54de-b6f5-a0720e8810a4","resolutions":{"width":800,"height":550,"src":"//images.ctfassets.net/04k2xg9gplcj/1pDfPsbWTyaoGg6OQsWOWy/380044be82021a80d591ee3dc5a7a271/332.jpg?w=800&h=550&q=50&fit=fill","srcSet":""}},"thumbnailAlt":"LeetCode 332题 Reconstruct Itinerary","body":{"id":"dce0f105-714e-50b7-ad05-fdd2d11563b7","body":"Google, Yelp高频面试题\n\n考点：Graph 图论, DFS 深度优先搜索\n\n难度：中等"}}},{"node":{"title":"习题 199 - Binary Tree Right Side View","path":"/zh/videos/2018-05-21-199-binary-tree-right-side-view/","id":"e11f58be-b18b-55ee-a732-baf786437fc8","contentful_id":"4JsftJC3bWqKm8gckCMiU4","date":"2018-05-21T18:30-08:00","featured":false,"node_locale":"zh","sectionId":"coding-interview","section":"FLAG 高频精选面试题讲解","tags":["Google","Facebook","Amazon","Yelp","树","深度优先搜索","宽度优先搜索"],"videoDuration":"16:12","description":{"description":"LeetCode 199 - Binary Tree Right Side View | Google, Facebook, Amazon, Yelp高频面试题 | 考点：树, 深度优先搜索，宽度优先搜索"},"thumbnail":{"id":"4bcd5747-6e4f-5d80-89a5-f87cb6e43ca2","resolutions":{"width":800,"height":550,"src":"//images.ctfassets.net/04k2xg9gplcj/2kfzqbTxfOskUaCIAqmK2q/fe6e14d71ff6820e601a093638214857/199.jpg?w=800&h=550&q=50&fit=fill","srcSet":""}},"thumbnailAlt":"LeetCode 199题 binary tree right side view","body":{"id":"a60035e4-c59f-5719-b31a-3ea0e813bc3f","body":"Google, Facebook, Amazon, Yelp高频面试题\n\n考点：Tree 树，BFS 宽度优先搜索, DFS 深度优先搜索\n\n难度：中等\n"}}},{"node":{"title":"习题 91 - Decode Ways","path":"/zh/videos/2018-05-14-91-decode-ways/","id":"c5e56d62-d2fe-5b39-8bc7-6b2f9420ba4f","contentful_id":"g6ibmnSq4wyMUa2Eiu0Wy","date":"2018-05-14T17:00-08:00","featured":false,"node_locale":"zh","sectionId":"coding-interview","section":"FLAG 高频精选面试题讲解","tags":["Facebook","Microsoft","Uber","动态规划","字符串"],"videoDuration":"11:28","description":{"description":"LeetCode 91 - Decode Ways | Facebook, Microsoft, Uber 高频面试题 | 考点：动态规划, 字符串"},"thumbnail":{"id":"1a706fff-7283-5067-8086-3bcb86f90587","resolutions":{"width":800,"height":550,"src":"//images.ctfassets.net/04k2xg9gplcj/5PnKTjvm0wsGaGoiUIWia8/16365bbaf6f7dfcfa0f23693628d78f6/91.jpg?w=800&h=550&q=50&fit=fill","srcSet":""}},"thumbnailAlt":"LeetCode 91, Decode Ways","body":{"id":"f0d02b77-bf60-5fcf-9029-b91d981915bb","body":"Facebook, Microsoft, Uber 面试题\n\n考点：动态规划，字符串\n\n难度：中等"}}},{"node":{"title":"习题 632 - Smallest Range","path":"/zh/videos/2018-04-30-632-smallest-range/","id":"d5d869bc-c70a-5a77-867f-aaa3e8095e03","contentful_id":"2XC6ox3jKMMkA6wqW6Aoea","date":"2018-05-01T12:00-08:00","featured":false,"node_locale":"zh","sectionId":"coding-interview","section":"FLAG 高频精选面试题讲解","tags":["Google","Lyft","堆"],"videoDuration":"19:41","description":{"description":"LeetCode 632 - smallest range | Google，Lyft 高频面试题 | 考点：堆 Heap"},"thumbnail":{"id":"478df700-fc8a-5aa1-b236-38c05fcc49dd","resolutions":{"width":800,"height":550,"src":"//images.ctfassets.net/04k2xg9gplcj/6d4XpJhjOMSEGo2KGo04ko/4bd2c5082ad4bd5025921c24aaad8872/632.jpg?w=800&h=550&q=50&fit=fill","srcSet":""}},"thumbnailAlt":"LeetCode 632, 最小范围问题","body":{"id":"c91c483e-74a3-55b9-a2f4-d044fda36850","body":"Google，Lyft 面试题\n\n考点：Heap 堆\n\n难度：困难"}}},{"node":{"title":"习题 322 - Coin Change","path":"/zh/videos/2018-04-23-322-coin-change/","id":"fed0d986-aaa3-5565-bdc9-6e165d96be0c","contentful_id":"5xUggRGclq6Yyo0EmMACwM","date":"2018-04-23T15:00-08:00","featured":false,"node_locale":"zh","sectionId":"coding-interview","section":"FLAG 高频精选面试题讲解","tags":["Google","Amazon","Yahoo","Microsoft","动态规划"],"videoDuration":"25:58","description":{"description":"LeetCode 322 - Coin Change | Google, Amazon, Yahoo, Microsoft高频面试题 | 考点：动态规划"},"thumbnail":{"id":"bf51a161-7c84-5674-a419-f64cfaa844d4","resolutions":{"width":800,"height":550,"src":"//images.ctfassets.net/04k2xg9gplcj/3zbkgwNunewWuCeOeeYMmY/9a3f166b8a5de8ccb8d4ed162b439f4d/322.jpg?w=800&h=550&q=50&fit=fill","srcSet":""}},"thumbnailAlt":"LeetCode 322题 Coin Change","body":{"id":"192ac33e-6255-5de9-b928-dda86849faa6","body":"Google，Amazon，Yahoo，Microsoft高频面试题\n\n考点：动态规划\n\n难度：中等"}}},{"node":{"title":"习题 224 - Basic Calculator","path":"/zh/videos/2018-03-13-224-basic-calculator/","id":"608c7eca-7ad5-5d0f-93d8-e26e2977fc1f","contentful_id":"6Aa9k7P7sQGkQeugiOqKwW","date":"2018-03-13T17:00-08:00","featured":false,"node_locale":"zh","sectionId":"coding-interview","section":"FLAG 高频精选面试题讲解","tags":["Google","Expression Tree","递归","栈"],"videoDuration":"17:11","description":{"description":"LeetCode 224 - Basic Calculator | Google高频面试题 | 考点：Math, Expression Tree, 递归, 栈"},"thumbnail":{"id":"e8e53a85-9be6-551b-8f03-0f1406702194","resolutions":{"width":800,"height":550,"src":"//images.ctfassets.net/04k2xg9gplcj/6ITTsTWrw4ouOOY0gMaiK6/15443aa7d0ede1d7a990ed7cf85b5002/224.jpg?w=800&h=550&q=50&fit=fill","srcSet":""}},"thumbnailAlt":"LeetCode 224题 计算器","body":{"id":"d14f3625-7cb0-566b-b2d6-f72f34db8fd6","body":"Google高频面试题\n\n考点：Math, Expression Tree, 递归, 栈\n\n难度：困难"}}},{"node":{"title":"习题 243/244/245 - Shortest Word Distance","path":"/zh/videos/2018-04-16-243-shortest-word-distance/","id":"3a382efe-7b95-5429-8019-9a1136ad4fb5","contentful_id":"4klYnst5WoqqGkEwmySEkY","date":"2018-04-16T15:00-08:00","featured":false,"node_locale":"zh","sectionId":"coding-interview","section":"FLAG 高频精选面试题讲解","tags":["Facebook","LinkedIn","哈希表","Design","倒排索引"],"videoDuration":"32:46","description":{"description":"LeetCode 243/244/245 - Shortest Word Distance | Facebook, LinkedIn 高频面试题 | 考点：哈希表、Design、倒排索引"},"thumbnail":{"id":"581dfe93-5ab1-562c-a5d0-8709736964d1","resolutions":{"width":800,"height":550,"src":"//images.ctfassets.net/04k2xg9gplcj/3jxJYgXkPYwEcUikqUmMMe/b9650b7ddf842a985a18cf1c26d3600c/245.jpg?w=800&h=550&q=50&fit=fill","srcSet":""}},"thumbnailAlt":"LeetCode 243/244/245，最短词语距离","body":{"id":"498fb40f-a864-5dc2-a825-bdbf79b30854","body":"Facebook, LinkedIn 高频面试题\n\n考点：哈希表、Design、Invert Index\n\n难度：中等"}}},{"node":{"title":"习题 496 - Next Greater Elements I","path":"/zh/videos/2018-04-23-496-next-greater-elements/","id":"4208faae-02c8-5a1b-bef1-ea5ec7a476ce","contentful_id":"2wD1IxMceY2giQAuc4O4EQ","date":"2018-04-23T15:00-08:00","featured":false,"node_locale":"zh","sectionId":"coding-interview","section":"FLAG 高频精选面试题讲解","tags":["Google","数组","单调栈"],"videoDuration":"19:58","description":{"description":"LeetCode 496 - Next Greater Elements I | Google高频面试题 | 考点：数组、单调栈"},"thumbnail":{"id":"601c50fb-dc40-511f-b2e9-29f143bc9a0c","resolutions":{"width":800,"height":550,"src":"//images.ctfassets.net/04k2xg9gplcj/1rwWSkXO0M2W0OEkUKOUO0/393b6a588739e7fe54fc89f8fb415021/496.jpg?w=800&h=550&q=50&fit=fill","srcSet":""}},"thumbnailAlt":"LeetCode 496题 下一个更大元素","body":{"id":"0b2d85a4-9ae4-589d-96a4-3dfabf02606c","body":"Google高频面试题\n\n考点：数组、单调栈\n\n难度：简单"}}},{"node":{"title":"习题 33 - Search in Rotated Sorted Array","path":"/zh/videos/2018-04-16-33-search-in-rotated-sorted-array/","id":"87d753b2-6457-5bd1-a41b-157f62d79c75","contentful_id":"3StXUEFbhYWEsmAsYe8WgI","date":"2018-04-16T15:00-08:00","featured":false,"node_locale":"zh","sectionId":"coding-interview","section":"FLAG 高频精选面试题讲解","tags":["Facebook","Microsoft","Bloomberg","Uber","LinkedIn","数组","二分查找"],"videoDuration":"09:04","description":{"description":"LeetCode 33 - search in rotated sorted array | Facebook, Microsoft, Bloomberg, Uber, LinkedIn 高频面试题 | 考点：数组、二分查找"},"thumbnail":{"id":"1c426a4f-0233-5fcd-b3ee-d47370ad339b","resolutions":{"width":800,"height":550,"src":"//images.ctfassets.net/04k2xg9gplcj/1sYsYz48M0skAcYw6q64OA/2490ede3f77ee4e8e6b53f1d76a019a6/33.jpg?w=800&h=550&q=50&fit=fill","srcSet":""}},"thumbnailAlt":"LeetCode 33, 排序旋转数组查找","body":{"id":"8bc099fc-72e4-5a8b-8339-62c4125dc290","body":"Facebook, Microsoft, Bloomberg, Uber, LinkedIn 面试题\n\n考点：数组 Array，二分查找 Binary Search\n\n难度：中等"}}},{"node":{"title":"习题 518 - Coin Change II","path":"/zh/videos/2018-03-08-518-coin-change-2/","id":"e2c6d13f-c031-5dd4-a727-d6abdda090e8","contentful_id":"5lktp1EZQ48S0kaoG0KGcQ","date":"2018-03-08T04:29-08:00","featured":false,"node_locale":"zh","sectionId":"coding-interview","section":"FLAG 高频精选面试题讲解","tags":["Google","Facebook","Yahoo","Microsoft","动态规划"],"videoDuration":"21:15","description":{"description":"LeetCode 518 Coin Chage 2 | Google、Facebook、Yahoo，Microsoft高频面试题 | 考点：动态规划"},"thumbnail":{"id":"747ae806-7030-5e28-b90d-b9d85bc8b5e3","resolutions":{"width":800,"height":550,"src":"//images.ctfassets.net/04k2xg9gplcj/1MV7zkRB5GmCgo4owAiiYU/9f76d611872cbb9d775fcd9442c175c5/518.jpg?w=800&h=550&q=50&fit=fill","srcSet":""}},"thumbnailAlt":"LeetCode 518题 Coin Change II","body":{"id":"7673258d-94b2-5784-9241-6604e0c70e3b","body":"Google，Facebook，Yahoo，Microsoft 高频面试题\n\n考点：Dynamic Programming 动态规划\n\n难度：中等\n"}}},{"node":{"title":"习题 76 - Minimum Window Substring","path":"/zh/videos/2018-03-12-76-minimum-window-substring/","id":"92e7de69-ac1f-542e-9c3b-96aeedf4e1db","contentful_id":"K3djBQEGWIUSAw8Agwmyu","date":"2018-03-12T04:29-08:00","featured":true,"node_locale":"zh","sectionId":"coding-interview","section":"FLAG 高频精选面试题讲解","tags":["Facebook","Linkedin","Uber","Snap","双指针","字符串","哈希表"],"videoDuration":"37:06","description":{"description":"LeetCode 76 - Minimum Window Substring | Facebook, LinkedIn, Uber, Snapchat高频面试题 | 考点：字符串, 哈希表, 双指针"},"thumbnail":{"id":"95001f71-5bce-56bf-8601-d0df91b4c2de","resolutions":{"width":800,"height":550,"src":"//images.ctfassets.net/04k2xg9gplcj/3KCXrDPFgsIwaiUeQoq466/d85cd0da53da275decaff27344044027/76.jpg?w=800&h=550&q=50&fit=fill","srcSet":""}},"thumbnailAlt":"LeetCode 76 Sliding window","body":{"id":"6d42c725-c5af-5192-b725-a0e7bea87dc9","body":"Facebook, LinkedIn, Uber, Snapchat高频面试题\n\n考点：String 字符串, Hash Table 哈希表, Two Pointers 双指针\n\n难度：困难"}}},{"node":{"title":"习题 560 - Subarray Sum Equals K","path":"/zh/videos/2018-04-02-560-subarray-sum-equals-k/","id":"78a400f0-23eb-566f-a653-2d6e07995698","contentful_id":"7CUSHe7mtUMc6WMaqoes4C","date":"2018-04-02T12:00-08:00","featured":false,"node_locale":"zh","sectionId":"coding-interview","section":"FLAG 高频精选面试题讲解","tags":["Google","Facebook","数组","哈希表","Prefix Sum"],"videoDuration":"26:31","description":{"description":"LeetCode 560 - subarray sum equals K | Google，Facebook高频面试题 | 考点：数组、哈希表、Prefix Sum"},"thumbnail":{"id":"7b11692a-0520-5ccf-b15a-ab53d5c460bc","resolutions":{"width":800,"height":550,"src":"//images.ctfassets.net/04k2xg9gplcj/7hfW8cZhe0Sui2YMg4cAOI/3ccae1322c73119fc47e02e7d948921d/560.jpg?w=800&h=550&q=50&fit=fill","srcSet":""}},"thumbnailAlt":"LeetCode 560，子数组之和等于K","body":{"id":"41ea2f1a-9a21-5b83-9acb-933afce422c9","body":"Google，Facebook高频面试题\n\n考点：数组、哈希表、Prefix Sum\n\n难度：中等"}}},{"node":{"title":"习题 124 - Binary Tree Maximum Path Sum","path":"/zh/videos/2018-03-12-124-binary-tree-maximum-path-sum/","id":"a1e69e40-1f55-501c-9df7-a7f6194eb7f3","contentful_id":"9EX8fuan9CYWuaGyw0sqI","date":"2018-03-12T04:29-08:00","featured":false,"node_locale":"zh","sectionId":"coding-interview","section":"FLAG 高频精选面试题讲解","tags":["Google","Facebook","Amazon","Microsoft","递归","深度优先搜索"],"videoDuration":"21:26","description":{"description":"LeetCode 124 - Binary Tree Maximum Path Sum | Google，Facebook, Amazon, Microsoft高频面试题 | 考点：递归、深度优先搜索"},"thumbnail":{"id":"1853a0e9-ba8f-5915-a812-e5c22309637e","resolutions":{"width":800,"height":550,"src":"//images.ctfassets.net/04k2xg9gplcj/1HOxFMfNaUwo22AQS2gakw/99758c57e3e320230e6b9dffd0b61463/124.jpg?w=800&h=550&q=50&fit=fill","srcSet":""}},"thumbnailAlt":"LeetCode 124，二叉树问题","body":{"id":"3559393c-7ccc-51b4-b14a-1ebc992d42ca","body":"Google，Facebook, Amazon, Microsoft高频面试题\n\n考点：Recursion 递归、DFS 深度优先搜索\n\n难度：困难"}}},{"node":{"title":"习题 75 - Sort Colors","path":"/zh/videos/2018-03-12-75-sort-colors/","id":"52c9e693-3a5f-54c2-9b7c-9be51529dc9f","contentful_id":"3mYoLqWJDa2qiMoGoWeqK6","date":"2018-03-12T04:29-08:00","featured":false,"node_locale":"zh","sectionId":"coding-interview","section":"FLAG 高频精选面试题讲解","tags":["Facebook","Microsoft","双指针","搜索算法","数组"],"videoDuration":"20:08","description":{"description":"LeetCode 75 - Sort Colors | Facebook,  Microsoft高频面试题 | 考点：双指针、搜索、数组"},"thumbnail":{"id":"327a962a-3e88-5aff-ac4d-bc8e77dcb4dd","resolutions":{"width":800,"height":550,"src":"//images.ctfassets.net/04k2xg9gplcj/36Hc85yHDy0mMAyqc0kW2U/3dadafd326961d39ade729d8ca65808c/75.jpg?w=800&h=550&q=50&fit=fill","srcSet":""}},"thumbnailAlt":"LeetCode 75题 多挡板问题","body":{"id":"87c2de0a-8adb-5f5a-b91d-bdacd11df97c","body":"Facebook,  Microsoft高频面试题\n\n考点：Two Pointers, Sort 搜索算法, Array 数组\n\n难度：中等"}}},{"node":{"title":"习题 309 - Best Time to Buy and Sell Stock with Cooldown","path":"/zh/videos/2018-03-26-309-best-time-to-buy-and-sell-stock-with-cooldown/","id":"58af1a4f-28b0-5f8a-9fcb-3c92e50ed7ee","contentful_id":"5IhhaVUPBuioQwES0Swogy","date":"2018-03-28T16:00-08:00","featured":false,"node_locale":"zh","sectionId":"coding-interview","section":"FLAG 高频精选面试题讲解","tags":["Google","Facebook","动态规划"],"videoDuration":"11:51","description":{"description":"LeetCode 309 - Best Time to Buy and Sell Stock with Cooldown | Google，Facebook高频面试题 | 考点：动态规划"},"thumbnail":{"id":"a646ee06-af6e-5f54-958e-202cc64cd844","resolutions":{"width":800,"height":550,"src":"//images.ctfassets.net/04k2xg9gplcj/7Gv9cvzsXuusmSiWE4y6gu/4d755281d558f0f3cb0dba7002b57618/309.jpg?w=800&h=550&q=50&fit=fill","srcSet":""}},"thumbnailAlt":"LeetCode 309，动态规划问题","body":{"id":"171c9529-3767-5372-87b4-ce48885b00a2","body":"Google，Facebook高频面试题\n\n考点：动态规划（DP）\n\n难度：中等"}}},{"node":{"title":"习题 692 - Top K Frequent Words","path":"/zh/videos/2018-03-13-692-top-k-frequent-words/","id":"894468d7-6597-503d-b539-31f096d9ceaa","contentful_id":"M8gsnooTAcQG2IgAEUGwK","date":"2018-03-13T17:00-08:00","featured":false,"node_locale":"zh","sectionId":"coding-interview","section":"FLAG 高频精选面试题讲解","tags":["Amazon","Bloomberg","Uber","Yelp","哈希表","堆"],"videoDuration":"28:56","description":{"description":"LeetCode 692 - Top K Frequent Words | Amazon, Bloomberg, Uber, Yelp,高频面试题 | 考点：哈希表, 堆"},"thumbnail":{"id":"3206921f-ee3a-5988-86f2-fe55feda0db3","resolutions":{"width":800,"height":550,"src":"//images.ctfassets.net/04k2xg9gplcj/IL6OVpp42am28iswMOCCA/75526d3f9462d066637358be215bf5c7/692.jpg?w=800&h=550&q=50&fit=fill","srcSet":""}},"thumbnailAlt":"LeetCode 692题 哈希表问题","body":{"id":"df462dfb-289c-5b40-b0a4-8ca344853f78","body":"Amazon, Bloomberg, Uber, Yelp,高频面试题\n\n考点：Hash Table 哈希表, Heap 堆\n\n难度：中等"}}},{"node":{"title":"习题 516 - Longest Palindromic Subsequence","path":"/zh/videos/2018-03-14-516-longest-palindromic-subsequence/","id":"8bcb2497-db9c-547d-ad9b-c12b2cdfbcc0","contentful_id":"32lJZc5aFqeO0SGmumYcw","date":"2018-03-14T04:29-08:00","featured":false,"node_locale":"zh","sectionId":"coding-interview","section":"FLAG 高频精选面试题讲解","tags":["Google","Amazon","Uber","动态规划"],"videoDuration":"14:02","description":{"description":"LeetCode 516 - Longest Palindromic Subsequence | Google, Amazon, Uber,高频面试题 | 考点：动态规划"},"thumbnail":{"id":"046fc489-6161-57e2-9d0d-db320b10e29e","resolutions":{"width":800,"height":550,"src":"//images.ctfassets.net/04k2xg9gplcj/4Y9os8IL1eieyuq2iacYMO/fa439b8793d9e26d5ed83c1a549a750e/516.jpg?w=800&h=550&q=50&fit=fill","srcSet":""}},"thumbnailAlt":"LeetCode 516题 动态规划问题","body":{"id":"73cf0805-e423-5e59-a4f3-03abbe891dca","body":"Google, Amazon, Uber,高频面试题\n\n考点：Dynamic Programming 动态规划\n\n难度：中等"}}}]}},"pageContext":{"isCreatedByStatefulCreatePages":true,"slug":"/zh/videos/coding-interview/","langKey":"zh"}}}