Filter interviews by
Clear (1)
I applied via campus placement at National Institute of Technology, (NIT), Sikkim and was interviewed in Aug 2024. There were 2 interview rounds.
3 q python easy to medium
I am a passionate software engineer with experience in developing web applications and a strong background in computer science.
Experienced in developing web applications using technologies such as HTML, CSS, JavaScript, and React
Strong background in computer science with knowledge of data structures and algorithms
Proficient in programming languages such as Java, Python, and C++
Excellent problem-solving skills and abili
I have a strong technical background, problem-solving skills, and a passion for software development.
Extensive experience in programming languages such as Java, Python, and C++
Proven track record of successfully delivering high-quality software projects on time
Strong analytical and problem-solving skills, with the ability to quickly learn and adapt to new technologies
Excellent communication and teamwork skills, essenti
I applied via LinkedIn and was interviewed before Mar 2022. There were 2 interview rounds.
To traverse a singly linked list in both forward and backward directions, we can use a doubly linked list.
Create a doubly linked list with next and previous pointers
Start traversing from the head node to the tail node using the next pointers
To traverse in the backward direction, start from the tail node and use the previous pointers
Continue traversing until reaching the end of the list
Ola Cabs interview questions for designations
Top trending discussions
Logical reasoning, Quantitative aptitude
Array,Strings,DSA concepts like searching algorithm
It was a machine coding round
Sort an array of strings by the difference of a given element to each array element.
Iterate through the array and calculate the absolute difference between the given element and each array element.
Sort the array based on the calculated differences.
Return the sorted array.
I applied via Naukri.com and was interviewed in Apr 2024. There were 3 interview rounds.
Leaves of a tree are the nodes with no children in a tree data structure.
Traverse the tree and identify nodes with no children.
Use depth-first search or breadth-first search algorithms to find leaves.
Examples: In a binary tree, leaves are nodes with no left or right child.
In a general tree, leaves are nodes with no children in their child list.
The Lowest Common Ancestor (LCA) of a tree is the shared ancestor of two nodes farthest from the root.
Start from the root and traverse the tree to find the paths from the root to the two nodes.
Compare the paths to find the last common node between them, which is the LCA.
If one of the nodes is an ancestor of the other, then the ancestor node is the LCA.
I have worked on projects involving web development, mobile app development, and data analysis.
Developed a web application using React and Node.js for a client in the e-commerce industry
Created a mobile app using Flutter for a startup in the healthcare sector
Performed data analysis on customer behavior using Python and SQL for a marketing company
I completed internships at ABC Company and XYZ Company during my undergraduate studies.
Interned at ABC Company working on web development projects
Interned at XYZ Company assisting with software testing and quality assurance
Gained hands-on experience in coding, debugging, and problem-solving
based on 6 interviews
1 Interview rounds
based on 13 reviews
Rating in categories
Driver
748
salaries
| ₹1 L/yr - ₹6.4 L/yr |
CAR Driver
573
salaries
| ₹0.9 L/yr - ₹6 L/yr |
Program Manager
247
salaries
| ₹9.5 L/yr - ₹34 L/yr |
Assistant Manager
246
salaries
| ₹5.1 L/yr - ₹17.8 L/yr |
Senior Executive
227
salaries
| ₹2 L/yr - ₹7.5 L/yr |
Uber
Meru cabs
Zoomcar
Rapido