Cohesity Interview Experience

Result
No Offer
Posted
15 Dec 2025
560 reads

Summary

I recently interviewed with Cohesity and encountered a challenging binary tree dynamic programming problem, which I struggled to solve optimally during the coding round.

How it went

My interview at Cohesity commenced with approximately 10 minutes of discussion about my current role, day-to-day responsibilities, and the systems I actively work on. This initial conversation flowed quite naturally and was very conversational.

Following this, the interviewer transitioned to a coding problem:

Questions asked (1)

  1. 01

    Maximum Sum of Non-Adjacent Nodes in Binary Tree

    Data Structures & Algorithms · Medium

    Given a binary tree, find the maximum subset sum such that no two selected nodes are adjacent (meaning you cannot pick both a parent and its direct child).

    This is akin to the "Maximum Sum of Non-Adjacent Nodes in a Binary Tree" problem, often compared to LeetCode's House Robber III.

How they prepared

This interview served as a significant reminder that tree problems frequently necessitate dynamic programming with multiple states. Specifically, when constraints like "cannot pick adjacent nodes" are present, thinking in terms of "include/exclude" states is crucial. It underscored the importance of consistently practicing classic patterns such as Tree DP and DFS with tailored return states. This experience highlighted key areas I needed to focus on, and I've since dedicated time to improving my proficiency in these specific problem types.

Know someone preparing? Send it to them:WhatsAppLinkedInX

Interviewed at Cohesity recently?

Write up your rounds while you still remember the questions. It helps the next person more than you would think.

Share your experience
Discussion 0

Questions for the author, or how your own interview compared.

Join the discussion

Sign in with Google to comment or ask the author a question.

No comments yet

Be the first to share your thoughts and start the discussion!