Code360 powered by Coding Ninjas X Naukri.com. Code360 powered by Coding
Ninjas X Naukri.com

HCODE Technologies interview experience Real time questions & tips from candidates to crack your interview

HCODE Technologies

3 rounds | 10 Coding
problems

Journey

In 2019, I completed my B.Tech in Computer Science and Engineering and was presented with two promising placement offers after many rejections in the interviews. However, I decided to embark on a path of self-improvement by dedicating a year to GATE preparation. Despite not achieving the desired rank in the GATE (CSE) exam, I remained determined and eventually secured admission to Thapar University in 2020. This decision paved the way for an incredible journey that led me to a paid internship at Siemens and a full-time job offer from Droom Technology.
Currently, I am working as a Software Engineer at Qualcomm, Hyderabad.

Application story

I applied through Hirist. Then my resume got shortlisted, and got a call to give 1st coding assessment round. After clearing the Coding assessment, Technical Interview rounds were scheduled.

Why selected/rejected for the role?

I experienced rejection as my grasp of advanced Java Spring Boot concepts was limited, leading to missed opportunities. Acknowledging the need for improvement, I am committed to enhancing my skills through comprehensive learning. By immersing myself in official documentation, tutorials, and practical projects, I aim to bridge the knowledge gaps.

Preparation

Duration: 3 months

Topics: Core Java, Springboot, Algorithms, Data Structures, Puzzles

Tip

Tip 1: Practice standard questions of DP, Recursion, and Array for online assessment.

Tip 2: Add at least one Java Springboot project to your resume.

Application process

Where: Other

Eligibility: 1 year experience in Java Springboot

Resume tip

Tip 1: Have some Java Springboot projects on your resume.

Tip 2: Mention coding platform profiles.

01

Round

Hard

Online Coding Interview

Duration60 minutes

Interview date17 Feb 2023

Coding problem2

Timing was 2.00 PM.

```
1. The sizes will range from 1 to â€˜Nâ€™ and will be integers.
2. The sum of the pieces cut should be equal to â€˜Nâ€™.
3. Consider 1-based indexing.
```

Problem approach

Step 1: First, I try with a Recursive Solution. But, some test cases didn't pass.

Step 2: So, I thought a little bit more and reduced the Recursive Solution to the DP Solution.

Problem approach

Step 1: Sort the input array in increasing order.

Step 2: Separate even and odd numbers.

Step 3: Place even numbers at even indices and odd numbers at odd indices to get the final rearranged array.

02

Round

Medium

Video Call

Duration60 minutes

Interview date20 Feb 2023

Coding problem3

Timing was 8.00 PM.

There are 2 jugs with a capacity of 4 liters and 5 liters respectively.

The objective is to pour precisely 7 liters of water into a bucket. How can it be accomplished?

The bucket can hold more than 7 liters, the jugs are opaque with no markings and you have an infinite water source

Problem approach

Tip 1: Read and Understand the question carefully.

Tip 2: If any doubt in question, directly ask the interviewer.

Tip 3: Get permission from the interviewer to use Pen & Paper to solve.

Tip 4: Do not lose hope, even not get the solution on the first try. Try again and discuss the solution with the Interviewer.

You have 10 boxes of balls (each ball weighing exactly 10 gm) with one box with defective balls (each one of the defective balls weighs 9 gm). The number of balls in each box is different and more than 10 balls. You are given an electronic weighing machine and only one chance at it. How will find out which box has the defective balls?

Problem approach

Tip 1: Read and Understand the question carefully.

Tip 2: If any doubt in question, directly ask the interviewer.

Tip 3: Get permission from the interviewer to use Pen & Paper to solve.

Tip 4: Do not lose hope, even not get the solution on the first try. Try again and discuss the solution with the Interviewer.

```
The given linked list is 1 -> 2 -> 3 -> 4-> NULL. Then the reverse linked list is 4 -> 3 -> 2 -> 1 -> NULL and the head of the reversed linked list will be 4.
```

```
Can you solve this problem in O(N) time and O(1) space complexity?
```

Problem approach

Step 1: Use the 3-Pointer approach for the Iterative Solution.

Step 2: For the Recursive Solution, the function reverses the linked list by calling itself recursively and updating the next pointers accordingly until it reaches the end of the original list. Finally, it returns the new head of the reversed list.

03

Round

Medium

Video Call

Duration60 minutes

Interview date21 Feb 2023

Coding problem5

Problem approach

Tip 1: Read Core Java thoroughly.

What is 'MultiCatch' Block / 'Multiple Catch' Block?

What is StreamAPI, and what are its functions? (Learn)

What happens when we hit any URL, eg. (www.google.com)?

Explain the whole backend process while we hit any URL using WebBrowser.

Here's your problem of the day

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

What is the index number of the last element of an array with 9 elements?

Choose another skill to practice

Start a Discussion

Similar interview experiences

SDE - 1

4 rounds | 8 problems

Interviewed by Amazon

1867 views

0 comments

0 upvotes

Analytics Consultant

3 rounds | 10 problems

Interviewed by ZS Associates

239 views

0 comments

0 upvotes

SDE - Intern

1 rounds | 3 problems

Interviewed by Amazon

790 views

0 comments

0 upvotes

SDE - 2

4 rounds | 6 problems

Interviewed by Expedia Group

524 views

0 comments

0 upvotes

Companies with similar interview experiences

SDE - 1

1 rounds | 2 problems

Interviewed by Tata Consultancy Services (TCS)

0 views

0 comments

0 upvotes

SDE - 1

3 rounds | 4 problems

Interviewed by Tata Consultancy Services (TCS)

5724 views

0 comments

0 upvotes

SDE - 1

2 rounds | 3 problems

Interviewed by BNY Mellon

4968 views

3 comments

0 upvotes