i
Ixigo.com
Filter interviews by
I applied via Referral and was interviewed in Aug 2024. There was 1 interview round.
Primitives in JS are data types that are not objects and are immutable.
Types of primitives in JS include string, number, boolean, null, undefined, and symbol.
Primitives are passed by value, not by reference.
Examples: 'hello' (string), 42 (number), true (boolean), null, undefined, Symbol('foo')
Inline elements do not start on a new line and only take up as much width as necessary, while block elements start on a new line and take up the full width available.
Inline elements do not force a new line to start and only take up as much width as necessary (e.g. <span>, <a>, <strong>).
Block elements always start on a new line and take up the full width available (e.g. <div>, <p>, <h1&...
List virtualisation optimises rendering by only rendering items that are currently visible on the screen.
Use virtual scrolling to render only the visible items in a list
Implement windowing techniques to dynamically load and unload items as the user scrolls
Utilize libraries like React Virtualized or Angular CDK Virtual Scroll for efficient list rendering
Pseudo elements are used to style specific parts of an element, while pseudo classes are used to style an element based on its state or position.
Pseudo elements are denoted by :: before the element name, like ::before or ::after
Pseudo classes are denoted by a single colon before the class name, like :hover or :active
Pseudo elements are used to style parts of an element that do not exist in the DOM, like adding content ...
Top trending discussions
One hour for date-time serialization.
1 hour
pattern program
I applied via Approached by Company and was interviewed in Nov 2023. There were 3 interview rounds.
Linked list, tree, queues
Coin switch problem involves determining the minimum number of coin flips to make all coins face the same direction.
Start from one end and count the number of flips needed to make all coins face the same direction
Consider the edge cases where the first and last coins are different
Optimize by flipping only when necessary
posted on 9 May 2024
45 MCQ Which includes below topics
Basic core Java
Database
Spring
Hibernate
Angular
One program based on core Java logic
Travel module related code test.
I applied via Approached by Company and was interviewed in Aug 2023. There were 3 interview rounds.
Interviewer asked two coding question medium level
I applied via Walk-in and was interviewed before Oct 2023. There was 1 interview round.
PHP array functions are built-in functions in PHP that allow manipulation and handling of arrays.
Some common PHP array functions include array_push(), array_pop(), array_merge(), array_filter(), and array_map().
These functions can be used to add elements to an array, remove elements from an array, merge arrays, filter arrays based on a callback function, and apply a callback function to each element of an array.
Example
I applied via Referral and was interviewed in Nov 2023. There was 1 interview round.
LRU Cache is a data structure that stores the most recently used items and discards the least recently used items when full.
Use a combination of a doubly linked list and a hashmap to implement LRU Cache.
Keep track of the most recently used item at the head of the linked list and the least recently used item at the tail.
When a new item is accessed, move it to the head of the linked list and update the hashmap.
When the c...
I applied via Approached by Company and was interviewed in Dec 2022. There were 5 interview rounds.
I applied via Recruitment Consulltant and was interviewed before Jun 2023. There were 2 interview rounds.
Autosuggest debounce is a feature that delays the search suggestions until the user stops typing, and a polyfill is a piece of code that provides functionality that is not natively supported by the browser.
Implement a debounce function to delay the autosuggest feature until the user stops typing.
Use a polyfill to provide support for the autosuggest feature in browsers that do not natively support it.
Example: Implement ...
Kadane's algorithm is used to find the maximum subarray sum in an array of integers.
Iterate through the array and keep track of the maximum sum ending at each index.
At each index, choose between extending the previous subarray or starting a new subarray.
Example: For array [-2, 1, -3, 4, -1, 2, 1, -5, 4], the maximum subarray sum is 6 (from index 3 to 6).
based on 1 interview
Interview experience
Software Engineer
35
salaries
| ₹8 L/yr - ₹20 L/yr |
Software Developer
15
salaries
| ₹12 L/yr - ₹33 L/yr |
Software Engineer2
13
salaries
| ₹15.3 L/yr - ₹21 L/yr |
Product Manager
13
salaries
| ₹11 L/yr - ₹36 L/yr |
Senior Software Engineer
10
salaries
| ₹17.5 L/yr - ₹38 L/yr |
MakeMyTrip
Yatra
Cleartrip
Goibibo