Filter interviews by
I applied via Naukri.com and was interviewed before Nov 2022. There were 2 interview rounds.
First Round was pretty basic and coding questions was medium in Python and React.
Then coding assignment from client and then Manager Round followed by HR Round
I applied via Naukri.com and was interviewed in Jun 2022. There were 4 interview rounds.
Mirafra Technologies interview questions for designations
Top trending discussions
posted on 15 Jul 2024
To add two linked lists, iterate through both lists simultaneously and add corresponding nodes, considering carry from previous addition.
Create a dummy node to hold the result.
Initialize current node to dummy node.
Iterate through both lists, adding values and carry from previous addition.
Move to next nodes in both lists.
Handle cases where one list is longer than the other.
Handle final carry if present.
Use Dijkstra's algorithm to find the shortest path in a graph
Implement Dijkstra's algorithm to find the shortest path between two nodes in a graph
Maintain a priority queue to keep track of the shortest distance to each node
Update the shortest distance to each node as you traverse the graph
Track the path by storing the previous node for each node visited
Check if a binary tree is a Binary Search Tree (BST)
Perform an in-order traversal of the tree and check if the resulting array is sorted
Keep track of the previous node value during traversal to compare with the current node value
Ensure that each node's value is greater than the previous node's value in the in-order traversal
Check if a substring in an array of strings is a palindrome or not.
Iterate through each string in the array
For each string, check if any of its substrings are palindromes
Return true if a palindrome substring is found, false otherwise
I applied via Referral and was interviewed in Nov 2023. There were 6 interview rounds.
Duration: 1Hour 30 Minutes, 2 Coding Questions of Total 175 Marks. 1st Question has 75 marks and 2nd Question has 100 marks.
Using Bitwise OR operation to find the smallest missing number in an array.
Iterate through the array and perform Bitwise OR operation with each element to set corresponding bit in a bitmask
Iterate through the bitmask to find the first unset bit, which represents the smallest missing number
Example: Array [0, 1, 3, 4, 6] would have a bitmask of 10101, smallest missing number is 2
Pseudo code for a scenario
Define variables and data structures needed
Write the main logic using conditional statements and loops
Handle edge cases and error conditions
Test the pseudo code with sample inputs
Major questions were around problem solving, strings
posted on 20 May 2024
I applied via Referral and was interviewed in Nov 2023. There was 1 interview round.
Selenium xpath is used to locate elements on a web page, especially useful for dynamic loading scenarios.
Use xpath to locate elements based on their attributes or position on the page
For dynamic loading, use explicit waits to ensure elements are present before interacting with them
Consider using relative xpath expressions to make your tests more robust and maintainable
TestNG is a testing framework inspired by JUnit and NUnit, with more advanced features for test automation.
TestNG uses annotations to define test methods and test configurations.
It supports parameterized tests, test dependencies, and test groups.
TestNG allows parallel execution of tests, making it faster than other testing frameworks.
It provides detailed test reports and supports data-driven testing.
TestNG can be integ...
posted on 23 Mar 2023
I was interviewed in Feb 2023.
C Programming, OS Concepts, RTOS, Project Explanation.
posted on 28 Nov 2023
I applied via Naukri.com and was interviewed before Nov 2022. There were 3 interview rounds.
I interviewed with Mediatek having just 1 year of experience. It was for outsourcing position.
They asked me concepts from C language, writing code for data structures (LinkedIn list), and a question on string which I can't remember. This was pre COVID days.
Insert a node to the middle of a linked list
Find the middle node using slow and fast pointers
Create a new node with the data to be inserted
Adjust the pointers to insert the new node in the middle
based on 3 interviews
1 Interview rounds
based on 28 reviews
Rating in categories
Senior Software Engineer
269
salaries
| ₹6 L/yr - ₹23 L/yr |
Member Technical Staff
138
salaries
| ₹10 L/yr - ₹28 L/yr |
Software Engineer
104
salaries
| ₹3 L/yr - ₹12 L/yr |
Physical Design Engineer
54
salaries
| ₹5 L/yr - ₹17.1 L/yr |
Software Engineer2
50
salaries
| ₹5 L/yr - ₹12 L/yr |
Sasken
Einfochips
Cyient
L&T Technology Services