Zessta Software Services Associate HR Intern Interview Questions and Answers

Neural Hack 6 - Round 1 - 7 DSA Question I have solved 5 only

Round 2 - 5 DSA Problem I'm able to solve only 3 not able to top 100 but call for interview

Q1. Self Introduction
Add your answer
Q2. Which in most efficient sorting algorithm amd why and what is it's time complexity.
Ans. 
The most efficient sorting algorithm is Quick Sort due to its average time complexity of O(n log n).
• Quick Sort is efficient due to its divide and conquer approach.

• It has an average time complexity of O(n log n) and a worst-case time complexity of O(n^2).

• Example: Sorting an array of integers using Quick Sort.
Answered by AI
Add your answer
Q3. What is OOPS and explain all with their examples
Ans. 
OOPS stands for Object-Oriented Programming. It is a programming paradigm based on the concept of objects, which can contain data and code.
• OOPS focuses on creating objects that interact with each other to solve a problem

• Key principles of OOPS include encapsulation, inheritance, polymorphism, and abstraction

• Encapsulation: bundling data and methods that operate on the data into a single unit

• Inheritance: allows a class to...read more
Answered by AI
Add your answer
Q4. Explain your projects and what are the problem do you faced during development phase
Ans. 
I developed a mobile app for tracking daily water intake and exercise routines.
• Implemented user-friendly interface for easy input of water intake and exercise details

• Integrated push notifications to remind users to drink water and exercise regularly

• Used Firebase for backend data storage and retrieval

• Faced challenges with optimizing app performance on older devices

• Encountered issues with syncing data across multiple dev
Answered by AI
Add your answer
Q5. Write code for reversing array
Ans. 
Code to reverse an array of strings
• Use a loop to iterate through half of the array and swap elements at opposite ends

• Create a temporary variable to hold one element during swapping

• Ensure to handle odd length arrays by not swapping the middle element
Answered by AI
Add your answer

Q1. Self Introduction
Add your answer
Q2. Explained companies policies
Ans. 
Company policies outline rules and guidelines for employees to follow.
• Company policies cover areas such as dress code, attendance, code of conduct, and benefits.

• Examples of company policies include a policy on remote work, a policy on social media usage, and a policy on harassment.

• Employees are expected to adhere to company policies to maintain a positive work environment and ensure compliance with legal regulations.
Answered by AI
Add your answer

1. We noticed on your resume that your address is in another city. How will you get here every day if we hire you? Will you commute, or will you move? Will you want us to cover your moving expenses?”
2. We noticed that you’ve held a position as a mid-level manager. This is a junior-level position. Will you be willing to take a step down to accept this job?
3. We noticed that you have most of the requirements for this job, but you don’t have a master’s degree. Are you planning to earn one soon? What do you have to offer in lieu of this credential?

Q1. What can you bring to this company that can help us reach our goals?” How would you describe your experience in your own worlds?
Add your answer
Q2. How would you describe your personality, your approach to problem solving, your leadership skills, etc., in your own words?
Add your answer

It had mcq and 1 hard coding question

Q1. They asked me about backtracking and dp series problem and also to solve the given question
Add your answer
Q2. Java and in depth about different pillars of java
Add your answer

Q1. Tell me about your self
Add your answer
Q2. Mission vision of the company
Add your answer
Q3. Agrement and relocation
Add your answer

Q1. What was ur expected salary
Add your answer
Q2. Tell the needed one
Add your answer

Aptitude normal level

DSA questions were asked from medium to difficult

Coding test was easy, there were 2 questions.

Q1. Square root of a number in log n time
Ans. 
Using binary search, square root of a number can be found in log n time.
• Choose a range for the square root

• Use binary search to find the square root within the range

• Adjust the range based on whether the guess is too high or too low
Answered by AI
Add your answer

Q1. Basic questions on leadership and some problem based.
Add your answer
Q2. Basics questions
Add your answer