Datadog | SSE | Screening Round | Paris

Anonymous User
1172
Jan 09, 2025
Jan 10, 2025
  1. Given a paragraph, extract number of words which are repeated and give the output of total number of repetitions.
  2. Given a tree, (different class structure was there , but behind it was a tree), calculate the sum of all the paths from root to child and return the maximum sum obtained.
Comments (4)