Upload Button Icon Add office photos
Engaged Employer

i

This company page is being actively managed by iMocha Team. If you also belong to the team, you can get access from here

iMocha Verified Tick

Compare button icon Compare button icon Compare

Filter interviews by

iMocha Software Developer Interview Questions and Answers

Updated 3 Aug 2022

iMocha Software Developer Interview Experiences

1 interview found

Software Developer Interview Questions & Answers

user image Mahesh Wanode

posted on 3 Aug 2022

Round 1 - Coding Test 

Excellent knowledge you need on coding to crack

Round 2 - Technical 

(2 Questions)

  • Q1. SQL stored procedures
  • Q2. Subqueries , Dot net Core

Interview Preparation Tips

Interview preparation tips for other job seekers - Be prepare before interview so hard otherwise no chance

Interview questions from similar companies

Interview experience
2
Poor
Difficulty level
-
Process Duration
-
Result
Not Selected
Round 1 - Aptitude Test 

Nice interview experience on the aptitude

Round 2 - Technical 

(2 Questions)

  • Q1. Introduced ourselves
  • Q2. Explain about about projects
  • Ans. 

    Projects are specific tasks or assignments undertaken to achieve a particular goal or outcome.

    • Projects involve a defined scope, timeline, and budget.

    • They require a team of individuals with specific skills and roles.

    • Examples include developing a new software application, implementing a website redesign, or launching a marketing campaign.

  • Answered by AI
Interview experience
3
Average
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Not Selected

I applied via Company Website and was interviewed before Jul 2023. There was 1 interview round.

Round 1 - One-on-one 

(1 Question)

  • Q1. Create specific components
  • Ans. 

    Creating specific components for software development

    • Identify the requirements for the component

    • Design the component architecture

    • Implement the component using appropriate programming languages and tools

    • Test the component for functionality and performance

    • Integrate the component into the larger software system

  • Answered by AI

Skills evaluated in this interview

I was interviewed in Nov 2020.

Round 1 - Coding Test 

(3 Questions)

Round duration - 60 minutes
Round difficulty - Easy

  • Q1. 

    Path Queries Problem Statement

    Consider a weighted, undirected graph with 'V' vertices numbered from 1 to 'V' and 'E' bidirectional edges. You are tasked with handling 'Q' queries. For each query, you are...

  • Ans. 

    Implement a function to find the shortest distance between two vertices in a weighted, undirected graph.

    • Use Dijkstra's algorithm to find the shortest path between the given vertices.

    • Create a graph data structure to represent the weighted, undirected graph.

    • Handle cases where no path exists between the given vertices by returning -1.

    • Optimize the algorithm to handle multiple queries efficiently.

    • Consider edge cases such as...

  • Answered by AI
  • Q2. 

    Merge Sort Algorithm Problem Statement

    Your task is to sort a sequence of numbers stored in the array ‘ARR’ in non-descending order using the Merge Sort algorithm.

    Explanation:

    Merge Sort is a divide-an...

  • Ans. 

    Implement Merge Sort algorithm to sort a sequence of numbers in non-descending order.

    • Divide the input array into two halves recursively

    • Sort the two halves separately

    • Merge the sorted halves to produce a fully sorted array

    • Time complexity of Merge Sort is O(n log n)

    • Example: Input - [5, 2, 9, 1, 5], Output - [1, 2, 5, 5, 9]

  • Answered by AI
  • Q3. 

    Rat in a Maze: All Paths Problem

    You are provided with an N * N maze where a rat is positioned at starting cell MAZE[0][0]. The goal is to determine and print all possible paths that the rat can take to r...

  • Ans. 

    Given an N * N maze with binary values, find and print all possible paths for a rat to reach the destination cell.

    • Use backtracking to explore all possible paths from the starting cell to the destination cell.

    • At each cell, check if it is a valid move (within bounds and not blocked), then recursively explore all four directions.

    • Keep track of the path taken so far and mark the cells accordingly.

    • Once the destination cell i...

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI completed Computer Science Engineering from Dronacharya College of Engineering. I applied for the job as SDE - 1 in NoidaEligibility criteriaNo criteriaLido Learning interview preparation:Topics to prepare for the interview - Data Structures, Pointers, OOPS, System Design, Algorithms, Dynamic Programming etcTime required to prepare for the interview - 1 monthInterview preparation tips for other job seekers

Tip 1 : Practice Atleast 250 Questions
Tip 2 : Do atleast 2 projects
 

Application resume tips for other job seekers

Tip 1 : Have some projects on resume.
Tip 2 : Do not put false things on resume.

Final outcome of the interviewRejected

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 and was interviewed in Jul 2024. There were 2 interview rounds.

Round 1 - Coding Test 

Medium to hard level problem questions and basic subjects fundamentals mcqs

Round 2 - One-on-one 

(2 Questions)

  • Q1. Basic OS questions
  • Q2. Basic CN questions

Interview Preparation Tips

Interview preparation tips for other job seekers - Grap a good command on subject and low level and pray to God you will be selected

Interview Questionnaire 

8 Questions

  • Q1. Given a doubly linked list with one pointer of each node pointing to the next node just like in a singly linked list. The second pointer(arbit pointer) however can point to any node in the list and not jus...
  • Ans. 

    Program to create a copy of a doubly linked list with an arbit pointer.

    • Traverse the original list and create a new node for each node in the list.

    • Store the mapping of original node to the new node in a hash table.

    • Traverse the original list again and set the next and arbit pointers of the new nodes.

    • Return the head of the new list.

  • Answered by AI
  • Q2. Implement funcionality of 1000 of students giving a online test and timer is running. You have to calculate th etime when test is tarted and auto-matically stop the test when test is ended. Handle the scen...
  • Ans. 

    Implement functionality for online test with timer and handle power failure scenarios

    • Create a timer function to track the time

    • Store the start time and end time of the test

    • Implement a backup system to save progress in case of power failure

    • Use a database to store test data and progress

    • Handle edge cases like internet connectivity issues

  • Answered by AI
  • Q3. WAP of prime number using reursion?
  • Ans. 

    A recursive function to check if a number is prime or not.

    • Create a function that takes a number as input.

    • Check if the number is less than 2, return false.

    • Check if the number is 2, return true.

    • Check if the number is divisible by any number less than it, return false.

    • If none of the above conditions are met, call the function recursively with the number minus 1.

  • Answered by AI
  • Q4. Reverse a linked list?
  • Ans. 

    To reverse a linked list, we need to traverse the list and change the direction of the pointers.

    • Create three pointers: prev, curr, and next

    • Initialize prev to null, curr to head of the linked list, and next to null

    • Traverse the list and change the direction of the pointers: next = curr.next; curr.next = prev; prev = curr; curr = next;

    • Set the new head of the linked list to prev

  • Answered by AI
  • Q5. Some sql related questions – not very tough : some inner joins and self join based?
  • Q6. How can you stop man in the middle attack over an insecure communication line without using any kind of encryption ?
  • Ans. 

    It is not possible to stop man in the middle attack over an insecure communication line without using any kind of encryption.

    • Without encryption, the communication line is inherently insecure and vulnerable to man-in-the-middle attacks.

    • One possible solution is to use a secure communication line, such as a VPN or a dedicated private network.

    • Another solution is to use digital signatures to verify the authenticity of the c...

  • Answered by AI
  • Q7. What is the difference between http and https?
  • Ans. 

    HTTP is unsecured while HTTPS is secured with SSL/TLS encryption.

    • HTTP stands for Hypertext Transfer Protocol while HTTPS stands for Hypertext Transfer Protocol Secure.

    • HTTP operates on port 80 while HTTPS operates on port 443.

    • HTTP is unencrypted while HTTPS is encrypted with SSL/TLS.

    • HTTPS provides authentication and data integrity while HTTP does not.

    • HTTPS is used for secure online transactions such as online banking, e

  • Answered by AI
  • Q8. Heap memory and stack memory? Local variables are stored where? What is memory tables?
  • Ans. 

    Heap and stack memory are two types of memory allocation in a program. Local variables are stored in stack memory. Memory tables are used to track memory allocation.

    • Heap memory is used for dynamic memory allocation, while stack memory is used for static memory allocation.

    • Local variables are stored in stack memory and are only accessible within the scope of the function they are declared in.

    • Memory tables are used to kee...

  • Answered by AI

Interview Preparation Tips

Round: Technical Interview
Experience: Finally, I got offer from Aspiring Minds after 15 days of negotiation.

Skills: data structure, Algorithm
College Name: na

Skills evaluated in this interview

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

I applied via Naukri.com and was interviewed in Dec 2023. There was 1 interview round.

Round 1 - Coding Test 

Questions can be found on Leetcode

Interview experience
5
Excellent
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Technical 

(1 Question)

  • Q1. Dsa question regarding linked list and hashmap
Interview experience
5
Excellent
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Coding Test 

It was a Coding Interview with 2 basic DSA Questions

Round 2 - Technical 

(1 Question)

  • Q1. It was a LLD discussion to create a service like Bookmyshow.
Round 3 - Technical 

(1 Question)

  • Q1. A high level design interview around Google Docs
Round 4 - Technical 

(1 Question)

  • Q1. A Technical Discussion with the Hiring Manager
Round 5 - HR 

(1 Question)

  • Q1. A value fit round by the HR
Interview experience
5
Excellent
Difficulty level
-
Process Duration
-
Result
-
Round 1 - One-on-one 

(1 Question)

  • Q1. Project discussion
Round 2 - Coding Test 

Was a small test and was easy

iMocha Interview FAQs

How many rounds are there in iMocha Software Developer interview?
iMocha interview process usually has 2 rounds. The most common rounds in the iMocha interview process are Coding Test and Technical.
What are the top questions asked in iMocha Software Developer interview?

Some of the top questions asked at the iMocha Software Developer interview -

  1. SQL stored procedu...read more
  2. Subqueries , Dot net C...read more

Tell us how to improve this page.

Fast track your campus placements

View all
iMocha Software Developer Salary
based on 7 salaries
₹3.6 L/yr - ₹10 L/yr
18% less than the average Software Developer Salary in India
View more details
Software Engineer
15 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

UI Developer
8 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Software Developer
7 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Senior QA Engineer
6 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Data Analyst
6 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Explore more salaries
Compare iMocha with

HackerRank

4.2
Compare

Talview

3.1
Compare

Mettl

3.8
Compare

CoCubes Technologies

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