GitHub - Praxhant97/cpp_solutions: these are solutions of problems from leetcode, codeforces or from geeksforgeeks, you can see the questions by searching for the topic name

Branches Tags

Name		Name	Last commit message	Last commit date
Latest commit History 4 Commits
problems everyday.c		problems everyday.c
striver array		striver array
.gitignore		.gitignore
1.c		1.c
A_Create_A_New_String.cpp		A_Create_A_New_String.cpp
B_Let_s_use_Getline.cpp		B_Let_s_use_Getline.cpp
B_Searching.cpp		B_Searching.cpp
C_Compare.cpp		C_Compare.cpp
C_Even_Odd_Positive_and_Negative.cpp		C_Even_Odd_Positive_and_Negative.cpp
D_Fixed_Password.cpp		D_Fixed_Password.cpp
E_Area_of_a_Circle.cpp		E_Area_of_a_Circle.cpp
G_Factorial.cpp		G_Factorial.cpp
G_Palindrome_Array.cpp		G_Palindrome_Array.cpp
H_Sorting.cpp		H_Sorting.cpp
I_Palindrome.cpp		I_Palindrome.cpp
I_Welcome_for_you_with_Conditions.cpp		I_Welcome_for_you_with_Conditions.cpp
J_Multiples.cpp		J_Multiples.cpp
J_Primes_from_1_to_n.cpp		J_Primes_from_1_to_n.cpp
K_Divisors.cpp		K_Divisors.cpp
K_Max_and_Min.c		K_Max_and_Min.c
K_Max_and_Min.cpp		K_Max_and_Min.cpp
K_Sum_Digits.cpp		K_Sum_Digits.cpp
L_GCD.cpp		L_GCD.cpp
L_Max_Subarray.cpp		L_Max_Subarray.cpp
M_Capital_or_Small_or_Digit.cpp		M_Capital_or_Small_or_Digit.cpp
M_Subsequence_String.cpp		M_Subsequence_String.cpp
O_Calculator.cpp		O_Calculator.cpp
O_Pyramid.cpp		O_Pyramid.cpp
P_Count_Words.cpp		P_Count_Words.cpp
P_Shape_1.cpp		P_Shape_1.cpp
Palindrome_Partitioning.cpp		Palindrome_Partitioning.cpp
Q_Coordinates_of_a_Point.cpp		Q_Coordinates_of_a_Point.cpp
Q_Count_Subarrays.cpp		Q_Count_Subarrays.cpp
S_Search_In_Matrix.cpp		S_Search_In_Matrix.cpp
T_Shape_2.cpp		T_Shape_2.cpp
W_Shape_3.cpp		W_Shape_3.cpp
X_Two_intervals.cpp		X_Two_intervals.cpp
Y_Range_sum_query.cpp		Y_Range_sum_query.cpp
Z_Three_Numbers.cpp		Z_Three_Numbers.cpp
function.c		function.c
hello_world.cpp		hello_world.cpp
subsets2.cpp		subsets2.cpp
tempCodeRunnerFile.cpp		tempCodeRunnerFile.cpp
test.cpp		test.cpp