AmbitionBox
Interview Questions
- Reviews
- Salaries
- Interview Questions
- About Company
- Benefits
- Jobs
- Office Photos
- Community
Add office photos
Filter interviews by
mthree Python Developer Interview Questions and Answers
mthree Python Developer Interview Experiences
1 interview found
Anonymous
I applied via Company Website and was interviewed in Jul 2024. There were 2 interview rounds.
Javascript logical questions
(2 Questions)
- Q1. Basics of React
- Q2. JavaScript basics
Interview questions from similar companies
I applied via Campus Placement and was interviewed before Feb 2021. There were 3 interview rounds.
Aptitude round consists Logical reasoning, General Aptitude, Grammar related questions etc. All are moderate level questions.
(3 Questions)
- Q1. Explain OOPs w.r.t Java
- Ans.
OOPs is a programming paradigm that uses objects to represent real-world entities. Java is an OOPs language.
OOPs stands for Object-Oriented Programming System
Java is a class-based OOPs language
Encapsulation, Inheritance, Polymorphism, and Abstraction are the four pillars of OOPs
Objects have state and behavior
Java supports interfaces, which allow for multiple inheritance
Example: A car can be represented as an object wit...
- Q2. Explain about the projects that you have worked on
- Q3. Explain how Java solves machine dependency of code execution
- Ans.
Java solves machine dependency by using bytecode and virtual machine.
Java code is compiled into bytecode which is platform-independent
The bytecode is executed by the Java Virtual Machine (JVM) which is platform-specific
JVM translates bytecode into machine code for the specific platform
This allows Java code to run on any platform with a JVM installed
Example: A Java program compiled on Windows can run on Linux or Mac as
(2 Questions)
- Q1. Why should we hire you?
- Q2. Tell me about yourself.
Interview Preparation Tips
- Java
Skills evaluated in this interview
I applied via Campus Placement and was interviewed before May 2021. There were 2 interview rounds.
Numerical ability and logical reasoning followed by some coding mcqs
(1 Question)
- Q1. Print 1 to 100 without for loop
- Ans.
Printing 1 to 100 without for loop
Use recursion to print numbers from 1 to 99
Print 100 outside the recursion
Use a base case to stop recursion at 100
Interview Preparation Tips
I applied via Campus Placement and was interviewed before Jun 2021. There were 2 interview rounds.
Simple aptitude test
(1 Question)
- Q1. General questions as per your cv
Interview Preparation Tips
- Aptitude
I appeared for an interview before Sep 2020.
Round duration - 60 minutes
Round difficulty - Easy
Round duration - 50 minutes
Round difficulty - Easy
Round duration - 60 minutes
Round difficulty - Easy
At the beginning of this round, the interviewer asked me about the data structures I knew. Linked lists, trees, graphs, arrays etc. was my answer. He asked me how well I knew Dynamic Programming. I said I wasn’t strong in that and he said that he would ask me a question on dynamic programming for sure.
Round duration - 40 minutes
Round difficulty - Easy
The interviewer asked me if I was comfortable with the interview process so far and how the previous interviews were. I said it was good and he gave me the first problem to solve.
(1 Question)
Round duration - 60 minutes
Round difficulty - Easy
The interviewer asked me some Computer Science fundamentals in this round as well as some behavioural questions.
- Q1. Implement a Trie data structure and write functions to insert and search for a few words in it.
- Ans.
Implement a Trie data structure with insert and search functions.
Create a TrieNode class with children and isEndOfWord attributes.
Implement insert function to add words by iterating through characters.
Implement search function to check if a word exists by traversing the Trie.
Example: Insert 'apple', 'banana', 'orange' and search for 'apple' and 'grape'.
Interview Preparation Tips
Do lot of hard work and practice of Data Structures and Algorithms based questions. I personally recommend you Coding Ninjas and Geeks For Geeks for interview preparation.
Application resume tips for other job seekersMake your resume short and try to make it of one page only and do mention all your skills which you are confident of in your resume.
Final outcome of the interviewSelectedSkills evaluated in this interview
I applied via Campus Placement and was interviewed before Aug 2021. There were 2 interview rounds.
It was a basic aptitude test.
(1 Question)
- Q1. Interview was fine. Mostly asked about my final year project.
Interview Preparation Tips
I applied via Newspaper Ad and was interviewed before Jun 2021. There were 3 interview rounds.
(1 Question)
- Q1. Basic questions of java.
(1 Question)
- Q1. Intro and other hr related questions.
Interview Preparation Tips
I applied via Naukri.com and was interviewed before Jun 2021. There were 2 interview rounds.
English is the main focussed part
(1 Question)
- Q1. Basic introduction and project based questions.
Interview Preparation Tips
Arham Khokhar
I applied via Company Website and was interviewed before Apr 2021. There were 2 interview rounds.
It's totally based on Basic understanding of concepts such as Linear arrangement, circular arrangement، blood relation, direction sense, ratio proportion, time, speed, distance
(3 Questions)
- Q1. It's based on OOPS Concepts,
- Q2. Strength and weaknesses
- Q3. About yourself, about educational background, why should we hire you
Interview Preparation Tips
SAMKIT JAIN
I appeared for an interview in Aug 2017.
Interview Questionnaire
7 Questions
- Q1. Implement Merge Sort.
- Ans.
Merge Sort is a divide and conquer algorithm that sorts an array by dividing it into two halves, sorting them separately, and then merging the sorted halves.
Divide the array into two halves
Recursively sort the two halves
Merge the sorted halves
- Q2. Given a BST containing distinct integers, and a number ‘X’, find all pairs of integers in the BST whose sum is equal to ‘X’.
- Ans.
Find pairs of integers in a BST whose sum is equal to a given number.
Traverse the BST and store the values in a hash set.
For each node, check if (X - node.value) exists in the hash set.
If yes, add the pair (node.value, X - node.value) to the result.
Continue traversal until all nodes are processed.
- Q3. Given a set of time intervals in any order, merge all overlapping intervals into one and output the result which should have only mutually exclusive intervals.
- Ans.
Merge overlapping time intervals into mutually exclusive intervals.
Sort the intervals based on their start time.
Iterate through the intervals and merge overlapping intervals.
Output the mutually exclusive intervals.
Example: [(1,3), (2,6), (8,10), (15,18)] -> [(1,6), (8,10), (15,18)]
- Q4. What are the different types of hashing? Suggest an alternative and a better way for Linear Chaining.
- Ans.
Different types of hashing and alternative for Linear Chaining
Different types of hashing include division, multiplication, and universal hashing
Alternative for Linear Chaining is Open Addressing
Open Addressing includes Linear Probing, Quadratic Probing, and Double Hashing
- Q5. Implement AVL Tree.
- Ans.
An AVL tree is a self-balancing binary search tree where the heights of the left and right subtrees differ by at most one.
AVL tree is a binary search tree with additional balance factor for each node.
The balance factor is the difference between the heights of the left and right subtrees.
Insertion and deletion operations in AVL tree maintain the balance factor to ensure the tree remains balanced.
Rotations are performed ...
- Q6. Minimum number of squares whose sum equals to given number n.
- Ans.
Find the minimum number of squares whose sum equals to a given number n.
Use dynamic programming to solve the problem efficiently.
Start with finding the square root of n and check if it is a perfect square.
If not, then try to find the minimum number of squares required for the remaining number.
Repeat the process until the remaining number becomes 0.
Return the minimum number of squares required for the given number n.
- Q7. Insertion sort for a singly linked list.
- Ans.
Insertion sort for a singly linked list.
Traverse the list and compare each node with the previous nodes
If the current node is smaller, swap it with the previous node
Repeat until the end of the list is reached
Time complexity is O(n^2)
Interview Preparation Tips
Experience: There were 2 coding questions (no penalty for wrong submission) and 20 Multiple Choice Questions(with negative marking). We were given 90 minutes to solve them. MCQs were based on Data Structures, OS, CN, C outputs, OOP etc.
Tips: Experience in Competitive Programming might help in solving coding questions. No constraints were mentioned and detailed Instructions related to problem were stated vaguely. So code carefully.
Duration: 1 hour 30 minutes
Total Questions: 22
Round: Technical Interview
Experience: The interviewer asked me to introduce myself and a brief introduction of the projects that I have done. She first asked me questions related to my project. After that she moved on to the data structures part.
Tips: Take your time to approach the problems and if the question is not clear ask the interviewer to explain it again.
Round: Technical Interview
Experience: The interviewer asked me about how my previous round went. After that, he asked me to introduce myself and a brief introduction of the projects that I have done. He first asked me a few questions related to my project. Then he moved on to the data structures part. In this round the interviewer gave me strict time limit for coding the solution on paper for each problem and as soon as I was done coding he gave me 2-3 minutes every time to find errors and debug my code.
Tips: Do not panic even if the interviewer sets time limit while solving problems. If the question is not clear ask the interviewer to explain it again.
College Name: The LNM Institute Of Information Technology, Jaipur
Skills evaluated in this interview
mthree Interview FAQs
Tell us how to improve this page.
mthree Interviews By Designations
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
mthree Python Developer Interview Process
based on 1 interview
Interview experience
Python Developer Interview Questions from Similar Companies
Fast track your campus placements
|
Software Developer
10
salaries
|  ₹7 L/yr - ₹10 L/yr |
|
Production Support Analyst
4
salaries
| ₹5 L/yr - ₹9 L/yr |
|
Junior Associate
3
salaries
| ₹7 L/yr - ₹7 L/yr |
TCS
Infosys
Wipro
HCLTech
- Home >
- Interviews >
- mthree Interview Questions >
- mthree Python Developer Interview Questions
