Title: Add team blind's curated list · Issue #28 · AlgorithmCrackers/Interview-Questions · GitHub
Open Graph Title: Add team blind's curated list · Issue #28 · AlgorithmCrackers/Interview-Questions
X Title: Add team blind's curated list · Issue #28 · AlgorithmCrackers/Interview-Questions
Description: https://www.teamblind.com/post/New-Year-Gift---Curated-List-of-Top-75-LeetCode-Questions-to-Save-Your-Time-OaM1orEU Array Two Sum Easy Best Time to Buy and Sell Stock Easy Contains Duplicate Easy Product of Array Except Self Medium Maxim...
Open Graph Description: https://www.teamblind.com/post/New-Year-Gift---Curated-List-of-Top-75-LeetCode-Questions-to-Save-Your-Time-OaM1orEU Array Two Sum Easy Best Time to Buy and Sell Stock Easy Contains Duplicate Easy P...
X Description: https://www.teamblind.com/post/New-Year-Gift---Curated-List-of-Top-75-LeetCode-Questions-to-Save-Your-Time-OaM1orEU Array Two Sum Easy Best Time to Buy and Sell Stock Easy Contains Duplicate Easy P...
Opengraph URL: https://github.com/AlgorithmCrackers/Interview-Questions/issues/28
X: @github
Domain: patch-diff.githubusercontent.com
{"@context":"https://schema.org","@type":"DiscussionForumPosting","headline":"Add team blind's curated list","articleBody":"https://www.teamblind.com/post/New-Year-Gift---Curated-List-of-Top-75-LeetCode-Questions-to-Save-Your-Time-OaM1orEU\r\n\r\n# Array\r\n\r\n- [x] [Two Sum](../blob/master/00_Arrays/coupleSum) `Easy`\r\n- [x] [Best Time to Buy and Sell Stock](../blob/master/00_Arrays/best-time-to-buy-and-sell-stock) `Easy`\r\n- [x] [Contains Duplicate](../blob/master/00_Arrays/ContainsDuplicate) `Easy`\r\n- [x] [Product of Array Except Self](../blob/master/00_Arrays/product-of-array-except-self) `Medium`\r\n- [x] [Maximum Subarray](../blob/master/00_Arrays/MaximumSubArray/) `Easy`\r\n- [x] [Maximum Product Subarray](../blob/master/00_Arrays/maximum-product-subarray) `Medium`\r\n- [x] [Find Minimum in Rotated Sorted Array](../blob/master/00_Arrays/find-minimum-in-rotated-sorted-array) `Medium`\r\n- [ ] Search in Rotated Sorted Array - https://leetcode.com/problems/search-in-rotated-sorted-array/\r\n- [ ] 3Sum - https://leetcode.com/problems/3sum/\r\n- [ ] Container With Most Water - https://leetcode.com/problems/container-with-most-water/\r\n\r\n# Binary\r\n\r\n- [ ] Sum of Two Integers - https://leetcode.com/problems/sum-of-two-integers/\r\n- [ ] Number of 1 Bits - https://leetcode.com/problems/number-of-1-bits/\r\n- [ ] Counting Bits - https://leetcode.com/problems/counting-bits/\r\n- [ ] Missing Number - https://leetcode.com/problems/missing-number/\r\n- [ ] Reverse Bits - https://leetcode.com/problems/reverse-bits/\r\n\r\n# Dynamic Programming\r\n\r\n- [ ] Climbing Stairs - https://leetcode.com/problems/climbing-stairs/\r\n- [ ] Coin Change - https://leetcode.com/problems/coin-change/\r\n- [ ] Longest Increasing Subsequence - https://leetcode.com/problems/longest-increasing-subsequence/\r\n- [ ] Longest Common Subsequence - https://leetcode.com/problems/longest-common-subsequence/\r\n- [ ] Word Break Problem - https://leetcode.com/problems/word-break/\r\n- [ ] Combination Sum - https://leetcode.com/problems/combination-sum-iv/\r\n- [ ] House Robber - https://leetcode.com/problems/house-robber/\r\n- [ ] House Robber II - https://leetcode.com/problems/house-robber-ii/\r\n- [ ] Decode Ways - https://leetcode.com/problems/decode-ways/\r\n- [ ] Unique Paths - https://leetcode.com/problems/unique-paths/\r\n- [ ] Jump Game - https://leetcode.com/problems/jump-game/\r\n\r\n# Graph\r\n\r\n- [ ] Clone Graph - https://leetcode.com/problems/clone-graph/\r\n- [ ] Course Schedule - https://leetcode.com/problems/course-schedule/\r\n- [ ] Pacific Atlantic Water Flow - https://leetcode.com/problems/pacific-atlantic-water-flow/\r\n- [ ] Number of Islands - https://leetcode.com/problems/number-of-islands/\r\n- [ ] Longest Consecutive Sequence - https://leetcode.com/problems/longest-consecutive-sequence/\r\n- [ ] Alien Dictionary (Leetcode Premium) - https://leetcode.com/problems/alien-dictionary/\r\n- [ ] Graph Valid Tree (Leetcode Premium) - https://leetcode.com/problems/graph-valid-tree/\r\n- [ ] Number of Connected Components in an Undirected Graph (Leetcode Premium) - https://leetcode.com/problems/number-of-connected-components-in-an-undirected-graph/\r\n\r\n# Interval\r\n\r\n- [x] [Insert Interval](../blob/master/00_Arrays/insert-interval) `Hard`\r\n- [x] [Merge Intervals](../blob/master/00_Arrays/merge-intervals/) `Medium`\r\n- [ ] Non-overlapping Intervals - https://leetcode.com/problems/non-overlapping-intervals/\r\n- [ ] Meeting Rooms (Leetcode Premium) - https://leetcode.com/problems/meeting-rooms/\r\n- [ ] Meeting Rooms II (Leetcode Premium) - https://leetcode.com/problems/meeting-rooms-ii/\r\n\r\n# Linked List\r\n\r\n- [x] [Reverse a Linked List](../blob/master/02_LinkedLists/reverse-linked-list) `Easy`\r\n- [ ] Detect Cycle in a Linked List - https://leetcode.com/problems/linked-list-cycle/\r\n- [x] [Merge Two Sorted Lists](../blob/master/02_LinkedLists/merge-two-sorted-lists) `Easy`\r\n- [x] [Merge K Sorted Lists](../blob/master/02_LinkedLists/merge-k-sorted-lists) `Hard`\r\n- [ ] Remove Nth Node From End Of List - https://leetcode.com/problems/remove-nth-node-from-end-of-list/\r\n- [ ] Reorder List - https://leetcode.com/problems/reorder-list/\r\n\r\n# Matrix\r\n\r\n- [x] [Set Matrix Zeroes](../blob/master/00_Arrays/set-matrix-zeroes) `Medium`\r\n- [ ] Spiral Matrix - https://leetcode.com/problems/spiral-matrix/\r\n- [x] [Rotate Image](../blob/master/00_Arrays//rotate-image/) `Medium`\r\n- [ ] Word Search - https://leetcode.com/problems/word-search/\r\n\r\n# String\r\n\r\n- [x] [Longest Substring Without Repeating Characters](../blob/master/01_Strings/longest-substring-without-repeating-characters) `Medium`\r\n- [ ] Longest Repeating Character Replacement - https://leetcode.com/problems/longest-repeating-character-replacement/\r\n- [ ] Minimum Window Substring - https://leetcode.com/problems/minimum-window-substring/\r\n- [x] [Valid Anagram](../blob/master/01_Strings/isAnagram) `Easy`\r\n- [ ] Group Anagrams - https://leetcode.com/problems/group-anagrams/\r\n- [ ] Valid Parentheses - https://leetcode.com/problems/valid-parentheses/\r\n- [ ] Valid Palindrome - https://leetcode.com/problems/valid-palindrome/\r\n- [ ] Longest Palindromic Substring - https://leetcode.com/problems/longest-palindromic-substring/\r\n- [ ] Palindromic Substrings - https://leetcode.com/problems/palindromic-substrings/\r\n- [ ] Encode and Decode Strings (Leetcode Premium) - https://leetcode.com/problems/encode-and-decode-strings/\r\n\r\n# Tree\r\n\r\n- [x] [Maximum Depth of Binary Tree](../blob/master/04_Trees_and_Graphs/maximum-depth-of-binary-tree) `Easy`\r\n- [x] [Same Tree](../blob/master/04_Trees_and_Graphs/sameTree) `Easy`\r\n- [x] [Invert/Flip Binary Tree](../blob/master/04_Trees_and_Graphs/invert-binary-tree/) `Easy`\r\n- [ ] Binary Tree Maximum Path Sum - https://leetcode.com/problems/binary-tree-maximum-path-sum/\r\n- [ ] Binary Tree Level Order Traversal - https://leetcode.com/problems/binary-tree-level-order-traversal/\r\n- [ ] Serialize and Deserialize Binary Tree - https://leetcode.com/problems/serialize-and-deserialize-binary-tree/\r\n- [ ] Subtree of Another Tree - https://leetcode.com/problems/subtree-of-another-tree/\r\n- [ ] Construct Binary Tree from Preorder and Inorder Traversal - https://leetcode.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal/\r\n- [ ] Validate Binary Search Tree - https://leetcode.com/problems/validate-binary-search-tree/\r\n- [ ] Kth Smallest Element in a BST - https://leetcode.com/problems/kth-smallest-element-in-a-bst/\r\n- [ ] Lowest Common Ancestor of BST - https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-search-tree/\r\n- [ ] Implement Trie (Prefix Tree) - https://leetcode.com/problems/implement-trie-prefix-tree/\r\n- [ ] Add and Search Word - https://leetcode.com/problems/add-and-search-word-data-structure-design/\r\n- [ ] Word Search II - https://leetcode.com/problems/word-search-ii/\r\n\r\n# Heap\r\n\r\n- [ ] Merge K Sorted Lists - https://leetcode.com/problems/merge-k-sorted-lists/\r\n- [ ] Top K Frequent Elements - https://leetcode.com/problems/top-k-frequent-elements/\r\n- [ ] Find Median from Data Stream - https://leetcode.com/problems/find-median-from-data-stream/\r\n","author":{"url":"https://github.com/santhoshvai","@type":"Person","name":"santhoshvai"},"datePublished":"2020-01-04T22:12:31.000Z","interactionStatistic":{"@type":"InteractionCounter","interactionType":"https://schema.org/CommentAction","userInteractionCount":0},"url":"https://github.com/28/Interview-Questions/issues/28"}
| route-pattern | /_view_fragments/issues/show/:user_id/:repository/:id/issue_layout(.:format) |
| route-controller | voltron_issues_fragments |
| route-action | issue_layout |
| fetch-nonce | v2:57318f12-2c26-5cde-e4d0-3a59d563ab00 |
| current-catalog-service-hash | 81bb79d38c15960b92d99bca9288a9108c7a47b18f2423d0f6438c5b7bcd2114 |
| request-id | C9F4:100F11:4D27CB:688207:6977C736 |
| html-safe-nonce | a1fe10ce3c293396c474a6476589bf01822bdac7f8e088ade587c88196b79121 |
| visitor-payload | eyJyZWZlcnJlciI6IiIsInJlcXVlc3RfaWQiOiJDOUY0OjEwMEYxMTo0RDI3Q0I6Njg4MjA3OjY5NzdDNzM2IiwidmlzaXRvcl9pZCI6IjcwOTY2NjcyNDA1Mzg4MTgzNTgiLCJyZWdpb25fZWRnZSI6ImlhZCIsInJlZ2lvbl9yZW5kZXIiOiJpYWQifQ== |
| visitor-hmac | 74f904e17c079e42050a54cf676e1e563a4c928fee5453567c12ef6fd9f5cb29 |
| hovercard-subject-tag | issue:545338753 |
| github-keyboard-shortcuts | repository,issues,copilot |
| google-site-verification | Apib7-x98H0j5cPqHWwSMm6dNU4GmODRoqxLiDzdx9I |
| octolytics-url | https://collector.github.com/github/collect |
| analytics-location | / |
| fb:app_id | 1401488693436528 |
| apple-itunes-app | app-id=1477376905, app-argument=https://github.com/_view_fragments/issues/show/AlgorithmCrackers/Interview-Questions/28/issue_layout |
| twitter:image | https://opengraph.githubassets.com/d1e3f762e3449fc2c760f0f960a2d815103b4ae59f3bf898f4582fda79670122/AlgorithmCrackers/Interview-Questions/issues/28 |
| twitter:card | summary_large_image |
| og:image | https://opengraph.githubassets.com/d1e3f762e3449fc2c760f0f960a2d815103b4ae59f3bf898f4582fda79670122/AlgorithmCrackers/Interview-Questions/issues/28 |
| og:image:alt | https://www.teamblind.com/post/New-Year-Gift---Curated-List-of-Top-75-LeetCode-Questions-to-Save-Your-Time-OaM1orEU Array Two Sum Easy Best Time to Buy and Sell Stock Easy Contains Duplicate Easy P... |
| og:image:width | 1200 |
| og:image:height | 600 |
| og:site_name | GitHub |
| og:type | object |
| og:author:username | santhoshvai |
| hostname | github.com |
| expected-hostname | github.com |
| None | dd7783bd9901db88bac6bc215af7f020bc205a04ebc67e6c7def882ef2859ecd |
| turbo-cache-control | no-preview |
| go-import | github.com/AlgorithmCrackers/Interview-Questions git https://github.com/AlgorithmCrackers/Interview-Questions.git |
| octolytics-dimension-user_id | 7671025 |
| octolytics-dimension-user_login | AlgorithmCrackers |
| octolytics-dimension-repository_id | 26155198 |
| octolytics-dimension-repository_nwo | AlgorithmCrackers/Interview-Questions |
| octolytics-dimension-repository_public | true |
| octolytics-dimension-repository_is_fork | false |
| octolytics-dimension-repository_network_root_id | 26155198 |
| octolytics-dimension-repository_network_root_nwo | AlgorithmCrackers/Interview-Questions |
| turbo-body-classes | logged-out env-production page-responsive |
| disable-turbo | false |
| browser-stats-url | https://api.github.com/_private/browser/stats |
| browser-errors-url | https://api.github.com/_private/browser/errors |
| release | 5d30081a77a5d66860584073cb38fd98fd7f9388 |
| ui-target | full |
| theme-color | #1e2327 |
| color-scheme | light dark |
Links:
Viewport: width=device-width