Cohesity Interview Questions, Process, and Tips

Q1. Python robot framework
Add your answer

Q1. Why you want join veritas
Add your answer

Q1. C++ fundamentals interview
Add your answer

Q1. Prepare OS, DS-algo: linked list, bst, stacks, queue, array
Add your answer

Q1. 360 degree technical and confidence check. Anything can be asked from your wirk experience
Add your answer

Q1. This round is to purely judge you that you are fit for the team or not. Your attitude, behavioural questions! E.g. what would you do if there is a conflict between you and other colleague over a technical...read more
Add your answer

Q1. Last round abt salary negotiation!
Add your answer

Round duration - 90 minutes
Round difficulty - Medium

Test was conducted in the evening time .It was an online test with remote-proctoring consisted of 2 coding questions and 20 MCQS .The environment was quite good on the day of the test.

Q1. 
Balanced Sequence After Replacement
Given a string of length 'N' containing only the characters: '[', '{', '(', ')', '}', ']'. At certain places, the character 'X' appears in place of any bracket. Your go...read more
Ans. 
Determine if a valid balanced sequence can be achieved by replacing 'X's with suitable brackets.
• Iterate through the string and keep track of the count of opening and closing brackets.

• If at any point the count of closing brackets exceeds the count of opening brackets, return False.

• If all 'X's can be replaced to form a valid balanced sequence, return True.
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

This was technical+hr round
The interviewer was very friendly. He helped me in all questions.

Q1. 
String Palindrome Verification
Given a string, your task is to determine if it is a palindrome considering only alphanumeric characters.
Input:
The input is a single string without any leading or trailing...read more
Ans. 
Check if a given string is a palindrome considering only alphanumeric characters.
• Remove non-alphanumeric characters from the input string.

• Convert the string to lowercase for case-insensitive comparison.

• Compare characters from start and end of the string to determine if it is a palindrome.
Answered by AI
View 1 more answer