Filter interviews by
I applied via Naukri.com and was interviewed before Oct 2022. There were 4 interview rounds.
I applied via Recruitment Consultant and was interviewed in Mar 2021. There were 5 interview rounds.
I applied via Naukri.com and was interviewed before Mar 2021. There were 3 interview rounds.
I applied via Approached by Company and was interviewed before Dec 2021. There were 2 interview rounds.
I have extensive experience in Python, having worked with it for over 5 years.
Proficient in Python 2 and 3
Experience in developing web applications using Django and Flask frameworks
Familiarity with data analysis and visualization libraries such as Pandas and Matplotlib
Experience in developing automation scripts using Selenium and Beautiful Soup
Experience in developing machine learning models using scikit-learn and Tens
To compare time of 10 data in Python, use time module and compare each data using a loop.
Import time module
Create a list of 10 data
Use a loop to compare each data using time comparison operators
Print the result of each comparison
Marlabs interview questions for designations
Top trending discussions
I applied via Approached by Company and was interviewed before Apr 2021. There were 2 interview rounds.
I applied via Recruitment Consultant and was interviewed in May 2019. There were 3 interview rounds.
posted on 21 Nov 2020
posted on 11 Jul 2021
I applied via Naukri.com and was interviewed in Jan 2021. There were 3 interview rounds.
Angular is a popular front-end framework for building web applications.
Angular is developed and maintained by Google.
It uses TypeScript for building scalable and maintainable applications.
Angular has a powerful CLI for generating components, services, and more.
It has a large and active community with many third-party libraries and plugins available.
Angular has a modular architecture that allows for easy code reuse and
posted on 16 Apr 2021
I applied via Referral and was interviewed in Oct 2020. There was 1 interview round.
posted on 16 Apr 2021
Implement merge sort and find kth largest element in an array.
Merge sort is a divide and conquer algorithm that recursively divides the array into two halves, sorts them and then merges them.
Kth largest element can be found using quick select algorithm or by sorting the array and returning the kth element from the end.
Merge sort has a time complexity of O(nlogn) and space complexity of O(n).
Quick select has a time comp...
based on 2 interviews
Interview experience
based on 68 reviews
Rating in categories
Senior Software Engineer
610
salaries
| ₹6.5 L/yr - ₹25 L/yr |
Software Engineer
561
salaries
| ₹2.8 L/yr - ₹12 L/yr |
Technical Lead
363
salaries
| ₹9 L/yr - ₹35 L/yr |
Software Developer
123
salaries
| ₹3 L/yr - ₹11.4 L/yr |
Associate Software Engineer
88
salaries
| ₹3 L/yr - ₹5.2 L/yr |
ITC Infotech
CMS IT Services
KocharTech
Xoriant