Skip to content
Navigation Menu
Sign in
Appearance settings
Platform
AI CODE CREATION
GitHub Copilot
Write better code with AI
GitHub Copilot app
Direct agents from issue to merge
MCP Registry
Integrate external tools
DEVELOPER WORKFLOWS
Actions
Automate any workflow
Codespaces
Instant dev environments
Issues
Plan and track work
Code Review
Manage code changes
Code Quality
Enforce quality at merge
APPLICATION SECURITY
GitHub Advanced Security
Find and fix vulnerabilities
Code security
Secure your code as you build
Secret protection
Stop leaks before they start
EXPLORE
Why GitHub
Documentation
Blog
Changelog
Marketplace
View all features
Solutions
BY COMPANY SIZE
Enterprises
Small and medium teams
Startups
Nonprofits
BY USE CASE
App Modernization
DevSecOps
DevOps
CI/CD
View all use cases
BY INDUSTRY
Healthcare
Financial services
Manufacturing
Government
View all industries
View all solutions
Resources
EXPLORE BY TOPIC
AI
Software Development
DevOps
Security
View all topics
EXPLORE BY TYPE
Customer stories
Events & webinars
Ebooks & reports
Business insights
GitHub Skills
SUPPORT & SERVICES
Documentation
Customer support
Community forum
Trust center
Partners
View all resources
Open Source
COMMUNITY
GitHub Sponsors
Fund open source developers
PROGRAMS
Security Lab
Maintainer Community
Accelerator
GitHub Stars
Archive Program
REPOSITORIES
Topics
Trending
Collections
Enterprise
ENTERPRISE SOLUTIONS
Enterprise platform
AI-powered developer platform
AVAILABLE ADD-ONS
GitHub Advanced Security
Enterprise-grade security features
Copilot for Business
Enterprise-grade AI features
Premium Support
Enterprise-grade 24/7 support
Pricing
Search
/
Sign in
Sign up
Appearance settings
You signed in with another tab or window.
Reload
to refresh your session.
You signed out in another tab or window.
Reload
to refresh your session.
You switched accounts on another tab or window.
Reload
to refresh your session.
Dismiss alert
{{ message }}
rabbygit
/
problem_solving
Public
Notifications
You must be signed in to change notification settings
Fork
1
Star
0
Code
Issues
0
Pull requests
0
Actions
Projects
Security and quality
0
Insights
Additional navigation options
Code
Issues
Pull requests
Actions
Projects
Security and quality
Insights
Files
Expand file tree
master
Breadcrumbs
problem_solving
/
tree
/
Copy path
Directory actions
More options
More options
Directory actions
More options
More options
Latest commit
History
History
History
master
Breadcrumbs
problem_solving
/
tree
/
Copy path
Top
Folders and files
Name
Name
Last commit message
Last commit date
parent directory
..
102-level-order-traversal
102-level-order-traversal
1026-maximum-difference-between-node-and-ancestor
1026-maximum-difference-between-node-and-ancestor
1038-binary-search-tree-to-greater-sum-tree
1038-binary-search-tree-to-greater-sum-tree
104-max-depth-of-tree
104-max-depth-of-tree
107_binary_tree_level_order_tr_2
107_binary_tree_level_order_tr_2
108_convert_sorted_array_to_bst
108_convert_sorted_array_to_bst
109_convert_sorted_list_to_bst
109_convert_sorted_list_to_bst
110-balanced-binary-tree
110-balanced-binary-tree
112-path-sum
112-path-sum
113-path-sum-ii
113-path-sum-ii
116_populating_next_right_pointers_in_each_node
116_populating_next_right_pointers_in_each_node
117_populating_next_right_pointers_in_each_node_2
117_populating_next_right_pointers_in_each_node_2
124_max_path_sum
124_max_path_sum
1325-delete-leaves-with-a-given-value
1325-delete-leaves-with-a-given-value
1382-balance-a-binary-search-tree
1382-balance-a-binary-search-tree
1448-count-good-nodes-in-binary-tree
1448-count-good-nodes-in-binary-tree
1457-pseudo-palindromic-paths-in-a-binary-tree
1457-pseudo-palindromic-paths-in-a-binary-tree
1466-reorder-routes-to-make-all-paths-lead-to-the-city-zero
1466-reorder-routes-to-make-all-paths-lead-to-the-city-zero
1609-even-odd-tree
1609-even-odd-tree
1644-lowest-common-ancestor-of-a-binary-tree-i
1644-lowest-common-ancestor-of-a-binary-tree-i
1650-lowest-common-ancestor-of-a-binary-tree-iii
1650-lowest-common-ancestor-of-a-binary-tree-iii
173_bst_iterator
173_bst_iterator
199-binary-tree-right-side-view
199-binary-tree-right-side-view
226-invert-binary-tree
226-invert-binary-tree
230-kth-smallest-element-in-a-BST
230-kth-smallest-element-in-a-BST
2331-evaluate-boolean-binary-tree
2331-evaluate-boolean-binary-tree
235-lowest-common-anchestar-bst
235-lowest-common-anchestar-bst
236-lowest-common-ancestor-of-a-binary-tree
236-lowest-common-ancestor-of-a-binary-tree
2385-amount-of-time-for-binary-tree-to-be-infected
2385-amount-of-time-for-binary-tree-to-be-infected
2461-cousins-in-binary-tree-ii
2461-cousins-in-binary-tree-ii
2467-most-profitable-path-in-a-tree
2467-most-profitable-path-in-a-tree
2471-minimum-number-of-operations-to-sort-a-binary-tree-by-level
2471-minimum-number-of-operations-to-sort-a-binary-tree-by-level
2583-kth-largest-sum-in-a-binary-tree
2583-kth-largest-sum-in-a-binary-tree
297-serialize-and-deserialize-binary-tree
297-serialize-and-deserialize-binary-tree
366-find-leaves-of-binary-tree
366-find-leaves-of-binary-tree
437-path-sum-iii
437-path-sum-iii
450-delete-node-in-a-bst
450-delete-node-in-a-bst
515-find-largest-value-in-each-tree-row
515-find-largest-value-in-each-tree-row
543-diameter-of-binary-tree
543-diameter-of-binary-tree
572-subtree-of-another-tree
572-subtree-of-another-tree
590-n-ary-tree-postorder-traversal
590-n-ary-tree-postorder-traversal
617_merge_two_binary_trees
617_merge_two_binary_trees
671-second-minimum-node-in-a-binary-tree
671-second-minimum-node-in-a-binary-tree
729-my-calendar-i
729-my-calendar-i
731-my-calendar-ii
731-my-calendar-ii
783_minimum_distance_bet_bst_nodes
783_minimum_distance_bet_bst_nodes
872-leaf-similar-trees
872-leaf-similar-trees
938-range-sum-of-bst
938-range-sum-of-bst
95_unique_bst_2
95_unique_bst_2
construct_bst_from_pre_in
construct_bst_from_pre_in
construct_bst_from_pre_post
construct_bst_from_pre_post
find_bottom_left_tree_value
find_bottom_left_tree_value
in_order_traversal
in_order_traversal
largest_value_in_each_row
largest_value_in_each_row
min_depth_of_tree
min_depth_of_tree
post_order_traversal
post_order_traversal
pre_order_traversal
pre_order_traversal
same_tree
same_tree
sum_of_left_leaves
sum_of_left_leaves
sum_root_to_leaf_numbers
sum_root_to_leaf_numbers
symmetric_tree
symmetric_tree
unique_bst
unique_bst
validate_bst
validate_bst
zigzag_level_order_traversal
zigzag_level_order_traversal
View all files
You can’t perform that action at this time.