Infinite Computer Solutions Senior IOS Developer Interview Questions and Answers

Q1. What is difference between state object and state?
Ans. 
State object is a specific instance of a state, while state is a general concept representing the condition of a system.
• State object is a concrete representation of a state in a program, containing specific values and properties.

• State is an abstract concept that defines the overall condition or status of a system.

• In iOS development, state object could refer to an instance of a class representing the current state of a ...read more
Answered by AI
Add your answer
Q2. Lazy properties
Add your answer

Basic aptitude questions with no negative marking. 20 minutes 30 questions

2 String manipulation questions

Q1. Basic level Swift MCQ Questions
Add your answer

Q1. 30-45 minutes one on one ios interview, Asked memory management, lifecycle, core data questions
Add your answer

Q1. 30 minutes one on one ios interview. asked questions around concurrency, why swift is called POP, In detail rigorous interview.
Add your answer

Q1. 1.What is the difference between atomic and nonatomic properties. 2.How do you handle memory management in Swift. 3.Difference between classes and struct in Swift. 4. What is Factorial Pattern.
Ans. 
1. Atomic properties ensure that the value is always fully retrieved or set, while nonatomic properties do not guarantee this. 2. Memory management in Swift is handled automatically using Automatic Reference Counting (ARC). 3. Classes are reference types, while structs are value types in Swift. 4. Factorial pattern is a design pattern used to calculate the factorial of a number.
• Atomic properties ensure thread safety by...read more
Answered by AI
Add your answer

Q1. What is debouncing technique in swift. what is factorial pattern in swift what is dispatch_wait. Explain bluethooth in iOS. Explain InAppPurchases in iOS.
Ans. 
Debouncing technique in Swift is used to limit the rate at which a function is called, preventing it from being called multiple times in a short period.
• Debouncing involves setting a time threshold and only allowing the function to be called after that threshold has passed without any new calls.

• It is commonly used in scenarios like search bars or buttons to prevent rapid firing of events.

• Example: Implementing a search f...read more
Answered by AI
Add your answer

Complex Question are there like images patter and we have to predict next image

There are two task for coding. both are easy.

Had DSA and aptitude questions

Q1. DSA a questions, Database Questions
Add your answer

Q1. 5 min question and answers about company
Add your answer

Round duration - 75 min
Round difficulty - Medium

This round was MCQ and coding round. 25 MCQs and one coding question were asked. MCQs were based on OS, DBMS, Aptitude and Data Structures.

Q1. 
Minimum Days to Complete Work
You have 'N' tasks to complete. Each task can only be done on one of two specific days provided in two arrays: day1 and day2.
For each task i, day1[i] represents the earliest...read more
Ans. 
Find the minimum number of days required to complete all tasks given specific completion days for each task.
• Sort the tasks based on day1 in ascending order.

• For each task, choose the minimum of day1 and day2 as the completion day.

• Keep track of the maximum completion day for each task.

• The final answer is the maximum completion day of all tasks.
Answered by AI
Add your answer

Round duration - 30 min
Round difficulty - Easy

This was a Data Structural round. Only one coding question was asked by the interviewer. The interviewer was very friendly. This round was very easy.

Q1. 
Bubble Sort Problem Statement
Sort the given unsorted array consisting of N non-negative integers in non-decreasing order using the Bubble Sort algorithm.
Input:
The first line contains an integer 'T' r...read more
Ans. 
Bubble Sort algorithm is used to sort an array of non-negative integers in non-decreasing order.
• Implement the Bubble Sort algorithm to sort the array in place.

• Compare adjacent elements and swap them if they are in the wrong order.

• Repeat this process until the array is sorted.

• Time complexity of Bubble Sort is O(n^2) in the worst case.

• Example: For input [6, 2, 8, 4, 10], the output should be [2, 4, 6, 8, 10].
Answered by AI
Add your answer

Round duration - 75 minutes
Round difficulty - Medium

It was in the evening.
It consisted of 26 questions of easy to hard level.
It consisted of 25 MCQs and only 1 coding problem.

Q1. 
Author and Books Formatting
Given a structured list of books and their authors, format the information as specified.
Input:
The first line of input contains an integer ‘T' representing the number of tes...read more
Ans. 
The task is to format a list of authors and their books in a specific way as per the given input format.
• Parse the input to extract the number of test cases, number of authors, author names, and their respective books.

• Format the output by printing the author names and their books in the specified format.

• Ensure correct sequence and labeling of authors and books as per the example provided.

• Handle multiple test cases and a...read more
Answered by AI
Add your answer

Round duration - 15 minutes
Round difficulty - Medium

It was more of CV based round. A brief discussion on projects was there followed by some questions like why optum.

Q1. 
Delete a Node from a Linked List
You are provided with a linked list of integers. Your task is to implement a function that deletes a node located at a specified position 'POS'.
Input:
The first line co...read more
Ans. 
Implement a function to delete a node from a linked list at a specified position.
• Traverse the linked list to find the node at the specified position.

• Update the pointers of the previous and next nodes to skip the node to be deleted.

• Handle edge cases such as deleting the head or tail of the linked list.

• Ensure to free the memory of the deleted node to avoid memory leaks.
Answered by AI
Add your answer

Round duration - 15 minutes
Round difficulty - Easy

A short round where some basic dbms questions like procedure, cursor were asked. Then some questions on whether I would prefer working alone or in a team. Where I see myself in 5 years.

Q1. 
Graph Coloring Problem
You are given a graph with 'N' vertices numbered from '1' to 'N' and 'M' edges. Your task is to color this graph using two colors, such as blue and red, in a way that no two adjacen...read more
Ans. 
Given a graph with 'N' vertices and 'M' edges, determine if it can be colored using two colors without adjacent vertices sharing the same color.
• Use graph coloring algorithm like BFS or DFS to check if the graph can be colored with two colors without conflicts.

• Check if any adjacent vertices have the same color. If so, it is not possible to color the graph as described.

• If the graph has connected components, color each co...read more
Answered by AI
Add your answer