Upload Button Icon Add office photos
Engaged Employer

i

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

Z1 Tech Verified Tick

Compare button icon Compare button icon Compare

Filter interviews by

Clear (1)

Z1 Tech Front end Developer Interview Questions and Answers

Updated 20 Sep 2023

Z1 Tech Front end Developer Interview Experiences

2 interviews found

Front end Developer Interview Questions & Answers

user image Dharmveer Singh

posted on 16 Mar 2023

Interview experience
5
Excellent
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Not Selected

I applied via Referral and was interviewed in Feb 2023. There were 4 interview rounds.

Round 1 - Resume Shortlist 
Pro Tip by AmbitionBox:
Don’t add your photo or details such as gender, age, and address in your resume. These details do not add any value.
View all Resume tips
Round 2 - Aptitude Test 

There are some mcq based on dsa and core subject

Round 3 - Coding Test 

3 coding question easy to medium

Round 4 - One-on-one 

(2 Questions)

  • Q1. Find the mid of linked list using single loop
  • Ans. 

    To find the mid of a linked list using a single loop.

    • Initialize two pointers, slow and fast, both pointing to the head of the linked list.

    • Move the slow pointer by one node and the fast pointer by two nodes in each iteration.

    • When the fast pointer reaches the end of the linked list, the slow pointer will be pointing to the middle node.

    • Return the value of the node pointed by the slow pointer as the mid of the linked list.

  • Answered by AI
  • Q2. Reverse array without using extra space
  • Ans. 

    Reverse an array without using extra space

    • Use two pointers, one at the beginning and one at the end of the array

    • Swap the elements at the two pointers and move the pointers towards each other

    • Repeat until the pointers meet at the middle of the array

  • Answered by AI

Interview Preparation Tips

Interview preparation tips for other job seekers - focus on DSA and core subject and confidence level high

Skills evaluated in this interview

Interview experience
1
Bad
Difficulty level
Hard
Process Duration
Less than 2 weeks
Result
Not Selected

I applied via Naukri.com and was interviewed in Aug 2023. There were 3 interview rounds.

Round 1 - Resume Shortlist 
Pro Tip by AmbitionBox:
Properly align and format text in your resume. A recruiter will have to spend more time reading poorly aligned text, leading to high chances of rejection.
View all Resume tips
Round 2 - Coding Test 

Asked most question from javascript, and react also, interviewer was behaving rude

Round 3 - HR 

(1 Question)

  • Q1. There was no hr round

Interview Preparation Tips

Interview preparation tips for other job seekers - Prepare very deep and basic of javascript and reactjs.

Front end Developer Interview Questions Asked at Other Companies

Q1. Non-Decreasing Array Problem Statement Given an integer array ARR ... read more
Q2. Find Unique Element in Array You have been provided an integer ar ... read more
asked in JUSPAY
Q3. Dijkstra's Shortest Path Problem Statement You are given an undir ... read more
asked in JUSPAY
Q4. Encode N-ary Tree to Binary Tree Problem Statement You are provid ... read more
Q5. Sort Linked List Based on Actual Values You are given a Singly Li ... read more

Interview questions from similar companies

Interview experience
4
Good
Difficulty level
Moderate
Process Duration
2-4 weeks
Result
Selected Selected

I applied via LinkedIn and was interviewed before Sep 2023. There were 2 interview rounds.

Round 1 - Coding Test 

Just basic DSA round

Round 2 - Technical 

(2 Questions)

  • Q1. Questions on DSA like array and strings.
  • Q2. Computer science fundamentals questions like OOPS concepts
Interview experience
4
Good
Difficulty level
-
Process Duration
-
Result
-
Round 1 - HR 

(1 Question)

  • Q1. About Oracle database and Oracle adfs

I applied via LinkedIn and was interviewed before Sep 2021. There were 4 interview rounds.

Round 1 - Aptitude Test 

Aptitude + Coding Test

Round 2 - One-on-one 

(1 Question)

  • Q1. Technical Interview with an SDE
Round 3 - Technical 

(1 Question)

  • Q1. Managerial + Technical Interview
Round 4 - HR 

(1 Question)

  • Q1. Basic HR discussion around salary negotiation

Interview Preparation Tips

Interview preparation tips for other job seekers - Question were around OOPs, DSA and Aptitude.
Interview experience
4
Good
Difficulty level
-
Process Duration
-
Result
-

I applied via Campus Placement

Round 1 - Coding Test 

2 Questions - 1 graph and one basic

Round 2 - Technical 

(1 Question)

  • Q1. 2 basic coding questions and questions on OS and DBMS

Interview Preparation Tips

Interview preparation tips for other job seekers - Prepare basics

Interview Questionnaire 

1 Question

  • Q1. Delete a Node in Linked list.
  • Ans. 

    To delete a node in a linked list, we need to find the node and update the pointers of its previous and next nodes.

    • Find the node to be deleted by traversing the linked list

    • Update the pointers of the previous and next nodes to skip the node to be deleted

    • Free the memory occupied by the node to be deleted

  • Answered by AI

Interview Preparation Tips

Interview preparation tips for other job seekers - The campus process included 2 Technical and an HR round, First round was coding, second was to check theoretical knowledge and third HR round.

Skills evaluated in this interview

Interview experience
1
Bad
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Technical 

(2 Questions)

  • Q1. What is the use of ref?
  • Ans. 

    The 'ref' keyword in C# is used to pass arguments by reference instead of by value.

    • Allows a method to modify the value of the argument passed to it

    • Useful when you want to update the original value of a variable inside a method

    • Can be used with value types and reference types

    • Example: void UpdateValue(ref int num) { num = 10; }

    • Example: int value = 5; UpdateValue(ref value); // value will be 10 after the method call

  • Answered by AI
  • Q2. What are React Hooks
  • Ans. 

    React Hooks are functions that let you use state and other React features without writing a class.

    • React Hooks were introduced in React 16.8.

    • They allow you to use state and other React features in functional components.

    • Some commonly used React Hooks are useState, useEffect, useContext, etc.

    • Hooks are more lightweight and easier to understand compared to class components.

  • Answered by AI

I was interviewed before Jan 2021.

Round 1 - Face to Face 

(5 Questions)

Round duration - 60 minutes
Round difficulty - Easy

I had one interview for approx. an hour, it includes both Technical and HR round, well mostly technical. Interview starts with tell me something about yourself. Asked in detailed about algorithms/web based projects mentioned in CV, make sure that whatever you have written you have complete knowledge about it. Asked to code few basic algorithms questions. Do mention about small project if you have done related to web development.
If interviewer says if you want to ask any question, its always better to ask one or two question.

  • Q1. Can you introduce yourself?
  • Q2. What is a Binary Search Tree (BST)?
  • Ans. 

    A Binary Search Tree (BST) is a data structure where each node has at most two children, with the left child being less than the parent and the right child being greater.

    • Nodes in a BST are arranged in a hierarchical order where the left subtree of a node contains only nodes with keys less than the node's key, and the right subtree contains only nodes with keys greater than the node's key.

    • BST allows for efficient search...

  • Answered by AI
  • Q3. 

    Binary Search Tree Insertion

    Given the root node of a binary search tree and a positive integer, you need to insert a new node with the given value into the BST so that the resulting tree maintains the pr...

  • Ans. 

    Insert a new node with a given value into a binary search tree while maintaining the properties of a BST.

    • Traverse the BST starting from the root node and compare the value to be inserted with each node's value to determine the correct position for insertion.

    • Insert the new node as a leaf node in the appropriate position to maintain the BST properties.

    • Ensure that the resulting tree is a valid binary search tree by follow...

  • Answered by AI
  • Q4. 

    Delete Node in Binary Search Tree Problem Statement

    You are provided with a Binary Search Tree (BST) containing 'N' nodes with integer data. Your task is to remove a given node from this BST.

    A BST is a ...

  • Ans. 

    Delete a given node from a Binary Search Tree (BST) and return the inorder traversal of the modified BST.

    • Traverse the BST to find the node to be deleted.

    • Handle different cases like node with no children, one child, or two children.

    • Update the pointers of the parent node and child nodes accordingly.

    • Perform inorder traversal after deletion to get the modified BST.

  • Answered by AI
  • Q5. 

    Clone Linked List with Random Pointer Problem Statement

    Given a linked list where each node has two pointers: one pointing to the next node and another which can point randomly to any node in the list or ...

  • Ans. 

    Yes, the cloning of a linked list with random pointer can be accomplished without utilizing extra space.

    • Use a hashmap to store the mapping between original nodes and their corresponding cloned nodes.

    • Iterate through the original linked list to create the cloned nodes and update the hashmap.

    • Iterate through the original linked list again to set the next and random pointers of the cloned nodes using the hashmap.

    • Time comple...

  • Answered by AI

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPATimes Internet interview preparation:Topics to prepare for the interview - SQL, Algorithms, Data Structures, C++, PHPTime required to prepare for the interview - 6 monthsInterview preparation tips for other job seekers

Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.

Application resume tips for other job seekers

Tip 1 : Must verify your CV from your seniors/batchmates. 
Tip 2 : Include all the projects, intern work or hall activities or anything you have done on your own which is related to or interest of company. If you know any back-end/front-end (javascript, php, mysql etc) language do mention. I think the cv shortlist was completely based on previous work and technical skills related to Web Development/Design mentioned in the CV.
Tip 3 : Focus on skills, projects and experiences more.

Final outcome of the interviewSelected

Skills evaluated in this interview

I was interviewed before Jan 2021.

Round 1 - Coding Test 

(2 Questions)

Round duration - 90 minutes
Round difficulty - Easy

The test was of moderate level, the coding question was easy if all the boundary questions were properly considered.

  • Q1. 

    Largest Prime Factor Problem Statement

    You are given a positive integer n. Your task is to identify the largest prime factor of this given positive integer.

    If there is no prime factor for a given intege...

  • Ans. 

    Identify the largest prime factor of a given positive integer.

    • Iterate from 2 to sqrt(n) to find prime factors

    • Check if each factor is prime and update largest prime factor

    • If no prime factor found, output -1

  • Answered by AI
  • Q2. 

    First Missing Positive Problem Statement

    You are provided with an integer array ARR of length 'N'. Your objective is to determine the first missing positive integer using linear time and constant space. T...

  • Ans. 

    Find the smallest positive integer missing from an array of integers.

    • Iterate through the array and mark positive integers as visited using index as a reference.

    • After marking, iterate again to find the first unmarked index which represents the missing positive integer.

    • Handle edge cases like duplicates and negative numbers appropriately.

    • Example: For input [3, 4, -1, 1], the output should be 2.

  • Answered by AI
Round 2 - Face to Face 

(4 Questions)

Round duration - 60 minutes
Round difficulty - Easy

The interviewer was friendly and he was interested in the implementation first and then the code.
Tips: Be thorough with various implementations and why they are in practice. Try to know the logic behind each implementation.

  • Q1. 

    Binary Array Sorting Problem Statement

    You are provided with a binary array, i.e., an array containing only 0s and 1s. Your task is to sort this binary array and return it after sorting.

    Input:

     The fir...
  • Ans. 

    Yes, the binary array can be sorted in linear time and constant space using a single traversal.

    • Use two pointers approach to swap 0s to the left and 1s to the right.

    • Maintain two pointers, one for 0s and one for 1s, and iterate through the array once.

    • Example: Input array [1, 0, 1, 0, 1] will be sorted to [0, 0, 1, 1, 1] in a single traversal.

  • Answered by AI
  • Q2. What is polymorphism in object-oriented programming?
  • Ans. 

    Polymorphism in OOP allows objects of different classes to be treated as objects of a common superclass.

    • Polymorphism allows for flexibility and reusability in code.

    • It enables a single interface to be used for different data types.

    • Examples include method overriding and method overloading.

  • Answered by AI
  • Q3. What is operator overloading?
  • Ans. 

    Operator overloading is the ability to redefine the behavior of operators for user-defined data types.

    • Allows operators to be used with custom data types

    • Can define custom behavior for operators like +, -, *, etc.

    • Helps make code more readable and intuitive

    • Example: Overloading the + operator for a custom Vector class to add two vectors

  • Answered by AI
  • Q4. What is the difference between method overloading and method overriding?
  • Ans. 

    Method overloading is having multiple methods in the same class with the same name but different parameters. Method overriding is having a method in a subclass with the same name and parameters as a method in its superclass.

    • Method overloading involves multiple methods with the same name but different parameters.

    • Method overriding involves a subclass redefining a method from its superclass with the same name and paramete...

  • Answered by AI
Round 3 - Face to Face 

Round duration - 45 minutes
Round difficulty - Easy

The interviewer was looking for a person interested in problem solving. He was looking forward for loud thinking.
Tips: If you don't know any answer, don't lose your cool. It is never necessary to answer all the questions in an interview. Be confident and think loud, so that if you are going the wrong way, the interviewer can assist you.

Round 4 - HR 

Round duration - 30 minutes
Round difficulty - Easy

This was the last round and just for formality. The interviewers were looking for a person who would fit in their working culture.
Tips: Be confident and always have a smile on your face. If you are selected for the HR interview, then there is a 90% chance that you would be selected.

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPATimes Internet interview preparation:Topics to prepare for the interview - Confidence, Communication, Puzzle Solving Capability, Algorithms And Data Structures, Basic C/C++Time required to prepare for the interview - 6 monthsInterview preparation tips for other job seekers

Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.

Application resume tips for other job seekers

Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.

Final outcome of the interviewSelected

Skills evaluated in this interview

Contribute & help others!
anonymous
You can choose to be anonymous

Z1 Tech Interview FAQs

How many rounds are there in Z1 Tech Front end Developer interview?
Z1 Tech interview process usually has 3-4 rounds. The most common rounds in the Z1 Tech interview process are Resume Shortlist, Coding Test and Aptitude Test.
How to prepare for Z1 Tech Front end Developer interview?
Go through your CV in detail and study all the technologies mentioned in your CV. Prepare at least two technologies or languages in depth if you are appearing for a technical interview at Z1 Tech. The most common topics and skills that interviewers at Z1 Tech expect are Advertising, Advertising Management, CSS3, Computer science and Continuous Improvement.
What are the top questions asked in Z1 Tech Front end Developer interview?

Some of the top questions asked at the Z1 Tech Front end Developer interview -

  1. Find the mid of linked list using single l...read more
  2. Reverse array without using extra sp...read more
  3. there was no hr ro...read more

Recently Viewed

INTERVIEWS

Z1 Tech

No Interviews

INTERVIEWS

Xapads Media

No Interviews

INTERVIEWS

Liqvd Asia

No Interviews

INTERVIEWS

Xapads Media

No Interviews

INTERVIEWS

Z1 Tech

No Interviews

INTERVIEWS

Liqvd Asia

No Interviews

INTERVIEWS

Z1 Tech

No Interviews

SALARIES

Uno Minda Kyoraku

INTERVIEWS

Jivox

No Interviews

INTERVIEWS

Jivox

No Interviews

Tell us how to improve this page.

Z1 Tech Front end Developer Interview Process

based on 2 interviews

Interview experience

3
  
Average
View more

Interview Questions from Similar Companies

Times Internet Interview Questions
3.6
 • 63 Interviews
HT Media Interview Questions
3.3
 • 49 Interviews
Times Group Interview Questions
3.8
 • 27 Interviews
Network 18 Interview Questions
3.5
 • 26 Interviews
Moris Media Interview Questions
4.3
 • 24 Interviews
Sun TV Network Interview Questions
3.6
 • 12 Interviews
View all
Z1 Tech Front end Developer Salary
based on 15 salaries
₹2.4 L/yr - ₹8 L/yr
19% less than the average Front end Developer Salary in India
View more details

Z1 Tech Front end Developer Reviews and Ratings

based on 6 reviews

4.2/5

Rating in categories

4.6

Skill development

4.2

Work-life balance

4.2

Salary

4.3

Job security

4.3

Company culture

4.2

Promotions

4.5

Work satisfaction

Explore 6 Reviews and Ratings
Front end Developer
15 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Senior Associate
10 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Data Analyst
7 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Junior Software Developer
6 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Associate Director
5 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Explore more salaries
Compare Z1 Tech with

Times Internet

3.6
Compare

Network 18

3.5
Compare

Times Group

3.8
Compare

INDIA TODAY GROUP

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