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

Java Developer

Health Kart
upvote
share-icon
2 rounds | 2 Coding problems

Interview preparation journey

expand-icon
Preparation
Duration: 1 month
Topics: Data Structures & Algorithms, Operating System, Object-Oriented Programming System, DBMS, CN
Tip
Tip

Tip 1 : Prepare DSA well and I personally recommend Coding Ninjas and GeeksForGeeks for interview preparation.
Tip 2 : Be confident & relaxed during the interview.
Tip 3 : Do revise your projects i.e how it works and what are its functionalities.

Application process
Where: Other
Eligibility: No
Resume Tip
Resume tip

Tip 1 : Make your resume short and try to make it one page only and mention all your skills that you are confident in.
Tip 2 : Do not put false things on your resume.

Interview rounds

01
Round
Easy
Online Coding Interview
Duration60 minutes
Interview date27 Mar 2022
Coding problem1

10 Mcq Question + 2 Coding Questions

1. Level Order Traversal

Easy
15m average time
85% success
0/40
Asked in companies
WalmartFreshworksAdobe

You have been given a Binary Tree of integers. You are supposed to return the level order traversal of the given tree.

For example:
For the given binary tree

Example

The level order traversal will be {1,2,3,4,5,6,7}.
Problem approach

By Using BFS, Queue Data Structure.

Try solving now
02
Round
Medium
Face to Face
Duration60 minutes
Interview date31 Mar 2022
Coding problem1

In Technical Round. In a coding round, easy-medium Coding questions, and In Technical Interview asked Java, Project related Questions, and DBMS Questions.

1. Count Subsequences

Moderate
30m average time
60% success
0/80
Asked in companies
OracleHCL TechnologiesHCL Technologies

You have been given an integer array/list 'ARR' of size 'N'. Your task is to return the total number of those subsequences of the array in which all the elements are equal.

A subsequence of a given array is an array generated by deleting some elements of the given array with the order of elements in the subsequence remaining the same as the order of elements in the array.

Note :
As this value might be large, print it modulo 10^9 + 7
Problem approach

By using generate all subsequence(Recursively)

Try solving now

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
961 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
Java Developer
3 rounds | 20 problems
Interviewed by Ernst & Young (EY)
9061 views
2 comments
0 upvotes
company logo
Java Developer
3 rounds | 4 problems
Interviewed by SAP Labs
3149 views
0 comments
0 upvotes
company logo
Java Developer
2 rounds | 2 problems
Interviewed by HCL Technologies
7166 views
0 comments
0 upvotes