Frontend Developer Josh Technology Group interview experience

Interview rounds

Round

Easy

Online Coding Interview

Duration60 minutes

Interview date3 Aug 2021

Coding problem0

This round was easy. There were around 50 MCQ questions on C, C++, and DSA. The questions were basic and general approach based too, so you can crack this round even if your basic language is java or python. There was no negative marking in this round.

Round

Medium

Online Coding Test

Duration60 minutes

Interview date3 Aug 2021

Coding problem2

This was a Coding round with 2 questions based on DSA. In this round, you can choose the coding language of your choice.

1. Remove Duplicates From Unsorted Linked List

Moderate

15m average time

85% success

0/80

Asked in companies

You are given a linked list of N nodes. Your task is to remove the duplicate nodes from the linked list such that every element in the linked list occurs only once i.e. in case an element occurs more than once, only keep its first occurrence in the list.

For example :

Assuming the linked list is 3 -> 2 -> 3 -> 4 -> 2 -> 3 -> NULL.

Number ‘2’ and ‘3’ occurs more than once. Hence we remove the duplicates and keep only their first occurrence. So, our list becomes : 3 -> 2 -> 4 -> NULL.

Try solving now

2. Sum root to leaf

Easy

10m average time

90% success

0/40

Asked in companies

You are given an arbitrary binary tree consisting of N nodes where each node is associated with a certain integer value from 1 to 9. Consider each root to leaf path as a number.

For example:

       1
      /  \
     2    3

The root to leaf path 1->2 represents the number 12.
The root to leaf path 1->3 represents the number 13.

Your task is to find the total sum of all the possible root to leaf paths.

In the above example,

The total sum of all the possible root to leaf paths is 12+13 = 25

Note:

The output may be very large, return the answer after taking modulus with (10^9+7).

Try solving now

Round

Medium

Online Coding Test

Duration90 minutes

Interview date3 Aug 2021

Coding problem0

This round was purely based on the frontend (HTML, CSS, and javascript only). It contained 5 questions. The bad part of this round was that the editor was just a plain NotePad, so it was a bit rough experience and also we were not allowed to use any other external editor.

Questions:
1. Given two arrays one for positive integers and the other for their squares, create a function in JavaScript that returns true if the following conditions are met and false if not:
a) check if the square of values in array one is present in array two
b) check if the frequency of square of values in array one is equal to that of frequency of values in array two
Note: *Code needs to be done in javascript*

2. Create an input form using HTML, CSS, and JS

3. Create a digital stopwatch using HTML, CSS, and JS

4. I don't remember the exact problem but we have to find out the output of the given code and the code was based on the setTimeout function.

5. I don't remember the exact problem but we have to find out the output of the given code but the problem was based on "this" keyword.

Round

Easy

Assignment

Duration10080 minutes

Interview date4 Apr 2022

Coding problem1

1. Assignment

We were given a Figma design and we need to replicate that using HTML, CSS, and js. Also, we need to make the page pixel perfect. The duration of this round was 7 days.

Problem approach

Tip 1 : Go through the Figma design thoroughly. (most important)
Tip 2 : Use a google chrome extension to achieve pixel perfection.
Tip 3 : Code should be clean (like: don't use unnecessary divs etc..).

Round

Medium

Video Call

Duration120 minutes

Interview date17 Aug 2021

Coding problem0

This was a machine coding round. I was on a video call with the interviewer along with my screen shared. I have to build an image gallery in this round. The result was based on the following:
1. How well I was able to replicate the UI.
2. Basic features of the image gallery app:
a) A form having two fields, one for entering URL and another for alt text and a submit button.
b) On submitting the form, the image should be rendered in the gallery.
c) There should be a delete button below each image through which we can delete that image.
d) Newer image should be rendered at the top.
3. Some Good to have features:
a) Implement local storage
b) As the local storage is implemented, so on refresh, it should render the images we saved earlier in the gallery.
c) An edit icon on top of the image so that we can edit its alt text or even the URL.

Note: *I remember only this many features. Definitely, there were some more to implement.*

Round

Medium

Video Call

Duration60 minutes

Interview date17 Aug 2021

Coding problem1

This round was mostly based on frontend questions, but the interviewer slightly touched on the DSA part too. The questions were based on basics of HTML, CSS and js.
Questions:
1. difference between local storage and session storage.
2. Some questions on "position", "display" etc... properties in CSS.
3. on HTML tags, and what do we include in element of our HTML.
4. some javascript questions like hoisting, debouncing, throttling etc.... (all along with the code examples)

1. Sort 0 1 2

Easy

22m average time

0/40

Asked in companies

You have been given an integer array/list(ARR) of size 'N'. It only contains 0s, 1s and 2s. Write a solution to sort this array/list.

Note :

Try to solve the problem in 'Single Scan'. ' Single Scan' refers to iterating over the array/list just once or to put it in other words, you will be visiting each element in the array/list just once.

Try solving now

Round

Hard

Video Call

Duration150 minutes

Interview date20 Aug 2021

Coding problem1

This was the most difficult round. This round went around 2.5 hrs and was taken by one of their Frontend lead. The interviewer started with the code I did in the machine coding round. He asked multiple questions from the code like why I did this thing not that, why I used this approach not that approach.
Then the interviewer gave me a question that was based on shallow copy and deep copy, and the discussion on this topic went around 1.25hrs.
Other questions were based on code outputs, and those were hell tricky. These were based on setTimeout, variables declared with let/const/vars, event loops, call stack etc...
Difference between Call, bind and apply.
Event bubbling and event capturing (along with code examples)
One DSA question was also asked (only approach) which was N queens.

1. N Queens

Hard

55m average time

35% success

0/120

Asked in companies

You are given an integer 'N'. For a given 'N' x 'N' chessboard, find a way to place 'N' queens such that no queen can attack any other queen on the chessboard.

A queen can be killed when it lies in the same row, or same column, or the same diagonal of any of the other queens. You have to print all such configurations.

Try solving now

Round

Easy

HR Round

Duration30 minutes

Interview date20 Aug 2021

Coding problem1

This was a HR round. And there were basic HR questions.

1. Basic HR Questions

How will you tackle a conflict?
What are your expectations from this job role?
How was your interview experience till now?
Any questions from us or about the company?

Problem approach

Tip 1 : Sit calm, and listen carefully to the questions.
Tip 2 : First think, then answer.
Tip 3 : Try to give answers in positive ways.