Add office photos
ZeMoSo Technologies logo
Engaged Employer

ZeMoSo Technologies

Verified
3.6
based on 174 Reviews
Filter interviews by
Associate Software Engineer
Clear (1)

ZeMoSo Technologies Associate Software Engineer Interview Questions and Answers

Updated 18 Sep 2024

Q1. Ninja and Alternating Largest Problem Statement

Ninja is given a sequence of numbers and needs to rearrange them so that every second element is greater than its neighbors on both sides.

Example:

Input:
[1, 2, ...read more
Ans.

The task is to rearrange the given array such that every second element is greater than its left and right element.

  • Read the number of test cases

  • For each test case, read the number of elements in the array and the array elements

  • Iterate through the array and swap elements at odd indices with their adjacent elements if necessary

  • Check if the rearranged array satisfies the conditions and print 1 if it does, else print 0

Add your answer
right arrow

Q2. Longest Common Prefix After Rotation

You are given two strings 'A' and 'B'. While string 'A' is constant, you may apply any number of left shift operations to string 'B'.

Explanation:

Your task is to calculate ...read more

Ans.

The question asks to find the minimum number of left shift operations required to obtain the longest common prefix of two given strings.

  • Perform left shift operations on string B to find the longest common prefix with string A

  • Count the number of left shift operations required to obtain the longest common prefix

  • Return the minimum number of left shift operations for each test case

Add your answer
right arrow

Q3. Sub Sort Problem Statement

You are given an integer array ARR. Determine the length of the shortest contiguous subarray which, when sorted in ascending order, results in the entire array being sorted in ascendi...read more

Ans.

The question asks to find the length of the shortest contiguous subarray that needs to be sorted in order to sort the whole array.

  • Iterate through the array and find the first element that is out of order from the left side.

  • Iterate through the array and find the first element that is out of order from the right side.

  • Find the minimum and maximum element within the subarray from the above steps.

  • Expand the subarray from both sides until all elements within the subarray are in the...read more

Add your answer
right arrow

Q4. Given a Map of fruits with there price as a key value pair respectively, find the fruit whose price is maximum using Java 8 Stream API.

Ans.

Using Java 8 Stream API to find the fruit with maximum price in a Map of fruits.

  • Use entrySet() method to get a stream of key-value pairs from the Map.

  • Use max() method with Comparator.comparing() to find the entry with maximum price.

  • Extract the key (fruit) from the entry with maximum price.

Add your answer
right arrow
Discover ZeMoSo Technologies interview dos and don'ts from real experiences

Q5. Write a program to check whether the parenthesis are properly balanced or not, means for every opening brace these should be a closing brace present.

Ans.

Program to check if parenthesis are properly balanced

  • Use a stack data structure to keep track of opening parenthesis

  • Iterate through the input string and push opening parenthesis onto the stack

  • When a closing parenthesis is encountered, pop from the stack and check if it matches the corresponding opening parenthesis

  • If stack is empty at the end and all parenthesis are matched, then the input has properly balanced parenthesis

Add your answer
right arrow

Q6. Given a list of integer find the first non repeating integer using stream API of Java 8.

Ans.

Find the first non-repeating integer in a list using Java 8 stream API.

  • Use Java 8 stream API to group integers by count

  • Filter out integers with count greater than 1

  • Return the first non-repeating integer

Add your answer
right arrow

Q7. Implent Oops concept of Java through code

Ans.

Java OOPs concepts can be implemented using classes, objects, inheritance, polymorphism, and encapsulation.

  • Create classes with attributes and methods

  • Instantiate objects from classes

  • Use inheritance to create subclasses

  • Implement polymorphism through method overriding

  • Encapsulate data using access modifiers

Add your answer
right arrow

Q8. A variant of bubble sort

Ans.

Cocktail sort is a variant of bubble sort that sorts in both directions.

  • Also known as bidirectional bubble sort or shaker sort.

  • It starts with the first element and compares it with the next one, swapping if necessary.

  • Then it moves to the last element and compares it with the previous one, swapping if necessary.

  • It continues until no more swaps are needed.

  • It is more efficient than bubble sort for large lists with many out-of-order elements.

Add your answer
right arrow
Contribute & help others!
Write a review
Write a review
Share interview
Share interview
Contribute salary
Contribute salary
Add office photos
Add office photos

Interview Process at ZeMoSo Technologies Associate Software Engineer

based on 3 interviews
Interview experience
3.7
Good
View more
interview tips and stories logo
Interview Tips & Stories
Ace your next interview with expert advice and inspiring stories
Recently Viewed
CAMPUS PLACEMENT
B M S College of Engineering, Bangalore
CAMPUS PLACEMENT
Lovely Professional University (LPU)
INTERVIEWS
Jash Engineering
No Interviews
INTERVIEWS
ZeMoSo Technologies
5.6k top interview questions
INTERVIEWS
Wissen Technology
10 top interview questions
INTERVIEWS
ZeMoSo Technologies
5.6k top interview questions
INTERVIEWS
ZeMoSo Technologies
No Interviews
INTERVIEWS
Jash Engineering
No Interviews
INTERVIEWS
Wissen Technology
10 top interview questions
INTERVIEWS
Wissen Technology
50 top interview questions
Share an Interview
Stay ahead in your career. Get AmbitionBox app
play-icon
play-icon
qr-code
Helping over 1 Crore job seekers every month in choosing their right fit company
75 Lakh+

Reviews

5 Lakh+

Interviews

4 Crore+

Salaries

1 Cr+

Users/Month

Contribute to help millions

Made with ❤️ in India. Trademarks belong to their respective owners. All rights reserved © 2024 Info Edge (India) Ltd.

Follow us
  • Youtube
  • Instagram
  • LinkedIn
  • Facebook
  • Twitter