Repository navigation

GeeksforGeeks-problem

Public

About

💻 300+ GeeksforGeeks DSA solutions in Python covering arrays, strings, trees, graphs, dynamic programming, linked lists, greedy algorithms, and backtracking.

algorithms arrays backtracking coding-challenges competitive-programming data-structures dsa dynamic-programming geeksforgeeks graphs greedy-algorithms interview-preparation linked-list problem-solving python string trees

0 stars

0 watching

Report repository

Name		Name	Last commit message	Last commit date
1s Surrounded by 0s.py		1s Surrounded by 0s.py
2D Submatrix Sum Queries.py		2D Submatrix Sum Queries.py
Add Number Linked Lists.py		Add Number Linked Lists.py
Adding Ones.py		Adding Ones.py
Adventure in a Maze.py		Adventure in a Maze.py
All numbers with specific difference.py		All numbers with specific difference.py
Anagram Palindrome.py		Anagram Palindrome.py
Array Duplicates.py		Array Duplicates.py
Articulation Point - II.py		Articulation Point - II.py
Balanced Brackets.py		Balanced Brackets.py
Balancing with Distinct Powers.py		Balancing with Distinct Powers.py
Binary Searchable Count.py		Binary Searchable Count.py
Binary Strings with Equal Sum of Two Halves.py		Binary Strings with Equal Sum of Two Halves.py
Bird and Max Fruit Gathering.py		Bird and Max Fruit Gathering.py
Box Stacking.py		Box Stacking.py
Brackets in Matrix Chain Multiplication.py		Brackets in Matrix Chain Multiplication.py
Buildings with Sunlight.py		Buildings with Sunlight.py
Burning Tree.py		Burning Tree.py
Bus Conductor.py		Bus Conductor.py
Bus Ticket Change.py		Bus Ticket Change.py
Buy Stock with Transaction Fee.py		Buy Stock with Transaction Fee.py
Check Level Anagrams in Binary Trees.py		Check Level Anagrams in Binary Trees.py
Check Preorder of BST.py		Check Preorder of BST.py
Check Repeated Substring with K Replacements.py		Check Repeated Substring with K Replacements.py
Check Subset sum divisible by k.py		Check Subset sum divisible by k.py
Check for Power.py		Check for Power.py
Check if All Bits Set.py		Check if All Bits Set.py
Check if an Array is Max Heap.py		Check if an Array is Max Heap.py
Check if subtree.py		Check if subtree.py
Chocolate Distribution Problem.py		Chocolate Distribution Problem.py
Chocolates Pickup.py		Chocolates Pickup.py
Choose and Swap.py		Choose and Swap.py
Coils in a Matrix.py		Coils in a Matrix.py
Complete Binary Tree Traversal with Array Input.py		Complete Binary Tree Traversal with Array Input.py
Consecutive 1's not allowed.py		Consecutive 1's not allowed.py
Construct List using XOR Queries.py		Construct List using XOR Queries.py
Construct a Full Binary Tree.py		Construct a Full Binary Tree.py
Construct an array from its pair-sum array .py		Construct an array from its pair-sum array .py
Convert One String to Another with Constraints.py		Convert One String to Another with Constraints.py
Count Derangements.py		Count Derangements.py
Count Indices That Escape Array.py		Count Indices That Escape Array.py
Count Indices to Balance Even and Odd Sums.py		Count Indices to Balance Even and Odd Sums.py
Count Inversions.py		Count Inversions.py
Count Matching Subsequences .py		Count Matching Subsequences .py
Count Pairs Divisible By K.py		Count Pairs Divisible By K.py
Count Pairs Violating BST Property.py		Count Pairs Violating BST Property.py
Count Palindromic Strings with Constraints.py		Count Palindromic Strings with Constraints.py
Count Prefix-Balanced Binary Strings.py		Count Prefix-Balanced Binary Strings.py
Count Sorted Digit Groupings.py		Count Sorted Digit Groupings.py
Count Spanning Trees in a Graph.py		Count Spanning Trees in a Graph.py
Count Subarray with k odds.py		Count Subarray with k odds.py
Count Subarrays with given XOR.py		Count Subarrays with given XOR.py
Count Subsequences Divisible by n.py		Count Subsequences Divisible by n.py
Count Subset With Target Sum II.py		Count Subset With Target Sum II.py
Count X in Range of a Sorted Array.py		Count X in Range of a Sorted Array.py
Count distinct elements in every window.py		Count distinct elements in every window.py
Count elements less than or equal to k in a sorted rotated array.py		Count elements less than or equal to k in a sorted rotated array.py
Count increasing Subarrays.py		Count increasing Subarrays.py
Course Schedule I.py		Course Schedule I.py
Course Schedule II.py		Course Schedule II.py
Coverage of all Zeros in a Binary Matrix.py		Coverage of all Zeros in a Binary Matrix.py
Cut Matrix.py		Cut Matrix.py
Cut rope to maximise product.py		Cut rope to maximise product.py
Delete Nodes with Greater on Right.py		Delete Nodes with Greater on Right.py
Dice throw.py		Dice throw.py
Distribute Candies.py		Distribute Candies.py
Dominant Pairs.py		Dominant Pairs.py
Elements in range [a, b].py		Elements in range [a, b].py
Elements in the Range.py		Elements in the Range.py
Equal Point in Brackets.py		Equal Point in Brackets.py
Equalize All Prefix Sums.py		Equalize All Prefix Sums.py
Equalize the Towers.py		Equalize the Towers.py
Exit Point in a Matrix.py		Exit Point in a Matrix.py
Express as Consecutive Number Sum.py		Express as Consecutive Number Sum.py
Expression contains redundant bracket or not.py		Expression contains redundant bracket or not.py
Find H-Index.py		Find H-Index.py
Find Kth Rotation.py		Find Kth Rotation.py
Find the Peak Element in a 2D Matrix.py		Find the Peak Element in a 2D Matrix.py
Find the closest pair from two arrays.py		Find the closest pair from two arrays.py
Finding Profession.py		Finding Profession.py
Flattening a Linked List.py		Flattening a Linked List.py
Flip to Maximize 1s.py		Flip to Maximize 1s.py
Form the Largest Number.py		Form the Largest Number.py
Friends Pairing Problem.py		Friends Pairing Problem.py
Geek in a Maze.py		Geek in a Maze.py
Generate IP Addresses.py		Generate IP Addresses.py
Generate Permutations of an array.py		Generate Permutations of an array.py
Gray Code.py		Gray Code.py
Happiest Triplet.py		Happiest Triplet.py
High Effort vs Low Effort.py		High Effort vs Low Effort.py
Huffman Encoding.py		Huffman Encoding.py
Implement Atoi.py		Implement Atoi.py
Implement UNDO & REDO.py		Implement UNDO & REDO.py
Implement k Queues in a Single Array.py		Implement k Queues in a Single Array.py
Interleave the First Half of the Queue with Second Half.py		Interleave the First Half of the Queue with Second Half.py
Intersection in Y Shaped Lists.py		Intersection in Y Shaped Lists.py
Intersection of Two Sorted Arrays.py		Intersection of Two Sorted Arrays.py
Josephus problem.py		Josephus problem.py
K Sized Subarray Maximum.py		K Sized Subarray Maximum.py
K Sized Subarray Maximum.py		K Sized Subarray Maximum.py

Repository files navigation

GeeksforGeeks-problem

About

💻 300+ GeeksforGeeks DSA solutions in Python covering arrays, strings, trees, graphs, dynamic programming, linked lists, greedy algorithms, and backtracking.

algorithms arrays backtracking coding-challenges competitive-programming data-structures dsa dynamic-programming geeksforgeeks graphs greedy-algorithms interview-preparation linked-list problem-solving python string trees

0 stars

0 watching

Report repository

Releases

Packages

Contributors

Languages