Artoon Solutions IOS Developer Interview Questions and Answers

One hour aptitude test, after clearing that, some basic coding questions were unlocked.

This one was face to face. Basically, the approach to the question was seeked by the HRs rather than the correct answer only.

Q1. This included two rounds, one with HR and one with CEO. Questions were based on real life logics and basic mathematics
Add your answer
Q2. Based on real life and quants with some HR Questions.
Add your answer
Q3. Like: What salary do you expect
Ans. 
I expect a competitive salary based on my skills, experience, and the market rate for software developers.
• Research the average salary range for software developers in your location and industry.

• Consider your level of experience, education, and any specialized skills you possess.

• Factor in the company's size, reputation, and financial stability.

• Be prepared to negotiate and discuss benefits and perks in addition to salary...read more
Answered by AI
Add your answer

Mcq + dsa JavaScript questions

Q1. JavaScript advance topics and database design topics
Add your answer

Q1. Situation based question and behavioural questions
Add your answer

Round duration - 150 Minutes
Round difficulty - Medium

3 coding question + 50 dsa

Q1. 
Majority Element Problem Statement
Given an array/list 'ARR' consisting of 'N' integers, your task is to find the majority element in the array. If there is no majority element present, return -1.
Exampl...read more
Ans. 
Find the majority element in an array, return -1 if no majority element exists.
• Iterate through the array and keep track of the count of each element using a hashmap.

• Check if any element's count is greater than floor(N/2) to determine the majority element.

• Return the majority element or -1 if no majority element exists.
Answered by AI
Add your answer
Q2. 
Height of a Binary Tree
You are provided with an arbitrary binary tree consisting of 'N' nodes where each node is associated with a certain value. The task is to determine the height of the tree.
Explana...read more
Ans. 
Calculate the height of a binary tree given its level order traversal.
• Traverse the binary tree level by level and keep track of the height as you go down the tree.

• Use a queue data structure to perform level order traversal efficiently.

• The height of a binary tree is the maximum number of edges from the root to any leaf node.

• Handle NULL nodes represented by -1 in the input.

• Return the height of the binary tree as a single
Answered by AI
Add your answer
Q3. 
Number of Islands Problem Statement
You are provided with a 2-dimensional matrix having N rows and M columns, containing only 1s (land) and 0s (water). Your goal is to determine the number of islands in t...read more
Ans. 
Count the number of islands in a 2D matrix of 1s and 0s.
• Use Depth First Search (DFS) or Breadth First Search (BFS) to traverse the matrix and count the number of connected components.

• Maintain a visited array to keep track of visited cells to avoid counting the same island multiple times.

• Iterate through each cell in the matrix and if it is a land (1) and not visited, perform DFS/BFS to explore the connected land cells.

• I...read more
Answered by AI
Add your answer

Round duration - 60 Minutes
Round difficulty - Hard

2 coding questions

Q1. 
Maximum Length Pair Chain Problem Statement
You are given 'N' pairs of integers where the first number is always smaller than the second number, i.e., in pair (a, b) -> a < b always. A pair chain is...read more
Ans. 
Find the length of the longest pair chain that can be formed using the given pairs.
• Sort the pairs based on the second element in ascending order.

• Iterate through the sorted pairs and keep track of the maximum chain length.

• Update the chain length if the current pair can be added to the chain.

• Return the maximum chain length at the end.
Answered by AI
Add your answer
Q2. 
Maximize Stock Trading Profit
You are given an array prices, representing stock prices over N consecutive days. Your goal is to compute the maximum profit achievable by performing multiple transactions (i...read more
Ans. 
Find maximum profit by buying and selling stocks multiple times.
• Iterate through the array and find all increasing sequences of stock prices.

• Calculate profit by buying at the start and selling at the end of each increasing sequence.

• Sum up all profits to get the maximum profit achievable.
Answered by AI
Add your answer

Round duration - 45 minutes
Round difficulty - Medium

Data structures,java script,web dev related questions,dbms questions

Q1. Can you describe how to design a web crawler?
Ans. 
Designing a web crawler involves defining the scope, selecting a crawling strategy, implementing the crawler, handling data storage, and ensuring politeness.
• Define the scope of the web crawler by determining the websites to crawl and the depth of the crawl.

• Select a crawling strategy such as breadth-first or depth-first search based on the requirements.

• Implement the web crawler using a programming language like Python o...read more
Answered by AI
Add your answer

They would ask searching sorting , binary search in first round

Q1. Most of question were from Tree and DP
Add your answer
Q2. Delete a node from a binary tree.
Ans. 
Delete a node from a binary tree.
• Find the node to be deleted

• If the node has no children, simply delete it

• If the node has one child, replace it with its child

• If the node has two children, find the minimum value in its right subtree, replace the node with that value, and delete the minimum value node
Answered by AI
Add your answer

Duration 1 hour
Data structure and algorithms

Duration 1.5 hour
Data structure and algorithms

Q1. Given a value find next sibling on right side of it without using global/heap variables
Ans. 
Use a binary tree traversal algorithm to find the next sibling on the right side of a given value.
• Implement an in-order traversal algorithm to traverse the binary tree

• Keep track of the parent node and the direction of traversal to find the next sibling on the right side

• If the given value is the right child of its parent, move up the tree until finding a node that is the left child of its parent
Answered by AI
Add your answer

Questions related to input and output.

Subjective Round:4 questions related to coding.

Q1. 3 Interview round and finally HR round
Add your answer