i
42Gears Mobility
Systems
Filter interviews by
The Two Sum problem involves finding two numbers in an array that add up to a specific target sum.
Use a hash map to store numbers and their indices for quick lookup.
Iterate through the array, calculating the complement (target - current number).
Check if the complement exists in the hash map; if yes, return the indices.
Example: For nums = [2, 7, 11, 15] and target = 9, return [0, 1] because 2 + 7 = 9.
final, finally, and finalize are keywords in Java with distinct purposes related to variable declaration, exception handling, and method behavior.
final: Used to declare constants. Example: final int MAX_VALUE = 100;
finally: A block that executes after try-catch, regardless of exceptions. Example: try { ... } catch { ... } finally { ... };
finalize: A method called by the garbage collector before an object is remove...
To find the minimum number of swaps needed to sort an array
Use graph theory to find cycles in the array
Count the number of swaps needed to fix each cycle
Add up the swaps needed for all cycles to get the total minimum swaps
Array List can be implemented in a stack by using an array and keeping track of the top element.
Create an array to store the elements of the stack.
Keep track of the top element using a variable.
For push operation, add the element to the top of the stack and increment the top index.
For pop operation, remove the top element and decrement the top index.
Find the 3rd largest number in an array without sorting by tracking the largest values.
Initialize three variables: first, second, and third to hold the largest, second largest, and third largest values.
Iterate through the array, updating these variables as needed.
Example: For array [3, 1, 4, 4, 5], first = 5, second = 4, third = 3.
Handle cases where there are duplicates by ensuring the values are distinct.
Given two strings representing expressions in variables, determine if they are equivalent. Return 'YES' if the expressions are identical and 'NO' if they are different. Each exp...
Check if two expressions are equivalent by evaluating them with different variable assignments.
Parse the expressions to evaluate them with different variable assignments.
Use a stack to keep track of operands and operators while evaluating the expressions.
Compare the results of both expressions to determine if they are equivalent.
Given an array of integers with 'N' elements, determine the length of the longest subsequence where each element is greater than the previous element. This ...
Find the length of the longest strictly increasing subsequence in an array of integers.
Use dynamic programming to solve this problem efficiently.
Initialize an array to store the length of the longest increasing subsequence ending at each index.
Iterate through the array and update the length of the longest increasing subsequence for each element.
Return the maximum value in the array as the result.
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 l...
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, it indicates the presence of a cycle in the linked list.
To optimize, use Floyd's cycle detection algorithm for O(N) time complexity and O(1) space complexity...
For a given M x N sized 2D array 'MATRIX', find and return the value of (i * i + j * j) for elements where the sum of the cubes of its digits equals the element itself. Here...
Find and return the value of (i * i + j * j) for elements in a 2D array where the sum of the cubes of its digits equals the element itself.
Iterate through the 2D array and check if the sum of the cubes of the digits equals the element itself.
Calculate (i * i + j * j) for elements that satisfy the condition.
Return the calculated values as output.
If no element satisfies the condition, return -1.
Convert a given binary tree into its mirror tree, where the left and right children of all non-leaf nodes are interchanged.
An integer ‘T’ denoting the number of...
Convert a binary tree into its mirror tree by interchanging left and right children of non-leaf nodes.
Traverse the tree in a recursive manner and swap the left and right children of each node.
Modify the binary tree in place to get the mirror, without creating a new tree.
Use a temporary variable to swap the left and right children of each node.
I appeared for an interview in May 2025, where I was asked the following questions.
I applied via Recruitment Consulltant and was interviewed in Aug 2024. There were 3 interview rounds.
Aptitude Had around 50 Questions which cover Logical,Quantitative, Code snippets
I appeared for an interview in Oct 2020.
Round duration - 180 Minutes
Round difficulty - Easy
It was from 8 to 11 in the morning. Basic aptitude MCQs were there and 2 coding questions were there.
Given two strings representing expressions in variables, determine if they are equivalent. Return 'YES' if the expressions are identical and 'NO' if they are different. Each ex...
Check if two expressions are equivalent by evaluating them with different variable assignments.
Parse the expressions to evaluate them with different variable assignments.
Use a stack to keep track of operands and operators while evaluating the expressions.
Compare the results of both expressions to determine if they are equivalent.
Given an array of integers with 'N' elements, determine the length of the longest subsequence where each element is greater than the previous element. This...
Round duration - 32 Minutes
Round difficulty - Easy
It was my first face to face technical round. DSA questions of easy-medium type were asked. And some discussion on the project was there.
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 ...
Convert a given binary tree into its mirror tree, where the left and right children of all non-leaf nodes are interchanged.
An integer ‘T’ denoting the number o...
Round duration - 45 Minutes
Round difficulty - Medium
It was technical plus HR round
For a given M x N sized 2D array 'MATRIX', find and return the value of (i * i + j * j) for elements where the sum of the cubes of its digits equals the element itself. Her...
Find and return the value of (i * i + j * j) for elements in a 2D array where the sum of the cubes of its digits equals the element itself.
Iterate through the 2D array and check if the sum of the cubes of the digits equals the element itself.
Calculate (i * i + j * j) for elements that satisfy the condition.
Return the calculated values as output.
If no element satisfies the condition, return -1.
Tip 1 : Good practice of DSA
Tip 2 : Good project(decent one)
Tip 3 : For interviews prepare a little bit about the company you are applying for.
Tip 1 : Add a project in resume.
Tip 2 : Add your top skills and make sure you have knowledge about the things written in your resume.
I applied via Recruitment Consultant and was interviewed in May 2021. There were 4 interview rounds.
Top trending discussions
I applied via Naukri.com and was interviewed before Jul 2019. There were 4 interview rounds.
I applied via Naukri.com and was interviewed before Sep 2020. There was 1 interview round.
I appeared for an interview before Apr 2021.
Round duration - 60 minutes
Round difficulty - Easy
The second round is also written but you need to write programming based on their concept.
Given a positive integer N
, your task is to identify all prime numbers less than or equal to N
.
A prime number is a natural number greater than 1 that has no po...
Determine if a given string 'S' is a palindrome, considering only alphanumeric characters and ignoring spaces and symbols.
The string 'S' should be evaluated in a case...
Round duration - 60 minutes
Round difficulty - Easy
Technical round with questions mainly on Java and OOPS concepts.
Static methods belong to the class itself, while instance methods belong to individual objects of the class.
Static methods are called using the class name, while instance methods are called using object references.
Static methods cannot access instance variables directly, while instance methods can access both static and instance variables.
Static methods are shared among all instances of the class, while instance method...
ClassNotFoundException occurs when a class is not found during runtime, while NoClassDefFoundError occurs when a class was found during compilation but not during runtime.
ClassNotFoundException is a checked exception, while NoClassDefFoundError is an Error.
ClassNotFoundException occurs when a class is not found at runtime, usually due to a missing classpath or incorrect class name.
NoClassDefFoundError occurs when a cla...
Error is a serious issue that cannot be handled at runtime, while Exception is a recoverable issue that can be caught and handled.
Error is a subclass of Throwable and is usually caused by the environment or system, such as running out of memory or stack overflow.
Exception is also a subclass of Throwable but is caused by the application code, such as invalid input or file not found.
Errors are unchecked and are not meant...
SerialVersionUID is a unique identifier used by Java to ensure the compatibility of serialized objects.
SerialVersionUID is a static final long variable in a class that implements Serializable interface.
It is used to ensure that the serialized object can be deserialized correctly even if the class definition has changed.
If the SerialVersionUID of the serialized object does not match the one in the class, an InvalidClass...
Requirements for creating an immutable class in Java
Make the class final so it cannot be extended
Make all fields private and final
Do not provide setter methods, only getter methods
Ensure that mutable objects are not returned in getter methods
Override equals() and hashCode() methods for proper comparison
Consider making defensive copies of mutable fields in constructor or getter methods
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.
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.
I appeared for an interview before Apr 2021.
Round duration - 90 minutes
Round difficulty - Easy
It was on online objective test consisting of 4 sections: Aptitude, Technical MCQs, Code snippet based MCQs and Coding part.
Given a string 'STR' consisting solely of the characters “{”, “}”, “(”, “)”, “[” and “]”, determine if the parentheses are balanced.
The first line contains an...
Determine if a given singly linked list of integers is a palindrome. Return true
if it is a palindrome, otherwise return false
.
1 -> 2 -> ...
Check if a given singly linked list of integers is a palindrome.
Use two pointers to find the middle of the linked list.
Reverse the second half of the linked list.
Compare the first half with the reversed second half to determine if it is a palindrome.
Round duration - 60 minutes
Round difficulty - Easy
This was a technical and managerial round. The interviewer gave me a situation where I am in testing team and I found that customer requirement was drop down list at a place but developer has used bullet selection, and is not ready to change it. How will you manage? I gave some good replies and he was convinced.
Abstract classes in C++ are classes that cannot be instantiated and are designed to be base classes for other classes.
Abstract classes may contain pure virtual functions, making them incomplete and unable to be instantiated.
Derived classes must implement all pure virtual functions from the abstract class in order to be concrete classes.
Abstract classes can have non-virtual functions and member variables like regular cl...
Round duration - 60 minutes
Round difficulty - Easy
This was also a technical round. He asked to optimize the code I wrote in coding round. Then he asked me a few puzzles and questions on OOPS, OS and DBMS.
Paging and segmentation are memory management techniques in operating systems.
Paging divides physical memory into fixed-size blocks called pages, while segmentation divides logical memory into variable-size segments.
Paging allows for efficient memory allocation and management, while segmentation provides protection and sharing of memory.
Paging is simpler to implement but can lead to internal fragmentation, while segmen...
Concurrency control is a technique used in databases to manage simultaneous access and modification of data by multiple users or processes.
Concurrency control ensures that transactions are executed in a way that maintains data consistency and integrity.
Techniques like locking, timestamp ordering, and optimistic concurrency control are used to implement concurrency control.
For example, in a banking system, concurrency c...
String Buffer is synchronized and thread-safe, while String Builder is not synchronized and faster.
String Buffer is synchronized, making it thread-safe for use in multi-threaded environments.
String Builder is not synchronized, resulting in faster performance but not thread-safe.
String Builder is preferred for single-threaded operations, while String Buffer is preferred for multi-threaded operations.
Smart pointers in C++ are objects that act like pointers but provide automatic memory management.
Smart pointers help prevent memory leaks by automatically managing memory allocation and deallocation.
Examples include unique_ptr, shared_ptr, and weak_ptr.
unique_ptr is used for exclusive ownership, shared_ptr for shared ownership, and weak_ptr to prevent circular references.
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.
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.
I applied via Company Website and was interviewed before May 2018. There were 3 interview rounds.
Program for snake traversal of binary tree
Use a stack to keep track of nodes to be visited
Start with the root node and push it onto the stack
While the stack is not empty, pop a node and print its value
If the level is even, push the left child first and then the right child onto the stack
If the level is odd, push the right child first and then the left child onto the stack
The duration of 42Gears Mobility Systems interview process can vary, but typically it takes about less than 2 weeks to complete.
based on 2 interview experiences
Difficulty level
Duration
based on 116 reviews
Rating in categories
Software Engineer
45
salaries
| ₹4.2 L/yr - ₹11 L/yr |
Member Technical Staff
39
salaries
| ₹5.3 L/yr - ₹12.9 L/yr |
Technical Support Engineer
32
salaries
| ₹6.9 L/yr - ₹12.2 L/yr |
Softwaretest Engineer
25
salaries
| ₹2.5 L/yr - ₹7.5 L/yr |
Test Engineer
23
salaries
| ₹3.2 L/yr - ₹8 L/yr |
Yodlee
Fingent
Bravura Solutions
CloudMoyo