i
Tekion
Work with us
Filter interviews by
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.
Implementing polyfills for Promises to ensure compatibility in environments lacking native support.
Define a Promise constructor that takes an executor function with resolve and reject parameters.
Implement the 'then' method to handle chaining of promises.
Handle asynchronous operations using 'setTimeout' to mimic the behavior of native promises.
Ensure proper error handling by catching exceptions and calling the reje...
Implementing Promise.all allows multiple promises to run concurrently and resolves when all promises are fulfilled.
Promise.all takes an iterable of promises as input.
It returns a single promise that resolves when all input promises resolve.
If any promise rejects, Promise.all immediately rejects with that reason.
Example: Promise.all([promise1, promise2]).then(results => { /* handle results */ });
The resolved val...
Find the path in a matrix with the longest sum of elements
Start from the top-left corner of the matrix
Move only right or down in the matrix
Keep track of the sum of elements in each path
Return the path with the longest sum
The problem involves finding the sum of all possible subarrays in an array of integers.
Use nested loops to iterate through all possible subarrays
Keep track of the sum of each subarray as you iterate
Consider edge cases like empty array or negative numbers
Graph algorithms are essential for solving problems related to networks, paths, and connectivity in data structures.
Graphs can be represented using adjacency lists or adjacency matrices.
Common algorithms include Depth-First Search (DFS) and Breadth-First Search (BFS).
Dijkstra's algorithm finds the shortest path in weighted graphs.
Topological sorting is used in directed acyclic graphs (DAGs) to order vertices.
Examp...
An in-memory database is a database that primarily relies on main memory for data storage and retrieval.
Utilize data structures like hash tables or trees for fast data access
Implement caching mechanisms to optimize performance
Consider data persistence strategies for durability
Support for transactions and concurrency control
Example: Redis, Memcached
Reversing a linked list involves changing the direction of the pointers between nodes.
Iterative approach: Use three pointers (prev, current, next) to reverse links.
Example: For list 1 -> 2 -> 3, after reversal it becomes 3 -> 2 -> 1.
Recursive approach: Reverse the rest of the list and adjust pointers.
Example: Base case is when the list is empty or has one node.
Common tools for troubleshooting include log analysis tools, network monitoring tools, and remote desktop tools.
Log analysis tools such as Splunk or ELK stack can help identify errors and issues in application logs.
Network monitoring tools like Wireshark or Nagios can help pinpoint network-related problems.
Remote desktop tools like TeamViewer or AnyDesk can be used to troubleshoot issues on end-user machines remot...
I have experience using Splunk for log management and analysis.
Utilized Splunk to monitor and analyze log data for troubleshooting issues
Created custom dashboards and alerts to track system performance
Used Splunk queries to identify patterns and trends in log data
Integrated Splunk with other tools for seamless data analysis
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.
Find the path in a matrix with the longest sum of elements
Start from the top-left corner of the matrix
Move only right or down in the matrix
Keep track of the sum of elements in each path
Return the path with the longest sum
IT WAS BIT TOUGH AND WAS BASED UPON LEETCODE AND CONTAINED SOME MCQ AS WELL
I have 3 years of experience troubleshooting various software and hardware issues in a corporate IT environment.
Experience diagnosing and resolving technical issues for end users
Proficient in using troubleshooting tools and techniques
Ability to analyze logs and error messages to identify root causes
Familiarity with ticketing systems for tracking and documenting issues
Collaborated with cross-functional teams to resolve ...
Experience working with REST API's in previous roles.
Developed and maintained RESTful APIs for various applications
Used tools like Postman for testing and debugging API endpoints
Worked with JSON and XML data formats for API communication
Common tools for troubleshooting include log analysis tools, network monitoring tools, and remote desktop tools.
Log analysis tools such as Splunk or ELK stack can help identify errors and issues in application logs.
Network monitoring tools like Wireshark or Nagios can help pinpoint network-related problems.
Remote desktop tools like TeamViewer or AnyDesk can be used to troubleshoot issues on end-user machines remotely.
I have experience using Splunk for log management and analysis.
Utilized Splunk to monitor and analyze log data for troubleshooting issues
Created custom dashboards and alerts to track system performance
Used Splunk queries to identify patterns and trends in log data
Integrated Splunk with other tools for seamless data analysis
I applied via Referral and was interviewed in Oct 2024. There was 1 interview round.
Design a notification service for sending alerts to users.
Use a scalable messaging system like Kafka or RabbitMQ to handle high volume of notifications.
Implement a user subscription system to allow users to choose which notifications they want to receive.
Include different channels for notifications such as email, SMS, and push notifications.
Consider implementing a scheduling system to send notifications at specific tim...
I applied via LinkedIn and was interviewed in Jul 2024. There were 2 interview rounds.
Progress bar in React can be designed using CSS and state management.
Use CSS to style the progress bar
Use state management to update the progress value dynamically
Consider using libraries like react-progress-bar to simplify implementation
In React JS, timers can be implemented using setInterval or setTimeout functions.
Use setInterval for recurring timers
Use setTimeout for one-time timers
Remember to clear the timer using clearInterval or clearTimeout when component unmounts
I applied via Instahyre and was interviewed in May 2024. There were 2 interview rounds.
Use sorting or heap data structure to find top k elements in an array.
Sort the array in descending order and return the first k elements.
Use a max heap data structure to efficiently find the top k elements.
Time complexity can be O(n log n) for sorting or O(n log k) for heap method.
Arrow functions are concise and have implicit return, while normal functions have more flexibility and can be named.
Arrow functions are written with a concise syntax using '=>'
Arrow functions do not have their own 'this' keyword
Normal functions can be named and have more flexibility in terms of syntax and behavior
ES6 updates refer to the new features and syntax improvements introduced in ECMAScript 6, also known as ES2015.
Arrow functions for more concise syntax
Let and const for block-scoped variables
Classes for object-oriented programming
Template literals for easier string interpolation
Destructuring assignment for extracting values from arrays and objects
Spread and rest operators for easier manipulation of arrays and objects
Event loop is a mechanism in JavaScript that allows for asynchronous operations to be executed in a non-blocking way.
Event loop continuously checks the call stack for any functions that need to be executed.
If the call stack is empty, the event loop checks the callback queue for any pending tasks.
Event loop moves tasks from the callback queue to the call stack for execution.
Example: setTimeout function in JavaScript use...
I applied via LinkedIn and was interviewed in Jun 2024. There were 4 interview rounds.
Design a system for booking airplane tickets efficiently and securely.
Create a user-friendly interface for customers to search and book flights.
Implement a secure payment system for processing transactions.
Include features for managing flight schedules, seat availability, and pricing.
Integrate with airlines' reservation systems for real-time updates.
Provide options for seat selection, meal preferences, and special requ...
High-Level Design (HLD) outlines the architecture and components of our current software system.
System Architecture: Microservices architecture with independent services for user management, order processing, and payment.
Data Flow: User requests are routed through an API Gateway to respective microservices, ensuring scalability.
Database Design: Each microservice has its own database, e.g., PostgreSQL for user data and ...
Design a system for searching and booking train tickets on IRCTC, focusing on user experience and backend architecture.
User Interface: A clean, intuitive UI for searching trains by source, destination, and date.
Search Algorithm: Implement efficient algorithms to fetch available trains based on user input.
Database Design: Use a relational database to store train schedules, bookings, and user data.
Caching: Implement cach...
Current system is a web-based application for managing customer data and orders.
Frontend built with React for user interface
Backend built with Node.js and Express for server-side logic
Database using MySQL for storing customer data and orders
Authentication using JWT tokens for secure access
I applied via Recruitment Consulltant and was interviewed in Sep 2024. There was 1 interview round.
A polyfill for Promise.all that resolves multiple promises and returns a single promise with an array of results.
Create a function named 'promiseAll' that accepts an array of promises.
Use 'Promise.resolve()' to handle non-promise values.
Utilize 'Promise.allSettled()' to wait for all promises to settle.
Return a single promise that resolves with an array of results.
Debouncing is a technique to limit the rate at which a function is executed, improving performance in React applications.
Debouncing delays the execution of a function until after a specified wait time has elapsed since the last time it was invoked.
Commonly used in scenarios like search input fields to prevent excessive API calls while the user is typing.
Example: Using lodash's debounce function: const debouncedFunction...
Graph algorithms are essential for solving problems related to networks, paths, and connectivity in data structures.
Graphs can be represented using adjacency lists or adjacency matrices.
Common algorithms include Depth-First Search (DFS) and Breadth-First Search (BFS).
Dijkstra's algorithm finds the shortest path in weighted graphs.
Topological sorting is used in directed acyclic graphs (DAGs) to order vertices.
Example: U...
The problem involves finding the sum of all possible subarrays in an array of integers.
Use nested loops to iterate through all possible subarrays
Keep track of the sum of each subarray as you iterate
Consider edge cases like empty array or negative numbers
Top trending discussions
The duration of Tekion interview process can vary, but typically it takes about less than 2 weeks to complete.
based on 101 interview experiences
Difficulty level
Duration
based on 337 reviews
Rating in categories
Software Engineer
577
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