Skip to content

cpp-blind-75

Directory actions

More options

Directory actions

More options

Latest commit

 

History

History

cpp-blind-75

Folders and files

NameName
Last commit message
Last commit date

parent directory

..
01_two-sum.cpp
01_two-sum.cpp
 
 
02_best-time-to-buy-and-sell-stock.cpp
02_best-time-to-buy-and-sell-stock.cpp
 
 
03_contains-duplicate.cpp
03_contains-duplicate.cpp
 
 
04_product-of-array-except-self.cpp
04_product-of-array-except-self.cpp
 
 
05_maximum-subarray.cpp
05_maximum-subarray.cpp
 
 
06_maximum-product-subarray.cpp
06_maximum-product-subarray.cpp
 
 
07_find-minimum-in-rotated-sorted-array.cpp
07_find-minimum-in-rotated-sorted-array.cpp
 
 
08_search-in-rotated-sorted-array.cpp
08_search-in-rotated-sorted-array.cpp
 
 
09_3sum.cpp
09_3sum.cpp
 
 
10_container-with-most-water.cpp
10_container-with-most-water.cpp
 
 
11_sum-of-two-integers.cpp
11_sum-of-two-integers.cpp
 
 
12_number-of-1-bits.cpp
12_number-of-1-bits.cpp
 
 
13_counting-bits.cpp
13_counting-bits.cpp
 
 
14_missing-number.cpp
14_missing-number.cpp
 
 
15_reverse-bits.cpp
15_reverse-bits.cpp
 
 
16_set-matrix-zeroes.cpp
16_set-matrix-zeroes.cpp
 
 
17_spiral-matrix.cpp
17_spiral-matrix.cpp
 
 
18_rotate-image.cpp
18_rotate-image.cpp
 
 
19_word-search.cpp
19_word-search.cpp
 
 
20_reverse-linked-list.cpp
20_reverse-linked-list.cpp
 
 
21_linked-list-cycle.cpp
21_linked-list-cycle.cpp
 
 
22_merge-two-sorted-lists.cpp
22_merge-two-sorted-lists.cpp
 
 
23_merge-k-sorted-lists.cpp
23_merge-k-sorted-lists.cpp
 
 
24_remove-nth-node-from-end-of-list.cpp
24_remove-nth-node-from-end-of-list.cpp
 
 
25_reorder-list.cpp
25_reorder-list.cpp
 
 
26_longest-substring-without-repeating-characters.cpp
26_longest-substring-without-repeating-characters.cpp
 
 
27_longest-repeating-character-replacement.cpp
27_longest-repeating-character-replacement.cpp
 
 
28_minimum-window-substring.cpp
28_minimum-window-substring.cpp
 
 
29_valid-anagram.cpp
29_valid-anagram.cpp
 
 
30_group-anagrams.cpp
30_group-anagrams.cpp
 
 
31_valid-parentheses.cpp
31_valid-parentheses.cpp
 
 
32_valid-palindrome.cpp
32_valid-palindrome.cpp
 
 
33_longest-palindromic-substring.cpp
33_longest-palindromic-substring.cpp
 
 
34_palindromic-substrings.cpp
34_palindromic-substrings.cpp
 
 
35_encode-and-decode-strings.cpp
35_encode-and-decode-strings.cpp
 
 
36_top-k-frequent-elements.cpp
36_top-k-frequent-elements.cpp
 
 
37_find-median-from-data-stream.cpp
37_find-median-from-data-stream.cpp
 
 
38_insert-interval.cpp
38_insert-interval.cpp
 
 
39_merge-intervals.cpp
39_merge-intervals.cpp
 
 
40_non-overlapping-intervals.cpp
40_non-overlapping-intervals.cpp
 
 
41_meeting-rooms.cpp
41_meeting-rooms.cpp
 
 
42_meeting-rooms-ii.cpp
42_meeting-rooms-ii.cpp
 
 
43_maximum-depth-of-binary-tree.cpp
43_maximum-depth-of-binary-tree.cpp
 
 
44_same-tree.cpp
44_same-tree.cpp
 
 
45_invert-binary-tree.cpp
45_invert-binary-tree.cpp
 
 
46_binary-tree-maximum-path-sum.cpp
46_binary-tree-maximum-path-sum.cpp
 
 
47_binary-tree-level-order-traversal.cpp
47_binary-tree-level-order-traversal.cpp
 
 
48_serialize-and-deserialize-binary-tree.cpp
48_serialize-and-deserialize-binary-tree.cpp
 
 
49_subtree-of-another-tree.cpp
49_subtree-of-another-tree.cpp
 
 
50_construct-binary-tree-from-preorder-and-inorder-traversal.cpp
50_construct-binary-tree-from-preorder-and-inorder-traversal.cpp
 
 
51_validate-binary-search-tree.cpp
51_validate-binary-search-tree.cpp
 
 
52_kth-smallest-element-in-a-bst.cpp
52_kth-smallest-element-in-a-bst.cpp
 
 
53_lowest-common-ancestor-of-a-binary-search-tree.cpp
53_lowest-common-ancestor-of-a-binary-search-tree.cpp
 
 
54_implement-trie-prefix-tree.cpp
54_implement-trie-prefix-tree.cpp
 
 
55_design-add-and-search-words-data-structure.cpp
55_design-add-and-search-words-data-structure.cpp
 
 
56_word-search-ii.cpp
56_word-search-ii.cpp
 
 
57_clone-graph.cpp
57_clone-graph.cpp
 
 
58_course-schedule.cpp
58_course-schedule.cpp
 
 
59_pacific-atlantic-water-flow.cpp
59_pacific-atlantic-water-flow.cpp
 
 
60_number-of-islands.cpp
60_number-of-islands.cpp
 
 
61_longest-consecutive-sequence.cpp
61_longest-consecutive-sequence.cpp
 
 
62_alien-dictionary.cpp
62_alien-dictionary.cpp
 
 
63_graph-valid-tree.cpp
63_graph-valid-tree.cpp
 
 
64_number-of-connected-components-in-an-undirected-graph.cpp
64_number-of-connected-components-in-an-undirected-graph.cpp
 
 
65_climbing-stairs.cpp
65_climbing-stairs.cpp
 
 
66_coin-change.cpp
66_coin-change.cpp
 
 
67_longest-increasing-subsequence.cpp
67_longest-increasing-subsequence.cpp
 
 
68_longest-common-subsequence.cpp
68_longest-common-subsequence.cpp
 
 
69_word-break.cpp
69_word-break.cpp
 
 
70_combination-sum.cpp
70_combination-sum.cpp
 
 
71_house-robber.cpp
71_house-robber.cpp
 
 
72_house-robber-ii.cpp
72_house-robber-ii.cpp
 
 
73_decode-ways.cpp
73_decode-ways.cpp
 
 
74_unique-paths.cpp
74_unique-paths.cpp
 
 
75_jump-game.cpp
75_jump-game.cpp
 
 
README.md
README.md
 
 

README.md

cpp-blind-75

This folder contains all cpp solutions for cpp-blind-75.

Files with suffix _std uses input.txt and output.txt as STDIN and STDOUT (used in OnlineJudge).

SL NO. PROGRAM NAME DATE
01 Array - Two Sum 27-07-2023
02 Array - Best Time to Buy and Sell Stock 27-07-2023
03 Array - Contains Duplicate 27-07-2023
04 Array - Product of Array Except Self 27-07-2023
05 Array - Maximum Subarray 28-07-2023
06 Array - Maximum Product SubArray 28-July-2023
07 Array - Find Minimum in Rotated Sorted Array 28-July-2023
08 Array - Search in Rotated Sorted Array 28-July-2023
09 Array - 3Sum 28-July-2023
10 Array - Container With Most Water 28-July-2023
11 Binary - Sum of Two Integers 28-July-2023
12 Binary - Number of 1 Bits 28-July-2023
13 Binary - Counting Bits 28-July-2023
14 Binary - Missing Number 28-July-2023
15 Binary - Reverse Bits 28-July-2023
16 Matrix - Set Matrix Zeroes 29-July-2023
17 Matrix - Spiral Matrix 29-July-2023
18 Matrix - Rotate Image 29-July-2023
19 Matrix - Word Search 29-July-2023
20 Linked List - Reverse Linked List 02-August-2023
21 Linked List - Linked List Cycle 02-August-2023
22 Linked List - Merge Two Sorted Lists 02-August-2023
23 Linked List - Merge k Sorted Lists 02-Aug-2023
24 Linked List - Remove Nth Node From End of List 02-Aug-2023
25 Linked List - Reorder List 02-Aug-2023
26 String - Longest Substring Without Repeating Characters 03-Aug-2023
27 String - Longest Repeating Character Replacement 03-Aug-2023
28 String - Minimum Window Substring 03-Aug-2023
29 String - Valid Anagram 05-Aug-2023
30 String - Group Anagrams 05-Aug-2023
31 String - Valid Parentheses 05-Aug-2023
32 String - Valid Palindrome 05-Aug-2023
33 String - Longest Palindromic Substring 05-Aug-2023
34 String - Palindromic Substrings 05-Aug-2023
35 String - Encode and Decode Strings 05-Aug-2023
36 Heap - Top K Frequent Elements_Bucket Sort 06-Aug-2023
37 Heap - Find Median from Data Stream 06-Aug-2023
38 Interval - Insert Interval 06-Aug-2023
39 Interval - Merge Intervals 06-Aug-2023
40 Interval - Non-overlapping Intervals 06-Aug-2023
41 Interval - Meeting Rooms 06-Aug-2023
42 Interval - Meeting Rooms II 06-Aug-2023
43 Tree - Maximum Depth of Binary Tree 06-Aug-2023
44 Tree - Same Tree 07-Aug-2023
45 Tree - Invert Binary Tree 07-Aug-2023
46 Tree - Binary Tree Maximum Path Sum 07-Aug-2023
47 Tree - Binary Tree Level Order Traversal 07-Aug-2023
48 Tree - Serialize and Deserialize Binary Tree 07-Aug-2023
49 Tree - Subtree of Another Tree 07-Aug-2023
50 Tree - Construct Binary Tree from Preorder and Inorder Traversal 07-Aug-2023
51 Tree - Validate Binary Search Tree 07-Aug-2023
52 Tree - Kth Smallest Element in a BST 07-Aug-2023
53 Tree - Lowest Common Ancestor of BST 07-Aug-2023
54 Tree - Implement Trie (Prefix Tree) 07-Aug-2023
55 Tree - Add and Search Word 08-Aug-2023
56 Tree - Word Search II 08-Aug-2023