CodeDaily

DSA

Arrays & Strings Recursion Trees & Graphs Dynamic Programming Linked Lists View all →

Web Dev

Frontend Backend Full Stack DevOps APIs & REST View all →

AI & ML

Machine Learning Deep Learning Computer Vision NLP Data Science View all →

Blockchain

Smart Contracts DeFi Web3 Solidity NFTs & Tokens View all →

Level 1 · Easy

Patterns Linked Lists Stacks and Queues Binary Tree Graphs 2D Arrays Hashmap And Heap All Level 1 →

Level 2 · Medium

Arrays and Strings Dynamic Programming Trees Graphs Linked List Stacks Bit Manipulation All Level 2 →

Level 3 · Hard

Maths Segment Tree Game Theory Number Theory Geometry Digit DP Range Queries All Level 3 →

Python JavaScript Java C++ C TypeScript Go Rust Kotlin Swift Ruby C# Dart PHP Zig Perl Haskell Julia F# OCaml Pascal COBOL

All languages →

Contests

CodeDaily

Topics

DSA Web Dev AI & ML Blockchain Cybersecurity Cloud DevOps Mobile System Design

Questions

Level 1 · Easy

Patterns Linked Lists Stacks and Queues Binary Tree Graphs 2D Arrays Hashmap And Heap

Level 2 · Medium

Arrays and Strings Dynamic Programming Trees Graphs Linked List Stacks Bit Manipulation

Level 3 · Hard

Maths Segment Tree Game Theory Number Theory Geometry Digit DP Range Queries

Compiler

Python JavaScript TypeScript Java C++ C Go Rust Kotlin Swift Ruby C# Dart PHP Zig Perl Haskell Julia F# OCaml Pascal COBOL

All languages →

Contests

DSA Level 3 Competitive Euler Tour New Year Tree

New Year Tree

hard

Euler Tour

Question Solve Solutions

Input

Output

                    Click Run to execute
                

No submissions yet

Subtree Sum

Lca - Lowest Common Ancestor - Euler Tour

Learn

DSA Web Dev AI & ML Blockchain Cybersecurity All Topics →

Practice

Level 1 · Easy Level 2 · Medium Level 3 · Hard Online Compiler All Problems

Company

About Pricing Contests Testimonials FAQ Contact

New Year Tree

Related Questions