Filter interviews by
I am a Python Developer with 5 years of experience in web development and data analysis.
5 years of experience in Python development
Skilled in web development and data analysis
Proficient in using frameworks like Django and Flask
ORM stands for Object-Relational Mapping, a technique to map objects from an application to tables in a relational database.
ORM helps developers interact with databases using objects instead of SQL queries
Popular ORMs include SQLAlchemy for Python, Django ORM for Django framework
ORMs provide features like data validation, relationship management, and query optimization
Top trending discussions
I was interviewed in Jan 2021.
posted on 27 Jan 2017
I was interviewed in Dec 2016.
I applied via Naukri.com and was interviewed before Aug 2021. There were 2 interview rounds.
I was attended for technical f2f round for Android app developer, they asked to develop sample app with large json parsing in grid view. It's good and nice.
Easy to moderate apt test here
Easy to moderate coding questions on array
I applied via Referral and was interviewed in Oct 2023. There were 4 interview rounds.
NEED TO QUALIFY IN THIS TEST
NEED TO QUALIFY THIS TEST ALSO
I applied via Campus Placement and was interviewed before Jul 2022. There were 5 interview rounds.
50 questions in 12 minutes mostly test your arthimetic, logical knowledge.
3 coding questions in 90 mins, 1st one is from arrays an easy question, 2nd one is related to stacks and queues relatively harder and last one is hard which i am also unable to attempt. I cracked the first two questions and my solutions passed all the test cases.
Sorting algorithms are methods used to arrange elements in a specific order.
Different sorting algorithms include bubble sort, selection sort, insertion sort, merge sort, quick sort, and heap sort.
Some algorithms are more efficient than others depending on the size of the data set and the initial order of the elements.
For example, quick sort is generally faster than bubble sort for large data sets.
BFS and DFS are traversal algorithms used in trees. BFS explores level by level, while DFS explores depth first.
BFS (Breadth-First Search) visits nodes level by level, using a queue. Example: traversing a binary tree level by level.
DFS (Depth-First Search) explores as far as possible along each branch before backtracking. Example: in-order traversal of a binary tree.
I applied via Campus Placement and was interviewed before Sep 2022. There were 4 interview rounds.
Question from Array,DP
based on 1 interview
Interview experience
Software Engineer
43
salaries
| ₹0 L/yr - ₹0 L/yr |
Lease Analyst
24
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Software Engineer
23
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Engineer2
17
salaries
| ₹0 L/yr - ₹0 L/yr |
Product Owner
15
salaries
| ₹0 L/yr - ₹0 L/yr |
Yardi Systems
RealPage
Buildium
Entrata