i
Pixis
Filter interviews by
I applied via Referral and was interviewed in Jul 2024. There was 1 interview round.
Call, apply, and bind are methods in JavaScript used to manipulate the context of a function.
Call: Invokes a function with a specified 'this' value and arguments provided individually.
Apply: Invokes a function with a specified 'this' value and arguments provided as an array.
Bind: Creates a new function that, when called, has its 'this' keyword set to a specific value.
Closures are functions that have access to variables from their containing scope even after the scope has closed.
Closures allow functions to access variables from their outer function even after the outer function has finished executing.
They are commonly used in event handlers, callbacks, and asynchronous programming.
Closures help in maintaining state in functional programming.
I appeared for an interview in Apr 2021.
Round duration - 90 minutes
Round difficulty - Hard
Timing was late evening. Platform was good.
Given a maze represented by 'N' cells numbered from 0 to N-1, and an array arr
of 'N' integers where arr[i]
denotes the cell number that can be reached from the 'i'...
Identify the length of the largest cycle in a maze represented by cells and an array of integers.
Iterate through each cell and find the cycle length using DFS or Floyd's Tortoise and Hare algorithm.
Handle self-cycles and cells with no exit by checking arr[i] = i and arr[i] = -1 respectively.
Output the length of the largest cycle found or -1 if no cycles exist.
Ninja is stuck in a maze represented as a 2D grid. He can move in four directions (Up, Down, Left, Right) until he hits a wall ('1'). Once stopped, he can choose a new...
Determine if Ninja can reach the destination in a maze by moving in four directions until hitting a wall.
Create a function to traverse the maze using depth-first search or breadth-first search.
Keep track of visited cells to avoid infinite loops.
Return 'True' if destination is reachable, 'False' otherwise.
Tip 1 : Do some projects.
Tip 2 : Practice dynamic programming.
Tip 1 : Keep it short.
Tip 2 : Do not put false things on resume.
I appeared for an interview in Apr 2021.
Round duration - 90 minutes
Round difficulty - Hard
Timing was late evening . Platform was good.
Given a maze represented by 'N' cells numbered from 0 to N-1, and an array arr
of 'N' integers where arr[i]
denotes the cell number that can be reached from the 'i'...
Identify the length of the largest cycle in a maze represented by cells and an array of integers.
Iterate through each cell and find the cycle length using DFS or Floyd's Tortoise and Hare algorithm.
Keep track of visited cells to avoid infinite loops.
Return the length of the largest cycle found or -1 if no cycles exist.
Tip 1 : Do some projects
Tip 2 : Be good in data structure
Tip 1 : Keep it short
Tip 2 : Don't try to add false things.
I appeared for an interview in Mar 2021.
Round duration - 90 minutes
Round difficulty - Medium
The coding round was 90 minutes with 2 question and the difficulty was mid-range and both were graph question
You need to determine all possible paths for a rat starting at position (0, 0) in a square maze to reach its destination at (N-1, N-1). The maze is represented as an N*N ma...
Find all possible paths for a rat in a maze from start to destination.
Use backtracking to explore all possible paths in the maze.
Keep track of visited cells to avoid revisiting them.
Explore all possible directions (up, down, left, right) from each cell.
Add the current direction to the path and recursively explore further.
When reaching the destination, add the path to the list of valid paths.
Tip 1 : Practice question and try to understand with using javascript
Tip 2 : The Elm Architecture.
Tip 3 : Project matters
Tip 1 : Have web development project
Tip 2 : learn purescript and node.js
3 Graph Questions Were asked of difficulty medium to hard.
Hackathon round which revolved around multithreading
Hoisting in JavaScript is the behavior where variable and function declarations are moved to the top of their containing scope during the compilation phase.
Variable declarations are hoisted to the top of their scope, but not their assignments.
Function declarations are fully hoisted, meaning they can be called before they are declared.
Hoisting can lead to unexpected behavior if not understood properly.
Closures in JavaScript allow functions to access variables from their outer scope even after the outer function has finished executing.
Closures are created when a function is defined within another function and the inner function has access to the outer function's variables.
Closures can be used to create private variables and functions in JavaScript.
Closures can also be used to maintain state in asynchronous operations
I applied via LinkedIn and was interviewed before Feb 2023. There were 2 interview rounds.
- simple basic ios questions
I applied via Campus Placement and was interviewed before Mar 2023. There were 3 interview rounds.
Kadance algorithm and find the middle of the linklist
More on java and Python based coding questions
I applied via Campus Placement and was interviewed in Feb 2024. There were 3 interview rounds.
They have their own coding platform. The questions are basically from tree.
Tree of space question
Leecode medium level question
Leetcode Hard level Question
based on 1 interview
Interview experience
based on 1 review
Rating in categories
Data Scientist
15
salaries
| ₹12 L/yr - ₹35 L/yr |
Customer Success Manager
12
salaries
| ₹10 L/yr - ₹16 L/yr |
Product Manager
10
salaries
| ₹24 L/yr - ₹35 L/yr |
Senior Software Engineer
9
salaries
| ₹25 L/yr - ₹31 L/yr |
Market Research Analyst
9
salaries
| ₹5.4 L/yr - ₹11 L/yr |
MagicPin
Awign Enterprises
Nestaway
Flyhomes