GFG-Competitive-Programming

What is CP (Competitive Programming)?

Competitive programming is a sport. 
A sport based on problem-solving skills, thinking ability, speed testing, regularity and to be precise. 
Competitive Programming will help you build logic and implement that logic to find solutions to a real-world problem. 
Brainstorming upon your code will increase your coding skills as well as it will help to expand your thinking capacity.

---

Platform to practice CP:

• HackerRank
• CodeChef
• CodeForces
• HackerEarth
• GeeksForGeeks
• LeetCode (For Data-Structures and Algos)
• interviewBit
• Leetcode (for monthly challenges)

Languages we have solutions:

Problems we have solutions:

Arrays:

Recursion:

String:

Linked List:

Searching:

• Binary Search
• Count no of 1s in a sorted array
• Count occurrences of a given number in a sorted array
• Find index of first occurrence of a given number in a sorted array
• Find index of last occurrence of a given number in a sorted array
• Peak element in an unsorted array
• Search in an sorted array of infinite length
• Search in a sorted rotated array
• Square root of a number
• Triplet with given sum in a sorted array
• Pair with given sum in sorted array (Time Complexity = O(n) & Auxiliary Space = O(1))
• Median of two sorted arrays
• Repeating element (Time Complexity = O(n), Auxiliary Space = O(1), without modifying array)
• Allocate minimum no. of pages
• Count more than n/k occurrences
• Two repeated elements

Hashing:

• Open Addressing

• Separate Chaining

• Count no. of distinct elements in an array

• Frequencies of each element in an array

• Intersection of two arrays in an array

• Longest consecutive subsequence in an array

• Longest subarray with no. of 0s and 1s in a binary array

• Longest subarray with given sum in an array

• Element with more than n/k occurrences in an array

• Pair with given sum in an array

• Subarray with given sum in an array

• Subarray with zero-sum in an array

• Union of two arrays

• Check if two arrays are equals

• Count no. of non-repeated element in an array

• Count no. of subarrays with equal 0s and 1s in an array

• Find the first repeating element in an array

• Find subarray with given sum exists or not

• • NUMBER CONTAINING 123
• • POSITIVE NEGATIVE PAIR

• Print non-repeating elements in an array

• Sort array by elements frequency