Filter interviews by
I applied via Company Website and was interviewed in Aug 2024. There was 1 interview round.
Sort an array of colors in a specific order
Use a custom sorting function to sort the colors based on a predefined order
Map each color to a numerical value and sort based on that value
Consider using a hashmap to store the order of colors
I applied via Company Website and was interviewed in May 2024. There was 1 interview round.
I applied via Approached by Company and was interviewed in Jul 2022. There were 4 interview rounds.
What people are saying about Target
Yes, I have worked in Databricks for data engineering projects.
I have experience using Databricks for data processing and analysis.
I have utilized Databricks for building and optimizing data pipelines.
I have worked with Databricks notebooks for coding and collaboration.
I have used Databricks clusters for scalable data processing.
I have integrated Databricks with other tools like Apache Spark for big data processing.
I applied via Recruitment Consultant and was interviewed before Jul 2020. There was 1 interview round.
I was interviewed in Oct 2016.
I applied via Campus Placement
Boundary traversal of a tree is the process of visiting the nodes on the boundary of a tree in a specific order.
The boundary traversal can be done in three steps: left boundary, leaf nodes, and right boundary.
For the left boundary, start from the root and traverse down the left side of the tree until reaching a leaf node.
For the leaf nodes, perform an inorder traversal to visit all the leaf nodes of the tree.
For the ri...
Find the nearest greater value of a given value in a Binary Search Tree (BST).
Start from the root node and compare the given value with the current node's value.
If the given value is less than the current node's value, move to the left subtree.
If the given value is greater than the current node's value, move to the right subtree.
Keep track of the closest greater value encountered while traversing the tree.
Return the cl
Given an infinite staircase with a broken kth step, find the maximum height we can reach in n rounds of jumping i steps.
We can start by jumping the maximum number of steps in each round until we reach the broken step.
After reaching the broken step, we can discard the i steps that would land us on the broken step and jump the remaining steps.
We can continue this pattern until we reach the maximum height we can reach wit
based on 3 interviews
Interview experience
based on 4 reviews
Rating in categories
Senior Engineer
262
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Engineer
175
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Software Engineer
161
salaries
| ₹0 L/yr - ₹0 L/yr |
Lead Engineer
127
salaries
| ₹0 L/yr - ₹0 L/yr |
Lead Specialist
119
salaries
| ₹0 L/yr - ₹0 L/yr |
Walmart
Amazon
Flipkart
Reliance Retail