Competitive-Programming

KO | EN

gitlite — search

#javascript #hacktoberfest #react #ai #typescript #deep-learning #docker #nodejs #cli #vue #awesome-list #pytorch #ios #mcp

Competitive-Programming

(★ 5)

Contains solutions of Problem on various competitive programming websites

Competitive-Programming Latest Version Download

Download Latest Version (.zip)

// repository documentation

Was this content helpful?

★ 0 (0 ratings)

# Competitive-Programming
Contains solutions of Problems from various websites.

## HackerRank

|Challenge                          | Solution     |      Explanation    |
|:---------------------------------:|:------------:|:--------------------|
| [Between Two Sets](https://www.hackerrank.com/challenges/between-two-sets/problem) | [Solution](https://github.com/programmercave0/Competitive-Programming/blob/master/Hackerrank/Between_two_Sets.cpp) | [Blog](https://programmercave0.github.io/blog/2019/11/29/Between-Two-Sets-HackerRank-Challenge-C++-Implementation) |
| [Circular Array Rotation](https://www.hackerrank.com/challenges/circular-array-rotation/problem) | [Solution](https://github.com/programmercave0/Competitive-Programming/blob/master/Hackerrank/Circular_Array_Rotation.cpp) | [Blog](https://programmercave0.github.io/blog/2019/12/12/Circular-Array-Rotation-HackerRank) |
| [Drawing Book](https://www.hackerrank.com/challenges/drawing-book/problem) | [Solution](https://github.com/programmercave0/Competitive-Programming/blob/master/Hackerrank/Drawing_Book.cpp) | [Blog](https://programmercave0.github.io/blog/2019/12/11/Drawing-Book-HackerRank) |
| [Kangaroo](https://www.hackerrank.com/challenges/kangaroo/problem) | [Solution](https://github.com/programmercave0/Competitive-Programming/blob/master/Hackerrank/Kangaroo.cpp) | [Blog](https://programmercave0.github.io/blog/2019/11/28/Kangaroo-HackerRank-Challenge-C++-Implementation) |
| [Left Rotation](https://www.hackerrank.com/challenges/array-left-rotation/problem) | [Solution](https://github.com/programmercave0/Competitive-Programming/blob/master/Hackerrank/Left_Rotation.cpp) | [Blog](https://programmercave0.github.io/blog/2020/04/25/Left-Rotation-HackerRank-Challenge-Cpp-Implementation) |
| [Library Fine](https://www.hackerrank.com/challenges/library-fine/problem) | [Solution](https://github.com/programmercave0/Competitive-Programming/blob/master/Hackerrank/Library_Fine.cpp) | [Blog](https://programmercave0.github.io/blog/2019/12/20/Library-Fine-HackerRank) |
| [Migratory Birds](https://www.hackerrank.com/challenges/migratory-birds/problem) | [Solution](https://github.com/programmercave0/Competitive-Programming/blob/master/Hackerrank/Migratory_Birds.cpp) | [Blog](https://programmercave0.github.io/blog/2019/12/01/Migratory-Birds-HackerRank-Challenge-C++-Implementation) |
| [Picking Numbers](https://www.hackerrank.com/challenges/picking-numbers/problem) | [Solution](https://github.com/programmercave0/Competitive-Programming/blob/master/Hackerrank/Picking_Numbers.cpp) | [Blog](https://programmercave0.github.io/blog/2020/03/28/Picking-Numbers-HackerRank-Challenge-Cpp-Implementation) |
| [Repeated String](https://www.hackerrank.com/challenges/repeated-string/copy-from/124938661?isFullScreen=false) | [Solution](https://github.com/programmercave0/Competitive-Programming/blob/master/Hackerrank/Repeated_String.cpp) | [Blog](https://programmercave0.github.io/blog/2020/04/24/Repeated-String-HackerRank-Challenge-Cpp-Implementation) |
| [Sherlock and Squares](https://www.hackerrank.com/challenges/sherlock-and-squares/problem) | [Solution](https://github.com/programmercave0/Competitive-Programming/blob/master/Hackerrank/Sherlock_and_Squares.cpp) | [Blog](https://programmercave0.github.io/blog/2019/12/19/Sherlock-and-Squares-HackerRank) |

## CodeForces

|Challenge                          | Solution     |      Explanation    |
|:---------------------------------:|:------------:|:--------------------|
|[Hit the Lottery](https://codeforces.com/problemset/problem/996/A) | [Solution](https://github.com/programmercave0/Competitive-Programming/blob/master/Codeforces/Hit_the_lottery.cpp) |
| [Kefa and First Steps](https://codeforces.com/problemset/problem/580/A) | [Solution](https://github.com/programmercave0/Competitive-Programming/blob/master/Codeforces/Kefa_and_first_steps.cpp) | [Blog](https://programmercave0.github.io/blog/2021/06/28/Kefa-and-First-Steps-CodeForces-C++-Implementation) |

## LeetCode

|Challenge                          | Solution     |      Explanation    |
|:---------------------------------:|:------------:|:--------------------| 
| [Array - 3Sum](https://leetcode.com/problems/3sum/) | [Solution](https://github.com/programmercave0/Competitive-Programming/blob/master/LeetCode/Array_3sum.cpp) |
| [Array - Best Time to Buy and Sell Stock](https://leetcode.com/problems/best-time-to-buy-and-sell-stock/) | [Solution](https://github.com/programmercave0/Competitive-Programming/blob/master/LeetCode/Array_stock_buy_and_sell.cpp) |
| [Array - Count Negative Numbers in a Sorted Matrix](https://leetcode.com/problems/count-negative-numbers-in-a-sorted-matrix/) | [Solution](https://github.com/programmercave0/Competitive-Programming/blob/master/LeetCode/Array_count_negative_numbers_in_a_sorted_matrix.cpp) |
| [Array - Find N Unique Integers Sum up to Zero](https://leetcode.com/problems/find-n-unique-integers-sum-up-to-zero/) | [Solution](https://github.com/programmercave0/Competitive-Programming/blob/master/LeetCode/Array_find_N_unique_integers_sum_upto_0.cpp) |
| [Array - Find Numbers with Even Number of Digits](https://leetcode.com/problems/find-numbers-with-even-number-of-digits/) | [Solution](https://github.com/programmercave0/Competitive-Programming/blob/master/LeetCode/Array_find_numbers_with_even_number_of_digits.cpp) |
| [Array - Find the Duplicate Number](https://leetcode.com/problems/find-the-duplicate-number/) | [Solution](https://github.com/programmercave0/Competitive-Programming/blob/master/LeetCode/Array_find_the_duplicate_number.cpp) |
| [Array - Longest Consecutive Sequence](https://leetcode.com/problems/longest-consecutive-sequence/) | [Solution](https://github.com/programmercave0/Competitive-Programming/blob/master/LeetCode/Array_longest_consecutive_seq.cpp) |
| [Array - Longest Substring Without Repeating Characters](https://leetcode.com/problems/longest-substring-without-repeating-characters/) | [Solution](https://github.com/programmercave0/Competitive-Programming/blob/master/LeetCode/Array_longest_substr_wo_repeating_char.cpp) | 
| [Array - Majority Element](https://leetcode.com/problems/majority-element/) | [Solution](https://github.com/programmercave0/Competitive-Programming/blob/master/LeetCode/Array_majority_ele.cpp) |
| [Array - Maximum Product of Two Elements in an Array](https://leetcode.com/problems/maximum-product-of-two-elements-in-an-array/) | [Solution](https://github.com/programmercave0/Competitive-Programming/blob/master/LeetCode/Array_maximum_product_of_two_elements_in_array.cpp) |
| [Array - Merge Intervals](https://leetcode.com/problems/merge-intervals/) | [Solution](https://github.com/programmercave0/Competitive-Programming/blob/master/LeetCode/Array_merge_intervals.cpp) |
| [Array - Majority Element II](https://leetcode.com/problems/majority-element-ii/) | [Solution](https://github.com/programmercave0/Competitive-Programming/blob/master/LeetCode/Array_majority_ele2.cpp) |
| [Array - Merge Sorted Array](https://leetcode.com/problems/merge-sorted-array/) | [Solution](https://github.com/programmercave0/Competitive-Programming/blob/master/LeetCode/Array_merge_sorted_array.cpp) |
| [Array - Next Permutation](https://leetcode.com/problems/next-permutation/) | [Solution](https://github.com/programmercave0/Competitive-Programming/blob/master/LeetCode/Array_next_permutation.cpp) | 
| [Array - Pascal's Triangle](https://leetcode.com/problems/pascals-triangle/) | [Solution](https://github.com/programmercave0/Competitive-Programming/blob/master/LeetCode/Array_pascals_triangle.cpp) |
| [Array - Remove Duplicates from Sorted Array](https://leetcode.com/problems/remove-duplicates-from-sorted-array/) | [Solution](https://github.com/programmercave0/Competitive-Programming/blob/master/LeetCode/Array_remove_dup_sorted_arr.cpp) |
| [Array - Set Matrix Zeroes](https://leetcode.com/problems/set-matrix-zeroes/) | [Solution](https://github.com/programmercave0/Competitive-Programming/blob/master/LeetCode/Array_set_matrix_zeros.cpp) |
| [Array - Sort Array By Parity](https://leetcode.com/problems/sort-array-by-parity/) | [Solution](https://github.com/programmercave0/Competitive-Programming/blob/master/LeetCode/Array_sort_array_by_parity.cpp) |
| [Array - Sort Colors](https://leetcode.com/problems/sort-colors/) | [Solution](https://github.com/programmercave0/Competitive-Programming/blob/master/LeetCode/Array_sort_colors.cpp) |
| [Array - Trapping Rain Water](https://leetcode.com/problems/trapping-rain-water/) | [Solution](https://github.com/programmercave0/Competitive-Programming/blob/master/LeetCode/Array_trap_rainwater.cpp) |
| [Bit Manipulation - Decode XORed Array](https://leetcode.com/problems/decode-xored-array/) | [Solution](https://github.com/programmercave0/Competitive-Programming/blob/master/LeetCode/Bit_Manipulation_decoded_xored_array.cpp) |
| [Bit Manipulation - Find the Difference](https://leetcode.com/problems/find-the-difference/) | [Solution](https://github.com/programmercave0/Competitive-Programming/blob/master/LeetCode/Bit_Manipulation_find_the_difference.cpp) |
| [Bit Manipulation - Hamming Distance](https://leetcode.com/problems/hamming-distance/) | [Solution](https://github.com/programmercave0/Competitive-Programming/blob/master/LeetCode/Bit_Manipulation_hamming_distance.cpp) |
| [Bit Manipulation - Maximum Subarray](https://leetcode.com/problems/maximum-subarray/) | [Solution](https://github.com/programmercave0/Competitive-Programming/blob/master/LeetCode/maximum_subarray.cpp) |
| [Bit Manipulation - Missing Number](https://leetcode.com/problems/missing-number/) | [Solution](https://github.com/programmercave0/Competitive-Programming/blob/master/LeetCode/Bit_Manipulation_missing_number.cpp) |
| [Bit Manipulation - Number Complement](https://leetcode.com/problems/number-complement/) | [Solution](https://github.com/programmercave0/Competitive-Programming/blob/master/LeetCode/Bit_Manipulation_number_complement.cpp) |
| [Bit Manipulation - Number of 1 Bits](https://leetcode.com/problems/number-of-1-bits/) | [Solution](https://github.com/programmercave0/Competitive-Programming/blob/master/LeetCode/Bit_Manipulation_number_of_1_bits.cpp) |
| [DP - Coin Change](https://leetcode.com/problems/coin-change/) | [Solution](https://github.com/programmercave0/Competitive-Programming/blob/master/LeetCode/DP_coin_change.cpp) |
| [DP - Edit Distance](https://leetcode.com/problems/edit-distance/) | [Solution](https://github.com/programmercave0/Competitive-Programming/blob/master/LeetCode/DP_edit_distance.cpp) |
| [DP - Longest Common Subsequence](https://leetcode.com/problems/longest-common-subsequence/) | [Solution](https://github.com/programmercave0/Competitive-Programming/blob/master/LeetCode/DP_lcs.cpp) |
| [DP - Longest Increasing Subsequence](https://leetcode.com/problems/longest-increasing-subsequence/) | [Solution](https://github.com/programmercave0/Competitive-Programming/blob/master/LeetCode/DP_lis.cpp) |
| [DP - Maximum Product Subarray](https://leetcode.com/problems/maximum-product-subarray/) | [Solution](https://github.com/programmercave0/Competitive-Programming/blob/master/LeetCode/DP_max_prod_subarray.cpp) |
| [DP - Min Cost Climbing Stairs](https://leetcode.com/problems/min-cost-climbing-stairs/) | [Solution](https://github.com/programmercave0/Competitive-Programming/blob/master/LeetCode/DP_min_cost_stairs.cpp) |
| [DP - Ones and Zeroes](https://leetcode.com/problems/ones-and-zeroes/) | [Solution](https://github.com/programmercave0/Competitive-Programming/blob/master/LeetCode/DP_ones_and_zeroes.cpp) | 
| [Linked List - Copy List with Random Pointer](https://leetcode.com/problems/copy-list-with-random-pointer/) | [Solution](https://github.com/programmercave0/Competitive-Programming/blob/master/LeetCode/LL_copy_list_with_random_ptr.cpp) |
| [Linked List - Cycle II](https://leetcode.com/problems/linked-list-cycle-ii/) | [Solution](https://github.com/programmercave0/Competitive-Programming/blob/master/LeetCode/LL_cycle_2.cpp) | 
| [Linked List - Intersection of Two Linked Lists](https://leetcode.com/problems/intersection-of-two-linked-lists/) | [Solution](https://github.com/programmercave0/Competitive-Programming/blob/master/LeetCode/LL_intersection_2_ll.cpp) |
| [Linked List - Palindrome Linked List](https://leetcode.com/problems/palindrome-linked-list/) | [Solution](https://github.com/programmercave0/Competitive-Programming/blob/master/LeetCode/LL_palindrome.cpp) |
| [Math - Pow(x, n)](https://leetcode.com/problems/powx-n/) | [Solution](https://github.com/programmercave0/Competitive-Programming/blob/master/LeetCode/Math_pow_x_n.cpp) |
| [Recursion - Combination Sum](https://leetcode.com/problems/combination-sum/) | [Solution](https://github.com/programmercave0/Competitive-Programming/blob/master/LeetCode/Recursion_combination_sum.cpp) |
| [Recursion - Combination Sum 2](https://leetcode.com/problems/combination-sum-ii/) | [Solution](https://github.com/programmercave0/Competitive-Programming/blob/master/LeetCode/Recursion_combination_sum_2.cpp) |
| [Recursion - Palindrome Partitioning](https://leetcode.com/problems/palindrome-partitioning/) | [Solution](https://github.com/programmercave0/Competitive-Programming/blob/master/LeetCode/Recursion_palin_partitioning.cpp) |
| [Climbing Stairs](https://leetcode.com/problems/climbing-stairs/) | [Solution](https://github.com/programmercave0/Competitive-Programming/blob/master/LeetCode/climbing_stairs.cpp) |
| [Count Good Triplets](https://leetcode.com/problems/count-good-triplets/) | [Solution](https://github.com/programmercave0/Competitive-Programming/blob/master/LeetCode/count_good_triplets.cpp) |
| [Count the Number of Consistent Strings](https://leetcode.com/problems/count-the-number-of-consistent-strings/) | [Solution](https://github.com/programmercave0/Competitive-Programming/blob/master/LeetCode/count_num_of_consistent_strings.cpp) |
| [Flipping an Image](https://leetcode.com/problems/flipping-an-image/) | [Solution](https://github.com/programmercave0/Competitive-Programming/blob/master/LeetCode/flipping_an_image.cpp) |
| [Is Subsequence](https://leetcode.com/problems/is-subsequence/) | [Solution](https://github.com/programmercave0/Competitive-Programming/blob/master/LeetCode/is_subsequence.cpp) |
| [Island Perimeter](https://leetcode.com/problems/island-perimeter/) | [Solution](https://github.com/programmercave0/Competitive-Programming/blob/master/LeetCode/island_perimeter.cpp) |
| [Lucky Numbers in a Matrix](https://leetcode.com/problems/lucky-numbers-in-a-matrix/) | [Solution](https://github.com/programmercave0/Competitive-Programming/blob/master/LeetCode/lucky_numbers_in_a_matrix.cpp) |
| [Minimum Value to Get Positive Step by Step Sum](https://leetcode.com/problems/minimum-value-to-get-positive-step-by-step-sum/) | [Solution](https://github.com/programmercave0/Competitive-Programming/blob/master/LeetCode/min_value_to_get_positive_step_by_step_sum.cpp) |
| [Number of Good Pairs](https://leetcode.com/problems/number-of-good-pairs/) | [Solution](https://github.com/programmercave0/Competitive-Programming/blob/master/LeetCode/num_of_good_pairs.cpp) |
| [Power of Two](https://leetcode.com/problems/power-of-two/) | [Solution](https://github.com/programmercave0/Competitive-Programming/blob/master/LeetCode/power_of_two.cpp) |
| [Single Number III](https://leetcode.com/problems/single-number-iii/) | [Solution](https://github.com/programmercave0/Competitive-Programming/blob/master/LeetCode/single_number_III.cpp) |
| [Sum of All Subset XOR Totals](https://leetcode.com/problems/sum-of-all-subset-xor-totals/) | [Solution](https://github.com/programmercave0/Competitive-Programming/blob/master/LeetCode/sum_of_all_subset_xor_totals.cpp) |
| [Toeplitz Matrix](https://leetcode.com/problems/toeplitz-matrix/) | [Solution](https://github.com/programmercave0/Competitive-Programming/blob/master/LeetCode/toeplitz_matrix.cpp) |

## InterviewBit

|Challenge                          | Solution     |      Explanation    |
|:---------------------------------:|:------------:|:--------------------|
| [Array - Anti Diagonals](https://www.interviewbit.com/problems/anti-diagonals/) | [Solution](https://github.com/programmercave0/Competitive-Programming/blob/master/InterviewBit/Array_anti_diagonals.cpp) |
| [Array - Balance Array](interviewbit.com/problems/balance-array/) | [Solution](https://github.com/programmercave0/Competitive-Programming/blob/master/InterviewBit/Array_balance_array.cpp) |
| [Array - Find Duplicate In Array](https://www.interviewbit.com/problems/find-duplicate-in-array/) | [Solution](https://github.com/programmercave0/Competitive-Programming/blob/master/InterviewBit/Array_find_duplicate_in_array.cpp) |
| [Array - Largest Number](https://www.interviewbit.com/problems/largest-number/) | [Solution](https://github.com/programmercave0/Competitive-Programming/blob/master/InterviewBit/Array_largest_number.cpp) |
| [Array - Maximum Absolute Difference](https://www.interviewbit.com/problems/maximum-absolute-difference/) | [Solution](https://github.com/programmercave0/Competitive-Programming/blob/master/InterviewBit/Array_maximum_absolute_difference.cpp) |
| [Array - Min Steps In Infinite Grid]() | [Solution](https://github.com/programmercave0/Competitive-Programming/blob/master/InterviewBit/Array_min_steps_in_infinite_grid.cpp) |
| [Array - Perfect Peak Of Array](https://www.interviewbit.com/problems/perfect-peak-of-array/) | [Solution](https://github.com/programmercave0/Competitive-Programming/blob/master/InterviewBit/Array_perfect_peak_of_array.cpp) |
| [Array - Pick from both sides!](https://www.interviewbit.com/problems/pick-from-both-sides/) | [Solution](https://github.com/programmercave0/Competitive-Programming/blob/master/InterviewBit/Array_pick_from_both_sides.cpp) | 
| [Array - Spiral Order Matrix II](https://www.interviewbit.com/problems/spiral-order-matrix-ii/) | [Solution](https://github.com/programmercave0/Competitive-Programming/blob/master/InterviewBit/Array_spiral_order_matrix_II.cpp) |
| [Array - Subarray with given XOR](https://www.interviewbit.com/problems/subarray-with-given-xor/) | [Solution](https://github.com/programmercave0/Competitive-Programming/blob/master/InterviewBit/Array_subarray_with_given_xor.cpp) | 
| [Array - Wave Array](https://www.interviewbit.com/problems/wave-array/) | [Solution](https://github.com/programmercave0/Competitive-Programming/blob/master/InterviewBit/Array_wave_array.cpp) |
| [Binary Search - Allocate Books](https://www.interviewbit.com/problems/allocate-books/) | [Solution](https://github.com/abhiabhi0/Competitive-Programming/blob/master/InterviewBit/Binary_Search_Allocate_Books.py) |
| [Bit Manipulation - Number of 1 Bits](https://www.interviewbit.com/problems/number-of-1-bits/) | [Solution](https://github.com/programmercave0/Competitive-Programming/blob/master/InterviewBit/Bit_Manipulation_number_of_1_bits.cpp) |
| [Bit Manipulation - Reverse Bits](https://www.interviewbit.com/problems/reverse-bits/) | [Solution](https://github.com/programmercave0/Competitive-Programming/blob/master/InterviewBit/Bit_Manipulation_reverse_bits.cpp) |
| [Math - Next Similar Number](https://www.interviewbit.com/problems/next-similar-number/) | [Solution](https://github.com/programmercave0/Competitive-Programming/blob/master/InterviewBit/Math_next_similar_number.cpp) |
| [Math - Prime Sum](https://www.interviewbit.com/problems/prime-sum/) | [Solution](https://github.com/programmercave0/Competitive-Programming/blob/master/InterviewBit/Math_prime_sum.cpp) |
| [Math - Total Moves For Bishop!](https://www.interviewbit.com/problems/total-moves-for-bishop/) | [Solution](https://github.com/programmercave0/Competitive-Programming/blob/master/InterviewBit/Math_total_moves_for_bishop.cpp) |
| [String - Minimum Characters required to make a String Palindromic](https://www.interviewbit.com/problems/minimum-characters-required-to-make-a-string-palindromic/) | [Solution](https://github.com/programmercave0/Competitive-Programming/blob/master/InterviewBit/String_Min_characters_required_to_make_string_palindrome.cpp) |

## CodeChef

|Challenge                          | Solution     |      Explanation    |
|:---------------------------------:|:------------:|:--------------------|
| [Bit Manipulation - The Unchanging OR](https://www.codechef.com/problems/UNCHANGEDOR) | [Solution](https://github.com/programmercave0/Competitive-Programming/blob/master/CodeChef/Bit_unchanging_or.cpp) | 
| [Bit Manipulation - XOR and AND](https://www.codechef.com/problems/XORAND) | [Solution](https://github.com/programmercave0/Competitive-Programming/blob/master/CodeChef/Bit_xorand.cpp) | 
| [String - How Many Maximums](https://www.codechef.com/submit-v2/HOWMANYMAX?tab=statement) | [Solution](https://github.com/programmercave0/Competitive-Programming/blob/master/CodeChef/String_how_many_maxs.cpp) |

## GeeksForGeeks

|Challenge                          | Solution     |      Explanation    |
|:---------------------------------:|:------------:|:--------------------|
| [BST - Add all greater values to every node in a BST](https://practice.geeksforgeeks.org/problems/add-all-greater-values-to-every-node-in-a-bst/1/) | [Solution](https://github.com/programmercave0/Competitive-Programming/blob/master/Geeksforgeeks/BST_Add_all_greater_values_to_every_node_in_BST.cpp) |
| [DP - Word Break](https://practice.geeksforgeeks.org/problems/word-break1352/1#) | [Solution](https://github.com/programmercave0/Competitive-Programming/blob/master/Geeksforgeeks/DP_word_break.cpp) |
| [DP - Egg Dropping Puzzle](https://practice.geeksforgeeks.org/problems/egg-dropping-puzzle-1587115620/1#) | [Solution](https://github.com/programmercave0/Competitive-Programming/blob/master/Geeksforgeeks/DP_egg_dropping_puzzle.cpp) |
| [DP - Matrix Chain Multiplication](https://practice.geeksforgeeks.org/problems/matrix-chain-multiplication0303/1#) | [Solution](https://github.com/programmercave0/Competitive-Programming/blob/master/Geeksforgeeks/DP_mcm.cpp) |
| [DP - Maximum sum increasing subsequence](https://practice.geeksforgeeks.org/problems/maximum-sum-increasing-subsequence4749/1#) | [Solution](https://github.com/programmercave0/Competitive-Programming/blob/master/Geeksforgeeks/DP_max_sum_incr_subseq.cpp) |
| [DP - Palindromic patitioning](https://practice.geeksforgeeks.org/problems/palindromic-patitioning4845/1#) | [Solution](https://github.com/programmercave0/Competitive-Programming/blob/master/Geeksforgeeks/DP_paindromic_partitioning.cpp) |
| [Linked List - Flattening a Linked List](https://practice.geeksforgeeks.org/problems/flattening-a-linked-list/1#) | [Solution](https://github.com/programmercave0/Competitive-Programming/blob/master/Geeksforgeeks/LL_flattening_ll.cpp) |
| [Queue - Reverse First K elements of Queue](https://practice.geeksforgeeks.org/problems/reverse-first-k-elements-of-queue/1/) | [Solution](https://github.com/programmercave0/Competitive-Programming/blob/master/Geeksforgeeks/Queue_reverse_first_k_elements_of_queue.cpp) |
| [Recursion - Subset Sums](https://practice.geeksforgeeks.org/problems/subset-sums2234/1#) | [Solution](https://github.com/programmercave0/Competitive-Programming/blob/master/Geeksforgeeks/Recursion_subset_sums.cpp) |
| [String - Longest Even Length Substring](https://practice.geeksforgeeks.org/problems/longest-even-length-substring/0/) | [Solution](https://github.com/programmercave0/Competitive-Programming/blob/master/Geeksforgeeks/String_longest_even_length_substring.cpp) |

## HackerEarth

|Challenge                          | Solution     |      Explanation    |
|:---------------------------------:|:------------:|:--------------------|
| [Roy and Code Streak](https://www.hackerearth.com/problem/algorithm/roy-and-code-streak/) | [Solution](https://github.com/programmercave0/Competitive-Programming/blob/master/Hackerearth/Roy_and_Code_Streak.cpp) | [Blog](https://programmercave0.github.io/blog/2019/10/24/Roy-and-Code-Streak-HackerEarth-Challenge) |

## SPOJ

|Challenge                          | Solution     |      Explanation    |
|:---------------------------------:|:------------:|:--------------------|
| [CPTTRN5 - Character Patterns (Act 5)](https://www.spoj.com/problems/CPTTRN5/) | [Solution](https://github.com/programmercave0/Competitive-Programming/blob/master/SPOJ/ptrn5.cpp) |

Also check out : \
[CodinGame-Solutions](https://github.com/programmercave0/CodinGame-Solutions)\
[Algo-Data-Structure](https://github.com/programmercave0/Algo-Data-Structure)

If you are considering enrolling in Scaler Academy and would like a referral and discount on your fees, I can help. As a current Scaler student, I am able to provide referrals. Please fill out the form at the following link for more information: [FORM - Information before Scaler Academy Referral](https://forms.gle/ZZum3N28FSVDphyU9)

Are you passionate about development and want to find a job that utilizes your skills? Check out [Geektrust](https://www.geektrust.com/create-account?refToken=878753f7a7a69b6db8ea7c) for resources and opportunities in the field of development

Competitive-Programming

Competitive-Programming Latest Version Download

Today's picks

Was this content helpful?

Recent Feedback

Competitive-Programming

Competitive-Programming Latest Version Download

Today's picks

Was this content helpful?

Recent Feedback

Download README