Zendesk Software Engineer Intern Interview Questions and Answers

Coding questions were easy and aptitude questions were a bit hard

Q1. Binary search based on 2 eggs
Add your answer
Q2. Two candles which were of random size, and what is the time to burn one candle completely
Ans. 
The time to burn one candle completely depends on the size of the candles and the rate at which they burn.
• The time to burn one candle completely is directly proportional to the size of the candle.

• The rate at which a candle burns can vary based on factors like the material of the candle, the wick, and the environment.

• For example, a larger candle may take longer to burn completely compared to a smaller candle, even if th
Answered by AI
Add your answer

Q1. What was your most impactful project?
Add your answer
Q2. What was an obstacle you faced?
Add your answer

Behavioral, then DSA

One easy and one medium question(Java)

Q1. Basic java and oops question
Add your answer

It was a 4 hour hacker rank with 2 Long questions

Q1. It was a technical interview with a senior software engineer. The Question was about partitioning a string into lowercase letters, uppercase letters and numbers
Add your answer

The technical assessment was in hackerRank when I was assigned a coding problem and five questions chose which one is right type, two were in time complexity, and three in abstract reasoning, the coding problem I found to be very difficult, and couldn't make any progress on it.

Machine learning take-home assignment in Kaggle.

2 dsa questions
1st is based on strings (easy)
2nd one ie based on hashmaps (medium)

Q1. IP address validation dsa
Add your answer
Q2. Oops question SQL query on employee database
Add your answer

Q1. Managerial round With questions about Linux commands Behavioral questions Questions about past projects
Add your answer

Q1. Question based on arrays, leetcode medium
Add your answer

Arrays,strings,Linkedlist

Q1. Implementation of trees ,stacks .
Ans. 
Trees and stacks are fundamental data structures used in software engineering for organizing and storing data efficiently.
• Trees are hierarchical data structures with nodes connected by edges. Examples include binary trees, AVL trees, and B-trees.

• Stacks are linear data structures that follow the Last In First Out (LIFO) principle. Examples include function call stack and undo/redo stack.
Answered by AI
Add your answer
Q2. Dbms(Acid properties), reverse words in a String.
Add your answer