Upload Button Icon Add office photos

Filter interviews by

Zopsmart Technology Software Development Engineer Interview Questions and Answers

Updated 20 Jan 2025

Zopsmart Technology Software Development Engineer Interview Experiences

4 interviews found

Interview experience
5
Excellent
Difficulty level
Hard
Process Duration
Less than 2 weeks
Result
No response

I applied via Recruitment Consulltant and was interviewed in Dec 2024. There were 2 interview rounds.

Round 1 - Technical 

(1 Question)

  • Q1. Tell me about yourself, sql vs no sql , project based and some DSA coding questions
Round 2 - Technical 

(1 Question)

  • Q1. More detailed on projects and how goroutine implemented and restful api design and db design

Interview Preparation Tips

Interview preparation tips for other job seekers - Be confiden while speaking to the interviewer
Interview experience
5
Excellent
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Not Selected

I applied via Campus Placement and was interviewed in Oct 2024. There was 1 interview round.

Round 1 - Technical 

(2 Questions)

  • Q1. Introduce yourself
  • Q2. Bubble sort was also asked

Interview Preparation Tips

Interview preparation tips for other job seekers - Be confident

Software Development Engineer Interview Questions Asked at Other Companies

asked in Amazon
Q1. Given an acyclic graph of a city where each edge represents a roa ... read more
asked in Hike
Q2. You have application which shows list of all contacts, the Name c ... read more
asked in Amazon
Q3. Given a m * n matrix filled with '0's and 'x's at random position ... read more
asked in Samsung
Q4. puzzle-There are 1000 wine bottles. One of the bottles contains p ... read more
asked in Accenture
Q5. Have you worked on cloud technology? Architecture of cloud
Interview experience
4
Good
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Selected Selected

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

Round 1 - Coding Test 

Easy to medium level coding interview round.

Round 2 - Technical 

(1 Question)

  • Q1. Interview based on technical skills, computer science concepts and projects etc.

Interview Preparation Tips

Interview preparation tips for other job seekers - Prepare well in DSA

I applied via Instahyre and was interviewed before Feb 2021. There were 3 interview rounds.

Round 1 - One-on-one 

(1 Question)

  • Q1. K-Reverse a linked list. Have to code in Go lang as the role was for Go lang developer
Round 2 - One-on-one 

(2 Questions)

  • Q1. Linkedlist insertion & deletion in Go
  • Ans. 

    Linkedlist insertion & deletion in Go

    • In Go, linked lists can be implemented using structs and pointers.

    • Insertion involves creating a new node and updating the pointers of adjacent nodes.

    • Deletion involves updating the pointers of adjacent nodes to bypass the node being deleted.

    • Go's garbage collector automatically frees memory of unused nodes.

  • Answered by AI
  • Q2. Go lang concurrency and concurrency patterns
Round 3 - Technical 

(3 Questions)

  • Q1. SQL vs NoSQL and when to use what
  • Ans. 

    SQL is best for structured data, NoSQL for unstructured. Use SQL for complex queries, NoSQL for scalability and speed.

    • SQL is best for structured data, NoSQL for unstructured

    • Use SQL for complex queries, NoSQL for scalability and speed

    • SQL is ACID compliant, NoSQL is BASE

    • Examples of SQL: MySQL, Oracle, PostgreSQL

    • Examples of NoSQL: MongoDB, Cassandra, Redis

  • Answered by AI
  • Q2. DB queries on finding the second largest element
  • Ans. 

    Query to find the second largest element in a database table

    • Use ORDER BY and LIMIT to select the second largest element

    • For MySQL: SELECT column FROM table ORDER BY column DESC LIMIT 1,1

    • For Oracle: SELECT column FROM (SELECT column FROM table ORDER BY column DESC) WHERE ROWNUM <= 2 MINUS SELECT column FROM (SELECT column FROM table ORDER BY column DESC) WHERE ROWNUM <= 1

  • Answered by AI
  • Q3. Discussion on projects mentioned in the CV

Interview Preparation Tips

Topics to prepare for Zopsmart Technology Software Development Engineer interview:
  • Linked List
  • Go
  • Docker
  • Kubernettes
  • Basic Devops questions
Interview preparation tips for other job seekers - Brush up your Go lang concurrency questions and Focus on Linked List and linear DST

Skills evaluated in this interview

Zopsmart Technology interview questions for designations

 Software Development Engineer 1

 (4)

 Software Development Engineer II

 (1)

 Software Development Engineer Intern

 (1)

 Software Engineer

 (3)

 Junior Software Engineer

 (1)

 Software Engineer Intern

 (1)

 Senior Software Engineer

 (1)

 Software Developer

 (8)

Interview questions from similar companies

Interview experience
1
Bad
Difficulty level
-
Process Duration
-
Result
-

I applied via Job Portal

Round 1 - Coding Test 

It was not good their approach of asking questions not good

Round 2 - Technical 

(2 Questions)

  • Q1. Dsa graph topological sorting
  • Q2. DSA tree question and largest bst

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

Interview Questionnaire 

5 Questions

  • Q1. 1) Time complexity of binary search for array and linked list
  • Ans. 

    Binary search has O(log n) time complexity for arrays and O(n) for linked lists.

    • Binary search is efficient for arrays due to their random access nature.

    • Linked lists require sequential traversal, making binary search inefficient.

    • For arrays, the time complexity is O(log n) as the search space is halved with each iteration.

    • For linked lists, the time complexity is O(n) as all nodes must be visited to find the target.

    • Binary...

  • Answered by AI
  • Q2. 2) Construct tree from inorder and post order list
  • Ans. 

    Construct a tree using inorder and postorder traversal lists.

    • The last element of the postorder list is the root of the tree.

    • Find the root in the inorder list and split the list into left and right subtrees.

    • Recursively construct the left and right subtrees using the corresponding sublists.

    • Return the root node.

    • Time complexity: O(n^2) in worst case, O(nlogn) on average.

  • Answered by AI
  • Q3. 3) Find depth of binary tree through recursion and iteration
  • Ans. 

    Find depth of binary tree through recursion and iteration

    • Recursively traverse left and right subtrees and return the maximum depth

    • Iteratively traverse the tree using a stack or queue and keep track of the depth

    • Depth of an empty tree is 0

    • Depth of a tree with only one node is 1

  • Answered by AI
  • Q4. 4) Find intersection of two arrays
  • Ans. 

    Intersection of two arrays is the common elements present in both arrays.

    • Sort both arrays and use two pointers to compare elements.

    • Use a hash set to store elements of one array and check for presence in the other array.

    • If arrays are already sorted, use binary search to find common elements.

  • Answered by AI
  • Q5. 5) Find out the heavier ball from 8 identical ball of which one is heavier using only a balance weighting machine in least number of trys
  • Ans. 

    Find the heavier ball from 8 identical balls using a balance weighting machine in least number of tries.

    • Divide the balls into 3 groups of 3, 3, and 2 balls.

    • Weigh the first two groups against each other.

    • If they balance, the heavier ball is in the remaining group of 2 balls.

    • If one group is heavier, weigh two balls from that group against each other.

    • If they balance, the heavier ball is the remaining ball.

    • If one ball is he

  • Answered by AI

Interview Preparation Tips

Interview preparation tips for other job seekers - Revise basic data structures and algorithms. Be aware of the logic behind calculating time complexities. Be prepared to implement the given coding questions on an ide

Skills evaluated in this interview

Interview experience
4
Good
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Not Selected

I applied via campus placement at Indian Institute of Information Technology (IIIT), Kota and was interviewed in Dec 2024. There were 2 interview rounds.

Round 1 - Coding Test 

A 90-minute coding test on HackerRank, which includes one medium, one easy, and one hard question.

Round 2 - Technical 

(2 Questions)

  • Q1. What is the index of the first occurrence where a pattern string matches with a text string?
  • Q2. Given a string, how can we find the minimum length substring whose sum is greater than or equal to a specified target?
Interview experience
4
Good
Difficulty level
-
Process Duration
-
Result
-

I applied via Campus Placement

Round 1 - Aptitude Test 

It was good 20 mcqs 3 coding questions

Round 2 - Technical 

(2 Questions)

  • Q1. Dsa and core subjects like cn os
  • Q2. Dsa questions and core subjects
Round 3 - HR 

(1 Question)

  • Q1. Basic family discussion and salary details

Interview Preparation Tips

Interview preparation tips for other job seekers - it was overall a good experience
Interview experience
4
Good
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Coding Test 

2 Leetcode Medium questions on hackerrank

Round 2 - One-on-one 

(3 Questions)

  • Q1. Kadane algorithm based question
  • Q2. Leetcode medium
  • Q3. Resume based questions
Round 3 - One-on-one 

(4 Questions)

  • Q1. Probability question math problem
  • Q2. Puzzle to solve
  • Q3. AI based question
  • Q4. 1 question to solve Leetcode medium

Interview Preparation Tips

Interview preparation tips for other job seekers - Be strong with DSA and communication skill
Interview experience
5
Excellent
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Selected Selected

I applied via Campus Placement

Round 1 - Aptitude Test 

Aptitude was including both MCQs and Input

Round 2 - Technical 

(4 Questions)

  • Q1. Technical interview 1 It revolved around core subjects Like OS, Oops, CNS, dbms etc,. And few basic questions on arrays
  • Q2. Difference between python and C
  • Ans. 

    Python is a high-level, interpreted language known for its simplicity and readability, while C is a low-level, compiled language known for its speed and efficiency.

    • Python is dynamically typed, while C is statically typed.

    • Python has automatic memory management, while C requires manual memory management.

    • Python is platform-independent, while C is platform-dependent.

    • Python is commonly used for web development and data anal...

  • Answered by AI
  • Q3. Why C is faster than python
  • Ans. 

    C is faster than Python due to its lower-level nature and direct hardware access.

    • C is a compiled language, while Python is an interpreted language.

    • C code is directly translated into machine code, while Python code is executed line by line.

    • C has direct access to hardware, while Python relies on external libraries for such access.

  • Answered by AI
  • Q4. Write a program to count vowels in your name
  • Ans. 

    A program to count vowels in a given name

    • Create a function that takes a string as input

    • Loop through each character in the string and check if it is a vowel (a, e, i, o, u)

    • Increment a counter for each vowel found

    • Return the total count of vowels

  • Answered by AI
Round 3 - Technical 

(5 Questions)

  • Q1. Technical interview 2 Focuses on DSA
  • Q2. Write quick sort
  • Ans. 

    Quick sort is a divide-and-conquer algorithm that sorts an array by partitioning it into smaller sub-arrays.

    • Choose a pivot element from the array

    • Partition the array into two sub-arrays based on the pivot element

    • Recursively apply quick sort to the sub-arrays

    • Combine the sorted sub-arrays to get the final sorted array

  • Answered by AI
  • Q3. Implement Linked list
  • Ans. 

    Implement a linked list data structure in a programming language.

    • Create a Node class with data and a reference to the next node

    • Implement methods to add, remove, and search for elements in the linked list

    • Handle edge cases like adding to an empty list or removing the last element

  • Answered by AI
  • Q4. All operations on Linked list
  • Ans. 

    Operations on Linked list include insertion, deletion, traversal, and searching.

    • Insertion: Add a new node at the beginning, end, or middle of the linked list.

    • Deletion: Remove a node from the linked list based on a given key or position.

    • Traversal: Visit each node in the linked list to perform operations or display data.

    • Searching: Find a specific node in the linked list based on a given key or value.

  • Answered by AI
  • Q5. Basic machine learning algorithms
Round 4 - HR 

(2 Questions)

  • Q1. Basic fitment questions
  • Q2. Introduction and flexibility

Interview Preparation Tips

Interview preparation tips for other job seekers - Be confident and brush up all CS core subjects

Skills evaluated in this interview

Zopsmart Technology Interview FAQs

How many rounds are there in Zopsmart Technology Software Development Engineer interview?
Zopsmart Technology interview process usually has 2 rounds. The most common rounds in the Zopsmart Technology interview process are Technical, One-on-one Round and Coding Test.
How to prepare for Zopsmart Technology Software Development Engineer interview?
Go through your CV in detail and study all the technologies mentioned in your CV. Prepare at least two technologies or languages in depth if you are appearing for a technical interview at Zopsmart Technology. The most common topics and skills that interviewers at Zopsmart Technology expect are Ansible, Bash Scripting, CI CD Pipeline, DevOps and Grafana.
What are the top questions asked in Zopsmart Technology Software Development Engineer interview?

Some of the top questions asked at the Zopsmart Technology Software Development Engineer interview -

  1. SQL vs NoSQL and when to use w...read more
  2. DB queries on finding the second largest elem...read more
  3. Linkedlist insertion & deletion in...read more

Tell us how to improve this page.

Zopsmart Technology Software Development Engineer Interview Process

based on 3 interviews

Interview experience

4.7
  
Excellent
View more
Zopsmart Technology Software Development Engineer Salary
based on 80 salaries
₹8 L/yr - ₹15 L/yr
19% less than the average Software Development Engineer Salary in India
View more details

Zopsmart Technology Software Development Engineer Reviews and Ratings

based on 6 reviews

3.6/5

Rating in categories

3.8

Skill development

3.5

Work-life balance

3.0

Salary

3.1

Job security

3.1

Company culture

2.9

Promotions

3.2

Work satisfaction

Explore 6 Reviews and Ratings
Software Engineer
85 salaries
unlock blur

₹8 L/yr - ₹14.5 L/yr

Software Development Engineer
80 salaries
unlock blur

₹8 L/yr - ₹15 L/yr

Software Developer
67 salaries
unlock blur

₹8.5 L/yr - ₹15.6 L/yr

Senior Software Engineer
51 salaries
unlock blur

₹11.7 L/yr - ₹33 L/yr

Software Development Engineer II
49 salaries
unlock blur

₹11 L/yr - ₹22 L/yr

Explore more salaries
Compare Zopsmart Technology with

Flipkart

4.0
Compare

Amazon

4.1
Compare

Paytm Mall

3.6
Compare

Snapdeal

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