i
Lumen Technologies
Filter interviews by
Top trending discussions
One take home assignment
posted on 11 Sep 2024
posted on 7 Aug 2024
I applied via Job Portal and was interviewed in Jul 2024. There were 3 interview rounds.
Dsa and pointer and logical .
Tree and LL and graphs.
I approach problems methodically by breaking them down, analyzing root causes, brainstorming solutions, and testing them.
Break down the problem into smaller, manageable parts
Analyze the root causes of the problem
Brainstorm potential solutions
Test and iterate on the solutions until the problem is resolved
I will manage workload by prioritizing tasks, setting realistic deadlines, delegating when necessary, and regularly reviewing progress.
Prioritize tasks based on deadlines and importance
Set realistic deadlines and milestones
Delegate tasks to team members when necessary
Regularly review progress and adjust workload as needed
I applied via Naukri.com and was interviewed in Jun 2022. There were 9 interview rounds.
Data structures and algorithms
Problem were from leetcode and geek for geeks.
Coding round , questions from leetcode
Situation based questions and thought process
posted on 15 Jul 2022
I applied via Naukri.com and was interviewed in Jun 2022. There were 2 interview rounds.
posted on 13 Feb 2024
I applied via Walk-in and was interviewed before Feb 2023. There were 4 interview rounds.
45 mins, 3 coding questions in any language about Data structures
Technical questions, over an hour
posted on 12 Feb 2024
I applied via Recruitment Consulltant and was interviewed in Jan 2024. There was 1 interview round.
The question asks to find the memory of a given structure by considering struct padding.
Struct padding refers to the unused bytes added to align the members of a structure.
To find the memory of a structure, we need to consider the size of each member and the padding added.
The total memory of a structure is the sum of the sizes of its members and the padding.
Code to find the position of a number in a BST
Implement a recursive function to traverse the BST
Compare the target number with the current node value
If the target is smaller, go to the left subtree; if larger, go to the right subtree
Repeat until the target is found or the subtree is null
A Trie is a tree-like data structure used for efficient retrieval of strings. It supports insertion and search operations.
A Trie is also known as a prefix tree.
Each node in the Trie represents a character.
The root node represents an empty string.
Each node can have multiple children, each representing a different character.
Insertion involves traversing the Trie and creating new nodes as needed.
Search involves traversing...
posted on 7 Apr 2024
based on 55 reviews
Rating in categories
Software Engineer
450
salaries
| ₹3.2 L/yr - ₹12 L/yr |
Senior Software Engineer
353
salaries
| ₹6 L/yr - ₹21 L/yr |
Module Lead
166
salaries
| ₹10 L/yr - ₹22 L/yr |
Software Development Engineer
130
salaries
| ₹5 L/yr - ₹9.7 L/yr |
Senior Engineer
101
salaries
| ₹7 L/yr - ₹15 L/yr |
Tata Communications
Bharti Airtel
Reliance Communications
Vodafone Idea