Nuclei Interview Questions, Process, and Tips

The interviewer asked me to build an accordion, the interview was 1 hour long

Q1. Rate Limiting algorithm
Ans. 
Rate limiting algorithm is used to control the rate of traffic sent or received by a system.
• Rate limiting helps prevent abuse, protect against DoS attacks, and ensure fair usage of resources.

• Common rate limiting algorithms include token bucket, leaky bucket, and fixed window.

• Token bucket algorithm allows bursts of traffic up to a certain limit, while leaky bucket algorithm smooths out traffic over time.

• Fixed window alg...read more
Answered by AI
Add your answer
Q2. HTTP status codes
Add your answer

It was mostly around Frontend and JavaScript, asked basic questions on javascript. Then they gave me a problem to make form with multiple steps where every step has some form fields, handle state and validations for such form. After building the solution he asked follow up questions like what if form is dynamic.

Q1. It was a normal discussion around my past projects and experiences.
Add your answer

Q1. Genral Discussion
Add your answer

Round duration - 70 minutes
Round difficulty - Medium

The test started around 3 pm and was of 70 minutes. 3 coding questions were asked which were mainly on trees and number theory.

Q1. 
Factorial Calculation Problem Statement
Develop a program to compute the factorial of a given integer 'n'.
The factorial of a non-negative integer 'n', denoted as n!, is the product of all positive integ...read more
Ans. 
Program to compute factorial of a given integer 'n', with error handling for negative values.
• Create a function to calculate factorial using a loop or recursion

• Check if input is negative, return 'Error' if true

• Handle edge cases like 0 and 1 separately

• Return the calculated factorial value
Answered by AI
Add your answer
Q2. 
Next Greater Element Problem Statement
Given a list of integers of size N, your task is to determine the Next Greater Element (NGE) for every element. The Next Greater Element for an element X is the firs...read more
Ans. 
The task is to find the Next Greater Element for each element in a list of integers.
• Iterate through the list of integers from right to left

• Use a stack to keep track of elements whose NGE is yet to be found

• Pop elements from the stack until a greater element is found or the stack is empty

• Assign the NGE as the top element of the stack or -1 if the stack is empty
Answered by AI
Add your answer
Q3. 
Ceil Value from BST Problem Statement
Given a Binary Search Tree (BST) and an integer, write a function to return the ceil value of a particular key in the BST.
The ceil of an integer is defined as the s...read more
Ans. 
Ceil value of a key in a Binary Search Tree (BST) is the smallest integer greater than or equal to the given number.
• Traverse the BST to find the closest integer greater than or equal to the given key.

• Compare the key with the current node value and update the ceil value accordingly.

• Recursively traverse left or right subtree based on the key value to find the ceil value.

• Return the ceil value once found for each test case
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

Interviewer was very friendly and supportive. My interview happened on google meet. What is a View? What is Denormalization? Difference between “==” and “===” operators in js.

Q1. 
Sub Sort Problem Statement
You are given an integer array ARR. Determine the length of the shortest contiguous subarray which, when sorted in ascending order, results in the entire array being sorted in a...read more
Ans. 
Determine the length of the shortest contiguous subarray that needs to be sorted to make the entire array sorted in ascending order.
• Iterate from left to right to find the first element out of order.

• Iterate from right to left to find the last element out of order.

• Calculate the length of the subarray between the two out of order elements.
Answered by AI
Add your answer
Q2. 
Sort 0 1 2 Problem Statement
Given an integer array arr of size 'N' containing only 0s, 1s, and 2s, write an algorithm to sort the array.
Input:
The first line contains an integer 'T' representing the n...read more
Ans. 
Sort an integer array containing only 0s, 1s, and 2s in linear time complexity.
• Use three pointers to keep track of 0s, 1s, and 2s while traversing the array.

• Swap elements based on the values encountered to sort the array in-place.

• Time complexity should be O(N) to solve the problem efficiently.
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

What are some of the advantages of Angular over other frameworks?

Q1. 
Cousin Nodes in a Binary Tree
Determine if two nodes in a binary tree are cousins. Nodes are considered cousins if they are at the same level and have different parents.
Explanation:
In a binary tree, e...read more
Ans. 
Determine if two nodes in a binary tree are cousins based on level and parent nodes.
• Traverse the binary tree to find the levels and parents of the given nodes.

• Check if the nodes are at the same level and have different parents to determine if they are cousins.

• Return 'YES' if the nodes are cousins, 'NO' otherwise.

• Example: For input '1 2 3 4 -1 5 6 -1 7 -1 -1 -1 -1 -1 -1' and nodes 4 7, output is 'YES'.
Answered by AI
Add your answer

Round duration - 10 minutes
Round difficulty - Easy

I got a call from HR in the evening around 6:30 pm.

Q1. Can you tell me about yourself?
Add your answer
Q2. How was your experience with the previous two technical rounds?
Add your answer
Q3. What do you know about Paytm?
Ans. 
Paytm is a leading Indian digital payment platform offering a wide range of services including mobile recharges, bill payments, and online shopping.
• Founded in 2010 by Vijay Shekhar Sharma

• Offers services like mobile recharges, bill payments, online shopping, and digital wallet

• Acquired by One97 Communications in 2013

• Expanded into financial services like Paytm Payments Bank and Paytm Money

• One of the largest digital paymen
Answered by AI
Add your answer

Round duration - 70 minutes
Round difficulty - Easy

there was some coding questions and some mcqs related to js, html, css, java and aptitude.

Q1. 
Bridge in Graph Problem Statement
Given an undirected graph with V vertices and E edges, your task is to find all the bridges in this graph. A bridge is an edge that, when removed, increases the number of...read more
Ans. 
Find all the bridges in an undirected graph by identifying edges that, when removed, increase the number of connected components.
• Use Tarjan's algorithm to find bridges in the graph.

• Keep track of the discovery time and low time of each vertex during DFS traversal.

• An edge (u, v) is a bridge if low[v] > disc[u].

• Handle multiple test cases efficiently to find bridges in each graph.

• Ensure the output contains the count of
Answered by AI
Add your answer
Q2. 
House Robber Problem Statement
Mr. X is a professional robber with a plan to rob houses arranged in a circular street. Each house has a certain amount of money hidden, separated by a security system that ...read more
Ans. 
The task is to find the maximum amount of money Mr. X can rob from houses arranged in a circle without alerting the police.
• The problem can be solved using dynamic programming.

• Create two arrays to store the maximum amount of money robbed when considering the first house and when not considering the first house.

• Iterate through the array and update the maximum amount of money robbed at each house.

• The final answer will be
Answered by AI
Add your answer