Tip 1: Master JavaScript thoroughly for web development.
Tip 2: Understand your projects well; employers value practical skills.
Tip 3: Practice DSA rigorously for strong problem-solving abilities.
Tip 1:Have some projects on resume.
Tip 2: Do not put false things on resume.
During this round, the discussion primarily revolved around my projects, with questions related to the projects being asked. Following that, the conversation shifted towards JavaScript, and I was asked JavaScript-related questions.
In my project, I explained the technologies I used, the functionality, and the user interface (UI). I elaborated on how each technology contributed to the project, the specific functionalities it enabled, and how the UI was designed to enhance user experience. Additionally, I provided insights into how the project operates and interacts with users, highlighting its overall workflow and functionality.
What is Api?
What is GET used for in API?
Difference between “ == “ and “ === “ operators. (Link)
What is NaN property in JavaScript?
Difference among let ,var and const? (Link)
Explain Higher Order Functions in javascript.
In this round, I was asked two Data Structures and Algorithms (DSA) questions. These questions were aimed at evaluating my coding skills, problem-solving abilities, and logical thinking.



You are given two strings 'str1' and 'str1'.
You have to tell whether these strings form an anagram pair or not.
examples include:
'triangle' and 'integral'
'listen' and 'silent'
Sample Input 1:
rasp spar
Sample Output 1:
True
Explanation For Sample Output 1:
Since both the strings have one 'a', one 'p', one 'r', and one 's', they are anagrams.
I used the map to solve this problem.



Given an array/list 'ARR' of integers and an integer ‘K’. You are supposed to return the length of the shortest subarray that has a sum greater than or equal to ‘K’. If there is no subarray with a sum greater than or equal to K, then return -1.
Sample Input 1 :
2
5 12
3 6 7 4 3
Sample Output 1 :
2
Explanation of Sample Input 1 :
In the first test case, the subarray from index 1 to index 2, i.e. {6, 7} has a sum of 13, which is greater than 12; hence the answer is 2.
I used the brute force approach and then optimized it.
This round primarily focused on salary discussion and basic HR questions.

Here's your problem of the day
Solving this problem will increase your chance to get selected in this company
What is recursion?