13 questions · from 7 interviews

Cohesity interview questions

Every question candidates reported from their Cohesity interviews, most frequently asked first. Each links to the write-up it came from, so you can see the round and how it went.

Cohesity coding and DSA questions

  1. 01

    Minimum Number of Days to Make m Bouquets

    Problem: Given an array where each element represents the day a flower will bloom, determine the minimum number of days required to make m bouquets, each consisting of k consecutive blooming flowers. Refer to the linked LeetCode problem for full details.

    Medium · From Cohesity Interview Experience || MTS-3 || 1st Round

  2. 02

    Largest Plus Sign

    Problem: Given an n x n binary grid where 1 represents a usable cell and 0 an obstacle, find the order of the largest axis-aligned plus sign of 1's that can be formed. See the linked LeetCode problem for the complete description.

    Medium · From Cohesity Interview Experience || MTS-3 || 1st Round

  3. 03

    Most Stones Removed with Same Row or Column

    Given a list of stones on a 2D plane, a stone can be removed if it shares a row or column with another stone. Return the maximum number of stones that can be removed such that at least one stone remains in each connected component.

    Medium · From Cohesity interview experience - Software Engineer 3

  4. 04

    Maximum Sum of Non-Adjacent Nodes in Binary Tree

    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…

    Medium · From Cohesity Interview Experience

  5. 05

    Shortest Distance to All Solar-Powered Houses in a Graph

    We have an undirected, connected graph of n houses labeled 0…n–1. A subset of these houses, given by solarPanels, already have power and incur cost 0. Every other house must “pull” electricity along the wires (each wire = unit distance) to its nearest…

    Medium · From Cohesity | MTS-3 | Interview Experience | Selected

  6. 06

    Delete Nodes And Return Forest

    Delete Nodes And Return Forest

    Medium · From Cohesity | MTS-3 | Interview Experience | Selected

  7. 07

    4 Sum Problem Variation

    I was presented with a variation of the classic 4 Sum problem and tasked with coding an optimized solution. The problem required a thorough discussion of the approach before implementation.

    From Cohesity India MTS 3 | reject

  8. 08

    Low-Level Design and C++ Implementation of Multi-Tier Cache

    Following the system design discussion, I was later asked to provide a low-level design and implement a portion of the multi-tier cache in C++. This involved coding classes and interfaces for the cache system.

    From Cohesity India MTS 3 | reject

Cohesity system design questions

  1. 01

    Design a Service Wrapper for Multiple Cloud Blob Stores

    Design a service that acts as a wrapper around different blob storage providers from various clouds. The service should allow a user to upload a file and provide additional details. Consider the following aspects in your design: - Cloud provider name - Blob…

    From Cohesity | LLD | MTS 3 | Interview Experience And Guidelines

  2. 02

    Design a File System

    I was asked to design a file system. The interviewer was more focused on low-level concepts, SOLID principles, and the design choices I made during the interview. There was also a strong emphasis on understanding the benefits of choosing one design decision…

    From Cohesity MTS-2 | Interview experience

  3. 03

    Design Key Management System

    Design Key Management System with certain requirements. Discussed in depth about DB (which & why), how to ensure high availability, type of replication to be used, caching, scaling, how bootstrapping will work, key rotation - old keys are rotated regularly or…

    Hard · From Cohesity | MTS-3 | Interview Experience | Selected

  4. 04

    Multi-Tier Cache Design

    I was asked to design a multi-tier cache system. The cache had specific tiers: RAM (100MB), SSD (2TB), and HDD, with the requirement that GET times would increase with each subsequent tier. I needed to consider eviction policies and data management strategies…

    From Cohesity India MTS 3 | reject

Cohesity behavioural and HR questions

  1. 01

    Most Difficult Part of Mentoring

    Describe what was the most difficult part of mentoring juniors or interns.

    From Cohesity MTS-2 | Interview experience

Cohesity interview questions FAQ

What questions are asked in Cohesity interviews?

Candidates reported 13 distinct questions across 7 Cohesity interviews. 8 coding and DSA questions, 4 system design questions, 1 behavioural and HR questions.

How difficult are Cohesity interview questions?

Of the questions candidates rated, 0% were easy, 86% medium and 14% hard.