Kenko Health interview experience Real time questions & tips from candidates to crack your interview

Frontend Developer

Kenko Health
upvote
share-icon
3 rounds | 4 Coding problems

Interview preparation journey

expand-icon
Journey
I enrolled in a tier-2 college for a B.Tech in Computer Science. I began my coding journey in the second year of my graduation. I sought guidance and advice from seniors on how to start my career. I then started practicing DSA.
Application story
I applied using the Google form provided by that employee and participated in its selection process. Luckily, most of the questions were from the list of important questions shared by my friend.
Why selected/rejected for the role?
I think my skills and knowledge were up to the mark, which is why they found me to be a valuable candidate. Moreover, my communication skills added to my strengths.
Preparation
Duration: 3 months
Topics: Data Structure & Algorithms, DBMS, OS, Android Development, Web Development, C++, OOPS
Tip
Tip

Tip 1: Become a pro in at least one programming language (preferably Java/C++).
Tip 2: Master DSA and solve a lot of problems on various online coding platforms.
Tip 3: Create some good projects related to your field of expertise, do them on your own, and deploy them.

Application process
Where: Linkedin
Eligibility: 7 CGPA
Resume Tip
Resume tip

Tip 1: Use some good templates.
Tip 2: Don't include irrelevant things.
Tip 3: Highlight the technologies used in your projects and internships.

Interview rounds

01
Round
Easy
Video Call
Duration70 minutes
Interview date10 Nov 2021
Coding problem2

1. Next Greater Element

Easy
10m average time
90% success
0/40
Asked in companies
IBMInfo Edge India (Naukri.com)Amazon

You are given an array 'a' of size 'n'.



The Next Greater Element for an element 'x' is the first element on the right side of 'x' in the array, which is greater than 'x'.


If no greater elements exist to the right of 'x', consider the next greater element as -1.


For example:
Input: 'a' = [7, 12, 1, 20]

Output: NGE = [12, 20, 20, -1]

Explanation: For the given array,

- The next greater element for 7 is 12.

- The next greater element for 12 is 20. 

- The next greater element for 1 is 20. 

- There is no greater element for 20 on the right side. So we consider NGE as -1.
Problem approach

Complete stack implementation.

Try solving now

2. Theory Questions

1. What are semaphores? (Learn)
2. What is the critical section problem? (Learn)
3. Code it with a multithreading program.
4. What is a thread? What is a process? What are the differences between them? (Learn)
5. Describe the execution flow in a multithreaded program, with preemption and the critical section problem occurring. How do semaphores help in overcoming this problem?

02
Round
Medium
Video Call
Duration45 minutes
Interview date10 Nov 2021
Coding problem1

1. Flip Bit to Win

Easy
20m average time
80% success
0/40
Asked in companies
HSBCAmazonMicrosoft

Ninjas are often known for their stealth execution and accuracy to get the job done right. While honing their art of moving through dense forests stealthily, they need the maximum number of continuous trees one after the other for practicing.

Trees are represented by 1s and empty places by 0s (basically a binary representation of a given integer). You are also given an extra tree which you can plant at any empty place (i.e. you can flip one of the zeroes in the binary representation to 1). The tree should be planted such that the maximum number of consecutive trees is maximized.

Your task is to report the maximum number of consecutive trees after plantation.

Note:

You may also choose not to plant that extra tree at all.
For Example:
Input: 54
Output: 5

The binary representation of 54 is 110110.
After flipping the third bit from the left, we get consecutive 5 bits. i.e. 111110.
Problem approach

I solved using Heap concept.

Try solving now
03
Round
Medium
Video Call
Duration50 minutes
Interview date10 Nov 2021
Coding problem1

It was a managerial round. It was a discussion about my projects.

1. Basic HR Questions

  • Explain your Android project.
  • Which tech stack did you use for this?
  • Is there any way you can change your logic?

Here's your problem of the day

Solving this problem will increase your chance to get selected in this company

Skill covered: Programming

What is recursion?

Choose another skill to practice
Similar interview experiences
company logo
SDE - 1
3 rounds | 7 problems
Interviewed by OYO
4657 views
0 comments
0 upvotes
company logo
SDE - Intern
2 rounds | 3 problems
Interviewed by Amazon
960 views
0 comments
0 upvotes
company logo
SDE - 1
2 rounds | 5 problems
Interviewed by Meesho
6450 views
0 comments
0 upvotes
company logo
SDE - 1
3 rounds | 9 problems
Interviewed by Salesforce
3452 views
0 comments
0 upvotes
Companies with similar interview experiences
company logo
Frontend Developer
3 rounds | 11 problems
Interviewed by Amdocs
2480 views
0 comments
0 upvotes