i
Tekion
Work with us
Filter interviews by
Parking lot design involves layout, size, capacity, and efficiency considerations.
Consider the layout to maximize space and ease of access for vehicles.
Include designated spots for different types of vehicles (e.g. compact, electric, disabled).
Implement efficient traffic flow patterns to reduce congestion and improve safety.
Incorporate technology like sensors and automated payment systems for convenience.
Ensure pr...
Count the number of 2s in a given number
Iterate through each digit of the number and count the occurrences of 2
Convert the number to a string for easier manipulation
Handle edge cases like negative numbers or zero
The right view of a binary tree shows the rightmost node at each level.
Traverse the tree in a depth-first manner, starting from the right child of each node.
Keep track of the current level and only add the rightmost node of each level to the result.
Example: For the tree [1,2,3,null,5,null,4], the right view is [1,3,4].
Left view of a binary tree is the set of nodes visible when the tree is viewed from the left side.
The leftmost node at each level is included in the left view.
Use depth-first search to traverse the tree and keep track of the maximum level seen so far.
If the current node is at a level greater than the maximum level seen so far, add it to the left view and update the maximum level seen.
Connect nodes of a tree on the same level
Use a queue to traverse the tree level by level
For each level, connect the nodes using their next pointer
If a node has no next node, set its next pointer to null
Add two numbers represented as a linked list
Traverse both linked lists and add corresponding nodes
Handle carry over to next node
Create a new linked list to store the result
I appeared for an interview in May 2025, where I was asked the following questions.
Detecting cycles in a linked list can be efficiently done using Floyd's Tortoise and Hare algorithm.
Use two pointers: slow and fast. Slow moves one step, fast moves two steps.
If there's a cycle, the fast pointer will eventually meet the slow pointer.
If the fast pointer reaches the end (null), there is no cycle.
Example: For a list 1 -> 2 -> 3 -> 4 -> 2 (cycle back to 2), slow and fast will meet at 2.
I applied via Campus Placement
Basic aptitude test for college students
Dsa question was good means easy to medium
I applied via Job Portal
Coding Test on javascript on hackerrank
Dsa + js + react js ques
I applied via Referral and was interviewed in Oct 2023. There were 3 interview rounds.
Write a flutter code to display the values as a list for the given JSON
I applied via Referral and was interviewed before Oct 2023. There were 2 interview rounds.
Machine coding round
posted on 20 May 2024
I applied via Referral and was interviewed before May 2023. There were 2 interview rounds.
Count the number of 2s in a given number
Iterate through each digit of the number and count the occurrences of 2
Convert the number to a string for easier manipulation
Handle edge cases like negative numbers or zero
Parking lot design involves layout, size, capacity, and efficiency considerations.
Consider the layout to maximize space and ease of access for vehicles.
Include designated spots for different types of vehicles (e.g. compact, electric, disabled).
Implement efficient traffic flow patterns to reduce congestion and improve safety.
Incorporate technology like sensors and automated payment systems for convenience.
Ensure proper ...
I applied via Referral and was interviewed before Apr 2023. There were 2 interview rounds.
Written coding
1. tree related
2. linked list related
3. priority queue related
I applied via Naukri.com and was interviewed before Jun 2023. There were 3 interview rounds.
2 questions.
One was a medium DP
and second was an easy linked list
System Design interview.
Design teacher scheduling
I have experience in software development, focusing on web applications and collaborating in agile teams to deliver quality solutions.
Developed a web application using React and Node.js, improving user engagement by 30%.
Collaborated with a team of 5 in an agile environment, participating in daily stand-ups and sprint planning.
Implemented RESTful APIs for data retrieval, enhancing application performance and scalability...
Top trending discussions
The duration of Tekion Associate Software Engineer interview process can vary, but typically it takes about less than 2 weeks to complete.
based on 14 interview experiences
Difficulty level
Duration
based on 52 reviews
Rating in categories
Software Engineer
580
salaries
| ₹10 L/yr - ₹40 L/yr |
Associate Software Engineer
277
salaries
| ₹6 L/yr - ₹23.5 L/yr |
Senior Software Engineer
208
salaries
| ₹15 L/yr - ₹55 L/yr |
Software Developer
145
salaries
| ₹12.4 L/yr - ₹50 L/yr |
Product Manager
111
salaries
| ₹13.9 L/yr - ₹45.7 L/yr |
Thomson Reuters
HighRadius
Chetu
EbixCash Limited