Upload Button Icon Add office photos

Filter interviews by

KEKA TECHNOLOGIES IOS Developer Interview Questions and Answers

Updated 19 Oct 2024

KEKA TECHNOLOGIES IOS Developer Interview Experiences

3 interviews found

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

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

Round 1 - Coding Test 

They ask some simple questions about swift , then give a problem to solve

IOS Developer Interview Questions & Answers

user image Anonymous

posted on 19 Oct 2024

Interview experience
4
Good
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Technical 

(1 Question)

  • Q1. Basics of swift

IOS Developer Interview Questions Asked at Other Companies

Q1. 1 - MVC PATTERN 2- CLOUSERS & it's type 3- Google SDK like Go ... read more
asked in Movius Corp
Q2. What will be the output of the following Swift code: \n\nstruct s ... read more
asked in Capgemini
Q3. What’s difference between class and structure
asked in Movius Corp
Q4. What is the difference between the Liskov Substitution Principle ... read more
asked in Movius Corp
Q5. What is the time complexity for finding the longest common prefix ... read more

IOS Developer Interview Questions & Answers

user image Anonymous

posted on 31 Oct 2023

Interview experience
3
Average
Difficulty level
Easy
Process Duration
Less than 2 weeks
Result
Selected Selected

I applied via LinkedIn and was interviewed in May 2023. There were 4 interview rounds.

Round 1 - Resume Shortlist 
Pro Tip by AmbitionBox:
Keep your resume crisp and to the point. A recruiter looks at your resume for an average of 6 seconds, make sure to leave the best impression.
View all tips
Round 2 - Technical 

(1 Question)

  • Q1. Just normal Swift question
Round 3 - Technical 

(1 Question)

  • Q1. Same thing, but kept asking the estimated timelines
Round 4 - HR 

(1 Question)

  • Q1. Just background checks

Interview questions from similar companies

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

It’s an average test experience

Round 2 - Coding Test 

Best questions with tricky one

Round 3 - HR 

(1 Question)

  • Q1. Salary expectations
Interview experience
5
Excellent
Difficulty level
Easy
Process Duration
Less than 2 weeks
Result
Selected Selected

I applied via Company Website and was interviewed before Jul 2023. There was 1 interview round.

Round 1 - One-on-one 

(3 Questions)

  • Q1. What is useState?
  • Ans. 

    useState is a hook in React that allows functional components to have state.

    • useState is a React hook used in functional components to manage state.

    • It returns an array with the current state value and a function to update that value.

    • Example: const [count, setCount] = useState(0);

  • Answered by AI
  • Q2. What's useEffect?
  • Ans. 

    useEffect is a hook in React that allows performing side effects in function components.

    • Used in React functional components to perform side effects

    • Executes after render and after every update

    • Can be used to fetch data, subscribe to events, update the DOM, etc.

  • Answered by AI
  • Q3. What is Redux and state management?
  • Ans. 

    Redux is a predictable state container for JavaScript apps. It helps manage the state of an application in a centralized way.

    • Redux is a state management library commonly used with React.

    • It allows for a single source of truth for the state of an application.

    • Actions are dispatched to update the state, and reducers specify how the state changes in response to actions.

    • Redux DevTools can be used to track state changes and d...

  • Answered by AI

Skills evaluated in this interview

Interview experience
1
Bad
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Technical 

(2 Questions)

  • Q1. Tell Me about yourself
  • Q2. What is C# and coding.
Round 2 - HR 

(1 Question)

  • Q1. What is your CCTC?

Interview Preparation Tips

Interview preparation tips for other job seekers - Consider this company your last choice.
Interview experience
4
Good
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Not Selected

I applied via Job Fair and was interviewed in Oct 2024. There were 2 interview rounds.

Round 1 - Coding Test 

It was an online test for interview

Round 2 - Technical 

(2 Questions)

  • Q1. Tell me about dijistkras algorithm
  • Ans. 

    Dijkstra's algorithm is a graph search algorithm that finds the shortest path between nodes in a graph.

    • Dijkstra's algorithm uses a priority queue to select the node with the smallest distance from the start node.

    • It maintains a list of tentative distances to each node and updates them as it explores the graph.

    • The algorithm is commonly used in routing and network protocols to find the shortest path between nodes.

    • Example:...

  • Answered by AI
  • Q2. Tell me about your projects

Skills evaluated in this interview

I was interviewed in Oct 2021.

Round 1 - Coding Test 

(3 Questions)

Round duration - 105 minutes
Round difficulty - Medium

There were 3 problems .
One was easy but the other two were of medium level.

  • Q1. 

    Aggressive Cows Problem Statement

    Given an array representing positions of stalls and an integer ‘K’ representing the number of aggressive cows, determine the largest minimum distance between any two cows ...

  • Ans. 

    The problem requires assigning aggressive cows to stalls in a way that maximizes the minimum distance between any two cows.

    • Sort the array of stall positions in ascending order.

    • Use binary search to find the largest minimum distance between cows.

    • Check if it is possible to assign cows with this minimum distance by iterating through the sorted array.

    • If it is possible, update the maximum distance and continue binary search ...

  • Answered by AI
  • Q2. 

    Shortest Path in an Unweighted Graph

    The city of Ninjaland is represented as an unweighted graph with houses and roads. There are 'N' houses numbered 1 to 'N', connected by 'M' bidirectional roads. A road...

  • Ans. 

    The problem is to find the shortest path between two houses in an unweighted graph.

    • The graph represents the city of Ninjaland with houses connected by roads.

    • The input consists of the number of test cases, number of houses and roads, starting and ending house, and the roads between houses.

    • The output is a vector of nodes representing the shortest path from the starting house to the ending house.

    • If there are multiple shor...

  • Answered by AI
  • Q3. 

    Count Set Bits Problem Statement

    Given a positive integer N, compute the total number of '1's in the binary representation of all numbers from 1 to N. Return this count modulo 1e9+7 because the result can...

  • Ans. 

    The task is to count the total number of '1' in the binary representation of all numbers from 1 to N.

    • Convert each number from 1 to N into its binary representation

    • Count the number of '1' bits in each binary representation

    • Sum up the counts of '1' bits for all numbers

    • Return the sum modulo 1e9+7

  • Answered by AI
Round 2 - Video Call 

(2 Questions)

Round duration - 60 minutes
Round difficulty - Easy

The interviewer was very polite and straightforward. 
Firstly he introduced himself and then asked me to introduce myself and then he jumped to the coding problems.
After the coding problems, he asked some questions from the OS and DBMS.

  • Q1. 

    Reverse Words in a String: Problem Statement

    You are given a string of length N. Your task is to reverse the string word by word. The input may contain multiple spaces between words and may have leading o...

  • Ans. 

    The task is to reverse the words in a given string, removing any leading or trailing spaces and replacing multiple spaces between words with a single space.

    • Split the string into words using spaces as delimiters

    • Reverse the order of the words

    • Join the reversed words with a single space between them

    • Remove any leading or trailing spaces

  • Answered by AI
  • Q2. 

    Reverse Linked List in Groups of K

    You are provided with a linked list containing 'N' nodes and an integer 'K'. The task is to reverse the linked list in groups of size K, which means reversing the nodes ...

  • Ans. 

    The task is to reverse a linked list in groups of size K.

    • Iterate through the linked list in groups of size K

    • Reverse each group using a helper function

    • Connect the reversed groups to form the final reversed linked list

  • Answered by AI
Round 3 - Video Call 

(2 Questions)

Round duration - 60 minutes
Round difficulty - Medium

The interviewer was very polite and straightforward, firstly he introduce himself and then ask me to introduce myself and then ask some ques on my projects and then he jumps to the coding problems.

  • Q1. 

    Remove Consecutive Duplicates From String Problem Statement

    Given a string STR consisting of both lower and upper case characters, your task is to remove consecutive duplicate characters from the string a...

  • Ans. 

    The task is to remove consecutive duplicate characters from a given string and return the new string.

    • Iterate through the characters of the string

    • Compare each character with the next character

    • If they are the same, skip the next character

    • If they are different, add the current character to the new string

    • Return the new string

  • Answered by AI
  • Q2. 

    Maximum Path Sum in a Matrix

    Given an N*M matrix filled with integer numbers, determine the maximum sum that can be obtained from a path starting from any cell in the first row to any cell in the last row...

  • Ans. 

    The question asks to find the maximum sum that can be obtained from a path starting from any cell in the first row to any cell in the last row of a given matrix.

    • Iterate through each cell in the first row and calculate the maximum sum path ending at that cell

    • For each cell, calculate the maximum sum path ending at that cell by considering the three possible directions

    • Store the maximum sum path ending at each cell in a se...

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI completed Computer Science Engineering from Indian Institute Of Information Technology Sonepat. I applied for the job as SDE - 1 in GurgaonEligibility criteriaAbove 7 CGPA with no backlogs.PeopleStrong interview preparation:Topics to prepare for the interview - Data Structures and Algorithms, DBMS, Operating Systems, Computer Networking, System Design, OOPS.Time required to prepare for the interview - 6 monthsInterview preparation tips for other job seekers

Tip 1 : Deep knowledge of the projects mentioned in your resume is a must.
Tip 2 : Practice must do GFG coding questions.
Tip 3 : Practice as many problems as you can from Leetcode.

Application resume tips for other job seekers

Tip 1 : Mention 1 or 2 projects in your resume.
Tip 2 : Don't put false things in your resume.

Final outcome of the interviewSelected

Skills evaluated in this interview

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

I applied via LinkedIn and was interviewed before Sep 2023. There were 3 interview rounds.

Round 1 - Coding Test 

10 mcq, 2 dsa, 1 assignment question

Round 2 - One-on-one 

(2 Questions)

  • Q1. Javascript basics
  • Q2. Previous projects
  • Ans. 

    Developed a web application for tracking inventory and sales data

    • Used React for front-end development

    • Implemented RESTful APIs for backend using Node.js

    • Utilized MongoDB for database storage

  • Answered by AI
Round 3 - HR 

(1 Question)

  • Q1. Behavorial questions
Interview experience
1
Bad
Difficulty level
Easy
Process Duration
2-4 weeks
Result
Not Selected

I applied via Referral and was interviewed before Feb 2023. There was 1 interview round.

Round 1 - Technical 

(2 Questions)

  • Q1. What is closure? Application and concept understanding
  • Ans. 

    Closure is a function that captures the environment in which it was created, allowing it to access variables from that environment even after the function has finished executing.

    • Closure allows a function to access variables from its outer scope even after the function has finished executing.

    • It 'closes over' the variables from the outer scope, preserving their values.

    • Example: function outerFunction() { let outerVar = 'I...

  • Answered by AI
  • Q2. What is event loop?
  • Ans. 

    Event loop is a mechanism that allows for asynchronous programming by handling and executing events in a loop.

    • Event loop is a part of the runtime environment that listens for events and executes callback functions.

    • It allows for non-blocking I/O operations by delegating tasks to the operating system.

    • Event loop is commonly used in JavaScript for handling asynchronous operations like setTimeout, setInterval, and AJAX requ

  • Answered by AI

Interview Preparation Tips

Interview preparation tips for other job seekers - Basic concept though be read and revised

Skills evaluated in this interview

KEKA TECHNOLOGIES Interview FAQs

How many rounds are there in KEKA TECHNOLOGIES IOS Developer interview?
KEKA TECHNOLOGIES interview process usually has 2 rounds. The most common rounds in the KEKA TECHNOLOGIES interview process are Technical, Resume Shortlist and HR.
How to prepare for KEKA TECHNOLOGIES IOS Developer 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 KEKA TECHNOLOGIES. The most common topics and skills that interviewers at KEKA TECHNOLOGIES expect are MVVM, Swift, Cocoa, Cocoa Touch and Core Data.
What are the top questions asked in KEKA TECHNOLOGIES IOS Developer interview?

Some of the top questions asked at the KEKA TECHNOLOGIES IOS Developer interview -

  1. Same thing, but kept asking the estimated timeli...read more
  2. Just normal Swift quest...read more
  3. Just background che...read more

Tell us how to improve this page.

KEKA TECHNOLOGIES IOS Developer Interview Process

based on 3 interviews

Interview experience

3.7
  
Good
View more

Interview Questions from Similar Companies

Innovaccer Interview Questions
3.4
 • 81 Interviews
NoBrokerHOOD Interview Questions
3.2
 • 57 Interviews
Vyapar Interview Questions
3.5
 • 53 Interviews
PeopleStrong Interview Questions
3.4
 • 50 Interviews
Darwinbox Interview Questions
3.9
 • 43 Interviews
Grey Orange Interview Questions
3.2
 • 38 Interviews
View all
Customer Success Manager
106 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Sales Development Representative
81 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Product Specialist
55 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Software Engineer
40 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Quality Analyst
39 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Explore more salaries
Compare KEKA TECHNOLOGIES with

greytHR

4.0
Compare

sumHR - HRMS Software

3.5
Compare

Darwinbox

3.9
Compare

ZingHR

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