Cavisson Systems HR Specialist Interview Questions and Answers

An online test with 2 coding problems
1. DP medium
2. Tree medium

In-person interview, asked 2 coding questions
1. easy question based on binary search. Write pseudo code on paper
2. medium question based on tree. Write pseudo code on paper

Q1. Asked about the projects mentioned in resume
Add your answer
Q2. What challenges did you overcome in your last internship
Ans. 
I overcame challenges related to learning new technologies and working in a fast-paced environment.
• Learning to use a new programming language and framework

• Adapting to the fast-paced nature of the work environment

• Troubleshooting and debugging complex issues

• Collaborating with team members to meet project deadlines
Answered by AI
Add your answer

Q1. Question on quick sort
Add your answer
Q2. Golang internals
Add your answer
Q3. Question on docker and kubernetes
Add your answer

Q1. Question on design pattern
Add your answer

Good DSA knowledge requires

Q1. Merge sorted array
Add your answer

Q1. Java questions, troubleshooting
Add your answer
Q2. Merge sorted array
Add your answer

Q1. Techno managerial
Add your answer

Not applicable for details disclosure

Q1. General questions
Add your answer

An online assessment was conducted, during which medium-level questions from LeetCode were asked.

Onsite interview. basic coding question was asked which was asked to improve on based on constraints.

Q1. System design question was asked with some scenario. Followup quesions were asked based on my answers.
Add your answer

Reverse a linked list in go,

1 medium-level leetcode question

Q1. 1 String-based question
Add your answer
Q2. 1 Array-based question
Add your answer

Q1. Design in-memory file system
Ans. 
Design an in-memory file system for efficient file storage and retrieval
• Use a tree data structure to represent directories and files

• Implement caching mechanisms to improve performance

• Consider using hash tables for fast file lookup

• Support file operations like read, write, delete, and search

• Ensure data consistency and durability through proper error handling
Answered by AI
Add your answer

Karat took 2 rounds of coding test

Q1. Tree based hard level question...
Add your answer
Q2. Diameter of tree but nodes are strings
Ans. 
To find the diameter of a tree with nodes as strings, convert strings to integers for calculations.
• Convert strings to integers for calculations

• Use depth-first search to find the longest path between two nodes
Answered by AI
Add your answer
Q3. Design question LRU cache
Add your answer