Upload Button Icon Add office photos
Engaged Employer

i

This company page is being actively managed by Whitehat jr Team. If you also belong to the team, you can get access from here

Whitehat jr Verified Tick

Compare button icon Compare button icon Compare

Filter interviews by

Whitehat jr React Developer Interview Questions and Answers

Updated 9 Nov 2021

Whitehat jr React Developer Interview Experiences

1 interview found

I was interviewed before Nov 2020.

Round 1 - Video Call 

(1 Question)

Round duration - 30 Minutes
Round difficulty - Easy

  • Q1. 

    Furthest Building You Can Reach

    In this problem, Ninja prefers jumping over building roofs rather than walking through the streets. The heights of the buildings in his city are represented by an array HEI...

  • Ans. 

    Given heights of buildings, bricks, and ladders, find the farthest building Ninja can reach using them optimally.

    • Iterate through the buildings and calculate the difference in heights between consecutive buildings.

    • Use bricks or ladders to cover the height difference when needed.

    • Keep track of the farthest building Ninja can reach based on available bricks and ladders.

    • Return the index of the farthest building Ninja can re

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI completed Computer Science Engineering from Dronacharya College of Engineering. Eligibility criteria80%WhiteHat Jr interview preparation:Topics to prepare for the interview - React native , DS, algorithms , OS, frontend AptiTime required to prepare for the interview - 1 MonthInterview preparation tips for other job seekers

Tip 1 : Practice as much as u can
Tip 2 : Have some basic knowledge of main topics

Application resume tips for other job seekers

Tip 1 : Have internship and projects
Tip 2 : No false information

Final outcome of the interviewSelected

Interview questions from similar companies

Interview experience
5
Excellent
Difficulty level
-
Process Duration
-
Result
-
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 - Coding Test 

Hard test dsa question practice more leetcode

Round 3 - One-on-one 

(1 Question)

  • Q1. Dsa question Array Powershell scripting Cpp Python
Interview experience
4
Good
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Selected Selected

I applied via Naukri.com and was interviewed in Jan 2023. There were 3 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 - Aptitude Test 

Aptitude test was first round. it was hard level

Round 3 - Coding Test 

Program on string, oops , exception handling

Interview Preparation Tips

Interview preparation tips for other job seekers - do your best. keep doing hardwork. practise as much as you can.
Interview experience
5
Excellent
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Technical 

(1 Question)

  • Q1. About Lighnting Web componet
Interview experience
5
Excellent
Difficulty level
Easy
Process Duration
Less than 2 weeks
Result
Selected Selected

I was interviewed in Oct 2024.

Round 1 - Coding Test 

Explain about DSA and its example in realtime.

I was interviewed in Dec 2020.

Round 1 - Coding Test 

(2 Questions)

Round duration - 135 minutes
Round difficulty - Easy

There was no sectional time limit for the coding questions.The test was online with audio and video both on for continuous monitoring.

  • Q1. 

    N-th Term Of Geometric Progression

    Find the N-th term of a Geometric Progression (GP) series given the first term A, the common ratio R, and the term position N.

    Explanation:

    The general form of a GP se...

  • Ans. 

    Calculate the N-th term of a Geometric Progression series given the first term, common ratio, and term position.

    • Use the formula A * R^(N-1) to find the N-th term of the GP series.

    • Remember to return the result modulo 10^9 + 7 as the term can be very large.

    • Handle multiple test cases efficiently by iterating through each case.

  • Answered by AI
  • Q2. 

    Matrix Element Cube Sum Problem

    For a given M x N sized 2D array 'MATRIX', find and return the value of (i * i + j * j) for elements where the sum of the cubes of its digits equals the element itself. Her...

  • Ans. 

    Find and return the value of (i * i + j * j) for elements in a 2D array where the sum of the cubes of its digits equals the element itself.

    • Iterate through the 2D array and check if the sum of the cubes of digits equals the element itself.

    • Calculate (i * i + j * j) for elements that satisfy the condition.

    • Return the calculated values as a new 2D array.

    • If no element satisfies the condition, return -1.

  • Answered by AI
Round 2 - Video Call 

(3 Questions)

Round duration - 40 minutes
Round difficulty - Easy

The interviewer was very calm and listened very carefully to the solutions. There was a lot of discussion on my projects and the interviewer seems to be very interested in knowing about the workflows of my projects.They also give me some coding questions which were related to problem solving also.

  • Q1. 

    Distinct Subsequences Problem Statement

    You are given a string 'S' of length 'N' which may include duplicate alphabets. Your goal is to calculate the number of distinct subsequences in the string.

    Exampl...

  • Ans. 

    Calculate the number of distinct subsequences in a string with possible duplicates.

    • Use dynamic programming to keep track of the count of distinct subsequences for each character in the string.

    • Consider the cases where the current character is included or excluded in the subsequence.

    • Handle duplicates by using a hashmap to store the last occurrence index of each character.

    • Modulo the final count by 10^9 + 7 to avoid overfl

  • Answered by AI
  • Q2. 

    Remove the Kth Node from the End of a Linked List

    You are given a singly Linked List with 'N' nodes containing integer data and an integer 'K'. Your task is to delete the Kth node from the end of this Lin...

  • Ans. 

    Remove the Kth node from the end of a singly linked list given the position from the end to be removed.

    • Traverse the list to find the length 'N' of the linked list.

    • Calculate the position from the beginning to be removed as 'N - K + 1'.

    • Delete the node at the calculated position from the beginning.

  • Answered by AI
  • Q3. 

    Common Elements Problem Statement

    Identify and output the common strings present in both given arrays of lowercase alphabets for each test case.

    Input:

    The first line contains an integer 'T' representin...
  • Ans. 

    The task is to find common strings in two arrays of lowercase alphabets for each test case.

    • Iterate through the elements of the second array and check if they are present in the first array.

    • Use a hash set to store the strings of the first array for efficient lookup.

    • Return the common strings in the order they appear in the second array.

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI applied for the job as SDE - 1 in GurgaonEligibility criteriaAbove 60%Cuemath interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, OOPS, Operating System, Database Management, C++, or Java (proficient in anyone) Computer Networks, Operating System, Software Engineering, System DesignTime required to prepare for the interview - 2 monthsInterview preparation tips for other job seekers

Tip 1 : If you have time for your interviews, I would recommend going through Leetcode as it has a good variety of questions sorted on topic wise difficulty level where you can try to solve at least 20-30 questions for each data structure and algorithm. Moreover, you should regularly participate in the weekly contests happening there so that you could know about your weak areas to improve.
Tip 2 : Practice DSA everyday and make sure that you are giving timed mock tests periodically.
Tip 3 : Keep revising your Computer Science fundamentals(OS, DBMS, Software Engineering principles).
Tip 4 : Also brush-up your aptitude skills.

Application resume tips for other job seekers

Tip 1 : The most important tip is that never lie on your resume and like If you have worked upon some technology for the project part only and don't know the proper depth you could write basics only in your resume.
Tip 2 : Customize your resume for a company based on their Job Description (highlight necessary skills)
Tip 3 : Include only those points about which you're fully confident. Sometimes including too much increases expectations and then the bar is set high for you which impacts the assessment
Tip 4 : Don't put anything in resume that you are not sure of.
Tip 5 : if you don't have any internship experience then you can show your good technical projects and certifications too.

Final outcome of the interviewSelected

Skills evaluated in this interview

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

(1 Question)

  • Q1. Sdlc lifecycle of components and architecture.
  • Ans. 

    SDLC lifecycle involves planning, designing, developing, testing, deploying, and maintaining software components and architecture.

    • SDLC (Software Development Life Cycle) includes phases like planning, designing, coding, testing, and maintenance.

    • Components are designed, developed, tested, and integrated into the overall architecture.

    • Architecture involves defining the structure, behavior, and interactions of software comp...

  • Answered by AI
Round 2 - Technical 

(1 Question)

  • Q1. Role and responsibility my tasks and questions on project

Skills evaluated in this interview

Interview experience
1
Bad
Difficulty level
Moderate
Process Duration
2-4 weeks
Result
No response

I applied via LinkedIn and was interviewed in Feb 2023. There were 6 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. Data structures
Round 3 - Technical 

(1 Question)

  • Q1. System Design fundamentals
Round 4 - Technical 

(1 Question)

  • Q1. System Design questions
Round 5 - Behavioral 

(1 Question)

  • Q1. What do you think about the negative news going around the company
Round 6 - HR 

(1 Question)

  • Q1. Why join this company

Interview Preparation Tips

Interview preparation tips for other job seekers - They took 5 rounds of interview. 3 of them were technical and had easy to moderate level of questions. Rest 2 were more of HR rounds.
After taking 5 rounds, they have the audacity of not even calling back, picking up the calls or providing us with any information. If you are not interested in taking the candidate then why waste their time?

Funniest part is that they are fully aware of what a rubbish organization it is. In the later rounds they talked about cost cutting, negative news around the company, and employee complaints for work life balance. However, they are great at gaslighting as well because they make these sound like employee problems not employer problems.
Interview experience
3
Average
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Not Selected

I applied via Naukri.com and was interviewed before Aug 2023. There was 1 interview round.

Round 1 - Technical 

(2 Questions)

  • Q1. Explain about Android lifecycle
  • Ans. 

    Android lifecycle refers to the series of states that an activity or fragment goes through from creation to destruction.

    • Android lifecycle includes states like onCreate, onStart, onResume, onPause, onStop, onDestroy, etc.

    • Activities and fragments transition between these states based on user interactions and system events.

    • Understanding Android lifecycle is crucial for managing resources, saving state, and handling config...

  • Answered by AI
  • Q2. Explain about fragment lifecycle
  • Ans. 

    Fragment lifecycle refers to the series of events that occur in the lifespan of a fragment in an Android app.

    • Fragments go through various states like created, started, resumed, paused, stopped, and destroyed.

    • Fragment lifecycle methods include onCreate(), onCreateView(), onResume(), onPause(), onStop(), onDestroy(), etc.

    • Fragment lifecycle is closely tied to the hosting activity's lifecycle.

    • Understanding fragment lifecyc...

  • Answered by AI

Interview Preparation Tips

Interview preparation tips for other job seekers - Look into basics

Skills evaluated in this interview

Interview experience
3
Average
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Coding Test 

Asking the dp and tree and other

Round 2 - One-on-one 

(1 Question)

  • Q1. Asking the project based question and
Round 3 - HR 

(1 Question)

  • Q1. Some question asking base on cultural base and resume based

Tell us how to improve this page.

Interview Questions from Similar Companies

BYJU'S Interview Questions
3.1
 • 2.1k Interviews
Planet Spark Interview Questions
3.7
 • 360 Interviews
Unacademy Interview Questions
3.0
 • 206 Interviews
upGrad Interview Questions
3.7
 • 198 Interviews
Physicswallah Interview Questions
3.8
 • 196 Interviews
Vedantu Interview Questions
3.3
 • 185 Interviews
NxtWave Interview Questions
3.8
 • 177 Interviews
Simplilearn Interview Questions
3.2
 • 101 Interviews
View all
Sales Manager
2.1k salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Coding Instructor
318 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Relationship Manager
274 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Manager
208 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Assistant Manager
164 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Explore more salaries
Compare Whitehat jr with

BYJU'S

3.1
Compare

Cuemath

3.8
Compare

Vedantu

3.3
Compare

Unacademy

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