.png&blockId=1944f852-4942-80e1-b97c-e2405856fcb7&width=3600)
The Only Quest for Registration: Solve 3 Problems !
Before starting, You need to apply for the camp and receive your quest.
1 → 2 → Quest received
Visit https://codetree.ai/camp/my-camp if you see this image, your Quest has been received.
Have you received your quest?
Now, You MUST SOLVE 3 Codetree problems by Feb 15, 5:00 PM (PST)
Important: Failure to meet this requirement will result in your camp application being canceled and your Codetree access being revoked.
Step 1. Choose Your Trail
Trail 1 : Foundations of Coding
Learn the basic syntax of various programming languages.
#Variables & Output #Input Basics #Basic Operators #Conditional Statements #Loops #Nested Loops #Arrays #Two-Dimensional Arrays #String
Trail 2 : Algorithmic Foundations
Develop fundamental implementation and debugging skills.
#Functions #Recursive Functions #Sorting #Simulation I #Simulation II #Exhaustive Search I #Exhaustive Search II #Exhaustive Search III #Case Work #Ad-Hoc
Trail 3 : Data Structures Fundamentals
Learn algorithms and data structures used in problem-solving through multiple-choice questions.
#Time and Space Complexity #Linear Data Stuctures #Sorting Algorithms #Binary Search #Stack, Queue, and Deque #Tree Structures #Hashing Techniques #Dynamic Programming Basics #Graph Basics #Advanced Graph Algorithms
Trail 4 : Practical Algorithm Design
Learn basic algorithms including BFS, DFS, and DP.
#Advanced Simulation #Backtracking #Depth-First Search #Breadth-First Search #Dynamic Programming I #Dynamic Programming II
Trail 5 : Advanced Algorithms I
Master time optimization algorithms like Two Pointer, Binary Search, and advanced data structures.
#Advanced Data Structures #Basic Optimization Techniques #Parametric Search #Greedy Algorithms #Shortest Path Algorithms
Trail 6 : Advanced Algorithms II
Study advanced algorithms including Tree algorithms and Topological Sort.
#Advanced Tree Algorithms #Minimum Spanning Trees #Topological Sort #Fundamental String Algorithms #Advanced Dynamic Programming
* Feel free to switch between Trails - just complete 3 problems total
* Use the tabs to easily explore different Trails.
Step 2. Solve Three Problems
Choose any problem from any Trail - just solve 3 problems total
Follow these steps:
Review the Concept tab to understand the approach
Navigate to the Problem tab and write your solution
Click Run to test your code
Submit your solution to mark it complete
! Only correctly submitted solutions count towards your progress
Solved all 3 problems? Your camp registration is complete!
How can you check if you've solved 3 problems?
Visit https://www.codetree.ai/trail-info and add up the completed problems shown in the red boxes in the image. These numbers indicate your completed problems in each trail.
You'll receive an email with orientation details 1-2 days before the camp starts. Keep an eye on your inbox!
Join Our Discord Community
* If the link appears invalid, try opening it in an incognito/private window.
FAQ
Q : Where is the function? This looks different from LeetCode problems
A :
We intentionally use standard input format (instead of function parameters) to help you:
•
Practice writing complete programs like in real coding tests
•
Learn input/output handling, which is essential for many coding interviews
•
Develop better understanding of program structure and flow
Here's how to read inputs in different languages:
Python
Javascript
Java
C++
Q : Can't I see other people's code?
A :
Learning from others' solutions is a great way to improve your problem-solving skills.
After you solve a problem, you can view other submissions in the Submissions tab to find potential improvements in your code.
Q : Why is my solution wrong?
A :
1.
Check the Solution tab to see the optimal approach written by our experts.
2.
Post your question in the Discussion tab.
Our international algorithm competition medalists with 10+ years of DSA teaching experience will respond within 24 hours.
3.
Try solving problems in an easier Trail level.
Get in Touch
If you have any questions, please leave them through the link below.
A product by Branch & Bound
Branch & BoundAll educational materials on the Codetree site are protected by copyright law. Unauthorized reproduction/copying/distribution without the consent of the author is prohibited.
Copyright Branch & Bound | contact@Codetree.ai
Branch & Bound | contact@Codetree.aiCEO : Sam Lee | Address: 1000 N. West Street, Suite 1200, Wilmington, Delaware, 19801 | Landline : +1 302 295 4813 | Contact : contact@bandb.ai