i
Apple
Filter interviews by
Clear (1)
I applied via Approached by Company and was interviewed in Apr 2024. There were 2 interview rounds.
Wi-Fi topologies refer to the way in which devices are connected in a wireless network.
There are three main Wi-Fi topologies: ad-hoc, infrastructure, and mesh.
Ad-hoc topology involves devices connecting directly to each other without the need for a central access point.
Infrastructure topology uses a central access point to connect devices to the network.
Mesh topology allows devices to connect to multiple access points,...
Testing roaming procedure using RF attenuator involves simulating different signal strengths to ensure seamless handover
Set up RF attenuator to simulate varying signal strengths
Trigger roaming procedure by moving device between coverage areas
Monitor handover process and verify successful transition
Repeat test with different signal strength levels to cover all scenarios
1. Write a program in Python that accepts large csv file and extracts data from it
2. Write tests for a charger of AirPods like product
I was interviewed in Sep 2016.
A solution for solving the Rubik's cube
Use the layer-by-layer method
Solve the first layer cross
Solve the first layer corners
Solve the second layer
Solve the third layer cross
Solve the third layer corners
Orient the third layer corners
Permute the third layer corners
Permute the third layer edges
I am open to working in any location as long as the job is challenging and rewarding.
Open to relocation
Prioritize job satisfaction over location
Flexible with work arrangements
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 1 interview
Interview experience
Software Engineer
143
salaries
| ₹0 L/yr - ₹0 L/yr |
Ipro
107
salaries
| ₹0 L/yr - ₹0 L/yr |
Sales Executive
104
salaries
| ₹0 L/yr - ₹0 L/yr |
Software Developer
93
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Software Engineer
74
salaries
| ₹0 L/yr - ₹0 L/yr |
Amazon
Microsoft Corporation
Samsung