i
Tekion
Filter interviews by
Clear (1)
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 Naukri.com and was interviewed in Jan 2024. There was 1 interview round.
Almost all on class based components in react js & polyfills prototypes for array methods
Top trending discussions
I applied via Referral and was interviewed in Oct 2024. There were 3 interview rounds.
Was asked to create a UI component keeping in mind scalability and reuseability.
General discussion about resume and projects, and then some basic JS coding questions like implement throttling and memoization.
I applied via Company Website and was interviewed before Oct 2023. There were 3 interview rounds.
It was on hackerrank, it was given to solve 3 questions in JS along with quiz on js concepts
It was a js fundamental round, was asked similar JS problems asked in the hackerrank test
Developed a responsive e-commerce website for a local boutique selling handmade jewelry
Used HTML, CSS, and JavaScript to create a visually appealing and user-friendly interface
Implemented a product carousel to showcase different jewelry collections
Integrated a payment gateway for secure online transactions
Stay updated by regularly reading tech blogs, attending conferences, taking online courses, and networking with other professionals.
Read tech blogs regularly (e.g. TechCrunch, Mashable)
Attend tech conferences and workshops
Take online courses and tutorials (e.g. Udemy, Coursera)
Network with other professionals in the field (e.g. LinkedIn, Meetup)
I do not try every new framework that comes in the market, but I do stay updated on the latest trends and evaluate them based on project requirements.
I prioritize learning frameworks that align with the project needs
I assess the pros and cons of new frameworks before deciding to use them
I stay updated on industry trends and experiment with new frameworks in personal projects
Optimizing code involves identifying and fixing bottlenecks to improve performance and efficiency.
Identify and remove unnecessary code or functions
Use efficient algorithms and data structures
Minimize network requests and optimize asset loading
Implement caching mechanisms
Profile and analyze code performance
I applied via Campus Placement and was interviewed in Feb 2024. There were 2 interview rounds.
Question are very tough and faad
Question like trees linked list and graphs
I applied via Referral and was interviewed in Sep 2023. There was 1 interview round.
I was interviewed in Aug 2021.
Round duration - 90 Minutes
Round difficulty - Easy
1 coding question which was quite easy. Some MCQ that includes basic questions related to html, css, javascript, oops, dbms and output.
Design a data structure for a Least Recently Used (LRU) cache that supports the following operations:
1. get(key)
- Return the value of the key if it exists in the cache; otherw...
Design a Least Recently Used (LRU) cache data structure that supports get and put operations with a given capacity.
Implement a doubly linked list to keep track of the order of keys based on their recent usage.
Use a hashmap to store key-value pairs for quick access and updates.
When capacity is reached, evict the least recently used item before inserting a new one.
Update the order of keys in the linked list whenever a ke
Round duration - 90 Minutes
Round difficulty - Easy
easy round. Had some frontend questions related to html ,css, js , etc Explain Closures in JavaScript. In how many ways can we specify the CSS styles for the HTML element?
Given a string, your task is to determine if it is a palindrome considering only alphanumeric characters.
The input is a single string without any leading or trailing...
Check if a given string is a palindrome considering only alphanumeric characters.
Remove non-alphanumeric characters from the input string.
Compare the string with its reverse to check for palindrome.
Handle edge cases like empty string or single character input.
Use two pointers approach for efficient comparison.
normalization, indexing
Normalization is the process of organizing data in a database to reduce redundancy and improve data integrity. Indexing is a technique to quickly retrieve data from a database.
Normalization helps in reducing data redundancy by breaking down tables into smaller, related tables.
Indexing is used to quickly retrieve data by creating indexes on columns in a table.
Normalization ensures data integrity by minimizing data dupli...
Round duration - 120 Minutes
Round difficulty - Hard
late at 8.00 pm
Given 'N' processes with their “burst times”, where the “arrival time” for all processes is ‘0’, and the ‘priority’ of each process, your task is to compute the “waiting ti...
Implement Priority CPU Scheduling algorithm to compute waiting time and turn-around time for processes.
Implement a function that takes in burst times, priorities, and number of processes as input
Sort the processes based on priority, with lower process ID as tiebreaker
Calculate waiting time and turn-around time for each process based on the scheduling algorithm
Data spooling is a process where data is temporarily stored in a buffer before being sent to an output device.
Data spooling helps in managing the flow of data between different devices by storing it temporarily.
It allows for efficient processing of data by decoupling the input/output operations.
Examples of data spooling include print spooling, where print jobs are stored in a queue before being sent to the printer.
Inheritance is a relationship between a superclass and subclass, while generalization is a relationship between entities with common characteristics.
Inheritance involves a parent-child relationship where the child class inherits attributes and methods from the parent class.
Generalization involves grouping entities with common attributes into a higher-level entity.
Inheritance is a specific form of generalization in obje...
Tip 1 : be confident
Tip 2 : make sure to talk less
Tip 3 : give precise answer
Tip 1 : mention only relevant things
Tip 2 : be precise
2 questions in 60 minutes
I applied via Campus Placement and was interviewed before Jul 2023. There was 1 interview round.
3-sum leetcode, 4 sum leetcode, react
based on 2 interviews
Interview experience
based on 2 reviews
Rating in categories
Software Engineer
381
salaries
| ₹0 L/yr - ₹0 L/yr |
Associate Software Engineer
237
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Software Engineer
146
salaries
| ₹0 L/yr - ₹0 L/yr |
Product Manager
100
salaries
| ₹0 L/yr - ₹0 L/yr |
QA Engineer
68
salaries
| ₹0 L/yr - ₹0 L/yr |
CarDekho Group
Cartrade.com
CARS24
Razorpay