AmbitionBox
Interview Questions
- Reviews
- Salaries
- Interview Questions
- About Company
- Benefits
- Jobs
- Office Photos
- Community
Add office photos
Filter interviews by
Mirafra Technologies Python Developer Interview Questions and Answers
Mirafra Technologies Python Developer Interview Experiences
2 interviews found
sivaraj yellathuripinti
I applied via Approached by Company and was interviewed in Jul 2024. There were 2 interview rounds.
(3 Questions)
- Q1. Fibanoica series
- Q2. Looping question
- Q3. Decorator function
(2 Questions)
- Q1. How to call parents init method in child class if child class also have init and global variable
- Ans.
Use super() method to call parent's init method in child class.
Use super() method in child class to call parent's init method.
Pass the child class and self as arguments to super() method.
Access the parent class attributes and methods using super().
- Q2. Looping question and json question
Skills evaluated in this interview
I applied via Recruitment Consultant and was interviewed before Jan 2021. There were 3 interview rounds.
Interview Questionnaire
1 Question
- Q1. Python Core Concepts , Coding Problems, and Django web framework
Interview Preparation Tips
Top trending discussions
Interview questions from similar companies
Software Developer Interview Questions & Answers
Cadence Design Systems
Anonymous
posted on 16 Sep 2021
I appeared for an interview before Sep 2020.
(3 Questions)
Round duration - 30 minutes
Round difficulty - Easy
- Q1. How do you search for a node in a linked list?
- Ans.
To search for a node in a linked list, iterate through the list and compare each node's value with the target value.
Start at the head of the linked list
Iterate through each node by following the 'next' pointer
Compare the value of each node with the target value
Return the node if found, otherwise return null
- Q2. How do you detect a loop in a linked list?
- Ans.
To detect a loop in a linked list, we can use Floyd's Cycle Detection Algorithm.
Initialize two pointers, slow and fast, at the head of the linked list.
Move slow pointer by one step and fast pointer by two steps.
If there is a loop, the two pointers will eventually meet.
Alternatively, we can use a hash set to store visited nodes and check for duplicates.
- Q3. Implement a stack using a singly linked list.
- Ans.
Implement a stack using a singly linked list
Create a Node class with data and next pointer
Create a Stack class with top pointer pointing to the top of the stack
Implement push, pop, and peek operations by manipulating the linked list
Example: Node class - Node { int data; Node next; }
(2 Questions)
Round duration - 40 minutes
Round difficulty - Easy
- Q1. What is the top view of a binary tree?
- Ans.
The top view of a binary tree shows the nodes visible from the top when looking down from the root node.
The top view of a binary tree is the set of nodes visible from the top when looking down from the root node.
Nodes at the same horizontal distance from the root are considered at the same level in the top view.
If multiple nodes are at the same horizontal distance, only the topmost node at that level is included in the...
- Q2. Explain the process of deleting a node from a linked list, covering all possible cases.
- Ans.
Deleting a node from a linked list involves updating pointers to maintain the list's integrity.
Identify the node to be deleted by traversing the list
Update the previous node's next pointer to skip the node to be deleted
Free the memory allocated to the node to be deleted
Interview Preparation Tips
Do practice a lot of questions on linked list and stacks as these are two most important data structures asked in the interview. Also, try to implement it yourself without seeing the solution. Also prepare for Computer Science subjects like Operating System, Database Management System, Computer Networks, etc. I prepared them through Coding Ninjas notes which were simpler and easy to understand.
Application resume tips for other job seekersKeep your resume short and up to mark and check spellings before submitting it for the interview process.
Final outcome of the interviewSelectedSkills evaluated in this interview
Software Developer Interview Questions & Answers
Cadence Design Systems
Anonymous
posted on 10 May 2015
Interview Questionnaire
9 Questions
- Q1. Tree questions related like traversal?
- Q2. Locate the sum of 2 numbers in a linear array (Unsorted and sorted) and their complexities
- Ans.
Locate sum of 2 numbers in a linear array (unsorted and sorted) and their complexities
For unsorted array, use nested loops to compare each element with every other element until the sum is found
For sorted array, use two pointers approach starting from the beginning and end of the array and move them towards each other until the sum is found
Complexity for unsorted array is O(n^2) and for sorted array is O(n)
- Q3. Pointers with increment/decrement, address of and value at operators (++,–,*,&)
- Ans.
Pointers are used to manipulate memory addresses and values in C++. Increment/decrement, address of and value at operators are commonly used.
Incrementing a pointer moves it to the next memory location of the same data type
Decrementing a pointer moves it to the previous memory location of the same data type
The address of operator (&) returns the memory address of a variable
The value at operator (*) returns the value sto
- Q4. A point and a rectangle is present with the given coordinates. How will you determine whether the point is inside or outside the rectangle?
- Ans.
To determine if a point is inside or outside a rectangle, we check if the point's coordinates fall within the rectangle's boundaries.
Check if the point's x-coordinate is greater than the left edge of the rectangle
Check if the point's x-coordinate is less than the right edge of the rectangle
Check if the point's y-coordinate is greater than the top edge of the rectangle
Check if the point's y-coordinate is less than the b...
- Q5. There is a point inside the rectangle. How will you determine the line that passes through the point and divides the rectangle into 2 equal halves?
- Ans.
To find line that divides rectangle into 2 equal halves through a point inside it.
Find the center of the rectangle
Draw a line from the center to the given point
Extend the line to the opposite side of the rectangle
The extended line will divide the rectangle into 2 equal halves
- Q6. There is a scheme which contains 8-bit and 16-bit signed numbers. How many such combinations are possible?
- Ans.
There are multiple combinations of 8-bit and 16-bit signed numbers. How many such combinations are possible?
There are 2^8 (256) possible combinations of 8-bit signed numbers.
There are 2^16 (65,536) possible combinations of 16-bit signed numbers.
To find the total number of combinations, we can add the number of combinations of 8-bit and 16-bit signed numbers.
Therefore, the total number of possible combinations is 256 +
- Q7. You are given an array of elements. Some/all of them are duplicates. Find them in 0(n) time and 0(1) space. Property of inputs – Number are in the range of 1..n where n is the limit of the array
- Ans.
Find duplicates in an array of elements in 0(n) time and 0(1) space.
Use the property of inputs to your advantage
Iterate through the array and mark elements as negative
If an element is already negative, it is a duplicate
Return all the negative elements as duplicates
- Q8. Given a array of digits. print all combination of of these i.e all no formed by these. repetition allowed. and then repetition not allowed example: i/p: arr={1,2,3} o/p: (without repetition) 123, 132, 213,...
- Q9. Questions on project
Interview Preparation Tips
Duration: 90 minutes
Total Questions: 3
Round: HR Interview
Experience: HR interview was all about my projects, my background and a few more typical HR questions. It was pretty easy to answer them.
Skills: Algorithm, Data structure, C++
College Name: IIT ROORKEE
Skills evaluated in this interview
I appeared for an interview before Mar 2024.
(1 Question)
- Q1. Salary discussion
Hirepro , 2 easy to medium coding questions with technical questions
(2 Questions)
- Q1. DSA questions were asked they were easy
- Q2. Insert a node at the middle of a linked list
- Ans.
To insert a node at the middle of a linked list, find the middle node and adjust pointers accordingly.
Find the middle node using slow and fast pointers
Adjust pointers to insert the new node at the middle
(1 Question)
- Q1. Puzzle and general question
Skills evaluated in this interview
I applied via Naukri.com and was interviewed in Apr 2024. There was 1 interview round.
(1 Question)
- Q1. Count freq of elements in array
- Ans.
Count frequency of elements in array of strings
Iterate through the array and use a hashmap to store the frequency of each element
Use a for loop to go through each element and update the count in the hashmap
Return the hashmap with element frequencies
Skills evaluated in this interview
I applied via Campus Placement and was interviewed in Aug 2024. There were 2 interview rounds.
Its basically a test comprising 32 mcq
12- logical reasoning
20- core C,DBMS, OS , Computer Networks
2 coding Questions
(2 Questions)
- Q1. He just Gave me to design a React Page and removed all the starting code and gave me blank folder and asked to code all by myself
- Q2. He asked me SQL queries which was quite tough as its of nested queries
(2 Questions)
- Q1. What is normalization
- Ans.
Normalization is the process of organizing data in a database to reduce redundancy and improve data integrity.
Normalization is used to eliminate data redundancy by breaking up tables into smaller, related tables.
It helps in reducing data anomalies such as insertion, update, and deletion anomalies.
Normalization is achieved through a series of stages called normal forms, with the most common being First Normal Form (1NF)...
- Q2. Code for armstrong alogrithm
- Ans.
Armstrong algorithm is used to find Armstrong numbers in a given range.
Iterate through the numbers in the given range
Calculate the sum of cubes of each digit in the number
Check if the sum is equal to the original number
Skills evaluated in this interview
I appeared for an interview before Sep 2020.
(1 Question)
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 Problem Statement
Given a positive integer
N, compute the total number of '1's in the binary representation of all numbers from 1 to N. Return this count modulo 1e9+7 because the result can... - Ans.
Count the total number of set bits in the binary representation of numbers from 1 to N modulo 1e9+7.
Use bitwise operations to count the set bits in each number from 1 to N.
Keep track of the total set bits and return the result modulo 1e9+7.
Optimize the solution to handle large values of N efficiently.
Consider using dynamic programming or precomputing values for faster computation.
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?
Interview Preparation Tips
Tip 1 : Do participate in all the coding contests, long challenges held by codechef, codeforces
Tip 2 : Practice all kinds of problems on leetcode, gfg, coding ninjas
Tip 3 : When you are writing a written exam for a particular company, make sure you get to know about the company in detail.
Tip 1 : Make your resume short and sweet(mostly 1 page, max 2 pages) is preferred.
Tip 2 : Make sure your resume is crisp rather than descriptive
Tip 3 : Do not lie on your resume
Skills evaluated in this interview
Mirafra Technologies Interview FAQs
Tell us how to improve this page.
Mirafra Technologies Interviews By Designations
- Mirafra Technologies Software Engineer Interview Questions
- Mirafra Technologies Senior Software Engineer Interview Questions
- Mirafra Technologies Embedded Software Engineer Interview Questions
- Mirafra Technologies Software Developer Interview Questions
- Mirafra Technologies Design & Verification Engineer Interview Questions
- Mirafra Technologies Python Developer Interview Questions
- Mirafra Technologies Data Scientist Interview Questions
- Mirafra Technologies Senior Engineer Interview Questions
- Show more
Interview Questions for Popular Designations
- Python Software Developer Interview Questions
- Jr Python Developer Interview Questions
- Python and Django Developer Interview Questions
- Python Developer Intern Interview Questions
- Senior Python Developer Interview Questions
- Python Developer Trainee Interview Questions
- Python Automation Engineer Interview Questions
- Odoo Python Developer Interview Questions
- Show more
Mirafra Technologies Python Developer Interview Process
based on 1 interview
Interview experience
Interview Questions from Similar Companies
|
Senior Software Engineer
293
salaries
|  ₹7 L/yr - ₹23.5 L/yr |
|
Member Technical Staff
140
salaries
| ₹10 L/yr - ₹32 L/yr |
|
Software Engineer
111
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.8 L/yr |
Apar Industries
TDK India Private Limited
Molex
Micron Technology
- Home >
- Interviews >
- Mirafra Technologies Interview Questions >
- Mirafra Technologies Python Developer Interview Questions
