MANDALI SOFTWARE SOLUTIONS Interview Questions and Answers

Assignment was too easy

Q1. Very basic questions were asked about my work experience.
Add your answer
Q2. Tell me about yourself.
Add your answer
Q3. Tell me about your ID experience in the last organization.
Add your answer
Q4. Why did you leave your last job?
Add your answer

Q1. Waste of time. Poorest Hr interview. Didn't ask anything creative or difficult. Too easy.
Add your answer

Q1. Support Role Questions 1) Like explaining a case which was done in your previous role and experience
Add your answer
Q2. Questions on Javascript
Add your answer

Q1. Technical Interview questions on Javascript, HTML, CSS and behavioural
Add your answer

Q1. Manager Questions based on Position and previous work experience.
Add your answer

Q1. Tell me about youtself?
Add your answer
Q2. What do you know about TDS?
Add your answer
Q3. Situation AP based journal entries
Add your answer
Q4. What is GST on reverse charge?
Add your answer
Q5. What are the documents required to initiate a foreign remittance?
Add your answer
Q6. More situational based AP journal entries.
Add your answer

1 and half hour coding assessment
1 - Hard question (100M)
1 - Medium question (50M)
1 - easy question (20M)

Q1. DSA question based on 2 pointer approach
Add your answer
Q2. One question based on dynamic programming
Add your answer

Q1. Based on kadane's algorithm was a leetcode medium question
Add your answer

Q1. Based on linked list - Reversal of group of k nodes
Ans. 
Reverses groups of k nodes in a linked list
• Iterate through the linked list in groups of k nodes

• Reverse each group of k nodes using a helper function

• Update the pointers to connect the reversed groups back together
Answered by AI
Add your answer

3 coding dsa question
Difficulty is On your luck
My friends got easy level
I got medium level
Some got hard questions as well

Ssh round , quant and logical
Tip: bring your calculator

Q1. Two Puzzle : bulb switching and candle
Add your answer
Q2. Dsa questions such as string reverse, binary search
Add your answer
Q3. Dbms and os core subject questions
Add your answer

Q1. How are you better than others
Add your answer
Q2. Why should we hire you
Add your answer

Mainly data leakage related problems

Q1. Basic Swift and Objective C related questions
Add your answer
Q2. SOLID principle
Add your answer
Q3. Details of SOLID principle with its basic
Add your answer
Q4. How to handle memory leakage
Ans. 
Best practices for handling memory leaks in iOS development
• Use Instruments to identify memory leaks

• Avoid strong reference cycles with weak or unowned references

• Use autorelease pools for temporary objects

• Implement proper memory management with ARC (Automatic Reference Counting)
Answered by AI
Add your answer
Q5. Memory management
Add your answer

Although it was quite challenging.

Complete it without significant difficulty.

Q1. Can you describe the projects you have worked on?
Add your answer
Q2. What is the code for printing prime numbers?
Add your answer

Q1. What motivates you to want to join Ion?
Add your answer
Q2. What makes you a suitable candidate for this position?
Add your answer

Q1. Internal working of hashmap
Ans. 
HashMap is a data structure that stores key-value pairs and uses hashing to efficiently retrieve values based on keys.
• HashMap internally uses an array of linked lists to store key-value pairs.

• When a key-value pair is added, the key is hashed to determine the index in the array where it will be stored.

• If multiple keys hash to the same index, a linked list is used to handle collisions.

• To retrieve a value, the key is hash...read more
Answered by AI
Add your answer
Q2. Find Anagram from string array
Ans. 
Find anagrams from a string array
• Iterate through each string in the array

• Sort the characters of each string to create a key for comparison

• Use a hashmap to group anagrams together

• Return the grouped anagrams as arrays
Answered by AI
Add your answer

Q1. Top view of binary Tree
Ans. 
A top view of a binary tree shows the nodes visible when looking at the tree from the top.
• The top view of a binary tree is the set of nodes visible when looking at the tree from the top.

• Nodes at the same horizontal distance from the root are considered at the same level.

• Use a map to store the horizontal distance of each node and only keep the first node encountered at each horizontal distance.
Answered by AI
Add your answer
Q2. Java based questions
Add your answer

Q1. Hight of binary tree
Ans. 
Height of a binary tree is the maximum number of edges on the longest path from the root node to a leaf node.
• Height of an empty tree is -1

• Height of a tree with only one node is 0

• Height of a binary tree can be calculated recursively by finding the height of left and right subtrees and adding 1 to the maximum of the two heights
Answered by AI
Add your answer
Q2. Garbage Collector
Add your answer

Q1. Library Management System
Add your answer