Upload Button Icon Add office photos

Filter interviews by

Parity Cube Interview Questions and Answers

Updated 7 Nov 2024

Parity Cube Interview Experiences

Popular Designations

2 interviews found

Interview experience
4
Good
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Selected Selected

I applied via LinkedIn and was interviewed in Sep 2024. There were 3 interview rounds.

Round 1 - HR 

(2 Questions)

  • Q1. Tell us About yourself
  • Q2. What About your last job ?
Round 2 - Assignment 

Technical SEO & basic SEO related assignment solving

Round 3 - One-on-one 

(2 Questions)

  • Q1. Technical SEO questions
  • Q2. Live project experience with case study
Interview experience
5
Excellent
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Selected Selected

I applied via Naukri.com and was interviewed before Nov 2023. There were 2 interview rounds.

Round 1 - Technical 

(2 Questions)

  • Q1. Difference between associations
  • Ans. 

    Associations in software engineering refer to the relationships between classes or objects in a system.

    • Associations define how classes or objects are connected to each other.

    • There are different types of associations like one-to-one, one-to-many, and many-to-many.

    • Examples include a student being associated with a school, a car being associated with a manufacturer, etc.

  • Answered by AI
  • Q2. One coding question of ruby on rails
Round 2 - Assignment 

Given an ruby code assignment.

Interview Preparation Tips

Interview preparation tips for other job seekers - Keep strong on basics.

Software Engineer Interview Questions asked at other Companies

Q1. Bridge and torch problem : Four people come to a river in the night. There is a narrow bridge, but it can only hold two people at a time. They have one torch and, because it's night, the torch has to be used when crossing the bridge. Person... read more
View answer (199)

Interview questions from similar companies

Interview Preparation Tips

Round: Test
Experience: First round was a simple round which involved 10 multiple choice questions and 3 coding questions on hackerrank platform.

Round: Technical Interview
Experience: Mainly on topics like networks, data structures and algorithms, operating systems. The interviewers looked for people who have had prior experience in web development and asked questions regarding web development in depth too.
Tips: I recommend everyone to read the book titled, 'Cracking the Coding Interview' as it was helpful in my approach to an interview.

General Tips: The one major thing that would give you the edge in joining Myntra would definitely be exposure to web development. Since it is not a part of the curriculum , it's all the more important for you to familiarize yourself with web development. In fact, a few projects in the same field would put you in a very advantageous position to get the job.
Skill Tips: 1. Start your placement preparations well ahead, no point regretting later.
2. Keep a concise resume. Do not take your resume to several pages.
3. Do not neglect aptitude preparation. Many people do this mistake and end up not clearing the first round for several companies.
4. Be thorough with your basics across all subjects. (Do not neglect any subject, even they you may like a few and dislike the others.)
5. Keep in mind, the interviewers are really friendly and try to make sure that you're not nervous during the interview. All they want to do is to test you. Be confident and give it your best shot.
Skills:
College Name: NIT Surathkal

Interview Questionnaire 

10 Questions

  • Q1. What do you do when your schedule is interrupted? How you handle it?
  • Q2. PreOrder traversal without recursion?
  • Ans. 

    PreOrder traversal without recursion is done using a stack to simulate the function call stack.

    • Create an empty stack and push the root node onto it.

    • While the stack is not empty, pop a node from the stack and process it.

    • Push the right child of the popped node onto the stack if it exists.

    • Push the left child of the popped node onto the stack if it exists.

  • Answered by AI
  • Q3. Build a bst out of the unsorted array by looping over the array and inserting each element to the tree?
  • Ans. 

    Yes

    • Create an empty binary search tree (BST)

    • Loop over the unsorted array

    • For each element, insert it into the BST using the appropriate insertion logic

    • Repeat until all elements are inserted

    • The resulting BST will be built from the unsorted array

  • Answered by AI
  • Q4. Find 2 elements in array whose sum is equal to given number?
  • Ans. 

    The question asks to find two elements in an array whose sum is equal to a given number.

    • Iterate through the array and for each element, check if the difference between the given number and the current element exists in the array.

    • Use a hash set to store the elements as you iterate through the array for efficient lookup.

    • Return the pair of elements if found, otherwise return a message indicating no such pair exists.

  • Answered by AI
  • Q5. How many types of trigger?
  • Ans. 

    There are two types of triggers: DML triggers and DDL triggers.

    • DML triggers are fired in response to DML (Data Manipulation Language) statements like INSERT, UPDATE, DELETE.

    • DDL triggers are fired in response to DDL (Data Definition Language) statements like CREATE, ALTER, DROP.

    • Examples: A DML trigger can be used to log changes made to a table, while a DDL trigger can be used to enforce certain rules when a table is alt

  • Answered by AI
  • Q6. Can trigger be used with select statement?
  • Ans. 

    Yes, triggers can be used with select statements in SQL.

    • Triggers are database objects that are automatically executed in response to certain events, such as insert, update, or delete operations.

    • While triggers are commonly used with insert, update, and delete statements, they can also be used with select statements.

    • Using triggers with select statements allows you to perform additional actions or validations before or af...

  • Answered by AI
  • Q7. Indexing in mysql? How many types of indexing in mysql?
  • Ans. 

    Indexing in MySQL improves query performance. There are several types of indexing in MySQL.

    • Indexes are used to quickly locate data without scanning the entire table.

    • Types of indexing in MySQL include B-tree, hash, full-text, and spatial indexes.

    • B-tree indexes are the most common and suitable for most use cases.

    • Hash indexes are used for exact match lookups.

    • Full-text indexes are used for searching text-based data efficie...

  • Answered by AI
  • Q8. Engines in mysql?
  • Ans. 

    Engines in MySQL are the underlying software components that handle storage, indexing, and querying of data.

    • MySQL supports multiple storage engines, each with its own strengths and features.

    • Some commonly used engines in MySQL are InnoDB, MyISAM, and Memory.

    • InnoDB is the default engine in MySQL and provides support for transactions and foreign keys.

    • MyISAM is known for its simplicity and speed but lacks transaction suppo...

  • Answered by AI
  • Q9. Singlton pattern?
  • Q10. Can a constructor be private?
  • Ans. 

    Yes, a constructor can be private.

    • A private constructor can only be accessed within the class itself.

    • It is often used in singleton design pattern to restrict object creation.

    • Private constructors are also useful for utility classes that only contain static methods.

  • Answered by AI

Interview Preparation Tips

Skills: Algorithm, Data structure
College Name: na

Skills evaluated in this interview

I applied via Referral and was interviewed in Feb 2021. There were 4 interview rounds.

Interview Questionnaire 

2 Questions

  • Q1. Technical Questions (SQL and Python)
  • Q2. Business case studies

Interview Preparation Tips

Interview preparation tips for other job seekers - Brush up SQL skills, learn different methods of solving the same problem, learn basics of python, especially Pandas and Numpy

I applied via Referral and was interviewed before May 2021. There was 1 interview round.

Round 1 - One-on-one 

(2 Questions)

  • Q1. It is relevant to area where you are expertises and for position you applied for
  • Q2. Relevant to position

Interview Preparation Tips

Interview preparation tips for other job seekers - Really good company and can enjoy myntra benefits a lot .

I applied via Naukri.com and was interviewed before Aug 2020. There was 1 interview round.

Interview Questionnaire 

2 Questions

  • Q1. Tell about yourself
  • Q2. What is your salary expectation

Interview Preparation Tips

Interview preparation tips for other job seekers - Interview wa easy and can crack it

I applied via Recruitment Consultant and was interviewed in Nov 2020. There were 3 interview rounds.

Interview Questionnaire 

1 Question

  • Q1. Tell me about your Journey
  • Ans. Share your schooling to present job summary, then share role and responsibilities. Achievement and share you are best in what
  • Answered by Jyotirmay Halder

Interview Preparation Tips

Interview preparation tips for other job seekers - Be honest and don't give Bluff. If you don't know say I don't have idea about that particular job or duty.

Interview Preparation Tips

Round: Round 1:
Experience: It was 5 question screening round which was meant to know about my expectations from the organization.

Round: Round 2:
Experience: Online Coding round on Hackerrank3 coding coding questions:
– Run length Encoding of string with slight modification
– Finding buying day and selling day for a given set of days such that the profit of the buyer is maximum .
– Given a set of keywords and a long string, break the long string such that the split words are from the keywords onlyQuestions were fairly simple but test cases were very nice.

Round: Round 3:
Experience: 1st InterviewThe interview went for about 1 hr and was completely technical. The questions asked were:
– Given a binary tree how would you identify whether it is a Binary Search tree or not?
I gave the answer using inorder traversal.– given a bst, convert it to a binary tree such that each element is replaced by the sum of all the elements greater than it?– Given an employee table with employee name and salary find the 2nd highest salary.
I gave the vague answer of using inner query then he asked if instead of 2nd its nth highest then what would I do. After sometime I asked for the keyword (which was LIMIT) and then I wrote the query which was almost syntactically correct.– The answer to the question of binary tree, he asked me if I could solve it without using any space (my previous solution took O(n) space)?
I was writing the solution and in between he said to stop and asked me if I have any question.

Round: Round 4: Java application development
Experience: Imagine we have an Email Queue table in our database with each row representing an email that needs sending. Table Name: EmailQueue Columns: id, from_email_address, to_email_address, subject, body (you can also add columns as you wish, but at minimum it should have these columns). Write a java program that will read from this table and send the emails over an SMTP server (not local unix mail). For the SMTP sending you can use a pre-existing library of your choice, if you wish. Please take into consideration the following:Speed is of the utmost concern. Imagine we have 1 million emails to send. Your code should not sequentially send one email after another.Your solution should scale. In other words, if we determine the fastest we can send emails from a single server is 300 emails/second I should be able to run the same Java program on another server and be able to send another 300 emails/second.Your code should be careful to ensure that it is not possible for the same email to be sent twice (especially when running multiple processes of the program).Don’t worry about whether the SMTP server can handle the load. It can.Order emails are sent is not necessarily important. In other words, even though I’m calling this a “queue” it’s not important to guarantee that emails are sent in the order they arequeued.Comment your code extensively.Once again, speed is the primary concern. So do remember to think about what the slow points in the email sending process could be and take efforts to minimize those pain points.Send me instructions on how to compile/run/test your code along with the code itself. Also the sql statements for me to create the table that you are working with and the sql statements to insert a few test emails.

Round: Round 5: Final interview
Experience: It was of about 1 hr on soft and technical skills. Questions asked include:– Tell be about yourself?
– given an array. find the pattern it follows? there can be 4 patterns only: increasing, decreasing, increase then decrease and decrease then increase.
– Given an array of distinct positive numbers find the maximum sum of elements such that no 2 elements occurring in the maximum sum set is adjacent to each other.
I gave an incorrect answer and then I realised it, so I asked to rectify and she allowed me to do so.
– How can you improve suggestions of coupons to the users?
This discussion went for about 20 mins.

College Name: NA

Interview Questionnaire 

8 Questions

  • Q1. Given a binary tree how would you identify whether it is a Binary Search tree or not?
  • Ans. 

    To identify whether a binary tree is a Binary Search Tree or not.

    • Check if the left subtree is a Binary Search Tree

    • Check if the right subtree is a Binary Search Tree

    • Check if the root node is greater than all the nodes in the left subtree

    • Check if the root node is less than all the nodes in the right subtree

  • Answered by AI
  • Q2. Solve it without using array (in case the solution is - Inorder traversal should be in sorted order)?
  • Ans. 

    Solution for inorder traversal in sorted order without using array

    • Implement a binary search tree and perform inorder traversal

    • Use a stack to simulate the recursive function call stack

    • Maintain a variable to keep track of the previously visited node

    • Compare the current node with the previously visited node to check if it is in sorted order

  • Answered by AI
  • Q3. Given a BST, convert it to a binary tree such that each element is replaced by the sum of all the elements greater than it?
  • Ans. 

    Convert a BST to a binary tree with each element replaced by sum of all greater elements.

    • Traverse the BST in reverse inorder and keep track of the sum of all greater elements.

    • Replace each node's value with the sum and update the sum.

    • Recursively perform the above steps on left and right subtrees.

    • Time complexity: O(n), Space complexity: O(h) where h is the height of the tree.

  • Answered by AI
  • Q4. Given an employee table with employee name and salary find the 2nd highest salary in sql?
  • Ans. 

    Find the 2nd highest salary from an employee table in SQL.

    • Use the SELECT statement to retrieve the salaries in descending order.

    • Use the LIMIT keyword to limit the result set to the second row.

    • Use a subquery to exclude the highest salary from the result set.

  • Answered by AI
  • Q5. Tell be about yourself?
  • Ans. 

    I am a software engineer with experience in developing web applications and a passion for problem-solving.

    • Experienced in developing web applications using languages such as Java, Python, and JavaScript

    • Proficient in using frameworks such as Spring, Django, and React

    • Strong problem-solving skills and ability to work in a team environment

    • Passionate about learning new technologies and keeping up with industry trends

  • Answered by AI
  • Q6. Given an array. find the pattern it follows? there can be 4 patterns only: increasing, decreasing, increase then decrease and decrease then increase
  • Ans. 

    Given an array, determine if it follows one of four patterns: increasing, decreasing, increase then decrease, or decrease then increase.

    • Iterate through the array and compare each element to the previous one.

    • If all elements are increasing, it follows the increasing pattern.

    • If all elements are decreasing, it follows the decreasing pattern.

    • If there is a point where the elements start decreasing after increasing, it follow...

  • Answered by AI
  • Q7. Given an array of distinct positive numbers find the maximum sum of elements such that no 2 elements occurring in the maximum sum set is adjacent to each other
  • Ans. 

    Given an array of distinct positive numbers, find the maximum sum of non-adjacent elements.

    • Use dynamic programming to keep track of the maximum sum at each index

    • At each index, choose between including the current element or skipping it

    • The maximum sum at index i is the maximum of the sum including i-2 and i or the sum excluding i

    • Return the maximum sum at the last index

  • Answered by AI
  • Q8. How can you improve suggestions of coupons to the users?
  • Ans. 

    Use machine learning algorithms to analyze user behavior and preferences to suggest personalized coupons.

    • Collect user data such as purchase history, search history, and demographics

    • Use machine learning algorithms to analyze the data and identify patterns

    • Create personalized coupon suggestions based on the identified patterns

    • Regularly update and refine the algorithm to improve accuracy

    • Allow users to provide feedback on t

  • Answered by AI

Interview Preparation Tips

Round: Resume Shortlist
Tips: - Keep your resume as compact as possible- Try to keep requirements of the profile in your resume- Survey on how much the company is paying in the market and then state your expected CTC in the range of +/- 2 LPA.

Round: Test
Experience: 2 questions were a bit easy and the 3rd one was a little tricky for the people who are afraid of recursive programming. All the questions are provided in the link here: -----/
Tips: - Programming experience or programmer's help ( :p ) was the only way out of it.- Try to solve problems which you can solve first rather than hanging on any tough problem, because people solving 2/3 questions were also selected for the next round.
Duration: 90 minutes
Total Questions: 3

Round: Technical Interview
Experience: The interviewer was very helpful in guiding, motivating and giving me time to solve the problems. It went quite smoothly and within days I was selected for the next interview.
Tips: - Never speak without thinking unless said to speak what you are thinking.- Try to clarify your doubts before you jump into solving questions asked.- If you are taking any assumption, forget not to notify it to the interviewer.

Round: App development
Experience: I was made to develop a Java application within a week and submit it with proper documentation. It was very interesting app and I learned tons of things while developing.
Tips: - Try to do your task by yourself.- Keep your code as clean and OOP-like as possible- Make your friend read your documentation you prepared to know if it is understandable.- Use git or any other VCS while developing to ensure fallback in case the application breaks down (which usually happens during development).

Round: Technical Interview
Experience: This was exactly like a last gateway to cross for entering into the company. The interviewer was modest and calm, watching all my steps that I take while solving the problem. Twisting problems and guiding me to unwind the twists. At the end...a great experience!
Tips: Same as the above interview tips, nothing much is required for any technical interview (if you ask me).

Skills: Programming, Java application development, Learning/Grabbing new skills, SQL knowledge
College Name: NIT DURGAPUR
Motivation: Few points that motivated me: - Web development related work which is my area of interest.
- Company was a startup so a lot of work => lot of learning (crucial for starting career).- Pay was decent, so I can sustain my living and save something.
Funny Moments: It was my last interview and while I was solving a problem I wrote something wrong, and by mistake " f**k " came out of my mouth. The interviewer was on the phone and for some time I was just wondering if she heard that word, whether it would affect my interview result and all sort of things, rather than about the problem.
A suggestion: Please mind what comes out of your mouth ;)

Skills evaluated in this interview

Parity Cube Interview FAQs

How many rounds are there in Parity Cube interview?
Parity Cube interview process usually has 2-3 rounds. The most common rounds in the Parity Cube interview process are Assignment, HR and One-on-one Round.
How to prepare for Parity Cube interview?
Go through your CV in detail and study all the technologies mentioned in your CV. Prepare at least two technologies or languages in depth if you are appearing for a technical interview at Parity Cube. The most common topics and skills that interviewers at Parity Cube expect are Javascript, SQL, HTML, CSS and JQuery.
What are the top questions asked in Parity Cube interview?

Some of the top questions asked at the Parity Cube interview -

  1. Difference between associati...read more
  2. One coding question of ruby on ra...read more
  3. Technical SEO questi...read more

Tell us how to improve this page.

Parity Cube Interview Process

based on 3 interviews

Interview experience

4.7
  
Excellent
View more

Interview Questions from Similar Companies

Amazon Interview Questions
4.1
 • 5.1k Interviews
Flipkart Interview Questions
4.0
 • 1.4k Interviews
Myntra Interview Questions
4.0
 • 216 Interviews
Webdew Interview Questions
4.5
 • 106 Interviews
HyScaler Interview Questions
4.5
 • 90 Interviews
Cashkaro.com Interview Questions
3.7
 • 11 Interviews
CouponDunia Interview Questions
3.8
 • 5 Interviews
GrabOn Interview Questions
4.3
 • 1 Interview
Voonik Interview Questions
2.1
 • 1 Interview
View all

Parity Cube Reviews and Ratings

based on 37 reviews

4.5/5

Rating in categories

4.4

Skill development

4.6

Work-life balance

4.1

Salary

4.5

Job security

4.7

Company culture

3.9

Promotions

4.4

Work satisfaction

Explore 37 Reviews and Ratings
Associate Product Manager
9 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

UI Developer
7 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Content Writer
6 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Senior HR Executive
5 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Business Intelligence Engineer
4 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Explore more salaries
Compare Parity Cube with

Cashkaro.com

3.7
Compare

CouponDunia

3.8
Compare

GrabOn

4.3
Compare

MySmartPrice

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