Dhwani Rural Information Systems Angular Frontend Developer Interview Questions, Process, and Tips for Freshers

Q1. Find the second most occurrence of string.
Ans. 
Find the second most occurrence of string in an array of strings.
• Create a dictionary to store the count of each string in the array

• Sort the dictionary by count in descending order

• Return the key of the second element in the sorted dictionary
Answered by AI
Add your answer

Round duration - 90 minutes
Round difficulty - Easy

Timing was 10:00 AM. Platform was good.

Q1. 
Subarray With Given Sum Problem Statement
Given an array ARR of N integers and an integer S, determine if there exists a contiguous subarray within the array with a sum equal to S. If such a subarray exis...read more
Ans. 
Given an array of integers, find a subarray with a given sum S.
• Iterate through the array while keeping track of the current sum and start index.

• Use a hashmap to store the sum and its corresponding index.

• If the current sum - S is found in the hashmap, a subarray with sum S exists.

• Return the start index and current index as the end index.
Answered by AI
Add your answer
Q2. 
Remove Consecutive Duplicates Problem Statement
Given a string S, your task is to recursively remove all consecutive duplicate characters from the string.
Input:
String S
Output:
Output string
Constr...read more
Ans. 
Recursively remove consecutive duplicate characters from a string.
• Use recursion to check if the current character is the same as the next character, if so skip the next character

• Base case: if string length is 1, return the string

• Example: Input: 'aabbc' Output: 'abc'
Answered by AI
Add your answer

There was an OA on hackerearth of an hour. In that there were 20 MCQs and two DSA questions easy to medium on Heap, Hashmap and Subarray

Q1. Asked about previous worked project in last company
Add your answer
Q2. Asked one medium DSA question (DNA sequencing) and asked to design some schema
Add your answer
Q3. Asked one puzzle If there are 1000 bottles and one is poisonous, a rat will diw after one hour of drinking and you have only one hour to find out which bottle is poisonous, How many minimum rats you need ?
Add your answer

Aptitude questions with some basic coding questions

They have given 3 coding questions and some pseudo codings

Q1. Tell about your self
Add your answer
Q2. Some coding questions
Add your answer

Q1. One Puzzle to detect Defective Box
Add your answer
Q2. Previous Work Experience
Ans. 
I have 3 years of experience as a Software Developer at XYZ company.
• Developed web applications using Java and Spring framework

• Collaborated with cross-functional teams to deliver projects on time

• Implemented new features and enhancements based on client requirements
Answered by AI
Add your answer

Before Aptitude Test, There was a telephonic interview round in which they test your communication and ask questions about your education and projects. You just have to show your confidence to pass this round. After that, the aptitude test was quite easy. There are 15 questions all are doable in just 15 to 20 minutes of time span.

After that, The coding round takes place in which they provide you with a device with an online compiler of your preferred programming language and ask you to solve 4 questions without using any built-in function. The questions are based on Linked Lists, Stacks, Arrays, etc. You have to do it all manually. This round lasts up to 1 hour.

Q1. The technical round takes place in which they ask different questions from your coding round, a few concept-based ones, and also a few questions to test your thinking and problem-solving abilities like the...read more
Add your answer

Easy aptitude test containing mathematics and logical questions

4 leetcode easy to medium level

Q1. Questions on project and tech stack.
Add your answer

Q1. Find the second most occurrence if string in JavaScript
Ans. 
Find the second most occurrence of a string in an array of strings in JavaScript.
• Create a map to store the count of each string in the array

• Sort the map by values in descending order to find the most occurrence

• Return the key of the second element in the sorted map
Answered by AI
Add your answer