{"componentChunkName":"component---src-pages-videos-coding-interview-index-en-js","path":"/en/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 Coding Interview","description":{"description":"Senior engineers and interviewers from Google, Facebook, LinkedIn and other companies explain frequently asked interview questions. The content covers dynamic programming, depth-first search, breadth-first search, Recursion and more. The instructor will lead your way from naive solution to optimal solution. Help you optimize the algorithm step-by-step. Additionally, they will describe the implementation details and application to help you understand the industrial requirements behind the algorithm."},"path":"/en/videos/coding-interview"}}]},"videos":{"edges":[{"node":{"title":"Problem 161 - One Edit Distance","path":"/en/videos/2018-08-08-161-one-edit-distance/","id":"08cc5fc6-3048-527f-b32e-6deca84a5d98","contentful_id":"1qvE36uuHCMeEWY6qqkkcG","date":"2018-08-08T17:00-08:00","featured":true,"node_locale":"en-US","sectionId":"coding-interview","section":"Coding Practice Questions","tags":["Facebook","Snap","Uber","Twitter","String"],"videoDuration":"08:44","description":{"description":"LeetCode 161 - One Edit Distance | Facebook, Snap, Uber, Twitter Interview Questions | String"},"thumbnail":{"id":"4446c61d-0638-5887-909c-4354656fcfa9","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":"dab410d7-83a8-5d6f-9654-515d90bae0bb","body":"Facebook, Snap, Uber, Twitter Interview Questions\n\nString\n\nMedium"}}},{"node":{"title":"Problem 138 - Copy List with Random Pointer","path":"/en/videos/2018-08-01-138-copy-list-with-random-pointer/","id":"935377dd-5956-5cd6-8fb9-3671e22d6d2a","contentful_id":"41tEe4dalyK2asMoQa4yMo","date":"2018-08-01T17:00-08:00","featured":false,"node_locale":"en-US","sectionId":"coding-interview","section":"Coding Practice Questions","tags":["Bloomberg","Uber","Amazon","Microsoft","Hash Table","Linked List"],"videoDuration":"16:08","description":{"description":"LeetCode 138 - Copy list with random pointer | Bloomberg, Uber, Amazon, Microsoft Interview Questions | Hash Table, Linked List"},"thumbnail":{"id":"77d10315-0ca8-506d-9461-4c8316901b14","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":"46a4a26e-9315-589d-a26f-0d1249a0d301","body":"Bloomberg, Uber, Amazon, Microsoft Interview Questions\n\nHash Table, Linked List\n\nMedium"}}},{"node":{"title":"Problem 220 - Contains Duplicate III","path":"/en/videos/2018-07-23-220-contains-duplicate-3/","id":"6efe491c-022c-5161-a072-ce0a6ca71d80","contentful_id":"1TPTGkGV2EKc6YkWo6e4U8","date":"2018-07-23T17:00-08:00","featured":false,"node_locale":"en-US","sectionId":"coding-interview","section":"Coding Practice Questions","tags":["Airbnb","Binary Search Tree","Bucket","Sliding Window"],"videoDuration":"25:12","description":{"description":"LeetCode 220 - Contains Duplicate III | Airbnb Interview Questions | Binary Search Tree, Bucket, Sliding Window"},"thumbnail":{"id":"06e4bb0d-7687-593f-b035-87f7b59ed76a","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, Contains Duplicate III","body":{"id":"1bc2f780-9dcc-5fca-b387-036b224f09dc","body":"Airbnb Interview Questions\n\nBinary Search Tree, Bucket, Sliding Window\n\nMidium"}}},{"node":{"title":"Problem 652 - Find Duplicate Subtrees","path":"/en/videos/2018-06-18-652-find-duplicate-subtrees/","id":"ccf51598-cd5c-532e-8212-a7b12a44389b","contentful_id":"6oPqn2Gdyw8AokqsUAEGci","date":"2018-06-18T17:00-08:00","featured":true,"node_locale":"en-US","sectionId":"coding-interview","section":"Coding Practice Questions","tags":["Google","Tree"],"videoDuration":"20:28","description":{"description":"LeetCode 652 - Find the duplicate Subtrees | Google Interview Questions | Tree"},"thumbnail":{"id":"10ae080a-bfa1-5ec1-bf22-5e6de6463c2d","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, Find Duplicate Subtrees","body":{"id":"ec6755e9-752b-5a39-97de-9946cffcc8d6","body":"Google Interview Questions\n\nTree\n\nMidium"}}},{"node":{"title":"Problem 23 - Merge K Sorted Lists","path":"/en/videos/2018-07-09-merge-k-sorted-lists/","id":"1592a6e5-cb4e-56c7-a9da-1779e6c75ec5","contentful_id":"f4LCFtE5NuCM2Im8oYC0s","date":"2018-07-09T17:00-08:00","featured":false,"node_locale":"en-US","sectionId":"coding-interview","section":"Coding Practice Questions","tags":["Google","Facebook","Microsoft","Amazon","Uber","LinkedIn","Airbnb","Twitter","Linked List","Divide and Conquer","Heap"],"videoDuration":"16:01","description":{"description":"LeetCode 23 - Merge K Sorted Lists | Google, Facebook, Microsoft, Amazon, Uber, LinkedIn, Airbnb, Twitter interview questions | Linked List, Divide and Conquer, Heap"},"thumbnail":{"id":"43d37f6c-d28e-5fce-867f-86616267a53d","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":"Problem 23, merge k sorted lists","body":{"id":"dc0ec762-21fa-51ef-b03f-b81610abbc9f","body":"Google, Facebook, Microsoft, Amazon, Uber, LinkedIn, Airbnb, Twitter interview questions\n\nLinked List, Divide and Conquer, Heap\n\nHard"}}},{"node":{"title":"Problem 56 - Merge Intervals","path":"/en/videos/2018-07-03-56-merge-intervals/","id":"81018146-31f2-51c9-b564-5b51113d8d2e","contentful_id":"26I8vhtVDiyK8MUKmaSU08","date":"2018-07-03T17:00-08:00","featured":false,"node_locale":"en-US","sectionId":"coding-interview","section":"Coding Practice Questions","tags":["Google","Facebook","Microsoft","Bloomberg","LinkedIn","Twitter","Yelp","Sort"],"videoDuration":"24:14","description":{"description":"LeetCode 56 - Merge Intervals | Google, Facebook, Microsoft, Bloomberg, LinkedIn, Twitter, Yelp interview questions | 考点：Sort"},"thumbnail":{"id":"a68e13ba-50ef-5f82-a93b-593838fea65c","resolutions":{"width":800,"height":550,"src":"//images.ctfassets.net/04k2xg9gplcj/2tMO9zf4POGCwsEqoGe8gY/cf0ff346306a36a550103b2c69cb0d87/56.jpg?w=800&h=550&q=50&fit=fill","srcSet":""}},"thumbnailAlt":"Problem 56, merge intervals","body":{"id":"16e877d2-8c30-5484-aad6-c1ad25c7bf02","body":"Google, Facebook, Microsoft, Bloomberg, LinkedIn, Twitter, Yelp interview questions\n\nSort\n\nMidium\n\n"}}},{"node":{"title":"Problem 17 - Letter Combinations of A Phone Number","path":"/en/videos/2018-06-25-17-letter-combinations-of-a-phone-number/","id":"99cadf1f-3861-52b8-b64a-48eab0b6c04c","contentful_id":"HObWvPUJGgaqiSiOuaa6K","date":"2018-06-25T17:00-08:00","featured":false,"node_locale":"en-US","sectionId":"coding-interview","section":"Coding Practice Questions","tags":["Google","Facebook","Amazon","Uber","Backtracking","String"],"videoDuration":"26:48","description":{"description":"LeetCode 17 - Letter Combinations of A Phone Number | Google, Facebook, Amazon, Uber Interview Questions | Backtracking, String"},"thumbnail":{"id":"86d07509-e5f2-532e-b7c3-26cc64373cfa","resolutions":{"width":800,"height":550,"src":"//images.ctfassets.net/04k2xg9gplcj/3r47Q9gwRWYSiSWsyoeayS/52a64076359e1604eadbc7750affeef2/17.jpg?w=800&h=550&q=50&fit=fill","srcSet":""}},"thumbnailAlt":"Problem 17, Letter Combinations of A Phone Number","body":{"id":"56e8a89a-b4f6-57af-a241-9bfeaf729356","body":"Google, Facebook, Amazon, Uber Interview Questions\n\nacktracking, String\n\nMidium"}}},{"node":{"title":"Problem 450 - Delete Node in a BST","path":"/en/videos/2018-06-13-450-delete-node-in-a-bst/","id":"d1c9e047-49e5-534c-bf2b-ef1b50286cfc","contentful_id":"b2eNXHmccEiaAmcIQIuca","date":"2018-06-13T17:00-08:00","featured":false,"node_locale":"en-US","sectionId":"coding-interview","section":"Coding Practice Questions","tags":["Google","Uber","Tree"],"videoDuration":"11:40","description":{"description":"LeetCode 450 - Delete Node in a BST | Google, Uber Interview Questions | Tree"},"thumbnail":{"id":"9d639ae3-a58f-5054-a8ed-c28baed66d5f","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, Delete Node in a BST","body":{"id":"13f8165c-dc8e-5a70-8a8a-76f4d911c754","body":"Google, Uber Interview Questions\n\nTree\n\nMidium"}}},{"node":{"title":"Problem 219 - Contains Duplicate II","path":"/en/videos/2018-06-06-219-contains-duplicate-2/","id":"b7dab431-943f-518c-92ab-f0e0d9d74782","contentful_id":"1K8jGtne8sQEa8AG4m6UcI","date":"2018-06-06T17:00-08:00","featured":false,"node_locale":"en-US","sectionId":"coding-interview","section":"Coding Practice Questions","tags":["Airbnb","Array","Hash Table","Sliding Window"],"videoDuration":"12:09","description":{"description":"LeetCode 219 - Contains Duplicate II | Airbnb Interview Questions | Array, Hash Table, Sliding Window"},"thumbnail":{"id":"7e657a8e-0307-5bf2-a14c-23157ea652c9","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, Contains Duplicate II","body":{"id":"062c6968-d650-5343-b4c0-89d2bf37757d","body":"Airbnb Interview Questions\n\nArray, Hash Table, Sliding Window\n\nEasy"}}},{"node":{"title":"Problem 503 - Next Greater Element II","path":"/en/videos/2018-05-29-503-next-greater-element/","id":"b27be0a9-f51f-513e-af65-bb00bac4785b","contentful_id":"3qt3ooMfdYUWguU8YyI4wu","date":"2018-05-29T15:00-08:00","featured":false,"node_locale":"en-US","sectionId":"coding-interview","section":"Coding Practice Questions","tags":["Google","Array","Monotone Stack"],"videoDuration":"22:21","description":{"description":"LeetCode 503 - next greater element II | Google Interview Questions | Array, Monotone Stack"},"thumbnail":{"id":"a336eb02-0aed-577c-86e5-ef574c5a9a0b","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, Next Greater Elements II","body":{"id":"e84f6445-2f34-5a03-8616-70c9c75ba18b","body":"Google Interview Questions\n\nArray, Monotone Stack\n\nMidium"}}},{"node":{"title":"Problem 200 - Number of Islands","path":"/en/videos/2018-04-11-200-number-of-islands/","id":"8c6beced-04a4-5186-8419-c3ab59f77095","contentful_id":"266jm1kYygqWAA2s62KcsK","date":"2018-04-11T12:00-08:00","featured":false,"node_locale":"en-US","sectionId":"coding-interview","section":"Coding Practice Questions","tags":["Google","Facebook","Microsoft","Amazon","DFS","BFS","Union Find"],"videoDuration":"23:10","description":{"description":"LeetCode 200 - number of islands | Google, Facebook, Microsoft, Amazon Interview Questions | DFS, BFS, Union Find"},"thumbnail":{"id":"b427d360-ae0d-5c21-8744-9380c63a891e","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, Number of Islands","body":{"id":"b2956ac8-4e1e-5c26-a29f-46a73b89ef87","body":"Google，Facebook, Microsoft, Amazon Coding Interview Questions\n\nDFS, BFS, Union Find\n\nMidium"}}},{"node":{"title":"Problem 277 - Find the Celebrity","path":"/en/videos/2018-05-07-277-find-the-celebrity/","id":"fee7955c-4909-5b58-8047-268fbcac15bf","contentful_id":"2xiylBHVFGAgGoI6OmWYOs","date":"2018-05-07T14:00-08:00","featured":false,"node_locale":"en-US","sectionId":"coding-interview","section":"Coding Practice Questions","tags":["Google","Facebook","Graph"],"videoDuration":"21:01","description":{"description":"LeetCode 277 - Find the Celebrity | Facebook, LinkedIn Interview Questions | Graph"},"thumbnail":{"id":"c0caa30d-6aa0-50a5-80a8-bba57b6f0cb1","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, Find the Celebrity","body":{"id":"d07c59f8-d9e9-50ad-947a-f8459efb8301","body":"Facebook, LinkedIn Interview Questions\n\nGraph\n\nMidium"}}},{"node":{"title":"Problem 332 - Reconstruct Itinerary","path":"/en/videos/2018-03-14-332-reconstruct-itinerary/","id":"ebeaa0c1-c1ae-579e-af88-182ba8fab0d4","contentful_id":"6KeV8uBBCMKi2wOKgieuoO","date":"2018-03-14T04:29-08:00","featured":true,"node_locale":"en-US","sectionId":"coding-interview","section":"Coding Practice Questions","tags":["Google","Yelp","Graph","DFS"],"videoDuration":"14:31","description":{"description":"LeetCode 332 - Reconstruct Itinerary | Google, Yelp coding interview questions | Graph, DFS\n"},"thumbnail":{"id":"38f1ee62-d3e7-5387-b001-a9ddbeac10c8","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":"c48efcdf-f020-5832-bdac-940a387d4ad0","body":"Google, Yelp Coding Interview Questions\n\nGraph, DFS\n\nMedium\n"}}},{"node":{"title":"Problem 199 - Binary Tree Right Side View","path":"/en/videos/2018-05-21-199-binary-tree-right-side-view/","id":"f532fcd4-637e-576b-9647-1611396ac594","contentful_id":"4JsftJC3bWqKm8gckCMiU4","date":"2018-05-21T18:30-08:00","featured":false,"node_locale":"en-US","sectionId":"coding-interview","section":"Coding Practice Questions","tags":["Google","Facebook","Amazon","Yelp","Tree","DFS","BFS"],"videoDuration":"16:12","description":{"description":"LeetCode 199 - Binary Tree Right Side View | Google, Facebook, Amazon, Yelp coding interview questions | Tree, DFS, BFS\n"},"thumbnail":{"id":"8a76fd83-dd13-5a70-8e73-b74b02c4ffa9","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":"0f022c6d-7c52-5c84-94c1-4de315e4a4d5","body":"Google, Facebook, Amazon, Yelp coding interview questions \n\nTree, DFS, BFS\n\nMedium\n\n\n"}}},{"node":{"title":"Problem 91 - Decode Ways","path":"/en/videos/2018-05-14-91-decode-ways/","id":"4f178802-dbdc-53fd-93b4-5e165baf07b7","contentful_id":"g6ibmnSq4wyMUa2Eiu0Wy","date":"2018-05-14T17:00-08:00","featured":false,"node_locale":"en-US","sectionId":"coding-interview","section":"Coding Practice Questions","tags":["Facebook","Microsoft","Uber","Dynamic Programming","String"],"videoDuration":"11:28","description":{"description":"LeetCode 91 - Decode Ways | Facebook, Microsoft, Uber Interview Questions | DP, String"},"thumbnail":{"id":"b8d67c4d-c125-5267-8876-e764ad7c1dea","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":"b54e6d31-a3d5-5cf9-b227-4ffb6410bddc","body":"Facebook, Microsoft, Uber Interview Questions\n\nDP, String\n\nMedium"}}},{"node":{"title":"Problem 632 - Smallest Range","path":"/en/videos/2018-04-30-632-smallest-range/","id":"8988ca82-c707-56fc-8d7d-6c64fe426353","contentful_id":"2XC6ox3jKMMkA6wqW6Aoea","date":"2018-05-01T12:00-08:00","featured":false,"node_locale":"en-US","sectionId":"coding-interview","section":"Coding Practice Questions","tags":["Google","Lyft","Heap"],"videoDuration":"19:41","description":{"description":"LeetCode 632 - smallest range | Google, Lyft Interview Questions | Heap"},"thumbnail":{"id":"936cbd8c-9a0c-5566-ba5e-107961614816","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, Smallest Range","body":{"id":"fe4653e3-1e25-5fa5-a010-e69149d8e463","body":"Google, Lyft Interview Questions\n\nHeap\n\nHard"}}},{"node":{"title":"Problem 322 - Coin Change","path":"/en/videos/2018-04-23-322-coin-change/","id":"6b0b1bab-74eb-5a6a-b3b4-cafc2095a885","contentful_id":"5xUggRGclq6Yyo0EmMACwM","date":"2018-04-23T15:00-08:00","featured":false,"node_locale":"en-US","sectionId":"coding-interview","section":"Coding Practice Questions","tags":["Google","Amazon","Yahoo","Microsoft","Dynamic Programming"],"videoDuration":"25:58","description":{"description":"LeetCode 322 - Coin Change | Google, Amazon, Yahoo, Microsoft coding interview questions | Dynamic Programming"},"thumbnail":{"id":"83bb1eb4-76e0-52d2-8646-a0fdc658d260","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":"ae636c31-64f9-5169-8eca-77befbcc79c5","body":"Google, Amazon, Yahoo, Microsoft Coding Interview Questions\n\nDynamic Programming\n\nMidium"}}},{"node":{"title":"Problem 224 - Basic Calculator","path":"/en/videos/2018-03-13-224-basic-calculator/","id":"21e63857-e054-5ff4-89b5-872e67a23c0d","contentful_id":"6Aa9k7P7sQGkQeugiOqKwW","date":"2018-03-13T17:00-08:00","featured":false,"node_locale":"en-US","sectionId":"coding-interview","section":"Coding Practice Questions","tags":["Google","Expression Tree","Recursion","Stack"],"videoDuration":"17:11","description":{"description":"LeetCode 224 - Basic Calculator | Google coding interview questions | Math, Expression Tree, Recursion, Stack\n"},"thumbnail":{"id":"730d3cd0-873d-563d-b777-6242829d1911","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 Basic Calculator","body":{"id":"328a1309-905f-5cc2-bdef-be6eb03b4714","body":"Google Coding Interview Questions\n\nMath, Expression Tree, Recursion, Stack\n\nHard"}}},{"node":{"title":"Problem 243/244/245 - Shortest Word Distance","path":"/en/videos/2018-04-16-243-shortest-word-distance/","id":"fe34da4a-ccd7-5662-adee-4b6f59680ab7","contentful_id":"4klYnst5WoqqGkEwmySEkY","date":"2018-04-16T15:00-08:00","featured":false,"node_locale":"en-US","sectionId":"coding-interview","section":"Coding Practice Questions","tags":["Facebook","LinkedIn","Hash Table","Design","Invert Index"],"videoDuration":"32:46","description":{"description":"LeetCode 243/244/245 - Shortest Word Distance | Facebook, LinkedIn Interview Questions | Hash Table, Design, Invert Index"},"thumbnail":{"id":"f7b9efee-bac3-5d4c-a861-be5ded269393","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, shortest word distance","body":{"id":"b7259a73-eb3a-5176-9b7f-bbaf8a42ee5a","body":"Facebook, LinkedIn Interview Questions\n\nHash Table, Design, Invert Index\n\nMidium"}}},{"node":{"title":"Problem 496 - Next Greater Elements I","path":"/en/videos/2018-04-23-496-next-greater-elements/","id":"038c8d03-73dd-55f6-bfd4-3648387a91d2","contentful_id":"2wD1IxMceY2giQAuc4O4EQ","date":"2018-04-23T15:00-08:00","featured":false,"node_locale":"en-US","sectionId":"coding-interview","section":"Coding Practice Questions","tags":["Google","Array","Monotone Stack"],"videoDuration":"19:58","description":{"description":"LeetCode 496 - Next Greater Elements I | Google coding interview questions | Array, Monotone Stack"},"thumbnail":{"id":"f3b2476d-fddd-522a-9242-d73ed2095c0e","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 Next Greater Elements","body":{"id":"cc2fc9c2-5bbf-5ecd-a013-793aed5a7a97","body":"Google Coding Interview Questions\n\nArray, Monotone Stack\n\nEasy"}}},{"node":{"title":"Problem 33 - Search in Rotated Sorted Array","path":"/en/videos/2018-04-16-33-search-in-rotated-sorted-array/","id":"62acb348-810d-5000-b809-afe664cb8ce2","contentful_id":"3StXUEFbhYWEsmAsYe8WgI","date":"2018-04-16T15:00-08:00","featured":false,"node_locale":"en-US","sectionId":"coding-interview","section":"Coding Practice Questions","tags":["Facebook","Microsoft","Bloomberg","Uber","LinkedIn","Array","Binary Search"],"videoDuration":"09:04","description":{"description":"LeetCode 33 - search in rotated sorted array |  Facebook, Microsoft, Bloomberg, Uber, LinkedIn Interview Questions | Array, Binary Search"},"thumbnail":{"id":"60672b0a-3e3f-5a46-9e10-0692ce3074ee","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, Search in Rotated Sorted Array","body":{"id":"b67c208f-c485-556e-9fd6-4b843d3cbede","body":"Facebook, Microsoft, Bloomberg, Uber, LinkedIn Coding Interview Questions\n\nArray, Binary Search\n\nMidium"}}},{"node":{"title":"Problem 518 - Coin Change II","path":"/en/videos/2018-03-08-518-coin-change-2/","id":"8db42008-ff89-5ed6-9bbe-7ee1c86116f7","contentful_id":"5lktp1EZQ48S0kaoG0KGcQ","date":"2018-03-08T04:29-08:00","featured":false,"node_locale":"en-US","sectionId":"coding-interview","section":"Coding Practice Questions","tags":["Google","Facebook","Yahoo","Microsoft","Dynamic Programming"],"videoDuration":"21:15","description":{"description":"LeetCode 518 Coin Chage 2 | Google、Facebook、Yahoo，Microsoft coding interview questions| Dynamic Programming"},"thumbnail":{"id":"b8bcdead-c1ae-5cf1-97f4-1979d0dadb95","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 Chage 2","body":{"id":"38a1faf6-b5a5-5171-85d5-210413c7aa49","body":"Google、Facebook、Yahoo，Microsoft Coding Interview Questions\n\nDynamic Programming\n\nMedium"}}},{"node":{"title":"Problem 76 - Minimum Window Substring","path":"/en/videos/2018-03-12-76-minimum-window-substring/","id":"19629faf-1ea4-5738-9679-338a7cb3e8c9","contentful_id":"K3djBQEGWIUSAw8Agwmyu","date":"2018-03-12T04:29-08:00","featured":true,"node_locale":"en-US","sectionId":"coding-interview","section":"Coding Practice Questions","tags":["Facebook","Linkedin","Uber","Snap","Two Pointer","String","Hash Table"],"videoDuration":"37:06","description":{"description":"LeetCode 76 - Minimum Window Substring | Facebook, LinkedIn, Uber, Snapchat coding interview questions | String, Hash Table, Two Pointers"},"thumbnail":{"id":"b66be037-b3fd-5d6e-b3e0-c51a264892e6","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 Minimum Window Substring","body":{"id":"16ad2d6d-8522-5381-929b-362a61a9c38c","body":"Facebook, LinkedIn, Uber, Snapchat\n\nString, Hash Table, Two Pointers\n\nHard"}}},{"node":{"title":"Problem 560 - Subarray Sum Equals K","path":"/en/videos/2018-04-02-560-subarray-sum-equals-k/","id":"ca10af9b-78f2-551f-ab07-42223e20d175","contentful_id":"7CUSHe7mtUMc6WMaqoes4C","date":"2018-04-02T12:00-08:00","featured":false,"node_locale":"en-US","sectionId":"coding-interview","section":"Coding Practice Questions","tags":["Google","Facebook","Array","Hash Table","Prefix Sum"],"videoDuration":"26:31","description":{"description":"LeetCode 560 - subarray sum equals K | Google, Facebook Interview Questions | Array, Hash Table, Prefix Sum"},"thumbnail":{"id":"3e9ab93c-c844-5d85-9232-2693f248cba2","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, Subarray Sum Equals K","body":{"id":"4f93cd13-1b62-52e8-be06-4e2af11745b5","body":"Google，Facebook Coding Interview Questions\n\nArray, Hash Table, Prefix Sum\n\nMidium"}}},{"node":{"title":"Problem 124 - Binary Tree Maximum Path Sum","path":"/en/videos/2018-03-12-124-binary-tree-maximum-path-sum/","id":"3450bc7d-d79a-5822-97ab-a13335c0a7d4","contentful_id":"9EX8fuan9CYWuaGyw0sqI","date":"2018-03-12T04:29-08:00","featured":false,"node_locale":"en-US","sectionId":"coding-interview","section":"Coding Practice Questions","tags":["Google","Facebook","Amazon","Microsoft","Recursion","DFS"],"videoDuration":"21:26","description":{"description":"LeetCode 124 - Binary Tree Maximum Path Sum | Google，Facebook, Amazon, Microsoft coding interview questions | Recursion、DFS"},"thumbnail":{"id":"12b6fe45-bb70-5f01-91a8-69aa03d5608c","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, Binary Tree Maximum Path Sum","body":{"id":"b8d6b97d-5b58-5107-b1da-05914005eb5b","body":"Google，Facebook, Amazon, Microsoft Coding Interview Questions\n\nRecursion、DFS\n\nHard"}}},{"node":{"title":"Problem 75 - Sort Colors","path":"/en/videos/2018-03-12-75-sort-colors/","id":"932beb49-fd8c-51b9-99e6-850dd2605719","contentful_id":"3mYoLqWJDa2qiMoGoWeqK6","date":"2018-03-12T04:29-08:00","featured":false,"node_locale":"en-US","sectionId":"coding-interview","section":"Coding Practice Questions","tags":["Facebook","Microsoft","Two Pointers","Sort","Array"],"videoDuration":"20:08","description":{"description":"LeetCode 75 - Sort Colors | Facebook,  Microsoft coding interview questions | Two Pointers、Sort、Array"},"thumbnail":{"id":"9eae19ee-a825-53bf-863b-1a339a674fff","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 Sort Colors","body":{"id":"f644d04a-88ea-5f5e-b7c1-d1acc8d24598","body":"Facebook,  Microsoft Coding Interview Questions\n\nTwo Pointers, Sort, Array\n\nMedium"}}},{"node":{"title":"Problem 309 - Best Time to Buy and Sell Stock with Cooldown","path":"/en/videos/2018-03-26-309-best-time-to-buy-and-sell-stock-with-cooldown/","id":"32733df1-7c43-5dcd-8f3b-151e8d56d033","contentful_id":"5IhhaVUPBuioQwES0Swogy","date":"2018-03-28T16:00-08:00","featured":false,"node_locale":"en-US","sectionId":"coding-interview","section":"Coding Practice Questions","tags":["Google","Facebook","DP"],"videoDuration":"11:51","description":{"description":"LeetCode 309 - Best Time to Buy and Sell Stock with Cooldown | Google，Facebook coding interview questions | Dynamic Programming(DP)"},"thumbnail":{"id":"c7b1cf49-8801-5deb-ba5a-9abf3d6f2f44","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, Best Time to Buy and Sell Stock with Cooldown","body":{"id":"f5231536-2620-560b-b695-63d3811d5579","body":"Google，FacebookCoding Interview Questions\n\nDP\n\nMedium"}}},{"node":{"title":"Problem 692 - Top K Frequent Words","path":"/en/videos/2018-03-13-692-top-k-frequent-words/","id":"39cafe44-161a-5be4-a69c-c92dfba069e4","contentful_id":"M8gsnooTAcQG2IgAEUGwK","date":"2018-03-13T17:00-08:00","featured":false,"node_locale":"en-US","sectionId":"coding-interview","section":"Coding Practice Questions","tags":["Amazon","Bloomberg","Uber","Yelp","Hash Table","Heap"],"videoDuration":"28:56","description":{"description":"LeetCode 692 - Top K Frequent Words | Amazon, Bloomberg, Uber, Yelp coding interview questions | Hash Table, Heap"},"thumbnail":{"id":"8f87a82d-2ef1-57c0-8e6a-0e67852c85f3","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 Top K Frequent Words","body":{"id":"63c5ce75-6dca-583b-b733-167ac9108bc9","body":"Amazon, Bloomberg, Uber, Yelp Coding Interview Questions\n\nHash Table, Heap\n\nMedium"}}},{"node":{"title":"Problem 516 - Longest Palindromic Subsequence","path":"/en/videos/2018-03-14-516-longest-palindromic-subsequence/","id":"ee36d7bb-c420-5b8f-b2e4-2e2ff3320745","contentful_id":"32lJZc5aFqeO0SGmumYcw","date":"2018-03-14T04:29-08:00","featured":false,"node_locale":"en-US","sectionId":"coding-interview","section":"Coding Practice Questions","tags":["Google","Amazon","Uber","DP"],"videoDuration":"14:02","description":{"description":"LeetCode 516 - Longest Palindromic Subsequence | Google, Amazon, Uber coding interview questions | Dynamic Programming"},"thumbnail":{"id":"ac2b7fe6-3b77-53bf-b0e7-6522a99bb1c6","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 Longest Palindromic Subsequence","body":{"id":"f484f3ca-dabf-5dc8-8290-3943dbb16ed4","body":"Google, Amazon, Uber Coding Interview Questions\n\nDynamic Programming\n\nMedium"}}}]}},"pageContext":{"isCreatedByStatefulCreatePages":true,"slug":"/en/videos/coding-interview/","langKey":"en"}}}