GitHub - Shanisoni/Problem-Solver-LeetCode_GFG_CodeStudio: 🚀 Current DSA Explorer in C++ 🔍 Current Focus: Actively solving Data Structures and Algorithms problems on LeetCode and GeeksForGeeks. 📈 Progress Snapshot: Currently tackling challenges of varying difficulty levels for continuous skill enhancement. Focusing on efficient C++ solutions to sharpen problem-solving skills.

Shanisoni / Problem-Solver-LeetCode_GFG_CodeStudio Public

Notifications You must be signed in to change notification settings
Fork 0
Star 8

🚀 Current DSA Explorer in C++ 🔍 Current Focus: Actively solving Data Structures and Algorithms problems on LeetCode and GeeksForGeeks. 📈 Progress Snapshot: Currently tackling challenges of varying difficulty levels for continuous skill enhancement. Focusing on efficient C++ solutions to sharpen problem-solving skills.

8 stars 0 forks Branches Tags Activity

Star

Notifications

Branches Tags

Name		Name	Last commit message	Last commit date
Latest commit History 103 Commits
UT Question		UT Question
1..cpp		1..cpp
1.cpp		1.cpp
1143Longest Common Subsequence.cpp		1143Longest Common Subsequence.cpp
1457_Pseudo-Palindromic Paths in a Binary Tree.cpp		1457_Pseudo-Palindromic Paths in a Binary Tree.cpp
30 Substring with_Concatenation_of_All_Words.cpp		30 Substring with_Concatenation_of_All_Words.cpp
Anagram.cpp		Anagram.cpp
Anagram.exe		Anagram.exe
Array Subset of another array.cpp		Array Subset of another array.cpp
Bitonic Point.cpp		Bitonic Point.cpp
Check for BST.cpp		Check for BST.cpp
Check for Balanced Tree.cpp		Check for Balanced Tree.cpp
Check if two arrays are equal or not.cpp		Check if two arrays are equal or not.cpp
Clone an Undirected Graph.cpp		Clone an Undirected Graph.cpp
Common elements.cpp		Common elements.cpp
Convert array into Zig-Zag fashion.cpp		Convert array into Zig-Zag fashion.cpp
Count Inversions.cpp		Count Inversions.cpp
Count all Possible Path.cpp		Count all Possible Path.cpp
Count_pairs_with_given_sum.cpp		Count_pairs_with_given_sum.cpp
Count_pairs_with_given_sum.exe		Count_pairs_with_given_sum.exe
Discover-Game.cpp		Discover-Game.cpp
Does array represent Heap.cpp		Does array represent Heap.cpp
Find Indexes of a subarray w.cpp		Find Indexes of a subarray w.cpp
Find Indexes of a subarray with given sum.cpp		Find Indexes of a subarray with given sum.cpp
Find all pairs with a given sum.cpp		Find all pairs with a given sum.cpp
Find the Maximum Sum of Node Values.cpp		Find the Maximum Sum of Node Values.cpp
Find triplets with zero sum.py		Find triplets with zero sum.py
Finding middle element in a linked list.cpp		Finding middle element in a linked list.cpp
First element to occur k times.cpp		First element to occur k times.cpp
Gray to Binary equivalent.cpp		Gray to Binary equivalent.cpp
Implement_Atoi.cpp		Implement_Atoi.cpp
Is_it_a_tree.cpp		Is_it_a_tree.cpp
Is_it_a_tree.exe		Is_it_a_tree.exe
K closest elements.cpp		K closest elements.cpp
Kth common ancestor in BST.cpp		Kth common ancestor in BST.cpp
Kth smallest element.cpp		Kth smallest element.cpp
LCS of three strings.cpp		LCS of three strings.cpp
Largest Element in Array.cpp		Largest Element in Array.cpp
Largest subarray with 0 sum.cpp		Largest subarray with 0 sum.cpp
Left View of Binary Tree.cpp		Left View of Binary Tree.cpp
Linked List Insertion.cpp		Linked List Insertion.cpp
Longest Common Prefix in an Array.cpp		Longest Common Prefix in an Array.cpp
Majority Element.cpp		Majority Element.cpp
Median in a row-wise sorted Matrix.cpp		Median in a row-wise sorted Matrix.cpp
Minimize the Heights II.py		Minimize the Heights II.py
Minimum Absolute Difference In BST.cpp		Minimum Absolute Difference In BST.cpp
Minimum Cost To Make Two Strings Identical.cpp		Minimum Cost To Make Two Strings Identical.cpp
Minimum Cost to Hire K Workers.cpp		Minimum Cost to Hire K Workers.cpp
Modular Exponentiation for large numbers.cpp		Modular Exponentiation for large numbers.cpp
NEW1.JAVA		NEW1.JAVA
N_Stack_inArray.cpp		N_Stack_inArray.cpp
Nth node from end of linked list.cpp		Nth node from end of linked list.cpp
Output Window.cpp		Output Window.cpp
Pairs violating the BST property.cpp		Pairs violating the BST property.cpp
Palindrome String.cpp		Palindrome String.cpp
Parenthesis_Checker.cpp		Parenthesis_Checker.cpp
Parenthesis_Checker.exe		Parenthesis_Checker.exe
Party of Couples.cpp		Party of Couples.cpp
Permutations.cpp		Permutations.cpp
Reach a given score.cpp		Reach a given score.cpp
Recamans sequence.cpp		Recamans sequence.cpp
Remove loop in Linked List.cpp		Remove loop in Linked List.cpp
Sum of bit differences.cpp		Sum of bit differences.cpp
Sum of leaf nodes in BST.cpp		Sum of leaf nodes in BST.cpp
Swap two nibbles in a byte.cpp		Swap two nibbles in a byte.cpp
Trapping Rain Water.cpp		Trapping Rain Water.cpp
You and your books.cpp		You and your books.cpp
java.java		java.java
l.cpp		l.cpp
leetCode.cpp		leetCode.cpp
new.cpp		new.cpp
new2.cpp		new2.cpp
o.py		o.py
op.cpp		op.cpp
tcode.cpp		tcode.cpp
tempCodeRunnerFile.js		tempCodeRunnerFile.js