Upload Button Icon Add office photos
Engaged Employer

i

This company page is being actively managed by Pixis Team. If you also belong to the team, you can get access from here

Pixis Verified Tick

Compare button icon Compare button icon Compare

Filter interviews by

Pixis Software Developer Interview Questions and Answers

Updated 13 Aug 2024

Pixis Software Developer Interview Experiences

1 interview found

Interview experience
3
Average
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
No response

I applied via Referral and was interviewed in Jul 2024. There was 1 interview round.

Round 1 - Technical 

(2 Questions)

  • Q1. Explain call, apply , bind
  • Ans. 

    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.

  • Answered by AI
  • Q2. Explain closures
  • Ans. 

    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.

  • Answered by AI

Interview Preparation Tips

Interview preparation tips for other job seekers - Have depth knowledge

Skills evaluated in this interview

Interview questions from similar companies

I applied via Referral

Interview Preparation Tips

Round: Test
Experience: Questions are asked on basic Programming(sorting ,trees) , networking and some aptitude
Tips: Spending some time on networking for preparation can help to clear the test ( as they are mostly like knowledge checking Questions)
Duration: 45 minutes
Total Questions: 30

Round: Test
Experience: Only 2 Questions time will be sufficient .i was asked to write the pseudo code
1) on Dynamic programming
2) Graphs
Tips: explain your code by writing in your own language at the end of your pseudo code
Duration: 60 minutes
Total Questions: 2

Skills:
College Name: IIT Kanpur

Interview Questionnaire 

3 Questions

  • Q1. N a line where words are separated by spaces, , and capitalize first letter of the reversed word. Other letters of the word should be in small. Input : “how are you?” → Output: “Woh Era ?uoy”
  • Ans. 

    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.

  • Answered by AI
  • Q2. He second question reduced to finding maximum weight matching in a bipartite graph. Not many people would have done this (maybe none)
  • Q3. There are 2 sets of countries. One set will donate clothes (something of this sort) and anotherset will accept clothes. A country can be in only 1 of the sets. The amount of clothes donated is also given. ...

Interview Preparation Tips

Round: Test
Experience: There were about 20 MCQs (30 minutes) to be done after the coding section. MCQs were totally nonsense. Can be done in 10 mins.For coding section 60 mins.  It was hosted on Hackerrank.
Duration: 90 minutes
Total Questions: 2

Round: Technical Interview
Experience: After this, selected candidates were interviewed that consists of 4 rounds and discussion was mostly on your CV and data structure problems.

General Tips: Be honest with your interviewer. If you are not comfortable in 1 topic, tell your interviewer honestly. Do well in other areas. Look for hints from the interviewer if you get stuck. They want to see how you approach a problem.
Skills: Algortihm, Data structure
College Name: IIT DELHI

I was interviewed before Mar 2021.

Round 1 - Coding Test 

(1 Question)

Round duration - 60 Minutes
Round difficulty - Easy

  • Q1. 

    Level Order Traversal Problem Statement

    Given a binary tree of integers, return the level order traversal of the binary tree.

    Input:

    The first line contains an integer 'T', representing the number of te...
  • Ans. 

    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

  • Answered by AI
Round 2 - Coding Test 

(1 Question)

Round duration - 45 minutes
Round difficulty - Easy

  • Q1. What is a deadlock in DBMS, and can you explain the concepts of join and query?
  • Ans. 

    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...

  • Answered by AI
Round 3 - Coding Test 

(1 Question)

Round duration - 60 Minutes
Round difficulty - Medium

  • Q1. Design a system for Twitter, outlining the key components and architecture involved.
  • Ans. 

    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

  • Answered by AI
Round 4 - Coding Test 

(2 Questions)

Round duration - 60 Minutes
Round difficulty - Medium

  • Q1. 

    Maximum Subarray Sum Queries

    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.

    Input:

    The first ...
  • Ans. 

    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.

  • Answered by AI
  • Q2. 

    Sort 0 1 2 Problem Statement

    Given an integer array arr of size 'N' containing only 0s, 1s, and 2s, write an algorithm to sort the array.

    Input:

    The first line contains an integer 'T' representing the n...
  • Ans. 

    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]

  • Answered by AI
Round 5 - Coding Test 

Round duration - 20 Minutes
Round difficulty - Medium

Interview Preparation Tips

Professional and academic backgroundI applied for the job as SDE - 1 in ChennaiEligibility criteria7 CGPAFreshworks interview preparation:Topics to prepare for the interview - Algorithms, Data Structures, Dynamic Programming, OOPS, System DesignTime required to prepare for the interview - 2.5 MonthsInterview preparation tips for other job seekers

Tip 1 : Prepare DS and Algo
Tip 2 : Prepare Dynamic programming 

Application resume tips for other job seekers

Tip 1 : Good in DS and algo that will be help in the interview that is very neccassry
Tip 2 : Prepare DBMS

Final outcome of the interviewSelected

Skills evaluated in this interview

Interview Questionnaire 

2 Questions

  • Q1. Rotate matrix by 90 degrees
  • Ans. 

    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]]

  • Answered by AI
  • Q2. Questions on core java, collections framework

Skills evaluated in this interview

Interview experience
5
Excellent
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
-

I applied via LinkedIn and was interviewed in Oct 2024. There was 1 interview round.

Round 1 - Coding Test 

1st round is coding assessment round based on graph and hashmaps

Interview experience
5
Excellent
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Coding Test 

5 verbal questions, 2 mid - hard coding on arrays, hashmap and dp

Round 2 - One-on-one 

(2 Questions)

  • Q1. Introduce yourself and projects
  • Ans. 

    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

  • Answered by AI
  • Q2. Basic questions on coding define different DS and Difference btw them
Interview experience
4
Good
Difficulty level
-
Process Duration
-
Result
Selected Selected
Round 1 - Technical 

(2 Questions)

  • Q1. Explain hoisting in js
  • Ans. 

    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.

  • Answered by AI
  • Q2. Explain closures in js
  • Ans. 

    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

  • Answered by AI
Round 2 - Technical 

(1 Question)

  • Q1. Javascript polyfills

Skills evaluated in this interview

I was interviewed in Oct 2021.

Round 1 - Coding Test 

(4 Questions)

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.

  • Q1. 

    Find the Third Greatest Element

    Given an array 'ARR' of 'N' distinct integers, determine the third largest element in the array.

    Input:

    The first line contains a single integer 'T' representing the numb...
  • Ans. 

    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.

  • Answered by AI
  • Q2. 

    Wildcard Pattern Matching Problem Statement

    Implement a wildcard pattern matching algorithm to determine if a given wildcard pattern matches a text string completely.

    The wildcard pattern may include the...

  • Ans. 

    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.

  • Answered by AI
  • Q3. 

    Detect and Remove Loop in Linked List

    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.

    Expected Complexity:

    A...

  • Ans. 

    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.

  • Answered by AI
  • Q4. 

    Longest Common Subsequence Problem Statement

    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...

  • Ans. 

    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

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI applied for the job as Software Developer in BangaloreEligibility criteriaNo criteriaFreshworks interview preparation:Topics to prepare for the interview - Java, Data Structures, Algorithms, OOPS, DBMS, OSTime required to prepare for the interview - 8 monthsInterview preparation tips for other job seekers

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.

Application resume tips for other job seekers

Tip 1 : Keep it simple in one page
Tip 2 : Use novoresume.com for nice templates
Tip 3 : Mention your projects and experience clearly.

Final outcome of the interviewSelected

Skills evaluated in this interview

I was interviewed in Mar 2022.

Round 1 - Video Call 

(2 Questions)

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

  • Q1. 

    Search In Rotated Sorted Array Problem Statement

    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...

  • Ans. 

    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.

  • Answered by AI
  • Q2. 

    Zigzag Binary Tree Traversal Problem

    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 ...

  • Ans. 

    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 -...

  • Answered by AI

Interview Preparation Tips

Eligibility criterianaPark+ interview preparation:Topics to prepare for the interview - OOPS, System Design, Algorithms, Dynamic ProgrammingTime required to prepare for the interview - 5 MonthInterview preparation tips for other job seekers

Tip 1 : Prepare well for subjects
Tip 2 : Prepare for system design
Tip 3 : Practice coding

Application resume tips for other job seekers

Tip 1 : Don't lie on resume
Tip 2 : Just write in format that is catchy

Final outcome of the interviewRejected

Skills evaluated in this interview

Pixis Interview FAQs

How many rounds are there in Pixis Software Developer interview?
Pixis interview process usually has 1 rounds. The most common rounds in the Pixis interview process are Technical.
What are the top questions asked in Pixis Software Developer interview?

Some of the top questions asked at the Pixis Software Developer interview -

  1. Explain call, apply , b...read more
  2. Explain closu...read more

Tell us how to improve this page.

Pixis Software Developer Interview Process

based on 1 interview

Interview experience

3
  
Average
View more
Pixis Software Developer Salary
based on 4 salaries
₹8 L/yr - ₹13.8 L/yr
55% more than the average Software Developer Salary in India
View more details

Pixis Software Developer Reviews and Ratings

based on 1 review

5.0/5

Rating in categories

5.0

Skill development

5.0

Work-life balance

5.0

Salary

5.0

Job security

5.0

Company culture

5.0

Promotions

5.0

Work satisfaction

Explore 1 Review and Rating
Data Scientist
15 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Customer Success Manager
11 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Product Manager
10 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Market Research Analyst
9 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Senior Software Engineer
9 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Explore more salaries
Compare Pixis with

CleverTap

3.6
Compare

MoEngage

4.0
Compare

Netcore Cloud Private Limited

4.2
Compare

Freshworks

3.5
Compare
Did you find this page helpful?
Yes No
write
Share an Interview