https://github.com/aksweb/gfg-potd
Solutions to Geeks for Geeks Problem of the day
https://github.com/aksweb/gfg-potd
Last synced: 6 months ago
JSON representation
Solutions to Geeks for Geeks Problem of the day
- Host: GitHub
- URL: https://github.com/aksweb/gfg-potd
- Owner: aksweb
- Created: 2023-03-14T19:36:41.000Z (over 3 years ago)
- Default Branch: main
- Last Pushed: 2024-07-24T14:41:27.000Z (almost 2 years ago)
- Last Synced: 2024-07-24T17:03:54.725Z (almost 2 years ago)
- Language: C++
- Size: 95.7 KB
- Stars: 2
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# GFG Problem of the Day Solutions
This repository contains solutions to the GeeksforGeeks Problem of the Day. All solutions are uploaded before evening of the day. To access the code for a specific problem, click on the file name below or you can also view the problem by clicking on Problem Link:
To view the code for a specific problem, simply click on the corresponding file name above.
- [isValidBST.cpp](./Solutions/isValidBST.cpp) || [EASY - Problem link :](https://www.geeksforgeeks.org/problems/check-for-bst/1)
- [Top_K_Frequent_ElementsinArray5Nov.cpp](./Solutions/Top_K_Frequent_ElementsinArray5Nov.cpp) || [EASY - Problem link :](https://www.geeksforgeeks.org/problems/top-k-frequent-elements-in-array/1)
- [Insert_in_sorted_linked_list_8Aug23.cpp](./Solutions/Insert_in_sorted_linked_list_8Aug23.cpp) || [EASY (Delete node in LL) - Problem link :](https://practice.geeksforgeeks.org/problems/insert-in-a-sorted-list/1?utm_source=geeksforgeeks&utm_medium=article_practice_tab&utm_campaign=article_practice_tab)
- [Delete_a_Node_in_Single_Linked_List_30Aug23.cpp](./Solutions/Delete_a_Node_in_Single_Linked_List_30Aug23.cpp) || [EASY (Delete node in LL) - Problem link :](https://practice.geeksforgeeks.org/problems/delete-a-node-in-single-linked-list/1)
- [Reverse_a_String27Aug23.cpp](./Solutions/Reverse_a_String27Aug23.cpp) || [EASY (Reverse a string) - Problem link :](https://practice.geeksforgeeks.org/problems/reverse-a-string/1)
- [Longest_K_unique_characters_substring_26Aug23.cpp](./Solutions/Longest_K_unique_characters_substring_26Aug23.cpp) || [MEDIUM (TWO POINTER, HASHMAP) - Problem link :](https://practice.geeksforgeeks.org/problems/longest-k-unique-characters-substring0853/1)
- [Palindrome_String_25Aug23.cpp](./Solutions/Palindrome_String_25Aug23.cpp) || [EASY (PALINDROME STRING) - Problem link :](https://practice.geeksforgeeks.org/problems/palindrome-string0817/1)
- [Multiply_two_strings_24Aug23.py](./Solutions/Multiply_two_strings_24Aug23.py) || [MEDIUM (STRINGS) - Problem link :](https://practice.geeksforgeeks.org/problems/multiply-two-strings/1)
- [Find_the string_in_grid_23Aug23.py](./Solutions/Find_the_string_in_grid_23Aug23.py) || [MEDIUM (MATRIX, RECURSION) - Problem link :](https://practice.geeksforgeeks.org/problems/find-the-string-in-grid0111/1)
- [Find_the string_in_grid_23Aug23.cpp](./Solutions/Find_the_string_in_grid_23Aug23.cpp) || [MEDIUM (MATRIX, RECURSION) - Problem link :](https://practice.geeksforgeeks.org/problems/find-the-string-in-grid0111/1)
- [Make_matrix_beautiful_22Aug23.cpp](./Solutions/Make_matrix_beautiful_22Aug23.cpp) || [MEDIUM (MATRIX) - Problem link :](https://practice.geeksforgeeks.org/problems/make-matrix-beautiful-1587115620/1)
- [Surround_the_1s_21_Aug23.cpp](./Solutions/Surround_the_1s_21_Aug23.cpp) || [EASY (MATRIX) - Problem link :](https://practice.geeksforgeeks.org/problems/surround-the-1s2505/1)
- [Number_of_occurrence_20Aug23.cpp](./Solutions/Number_of_occurrence_20Aug23.cpp) || [MEDIUM (easy) - Problem link :](https://practice.geeksforgeeks.org/problems/number-of-occurrence2259/1)
- [Flip_Bits_15Aug23.cpp](./Solutions/Flip_Bits_15Aug23.cpp) || [EASY - Problem link :](https://practice.geeksforgeeks.org/problems/flip-bits0240/1)
- [Non_Repeating_Numbers_14Aug23.cpp](./Solutions/Non_Repeating_Numbers_14Aug23.cpp) || [MEDIUM - Problem link :](https://practice.geeksforgeeks.org/problems/finding-the-numbers0215/1)
- [Inorder_Successor_in_BST_30Jul23.cpp](./Solutions/Inorder_Successor_in_BST_30Jul23.cpp) || [EASY - Problem link :](https://practice.geeksforgeeks.org/problems/inorder-successor-in-bst/1)
- [Median_of_BST_29Jull.cpp](./Solutions/Median_of_BST_29Jull.cpp) || [EASY - Problem link :](https://practice.geeksforgeeks.org/problems/median-of-bst/1)
- [Level_order_traversal_in_spiral_form_25Jul23.cpp](./Solutions/Level_order_traversal_in_spiral_form_25Jul23.cpp) || [EASY - Problem link :](https://practice.geeksforgeeks.org/problems/level-order-traversal-in-spiral-form/1)
- [Non_Repeating_Character_20Jul23.cpp](./Solutions/Non_Repeating_Character_20Jul23.cpp) || [EASY - Problem link :](https://practice.geeksforgeeks.org/problems/non-repeating-character-1587115620/1)
- [First_non-repeating_character_in_a_stream_17Jul23.cpp](./Solutions/First_non-repeating_character_in_a_stream_17Jul23.cpp) || [MEDIUM - Problem link :](https://practice.geeksforgeeks.org/problems/first-non-repeating-character-in-a-stream1216/1)
- [Queue_Reversal_16Jul23.cpp](./Solutions/Queue_Reversal_16Jul23.cpp) || [EASY - Problem link :](https://practice.geeksforgeeks.org/problems/queue-reversal/1)
- [Delete_middle_element_of_a_stack_15Jul23.cpp](./Solutions/Delete_middle_element_of_a_stack_15Jul23.cpp) || [EASY - Problem link :](https://practice.geeksforgeeks.org/problems/delete-middle-element-of-a-stack/1)
- [Implement_two_stacks in_an_array_14Jul23.cpp](./Solutions/Implement_two_stacks%20in_an_array_14Jul23.cpp) || [EASY - Problem link :](https://practice.geeksforgeeks.org/problems/implement-two-stacks-in-an-array/1)
- [Unique_Number_of_Occurrences_13Jul23.cpp](./Solutions/Unique_Number_of_Occurrences_13Jul23.cpp) || [EASY - Problem link :](https://practice.geeksforgeeks.org/problems/unique-frequencies-of-not/1)
- [Find_triplets_with_zero_sum_8Jul.cpp](./Solutions/Find_triplets_with_zero_sum_8Jul.cpp) || [BASIC - Problem link :](https://practice.geeksforgeeks.org/problems/find-triplets-with-zero-sum/1)
- [Stock_buy_and_sell_II_5Jul.cpp](./Solutions/Stock_buy_and_sell_II_5Jul.cpp) || [MEDIUM - Problem link :](https://practice.geeksforgeeks.org/problems/stock-buy-and-sell2615/1)
- [Number_of_1_Bits_1Jul23.cpp](./Solutions/Number_of_1_Bits_1Jul23.cpp) || [EASY - Problem link :](https://practice.geeksforgeeks.org/problems/set-bits0143/1)
- [Is_Binary_Number_Multiple_of_3_30Jun23.cpp](./Solutions/Is_Binary_Number_Multiple_of_3_30Jun23.cpp) || [MEDIUM - Problem link :](https://practice.geeksforgeeks.org/problems/is-binary-number-multiple-of-30654/1)
- [Maximum_Depth_Of_Binary_Tree_28Jun23.cpp](./Solutions/Maximum_Depth_Of_Binary_Tree_28Jun23.cpp) || [EASY - Problem link :](https://practice.geeksforgeeks.org/problems/maximum-depth-of-binary-tree/1)
- [Union_of_Two_Linked_Lists_27Jun.cpp](./Solutions/Union_of_Two_Linked_Lists_27Jun.cpp) || [EASY - Problem link :](https://practice.geeksforgeeks.org/problems/union-of-two-linked-list/1)
- [nCr_26Jun23.cpp](./Solutions/nCr_26Jun23.cpp) || [MEDIUM - Problem link :](https://practice.geeksforgeeks.org/problems/ncr1019/1)
- [Lemonade_Change_22Jun23.cpp](./Solutions/Lemonade_Change_22Jun23.cpp) || [MEDIUM - Problem link :](https://practice.geeksforgeeks.org/problems/lemonade-change/1)
- [Reverse_Coding_21Jun23.cpp](./Solutions/Reverse_Coding_21Jun23.cpp) || [EASY - Problem link :](https://practice.geeksforgeeks.org/problems/reverse-coding2452/1)
- [Matchsticks_game_20Jun23.cpp](./Solutions/Matchsticks_game_20Jun23.cpp) || [MEDIUM - Problem link :](https://practice.geeksforgeeks.org/problems/-matchsticks-game4906/1)
- [Rearrange_an_array_with_O(1)\_extra_space_19_jun23.cpp](<./Solutions/Rearrange_an_array_with_O(1)_extra_space_19_jun23.cpp>) || [MEDIUM - Problem link :](https://practice.geeksforgeeks.org/problems/rearrange-an-array-with-o1-extra-space3142/1)
- [Ticket_Counter_18_Jun_23.cpp](./Solutions/Ticket_Counter_18_Jun_23.cpp) || [EASY - Problem link :](https://practice.geeksforgeeks.org/problems/ticket-counter-2731/1)
- [Queue_Operatons_17_06_23](./Solutions/Queue_Operatons_17_06_23.cpp) || [EASY - Problem link :](https://practice.geeksforgeeks.org/problems/queue-operations/1)
- [Longest_Palindrome_in_a_String_15_06_23](./Solutions/Longest_Palindrome_in_a_String_15_06_23.cpp) || [MEDIUM - Problem link :](https://practice.geeksforgeeks.org/problems/longest-palindrome-in-a-string3411/1)
- [K_largest_elements_13_06_23.cpp](./Solutions/K_largest_elements_13_06_23.cpp) || [MEDIUM - Problem link :](https://practice.geeksforgeeks.org/problems/k-largest-elements4206/1https://practice.geeksforgeeks.org/problems/k-largest-elements4206/1)
- [Find_Kth_permutation_08_06_23.cpp](./Solutions/Find_Kth_permutation_08_06_23.cpp) || [MEDIUM - Problem link :](https://practice.geeksforgeeks.org/problems/find-kth-permutation-0932/1)
- [CamelCase_Pattern_Matching_29_05_23.cpp](./Solutions/CamelCase_Pattern_Matching_29_05_23.cpp) || [MEDIUM - Problem link :](https://practice.geeksforgeeks.org/problems/camelcase-pattern-matching2259/1)
- [Nth_node_from_end_of_linked_list_28_05_23](./Solutions/Nth_node_from_end_of_linked_list_28_05_23.cpp) || [EASY - Problem link :](https://practice.geeksforgeeks.org/problems/nth-node-from-end-of-linked-list/1)
- [Modify_Linked_List-1_27_05_23](./Solutions/Modify_Linked_List-1_28_05_23.cpp) || [MEDIUM - Problem link :](https://practice.geeksforgeeks.org/problems/modify-linked-list-1-0546/1)
- [Bit_magic_13_05_23](./Solutions/Bit_magic_13_05_23.cpp) || [EASY - Problem link :](https://practice.geeksforgeeks.org/problems/ed0422e992899f3f46340ce97b0090683ceebd67/1)
- [Array_Operations_12_05_23](./Solutions/Array_Operations_12_05_23.cpp) || [EASY - Problem link :](https://practice.geeksforgeeks.org/problems/3a93b6a25a7b88e4c80a1fee00898fd8022eb108/1)
- [Total_Cuts.cpp_10_05_23](./Solutions/Total_Cuts.cpp_10_05_23.cpp) || [EASY - Problem link :](https://practice.geeksforgeeks.org/problems/cbd515a00f6537180d2e66f1ffe11093a128e560/1)
- [Seating_Arrangement_26_04_23](./Solutions/Seating_Arrangement.cpp) || [EASY - Problem link :](https://practice.geeksforgeeks.org/problems/6bb49b563cc171335c6564b00307a6d867e0268d/1)
- [Game_Of_Subsets_25_04_23](https://github.com/Thelalitagarwal/GFG_Daily_Problem/blob/main/Game%20Of%20Subsets.cpp) || [HARD - Problem link :](https://practice.geeksforgeeks.org/problems/cec5db442a5652d07dd41e37ea780345f08c9a3d/1)
- [Nearest_Smaller_Tower_24_04_23](./Solutions/Nearest_Smaller_Tower_24_04_23.cpp) || [MEDIUM - Problem link :](https://practice.geeksforgeeks.org/problems/a520c08a8ea9b617be25c38b0fc2fe057e889253/1)
- [Minimum_Number_23_04_23](./Solutions/Minimum_Number_23_04_23.cpp) || [EASY - Problem link :](https://practice.geeksforgeeks.org/problems/7d62c8606123a199720c9b6885249dc9ac651bb7/1)
- [Smaller_Sum_22_04_23](./Solutions/Smaller_Sum_22_04_23.cpp) || [MEDIUM - Problem link :](https://practice.geeksforgeeks.org/problems/5877fde1c8e1029658845cd4bc94066ac1d4b09b/1)
- [Prefix_Suffix_String_21_04_23](./Solutions/Prefix_Suffix_String_21_04_23.cpp) || [MEDIUM - Problem link :](https://practice.geeksforgeeks.org/problems/5be83263c7f2cb866c60b23b73bb38f88de2461c/1)
- [Remove_the_balls_14_04_23](./Solutions/Remove_the_balls_14_04_23.cpp) || [MEDIUM - Problem link :](https://practice.geeksforgeeks.org/problems/546ea68f97be7283a04ddcc8057e09b46a686471/1)
- [Dominant_Pairs_12_04_23](./Solutions/Dominant_Pairs_12_04_23.cpp) || [EASY - Problem link :](https://practice.geeksforgeeks.org/problems/2a1c11024ceae36363fc405e07f2fa3e2f896ef0/1)
- [Maximum_Length_11_04_23](./Solutions/Maximum_Length_11_04_23.cpp) || [MEDIUM - Problem link :](https://practice.geeksforgeeks.org/problems/84963d7b5b84aa24f7807d86e672d0f97f41a4b5/1)
- [Make_the_array_beautiful_07_04_23](./Solutions/Make_the_array_beautiful.cpp) || [EASY - Problem link :](https://practice.geeksforgeeks.org/problems/badefd58bace4f2ca25267ccfe0c9dc844415e90/1)
- [Equal_Left_and_Right_Subarray_Sum_06_04_23](./Solutions/Equal_Left_and_Right_Subarray_Sum_06_04_23.cpp) || [EASY - Problem link :](https://practice.geeksforgeeks.org/problems/78a6854c8a2915e05f236aa407dfaa1bbc8ae7d3/1)
- [Remainder_on_dividing_by11_03_04_23](./Solutions/Remainder_on_dividing_by11_03_04_23.cpp) || [EASY - Problem link :](https://practice.geeksforgeeks.org/problems/aa8c89caad6b5c3a76ba5e6d65454f77aac3f3543526/1)
- [Make_Array_Elements_Equal_01_04_23](./Solutions/Make_Array_Elements_Equal.cpp) || [EASY - Problem link :](https://practice.geeksforgeeks.org/problems/1f05c7c12b1084f270c57566b2110967c046730d/1)
- [Even_Swap_31_03_23](./Solutions/Even_Swap_31_03_23.cpp) || [MEDIUM - Problem link :](https://practice.geeksforgeeks.org/problems/even-swap/1)
- [Redundant_Parenthesis_25_03_23](./Solutions/Redundant_Parenthesis_25_03_23.cpp) || [HARD - Problem link :](https://practice.geeksforgeeks.org/problems/ef5111156686a3136c6a0df8bbda17f952947e17/1)
- [Remove_and_Reverse_24_03_23](./Solutions/Remove_and_Reverse_24_03_23.cpp) || [MEDIUM - Problem link :](https://practice.geeksforgeeks.org/problems/1e2f365be6114b671b915e145ec7dbcfdc432910/1)
- [BST_Maximum_Difference_23_03_23.cpp](./Solutions/BST_Maximum_Difference_23_03_23.cpp) || [MEDIUM - Problem link :](https://practice.geeksforgeeks.org/problems/e841e10213ddf839d51c2909f1808632a19ae0bf/1)
- [String_rp_pr_22_03_23.cpp](./Solutions/String_rp_pr_22_03_23.cpp) || [MEDIUM - Problem link:](https://practice.geeksforgeeks.org/problems/d25f415de2ff3e02134de03e17ad019d723ab2e9/1)
- [Taxi_Booking_21_03_23.cpp](./Solutions/Taxi_Booking_21_03_23.cpp) || [EASY - Problem link :](https://practice.geeksforgeeks.org/problems/7995e41d167d81f14f1d4194b29ef839f52d18ba/1)
- [Distinct_Difference_19_03_23.cpp](./Solutions/Distinct_Difference_19_03_23.cpp) || [ EASY- Problem link:](https://practice.geeksforgeeks.org/problems/c670bf260ea9dce6c5910dedc165aa403f6e951d/1)
