Upload Button Icon Add office photos

Zolo

Compare button icon Compare button icon Compare

Filter interviews by

Zolo Software Developer Intern Interview Questions and Answers

Updated 22 May 2023

Zolo Software Developer Intern Interview Experiences

1 interview found

Interview experience
5
Excellent
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Selected Selected

I applied via Campus Placement and was interviewed in Nov 2022. There were 4 interview rounds.

Round 1 - Resume Shortlist 
Pro Tip by AmbitionBox:
Keep your resume crisp and to the point. A recruiter looks at your resume for an average of 6 seconds, make sure to leave the best impression.
View all tips
Round 2 - Technical 

(3 Questions)

  • Q1. Basic DSA problem and SQL based questions
  • Q2. What is Indexing in database
  • Ans. 

    Indexing is a technique used to improve the performance of database queries by creating a data structure that allows for faster data retrieval.

    • Indexing involves creating a separate data structure that contains a subset of the data in the database, organized in a way that makes it easier to search and retrieve.

    • Indexes can be created on one or more columns in a table, and can be either clustered or non-clustered.

    • Clustere...

  • Answered by AI
  • Q3. Basic concepts of unique keys
Round 3 - Technical 

(1 Question)

  • Q1. DSA problem to print prime number using recursion
  • Ans. 

    Print prime numbers using recursion

    • Define a recursive function that takes a number as input

    • Check if the number is prime or not

    • If it is prime, print it and call the function again with the next number

    • If it is not prime, call the function again with the next number

    • Stop the recursion when the desired number of prime numbers have been printed

  • Answered by AI
Round 4 - HR 

(1 Question)

  • Q1. Tell me one incident where you failed to complete your task

Skills evaluated in this interview

Interview questions from similar companies

I was interviewed before Feb 2021.

Round 1 - Coding Test 

(2 Questions)

Round duration - 60 minutes
Round difficulty - Easy

It comprised of general aptitude questions and two coding questions. It was an offline test.

  • Q1. 

    N Queens Problem

    Given an integer N, find all possible placements of N queens on an N x N chessboard such that no two queens threaten each other.

    Explanation:

    A queen can attack another queen if they ar...

  • Ans. 

    The N Queens Problem involves finding all possible placements of N queens on an N x N chessboard where no two queens threaten each other.

    • Use backtracking algorithm to explore all possible configurations.

    • Keep track of rows, columns, and diagonals to ensure queens do not attack each other.

    • Generate and print valid configurations where queens are placed safely.

    • Consider constraints and time limit for efficient solution.

    • Exam...

  • Answered by AI
  • Q2. 

    Sort 0 1 2 Problem Statement

    Given an integer array arr of size 'N' containing only 0s, 1s, and 2s, write an algorithm to sort the array.

    Input:

    The first line contains an integer 'T' representing the n...
  • Ans. 

    Sort an integer array containing only 0s, 1s, and 2s in linear time complexity.

    • Use three pointers to keep track of the positions of 0s, 1s, and 2s in the array.

    • Iterate through the array and swap elements based on the values encountered.

    • Achieve sorting in a single scan over the array without using any extra space.

  • Answered by AI
Round 2 - Face to Face 

(2 Questions)

Round duration - 60 minutes
Round difficulty - Easy

After having a technical discussion about my CV. He gave me two questions to code.

  • Q1. 

    Ninja and Substrings Problem Statement

    Ninja has to determine all the distinct substrings of size two that can be formed from a given string 'STR' comprising only lowercase alphabetic characters. These su...

  • Ans. 

    Find all unique contiguous substrings of size two from a given string.

    • Iterate through the string and extract substrings of size two

    • Use a set to store unique substrings

    • Return the set as an array of strings

  • Answered by AI
  • Q2. 

    Cycle Detection in a Singly Linked List

    Determine if a given singly linked list of integers forms a cycle or not.

    A cycle in a linked list occurs when a node's next points back to a previous node in the ...

  • Ans. 

    Detect if a singly linked list forms a cycle by checking if a node's next points back to a previous node.

    • Traverse the linked list using two pointers, one moving one step at a time and the other moving two steps at a time.

    • If the two pointers meet at any point, there is a cycle in the linked list.

    • If one of the pointers reaches the end of the list (null), there is no cycle.

  • Answered by AI
Round 3 - HR 

(1 Question)

Round duration - 30 minutes
Round difficulty - Easy

This was supposed to be the HR round but out of surprise the interviewer started by giving me a question to code. 
After I approached this question with the right solution he just asked about my family. After that he said to wait. After half an hour the results were announced. A total of three students were hired and I was amongst one of them.

  • Q1. 

    Balanced Parentheses Combinations

    Given an integer N representing the number of pairs of parentheses, find all the possible combinations of balanced parentheses using the given number of pairs.

    Explanati...

  • Ans. 

    Generate all possible combinations of balanced parentheses for a given number of pairs.

    • Use recursion to generate all possible combinations of balanced parentheses.

    • Keep track of the number of open and close parentheses used in each combination.

    • Return the valid combinations as an array of strings.

  • Answered by AI

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPAMagicbricks interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, System Design, Aptitude, OOPSTime required to prepare for the interview - 5 monthsInterview preparation tips for other job seekers

Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.

Application resume tips for other job seekers

Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.

Final outcome of the interviewSelected

Skills evaluated in this interview

I was interviewed before Apr 2021.

Round 1 - Coding Test 

(2 Questions)

Round duration - 45 minutes
Round difficulty - Easy

This was a test where 2 coding questions were to be solved in 45 minutes.

  • Q1. 

    Excel Column Number Conversion

    Given a column title as it appears in an Excel sheet, your task is to return its corresponding column number.

    Example:

    Input:
    S = "AB"
    Output:
    28
    Explanation:

    The seq...

  • Ans. 

    Convert Excel column title to corresponding column number.

    • Iterate through the characters in the input string from right to left

    • Calculate the value of each character based on its position and multiply by 26^index

    • Sum up the values to get the final column number

  • Answered by AI
  • Q2. 

    Check Permutation Problem

    Determine if two given strings, str1 and str2, are permutations of each other.

    Explanation:

    Two strings are permutations of each other if the characters of one string can be re...

  • Ans. 

    Check if two strings are permutations of each other.

    • Create character frequency maps for both strings.

    • Compare the frequency maps to check if they are permutations.

    • Handle edge cases like empty strings or strings of different lengths.

  • Answered by AI

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPAPropTiger interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, System Design, Aptitude, OOPSTime required to prepare for the interview - 4 monthsInterview preparation tips for other job seekers

Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.

Application resume tips for other job seekers

Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.

Final outcome of the interviewRejected

Skills evaluated in this interview

Interview experience
3
Average
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Resume Shortlist 
Pro Tip by AmbitionBox:
Keep your resume crisp and to the point. A recruiter looks at your resume for an average of 6 seconds, make sure to leave the best impression.
View all tips
Round 2 - Technical 

(1 Question)

  • Q1. Launch modes on android
  • Ans. 

    Launch modes on Android determine how a new instance of an activity is associated with the current task.

    • Standard: Creates a new instance of the activity in the task's stack

    • SingleTop: If an instance of the activity already exists at the top of the stack, it will not be recreated

    • SingleTask: Activity is always at the root of the task and no other activities can be on top of it

    • SingleInstance: Similar to SingleTask, but the

  • Answered by AI
Round 3 - Case Study 

Questios based on Activity backstacks

Skills evaluated in this interview

Interview experience
4
Good
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Resume Shortlist 
Pro Tip by AmbitionBox:
Keep your resume crisp and to the point. A recruiter looks at your resume for an average of 6 seconds, make sure to leave the best impression.
View all tips
Round 2 - Coding Test 

Data structure - rainwater trapping

Round 3 - Technical 

(2 Questions)

  • Q1. OOPs concept, core java, sql
  • Q2. Car parking lot problem - system design
  • Ans. 

    Design a car parking lot system

    • Determine the size and capacity of the parking lot

    • Create a database to store information about available spots and occupied spots

    • Develop a system to track the entry and exit of vehicles

    • Implement a payment system for parking fees

    • Incorporate security measures such as CCTV cameras and security personnel

    • Provide a user-friendly interface for customers to locate available spots and make payment

  • Answered by AI
Round 4 - Technical 

(2 Questions)

  • Q1. Rapid fire questions
  • Q2. More java springboot

Interview Preparation Tips

Interview preparation tips for other job seekers - medium level difficulty in the interview here.

Skills evaluated in this interview

Interview experience
5
Excellent
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Selected Selected

I applied via Referral and was interviewed before Aug 2023. There were 2 interview rounds.

Round 1 - Coding Test 

Basic JavaScript Interview

Round 2 - Technical 

(2 Questions)

  • Q1. What is closure
  • Ans. 

    Closure is a function that has access to its own scope, as well as the outer scope in which it was defined.

    • Closure allows a function to access variables from its outer scope even after the outer function has finished executing.

    • It is created whenever a function is defined within another function.

    • Closure is commonly used in JavaScript for maintaining state in asynchronous operations.

  • Answered by AI
  • Q2. What are promise
  • Ans. 

    Promises are objects representing the eventual completion or failure of an asynchronous operation.

    • Promises are used to handle asynchronous operations in JavaScript.

    • They can be in one of three states: pending, fulfilled, or rejected.

    • Promises can be chained together using .then() method.

    • They help avoid callback hell and make code more readable.

    • Example: Fetching data from an API returns a promise that resolves with the da

  • Answered by AI

Software Developer Interview Questions & Answers

NoBroker user image Shreeta Jayakar Shetty

posted on 26 Sep 2024

Interview experience
3
Average
Difficulty level
-
Process Duration
-
Result
-
Round 1 - HR 

(2 Questions)

  • Q1. Introduce yourself
  • Ans. 

    I am a software developer with 5 years of experience in Java and Python. I have a passion for problem-solving and creating innovative solutions.

    • 5 years of experience in Java and Python

    • Passionate about problem-solving

    • Innovative solutions driven

  • Answered by AI
  • Q2. Were u see after 5 years
  • Ans. 

    In 5 years, I see myself as a senior software developer leading a team and working on cutting-edge technologies.

    • Leading a team of developers on innovative projects

    • Working with cutting-edge technologies like AI and blockchain

    • Continuing to learn and grow in my career

    • Possibly pursuing further education or certifications

    • Contributing to open source projects

  • Answered by AI
Interview experience
2
Poor
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Coding Test 

HAckerrank based test

I was interviewed in Jan 2021.

Round 1 - Coding Test 

(2 Questions)

Round duration - 60 Minutes
Round difficulty - Easy

4 Questions which were of Easy, Medium, and Hard level.

  • Q1. 

    Lowest Common Ancestor of a Binary Tree III

    The structure of a binary tree has been modified so that each node includes a reference to its parent node.

    Problem Statement

    You are provided with two nodes,...

  • Ans. 

    This question is about finding the lowest common ancestor of two nodes in a binary tree with parent references.

    • Traverse from the given nodes to their respective root nodes and store the paths in two separate lists.

    • Compare the two lists and find the last common node.

    • Return the last common node as the lowest common ancestor.

  • Answered by AI
  • Q2. 

    Maximum Subarray Problem Statement

    Ninja has been given an array, and he wants to find a subarray such that the sum of all elements in the subarray is maximum.

    A subarray 'A' is considered greater than a...

  • Ans. 

    The problem is to find a subarray with the maximum sum in a given array.

    • Iterate through the array and keep track of the maximum sum and the current sum.

    • If the current sum becomes negative, reset it to 0.

    • Update the maximum sum if the current sum is greater.

    • Also keep track of the start and end indices of the subarray with the maximum sum.

    • Return the subarray using the start and end indices.

  • Answered by AI
Round 2 - Video Call 

(2 Questions)

Round duration - 50 Minutes
Round difficulty - Easy

  • Q1. 

    Next Greater Element Problem Statement

    Given a list of integers of size N, your task is to determine the Next Greater Element (NGE) for every element. The Next Greater Element for an element X is the firs...

  • Ans. 

    The task is to find the next greater element for each element in an array.

    • Iterate through the array from right to left.

    • Use a stack to keep track of the elements that have a greater element to their right.

    • For each element, pop elements from the stack until a greater element is found or the stack is empty.

    • If a greater element is found, it is the next greater element for the current element.

    • If the stack becomes empty, the...

  • Answered by AI
  • Q2. 

    Trapping Rain Water Problem Statement

    You are given a long type array/list ARR of size N, representing an elevation map. The value ARR[i] denotes the elevation of the ith bar. Your task is to determine th...

  • Ans. 

    The question asks to find the total amount of rainwater that can be trapped in the given elevation map.

    • Iterate through the array and find the maximum height on the left and right side of each bar.

    • Calculate the amount of water that can be trapped at each bar by taking the minimum of the maximum heights on both sides and subtracting the height of the bar.

    • Sum up the amount of water trapped at each bar to get the total amo

  • Answered by AI
Round 3 - HR 

Round duration - 30 Minutes
Round difficulty - Easy

It is just a formality round, asked basic questions like relocation and joining date etc

Interview Preparation Tips

Professional and academic backgroundI applied for the job as SDE - 1 in BengaluruEligibility criteriawith resumeSwiggy interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, Puzzles, Project, Mock Interviews, etcTime required to prepare for the interview - 2 monthsInterview preparation tips for other job seekers

Tip 1 : Be good with all data structures and algorithms
Tip 2 : Able to explain your projects well 
Tip 3 : focus on basics

Application resume tips for other job seekers

Tip 1 : Try to make a single-page resume. 
Tip 2 : Don't write unnecessary details like hobbies, family, etc.

Final outcome of the interviewSelected

Skills evaluated in this interview

I was interviewed before Sep 2020.

Round 1 - Face to Face 

(2 Questions)

Round duration - 60 Minutes
Round difficulty - Easy

  • Q1. 

    0/1 Knapsack Problem Statement

    A thief is planning to rob a store and can carry a maximum weight of 'W' in his knapsack. The store contains 'N' items where the ith item has a weight of 'wi' and a value of...

  • Ans. 

    Yes, the 0/1 Knapsack problem can be solved using dynamic programming with a space complexity of not more than O(W).

    • Use a 1D array to store the maximum value that can be stolen for each weight capacity from 0 to W.

    • Iterate through each item and update the array based on whether including the item would increase the total value.

    • The final value in the array at index W will be the maximum value that can be stolen.

  • Answered by AI
  • Q2. 

    Find the Second Largest Element

    Given an array or list of integers 'ARR', identify the second largest element in 'ARR'.

    If a second largest element does not exist, return -1.

    Example:

    Input:
    ARR = [2,...
  • Ans. 

    Find the second largest element in an array of integers.

    • Iterate through the array to find the largest and second largest elements.

    • Handle cases where all elements are identical.

    • Return -1 if a second largest element does not exist.

  • Answered by AI
Round 2 - Video Call 

(1 Question)

Round duration - 60 Minutes
Round difficulty - Easy

System Design Round

  • Q1. Design a system for Twitter, discussing its architecture, key components, and scalability considerations.
  • Ans. 

    Design a scalable system for Twitter with key components and architecture.

    • Use microservices architecture for scalability and fault isolation.

    • Key components include user service, tweet service, timeline service, and notification service.

    • Use a distributed database like Cassandra for storing tweets and user data.

    • Implement a message queue like Kafka for handling real-time updates and notifications.

    • Use a caching layer like ...

  • Answered by AI
Round 3 - HR 

Round duration - 30 Minutes
Round difficulty - Easy

It is just a formality

Interview Preparation Tips

Professional and academic backgroundI applied for the job as SDE - 1 in BangaloreEligibility criteriaResume shortlistingSwiggy interview preparation:Topics to prepare for the interview - OOPS, Data Structures, Core Java, Algorithms, DBMS, SQL,Time required to prepare for the interview - 3 monthsInterview preparation tips for other job seekers

Tip 1 : System Design
Tip 2 : Practice questions from leetcode
Tip 3 : Have some projects.

Application resume tips for other job seekers

Tip 1 : Mention what you know 
Tip 2 : Good previous work to showcase

Final outcome of the interviewSelected

Skills evaluated in this interview

Zolo Interview FAQs

How many rounds are there in Zolo Software Developer Intern interview?
Zolo interview process usually has 4 rounds. The most common rounds in the Zolo interview process are Technical, Resume Shortlist and HR.
What are the top questions asked in Zolo Software Developer Intern interview?

Some of the top questions asked at the Zolo Software Developer Intern interview -

  1. DSA problem to print prime number using recurs...read more
  2. What is Indexing in datab...read more
  3. Basic DSA problem and SQL based questi...read more

Tell us how to improve this page.

Zolo Software Developer Intern Interview Process

based on 1 interview

Interview experience

5
  
Excellent
View more

Zolo Software Developer Intern Reviews and Ratings

based on 1 review

5.0/5

Rating in categories

5.0

Skill development

5.0

Work-life balance

4.0

Salary

5.0

Job security

5.0

Company culture

4.0

Promotions

5.0

Work satisfaction

Explore 1 Review and Rating
MEP Engineer
95 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Property Manager
61 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Customer experience Manager
54 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Associate Manager
45 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Operations Manager
42 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Explore more salaries
Compare Zolo with

CoLive

2.2
Compare

Nestaway

3.9
Compare

NoBroker

3.2
Compare

CommonFloor

3.7
Compare
Did you find this page helpful?
Yes No
write
Share an Interview