Ecosyste.ms: Awesome

An open API service indexing awesome lists of open source software.

Awesome Lists | Featured Topics | Projects

https://github.com/iam-abhishek-yadav/blind-75-leetcode-typescript

Blind-75 Leetcode
https://github.com/iam-abhishek-yadav/blind-75-leetcode-typescript

blind-75-leetcode-questions dsa-algorithm typescript

Last synced: about 2 months ago
JSON representation

Blind-75 Leetcode

Awesome Lists containing this project

README

        

[Blind 75 Leetcode Article ](https://leetcode.com/discuss/general-discussion/460599/blind-75-leetcode-questions)

| **Category** | **Problem** | **Solution** |
| --------------------- | ----------------------------------------------------------------------------------------------------------------------------------------------------- | ---------------------------------------------------------------------------------- |
| `Array` | [Two Sum](https://leetcode.com/problems/two-sum/) | [Solution](./Arrays/01_two_sum.ts) |
| `Array` | [Best Time to Buy and Sell Stocks](https://leetcode.com/problems/best-time-to-buy-and-sell-stock/) | [Solution](./Arrays/02_best_time_to_buy_and_sell_stock.ts) |
| `Array` | [Contains Duplicate](https://leetcode.com/problems/contains-duplicate/) | [Solution](./Arrays/03_contains_duplicate.ts) |
| `Array` | [Product of Array Except Self](https://leetcode.com/problems/product-of-array-except-self/) | [Solution](./Arrays/04_product_of_array_except_self.ts) |
| `Array` | [Maximum Subarray](https://leetcode.com/problems/maximum-subarray/) | [Solution](./Arrays/05_maximum_subarray.ts) |
| `Array` | [Maximum Product Subarray](https://leetcode.com/problems/maximum-product-subarray/) | [Solution](./Arrays/06_maximum_product_subarray.ts) |
| `Array` | [Find Minimum in Rotated Sorted Array](https://leetcode.com/problems/find-minimum-in-rotated-sorted-array/) | [Solution](./Arrays/07_find_minimum_in_rotated_sorted_array.ts) |
| `Array` | [Search in Rotated Sorted Array](https://leetcode.com/problems/search-in-rotated-sorted-array/) | [Solution](./Arrays/08_search_in_rotated_sorted_array.ts) |
| `Array` | [3Sum](https://leetcode.com/problems/3sum/) | [Solution](./Arrays/09_3Sum.ts) |
| `Array` | [Container With Water](https://leetcode.com/problems/container-with-most-water/) | [Solution](./Arrays/10_container_with_most_water.ts) |
| `Binary` | [Sum of Two Integers](https://leetcode.com/problems/sum-of-two-integers/) | [Solution](./Binary/01_sum_of_two_integers.ts) |
| `Binary` | [Number of 1 Bits](https://leetcode.com/problems/number-of-1-bits/) | [Solution](./Binary/02_number_of_1_bits.ts) |
| `Binary` | [Counting Bits](https://leetcode.com/problems/counting-bits/) | [Solution](./Binary/03_counting_bits.ts) |
| `Binary` | [Missing Number](https://leetcode.com/problems/missing-number/) | [Solution](./Binary/04_missing_number.ts) |
| `Binary` | [Reverse Bits](https://leetcode.com/problems/reverse-bits/) | [Solution](./Binary/05_reverse_bits.ts) |
| `Dynamic Programming` | [Climbing Stairs](https://leetcode.com/problems/climbing-stairs/) | [Solution](./Dynamic-Programming/01_climbing_stairs.ts) |
| `Dynamic Programming` | [Coin Change](https://leetcode.com/problems/coin-change/) | [Solution](./Dynamic-Programming/02_coin_change.ts) |
| `Dynamic Programming` | [Longest Increasing Subsequence](https://leetcode.com/problems/longest-increasing-subsequence/) | [Solution](./Dynamic-Programming/03_longest_increasing_subsequence.ts) |
| `Dynamic Programming` | [Longest Common Subsequence](https://leetcode.com/problems/longest-common-subsequence/) | [Solution](./Dynamic-Programming/04_longest_common_subsequence.ts) |
| `Dynamic Programming` | [Word Break](https://leetcode.com/problems/word-break/) | [Solution](./Dynamic-Programming/05_word_break.ts) |
| `Dynamic Programming` | [Combination Sum IV](https://leetcode.com/problems/combination-sum-iv/) | [Solution](./Dynamic-Programming/06_combination_sum_IV.ts) |
| `Dynamic Programming` | [House Robber](https://leetcode.com/problems/house-robber/) | [Solution](./Dynamic-Programming/07_house_robber.ts) |
| `Dynamic Programming` | [House Robber II](https://leetcode.com/problems/house-robber-ii/) | [Solution](./Dynamic-Programming/08_house_robber-II.ts) |
| `Dynamic Programming` | [Decode Ways](https://leetcode.com/problems/decode-ways/) | [Solution](./Dynamic-Programming/09_decode_ways.ts) |
| `Dynamic Programming` | [Unique Paths](https://leetcode.com/problems/unique-paths/) | [Solution](./Dynamic-Programming/10_unique_paths.ts) |
| `Dynamic Programming` | [Jump Game](https://leetcode.com/problems/jump-game/) | [Solution](./Dynamic-Programming/11_jump_game.ts) |
| `Graph` | [Clone Graph](https://leetcode.com/problems/clone-graph/) | [Solution](./Graph/01_clone_graph.ts) |
| `Graph` | [Course Schedule](https://leetcode.com/problems/course-schedule/) | [Solution](./Graph/02_course_schedule.ts) |
| `Graph` | [Pacific Atlantic Water Flow](https://leetcode.com/problems/pacific-atlantic-water-flow/) | [Solution](./Graph/03_pacific_atlantic_water_flow.ts) |
| `Graph` | [Number of Islands](https://leetcode.com/problems/number-of-islands/) | [Solution](./Graph/04_number_of_islands.ts) |
| `Graph` | [Longest Consecutive Sequence](https://leetcode.com/problems/longest-consecutive-sequence/) | [Solution](./Graph/05_longest_consecutive_sequence.ts) |
| `Graph` | [Alien Dictionary](https://leetcode.com/problems/alien-dictionary/) | [Solution](./Graph/06_alien_dictionary.ts) |
| `Graph` | [Graph Valid Tree](https://leetcode.com/problems/graph-valid-tree/) | [Solution](./Graph/07_graph_valid_tree.ts) |
| `Graph` | [Number of Connected Components in an Undirected Graph](https://leetcode.com/problems/number-of-connected-components-in-an-undirected-graph/) | [Solution](./Graph/08_number_of_provinces.ts) |
| `Interval` | [Insert Interval](https://leetcode.com/problems/insert-interval/) | [Solution](./Interval/01_insert_interval.ts) |
| `Interval` | [Merge Intervals](https://leetcode.com/problems/merge-intervals/) | [Solution](./Interval/02_merge_intervals.ts) |
| `Interval` | [Non-overlapping Intervals](https://leetcode.com/problems/non-overlapping-intervals/) | [Solution](./Interval/03_non_overlapping_intervals.ts) |
| `Interval` | [Meeting Rooms](https://leetcode.com/problems/meeting-rooms/) | [Solution](./Interval/04_meeting_rooms.ts) |
| `Interval` | [Meeting Rooms II](https://leetcode.com/problems/meeting-rooms-ii/) | [Solution](./Interval/05_meeting_rooms_II.ts) |
| `Linked List` | [Reverse a Linked List](https://leetcode.com/problems/meeting-rooms-ii/) | [Solution](./Linked-List/01_reverse_linked_list.ts) |
| `Linked List` | [Detect Cycle in a Linked List](https://leetcode.com/problems/linked-list-cycle/) | [Solution](./Linked-List/02_linked_list_cycle.ts) |
| `Linked List` | [Merge Two Sorted Lists](https://leetcode.com/problems/merge-two-sorted-lists/) | [Solution](./Linked-List/03_merge_two_sorted_lists.ts) |
| `Linked List` | [Merge K Sorted Lists](https://leetcode.com/problems/merge-k-sorted-lists/) | [Solution](./Linked-List/04_merge_k_sorted_list.ts) |
| `Linked List` | [Remove Nth Node From End Of List](https://leetcode.com/problems/remove-nth-node-from-end-of-list/) | [Solution](./Linked-List/05_remove_Nth_node_from_end_of_list.ts) |
| `Linked List` | [Reorder List](https://leetcode.com/problems/reorder-list/) | [Solution](./Linked-List/06_reorder_list.ts) |
| `Matrix` | [Set Matrix Zeroes](https://leetcode.com/problems/set-matrix-zeroes/) | [Solution](./Matrix/01_set_matrix_zeroes.ts) |
| `Matrix` | [Spiral Matrix](https://leetcode.com/problems/spiral-matrix/) | [Solution](./Matrix/02_spiral_matrix.ts) |
| `Matrix` | [Rotate Image](https://leetcode.com/problems/rotate-image/) | [Solution](./Matrix/03_rotate_image.ts) |
| `Matrix` | [Word Search](https://leetcode.com/problems/word-search/) | [Solution](./Matrix/04_word-search.ts) |
| `String` | [Longest Substring Without Repeating Characters](https://leetcode.com/problems/longest-substring-without-repeating-characters/) | [Solution](./Strings/01_longest_substring_without_repeating_characters.ts) |
| `String` | [Longest Repeating Character Replacement](https://leetcode.com/problems/longest-repeating-character-replacement/) | [Solution](./Strings/02_longest_repeating_character_replacement.ts) |
| `String` | [Minimum Window Substring](https://leetcode.com/problems/minimum-window-substring/) | [Solution](./Strings/03_minimum_window_substring.ts) |
| `String` | [Valid Anagram](https://leetcode.com/problems/valid-anagram/) | [Solution](./Strings/04_valid_anagram.ts) |
| `String` | [Group Anagrams](https://leetcode.com/problems/group-anagrams/) | [Solution](./Strings/05_group_anagrams.ts) |
| `String` | [Valid Parentheses](https://leetcode.com/problems/valid-parentheses/) | [Solution](./Strings/06_valid_parentheses.ts) |
| `String` | [Valid Palindrome](https://leetcode.com/problems/valid-palindrome/) | [Solution](./Strings/07_valid_palindrome.ts) |
| `String` | [Longest Palindromic Substring](https://leetcode.com/problems/longest-palindromic-substring/) | [Solution](./Strings/08_longest_palindrome.ts) |
| `String` | [Palindromic Substrings](https://leetcode.com/problems/palindromic-substrings/) | [Solution](./Strings/09_palindromic_substrings.ts) |
| `String` | [Encode and Decode String](https://leetcode.com/problems/encode-and-decode-strings/) | [Solution](./Strings/10_encode_and_decode_strings.ts) |
| `Tree` | [Maximum Depth of Binary Tree](https://leetcode.com/problems/maximum-depth-of-binary-tree/) | [Solution](./Tree/01_maximum_depth_of_binary_tree.ts) |
| `Tree` | [Same Tree](https://leetcode.com/problems/same-tree/) | [Solution](./Tree/02_same_tree.ts) |
| `Tree` | [Invert/Flip Binary Tree](https://leetcode.com/problems/invert-binary-tree/) | [Solution](./Tree/03_invert_binary_tree.ts) |
| `Tree` | [Binary Tree Maximum Path Sum](https://leetcode.com/problems/binary-tree-maximum-path-sum/) | [Solution](./Tree/04_binary_tree_maximum_path_sum.ts) |
| `Tree` | [Binary Tree Level Order Traversal](https://leetcode.com/problems/binary-tree-level-order-traversal/) | [Solution](./Tree/05_binary_tree_level_order_traversal.ts) |
| `Tree` | [Serialize and Deserialize Binary Tree](https://leetcode.com/problems/serialize-and-deserialize-binary-tree/) | [Solution](./Tree/06_serialize_and_deserialize_binary_tree.ts) |
| `Tree` | [Subtree of Another Tree](https://leetcode.com/problems/subtree-of-another-tree/) | [Solution](./Tree/07_subtree_of_another_tree.ts) |
| `Tree` | [Construct Binary Tree from Preorder and Inorder Traversal](https://leetcode.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal/) | [Solution](./Tree/08_construct_binary_tree_fron_preorder_and_inorder_traversal.ts) |
| `Tree` | [Validate Binary Search Tree](https://leetcode.com/problems/validate-binary-search-tree/) | [Solution](./Tree/09_validate_binary_search_tree.ts) |
| `Tree` | [Kth Smallest Element in a BST](https://leetcode.com/problems/kth-smallest-element-in-a-bst/) | [Solution](./Tree/10_Kth_smallest_element_in_a_bst.ts) |
| `Tree` | [Lowest Common Ancestor of BST](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-search-tree/) | [Solution](./Tree/11_lowest_common_ancestor_of_a_binary_tree.ts) |
| `Tree` | [Implement Trie (Prefix Tree)](https://leetcode.com/problems/implement-trie-prefix-tree/) | [Solution](./Tree/12_implement_trie.ts) |
| `Tree` | [Add and Search Word](https://leetcode.com/problems/add-and-search-word-data-structure-design/) | [Solution](./Tree/13_design_add_and_search_words_data_structure.ts) |
| `Tree` | [Word Search II](https://leetcode.com/problems/word-search-ii/) | [Solution](./Tree/14_word_search_II.ts) |
| `Heap` | [Merge K Sorted Lists](https://leetcode.com/problems/merge-k-sorted-lists/) | [Solution](./Heap/01_merge_K_sorted_lists.ts) |
| `Heap` | [Top K Frequent Elements](https://leetcode.com/problems/top-k-frequent-elements/) | [Solution](./Heap/02_top_K_frequent_elements.ts) |
| `Heap` | [Find Median from Data Stream](https://leetcode.com/problems/find-median-from-data-stream/) | [Solution](./Heap/03_find_median_from_data_stream.ts) |