Mirafra Technologies Software Developer Interview Questions, Process, and Tips

Hirepro , 2 easy to medium coding questions with technical questions

• Q1. DSA questions were asked they were easy
  Add Answer
• Q2. Insert a node at the middle of a linked list
  View Answers (1)

• Q1. Puzzle and general question
  Add Answer

• Q1. Question on merge sort
  Add Answer

Round duration - 45 minutes
Round difficulty - Medium

Its a zoom call interview which lasted for 45 minutes. initially there are two panel members in which one is very targetting at me. They asked me different type of questions like jumping from DSA to project then to python then again java. Its a mixed combo pack type interview. for each and every question they asked me the real time example. The discussion on my project lasted for 15-20 mins.

• Q1. Count Set Bits You are given a positive integer ‘N’. Your task is to find the total number of ‘1’ in the binary representation of all the numbers from 1 to N. S...read more
  View Answers (2)
• Q2. Technical Questions Java: 1. In detail about the Oops concepts 2. Differences between Abstract class and Interface? 3. Differences between the real time example...read more
  Add Answer

Round duration - 30 mins
Round difficulty - Easy

This round was a zoom interview. The interview started with my brief introduction. This time the interview was more interested in my hobbies and passions. He asked me what do you do to keep yourself updated with the latest technology trends?

• Q1. Basic HR Questions 1. Asked me about the educational details? 2. What is your biggest achievement? 3. What do you know about the Micron Company? 4. Will you pre...read more
  Add Answer

Round duration - 75 minutes
Round difficulty - Medium

This was an online coding round where I had 2 questions to solve under 75 minutes. Both the coding questions were related to DP and were of Medium to Hard level of difficulty.

• Q1. Longest Common Prime Subsequence Ninja got a very long summer vacation. Being very bored and tired about it, he indulges himself in solving some puzzles. He enc...read more
  View Answers (2)
• Q2. Maximum Sum You are given an array “ARR” of N integers. You are required to perform an operation on the array each time until it becomes empty. The operation is...read more
  View Answers (4)

Round duration - 60 minutes
Round difficulty - Medium

This round had 2 Algorithmic questions wherein I was supposed to code both the problems after discussing their approaches and respective time and space complexities . After that , I was grilled on some OOPS concepts related to C++.

• Q1. Detect and Remove Loop in a Linked List You have given a Singly Linked List of integers, determine if it forms a cycle or not. A cycle occurs when a node's ...read more
  View Answers (4)
• Q2. Check If Preorder Traversal Is Valid You are given an array 'ARR' of positive integers. Your task is to check whether the array 'ARR' is a valid...read more
  View Answers (3)
• Q3. OOPS Question

  What is Vtable and VPTR in C++?

  View Answers (1)
• Q4. OOPS Question

  What Friend Functions in C++?

  View Answers (1)

Round duration - 60 minutes
Round difficulty - Medium

This was also a DS/Algo round where I was given 2 questions to solve and I was expected to come up with the optimal approach as far as possible. I solved both the questions with the optimal time and space complexities and then I was asked some more questions related to DBMS towards the end of the interview.

• Q1. Top View of a Binary Tree Given a binary tree. Print the Top View of Binary Tree. Print the nodes from left to right order. Example: Input: Output: 2 35 2 10 2...read more
  View Answers (3)
• Q2. Count number of Palindromic Substrings You have been given a string STR. Your task is to find the total number of palindromic substrings of STR. Example : If th...read more
  View Answers (6)
• Q3. DBMS Question

  Difference between the DELETE and TRUNCATE command in a DBMS.

  View Answers (1)
• Q4. DBMS Question

  What is meant by normalization and denormalization?

  View Answers (1)

Round duration - 75 minutes
Round difficulty - Medium

This was an online coding round where I had 2 questions to solve under 75 minutes. Both the coding questions were of Medium to Hard level of difficulty.

• Q1. Smallest Window You are given two strings S and X containing random characters. Your task is to find the smallest substring in S which contains all the charact...read more
  View Answers (3)
• Q2. K - Sum Path In A Binary Tree You are given a binary tree in which each node contains an integer value and a number ‘K’. Your task is to print every path of the...read more
  View Answers (2)

Round duration - 60 Minutes
Round difficulty - Medium

This round had 2 questions of DS/Algo to solve under 60 minutes and 2 questions related to Operating Systems.

• Q1. Validate BST Given a binary tree with N number of nodes, check if that input tree is Partial BST (Binary Search Tree) or not. If yes, return true, return false ...read more
  View Answers (3)
• Q2. Longest Increasing Subsequence For a given array with N elements, you need to find the length of the longest subsequence from the array such that all the elemen...read more
  View Answers (5)
• Q3. OS Question

  Define Process and Threads in OS.

  View Answers (1)
• Q4. OS Question

  What are the different types of semaphores ?

  View Answers (1)

Round duration - 60 Minutes
Round difficulty - Hard

In this round, I was asked 3 coding questions out of which I had to implement the first two and for the last question I was only asked the optimal approach. The main challenge in this round was to implement the first two questions in a production ready manner without any bugs and so I had to spent some time thinking about some Edge Cases which were important with respect to the question.

• Q1. Next Greater Element You are given an array arr of length N. You have to return a list of integers containing the NGE(next greater element) of each element of t...read more
  View Answers (3)
• Q2. Power Set You are given a sorted array of 'N' integers. You have to generate the power set for this array where each subset of this power set is individ...read more
  View Answers (4)
• Q3. Counting Sort Ninja is studying sorting algorithms. He has studied all comparison-based sorting algorithms and now decided to learn sorting algorithms that do n...read more
  View Answers (2)