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.
Top trending discussions
posted on 7 Sep 2015
I applied via Referral
The program capitalizes the first letter of each reversed word in a sentence.
Split the sentence into an array of words using space as a delimiter.
Reverse each word in the array and capitalize the first letter.
Join the modified words back into a sentence.
I was interviewed before Mar 2021.
Round duration - 60 Minutes
Round difficulty - Easy
Given a binary tree of integers, return the level order traversal of the binary tree.
The first line contains an integer 'T', representing the number of te...
Return the level order traversal of a binary tree given in level order with null nodes represented by -1.
Create a queue to store nodes for level order traversal
Start with the root node and add it to the queue
While the queue is not empty, dequeue a node, print its value, and enqueue its children
Repeat until all nodes are traversed in level order
Round duration - 45 minutes
Round difficulty - Easy
A deadlock in DBMS occurs when two or more transactions are waiting for each other to release locks, causing them to be stuck indefinitely.
Deadlock is a situation where two or more transactions are unable to proceed because each is waiting for the other to release locks.
To prevent deadlocks, DBMS uses techniques like deadlock detection and prevention algorithms.
Joins in DBMS are used to combine rows from two or more ta...
Round duration - 60 Minutes
Round difficulty - Medium
Design a system for Twitter
Key components: user profiles, tweets, hashtags, timelines
Architecture: microservices, load balancers, databases, caching
Scalability: sharding, replication, CDN
Real-time processing: streaming APIs, push notifications
Round duration - 60 Minutes
Round difficulty - Medium
You are provided with an array of ‘N’ integers and ‘Q’ queries. Each query requires calculating the maximum subarray sum in a specified range of the array.
The first ...
Implement a function to calculate maximum subarray sum queries in a given range of an array.
Iterate through each query and calculate the maximum subarray sum within the specified range using Kadane's algorithm.
Keep track of the maximum sum found so far and update it as needed.
Return the maximum subarray sum for each query in the test case.
Given an integer array arr
of size 'N' containing only 0s, 1s, and 2s, write an algorithm to sort the array.
The first line contains an integer 'T' representing the n...
Sort an integer array containing only 0s, 1s, and 2s in linear time complexity.
Use a single scan over the array to sort it in-place.
Maintain three pointers for 0s, 1s, and 2s and swap elements accordingly.
Example: Input: [0, 2, 1, 2, 0], Output: [0, 0, 1, 2, 2]
Round duration - 20 Minutes
Round difficulty - Medium
Tip 1 : Prepare DS and Algo
Tip 2 : Prepare Dynamic programming
Tip 1 : Good in DS and algo that will be help in the interview that is very neccassry
Tip 2 : Prepare DBMS
posted on 29 Jul 2021
Rotate a matrix by 90 degrees clockwise
Transpose the matrix
Reverse each row of the transposed matrix
Alternatively, swap elements in-place layer by layer
Example: [[1,2],[3,4]] -> [[3,1],[4,2]]
I applied via LinkedIn and was interviewed in Oct 2024. There was 1 interview round.
1st round is coding assessment round based on graph and hashmaps
posted on 24 Aug 2024
5 verbal questions, 2 mid - hard coding on arrays, hashmap and dp
I am a software developer with experience in web development and mobile applications.
Developed a web application using React and Node.js for managing inventory
Created a mobile app using Flutter for tracking daily expenses
Familiar with Agile development practices
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 was interviewed in Oct 2021.
Round duration - 90 minutes
Round difficulty - Hard
They gave around 7 days of time for attending the test.
It had 4 coding questions out of which I solved 2 fully and 2 partially.
Questions were medium-hard and based on DSA.
Given an array 'ARR' of 'N' distinct integers, determine the third largest element in the array.
The first line contains a single integer 'T' representing the numb...
Find the third largest element in an array of distinct integers.
Sort the array in descending order and return the element at index 2.
Handle cases where the array has less than 3 elements separately.
Consider edge cases like negative integers and duplicates.
Implement a wildcard pattern matching algorithm to determine if a given wildcard pattern matches a text string completely.
The wildcard pattern may include the...
Implement a wildcard pattern matching algorithm to determine if a given wildcard pattern matches a text string completely.
Create a recursive function to match the pattern with the text character by character.
Handle cases for '?' and '*' characters in the pattern.
Use dynamic programming to optimize the solution.
Check for edge cases like empty pattern or text.
For a given singly linked list, identify if a loop exists and remove it, adjusting the linked list in place. Return the modified linked list.
A...
Detect and remove loop in a singly linked list with O(n) time complexity and O(1) space complexity.
Use Floyd's Cycle Detection Algorithm to identify the loop in the linked list.
Once the loop is detected, use two pointers to find the start of the loop.
Adjust the pointers to remove the loop and return the modified linked list.
Example: For input 5 2 and elements 1 2 3 4 5, output should be 1 2 3 4 5.
Given two strings STR1
and STR2
, determine the length of their longest common subsequence.
A subsequence is a sequence that can be derived from another sequen...
The task is to find the length of the longest common subsequence between two given strings.
Implement a function to find the longest common subsequence length.
Use dynamic programming to solve the problem efficiently.
Iterate through the strings to find the common subsequence.
Handle edge cases like empty strings or equal strings.
Example: For input 'abcde' and 'ace', the longest common subsequence is 'ace' with a length of
Tip 1 : Practice programming daily
Tip 2 : Don't go after development when you are applying as a fresher, focus on DSA and CP.
Tip 3 : Apply for multiple companies.
Tip 1 : Keep it simple in one page
Tip 2 : Use novoresume.com for nice templates
Tip 3 : Mention your projects and experience clearly.
I was interviewed in Mar 2022.
Round duration - 60 Minutes
Round difficulty - Easy
Formal Introduction.
Asked About Projects.
Difference between SQL and NoSQL. Pros and Cons. Where should we use SQL and NoSQL.
Given a problem, I have to make a SQL Database structure and then interviewer told me to convert it into NoSQL.
asked coding questions
Given a sorted array of distinct integers that has been rotated clockwise by an unknown amount, you need to search for a specified integer in the array. Fo...
Implement a search function to find a specified integer in a rotated sorted array.
Implement a binary search algorithm to find the target integer in the rotated sorted array.
Handle the cases where the target integer may lie in the left or right half of the rotation.
Keep track of the mid element and adjust the search range based on the rotation.
Return the index of the target integer if found, else return -1.
Given a binary tree, compute the zigzag level order traversal of the node values in the tree. The zigzag traversal requires traversing levels from left to right, then ...
Zigzag level order traversal of a binary tree is computed by alternating between left to right and right to left traversal at each level.
Use a queue to perform level order traversal of the binary tree.
Maintain a flag to switch between left to right and right to left traversal at each level.
Store the node values in a list while traversing and alternate the order based on the flag.
Example: For input 1 2 3 4 -1 5 6 -1 7 -...
Tip 1 : Prepare well for subjects
Tip 2 : Prepare for system design
Tip 3 : Practice coding
Tip 1 : Don't lie on resume
Tip 2 : Just write in format that is catchy
based on 1 interview
Interview experience
based on 1 review
Rating in categories
Data Scientist
15
salaries
| ₹0 L/yr - ₹0 L/yr |
Customer Success Manager
11
salaries
| ₹0 L/yr - ₹0 L/yr |
Product Manager
10
salaries
| ₹0 L/yr - ₹0 L/yr |
Market Research Analyst
9
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Software Engineer
9
salaries
| ₹0 L/yr - ₹0 L/yr |
CleverTap
MoEngage
Netcore Cloud Private Limited
Freshworks