Codeforces - Woodcutters - Arrays & Sorting - Java Solution - Whiteboarding Session With Example

Codeforces - Woodcutters - Arrays & Sorting - Java Solution - Whiteboarding Session With Example.

If you find this video helpful, please 'Like' & 'Subscribe'.
This is really helpful for the channel and also motivates me to do more of such good videos.

Problem Link : https://codeforces.com/problemset/problem/545/C

Problem Description:
Little Susie listens to fairy tales before bed every day. Today's fairy tale was about wood cutters and the little girl immediately started imagining the choppers cutting wood. She imagined the situation that is described below.

There are n trees located along the road at points with coordinates x1, x2, ..., xn. Each tree has its height hi. Woodcutters can cut down a tree and fell it to the left or to the right. After that it occupies one of the segments [xi - hi, xi] or [xi;xi + hi]. The tree that is not cut down occupies a single point with coordinate xi. Woodcutters can fell a tree if the segment to be occupied by the fallen tree doesn't contain any occupied point. The woodcutters want to process as many trees as possible, so Susie wonders, what is the maximum number of trees to fell.

Youtube channel: https://www.youtube.com/channel/UCrvpRH4lSRjp2T6btl0lf4w

https://github.com/maksrane100/codeforces_solutions
https://github.com/maksrane100/leetcode_solutions

#coding #softwareengineer #Leetcode #Algorithm #DataStructure #Java #programmer #tech #software #codinglife #Preparation
#interview #programminglife #programmingisfun #codeforces