Dholera Industrial City Development Interview Questions and Answers

Very basic aptitude test. basic aptitude mcqs are there

Q1. Technical interview round was not that hard, easy to crack
Add your answer

There was one assignment given on talent acquisition topic.

Q1. Basic HR interaction round. HR asked some questions.
Add your answer

Q1. Introduce yourself , tell me about marketing,
Add your answer
Q2. Sell me something,hr type questions
Add your answer
Q3. How you convince the customer
Ans. 
I convince the customer by understanding their needs, providing relevant information, and building trust.
• Listen actively to their concerns and needs

• Provide relevant information and options

• Address any objections or doubts they may have

• Build trust through honesty and transparency

• Highlight the benefits and value of the service

• Offer personalized solutions

• Follow up and provide ongoing support
Answered by AI
Add your answer

Q1. Do you have any prior experience?
Add your answer
Q2. What do you mean by human resources?
Ans. 
Human resources refer to the people who make up the workforce of an organization and the management of their skills, knowledge, and abilities.
• Human resources involve managing and developing the workforce of an organization

• It includes recruitment, training, performance management, and employee relations

• HR also deals with compensation and benefits, compliance with labor laws, and workplace safety

• Effective HR practices ca...read more
Answered by AI
Add your answer
Q3. What can you tell us about country Inn?
Add your answer
Q4. What are your weaknesses?
Add your answer

Q1. Java, OOPS, Flutter basics
Add your answer

Q1. Isolates, Plugins, Event Loops
Add your answer

Q1. What is your current role
Add your answer

Q1. What are your strengths and weaknesses?
Add your answer

Round duration - 120 minutes
Round difficulty - Medium

Timing was 9: 30 AM. Platform was quite good and easy to understand.

Q1. Reverse Only Letters
You are given a string, ‘S’. You need to reverse the string where characters that are not an alphabet stay in the same place, and the rest reverse their positions.
Eg: “a-bcd” become...read more
Ans. Two Pointer Approach
Approach: Just like in order to reverse a string ‘S’ = “abcd”, we can can swap(S[0], S[3]) and swap(S[1],S[2]) to get new string “dcba”.
 
Similarly in this problem, we do the same using two pointers while ignoring the non-letter characters.
 
Eg: S = “a-bcd” we swap(S[0], S[4]) and swap(S[2], S[3]) to get the result.
 
Algorithm:
1. In the given string what we can do is maintain two variables ...read more
Answered by CodingNinjas
Add your answer
Q2. Find duplicates in array
You are given an array/list 'ARR' consisting of N integers, which contains elements only in the range 0 to N - 1. Some of the elements may be repeated in 'ARR'. You...read more
Ans. Sorting
1. The most trivial approach would be to sort the array/list ‘ARR’ and then return the duplicates.
2. After sorting the array in non-decreasing order, do the following for all the elements from i = 0 to i = n - 2:
   • If ARR[i] == ARR[i + 1], then add ARR[i] to the the output list.
   • While ARR[i] == ARR[i + 1], do i = i + 1, since we don’t want to add the same duplicate elements again and again.
   • Else continue.
3. After this loop, w...read more
Answered by CodingNinjas
View 1 more amswer
Q3. Pancake Sorting
You are given an array of integers ‘ARR’. Sort the array by performing a series of pancake flips. In one pancake flip, we do the following steps:
Choose an integer ‘K’ where 1 <= ‘K’ &l...read more
Ans. Pancake Sorting.
The main idea to solve this problem is that if we want to place a number at an index, then we need a maximum of 2 moves that are:- 
 
1. Bring it to the 0th index by reversing the prefix array till its index, e.g., if you chose some index K, then reverse the array from 0th index till Kth index.
2. Reverse the prefix array from the 0th index to the index where we want to place it.
• The main algorithm runs...read more
Answered by CodingNinjas
Add your answer
Q4. Sum of Digits
Ninja is given an integer ‘N’. One day Ninja decides to do the sum of all digits and replace the ‘N’ with the sum of digits until it becomes less than 10. Ninja wants to find what will be the...read more
Ans. Brute Force Approach
The main idea is to do the sum of digits until it becomes less than 10.
 
Algorithm:
• Add a condition if N is less than 10 then return N.
• Do the sum of all digits.
• Make a recursive call and pass the sum of digits as N.
• Return the answer which you get from a recursive call.
Space Complexity: O(1)Explanation:
O(1).
 
We are using constant space to solve this.
Time Complexity: OtherExplanation:
O(log10(...read more
Answered by CodingNinjas
View 1 more amswer

Round duration - 30 minutes
Round difficulty - Medium

Timing was 9:30 AM. The interviewer was very nice.

Q1. Fibonacci Number
You are given an integer, all you have to do is to find whether this number is a Fibonacci number or not.
Fn is said to be a Fibonacci sequence such that each number in Fn is the sum of ...read more
Ans. Brute Force
The basic idea is to keep generating Fibonacci numbers until we find a number equal to the given number or the generated number becomes greater than the given number. If the generated number is equal to the given number then it means the given number is a Fibonacci number. Otherwise, it is not a Fibonacci number.
 
The steps are as follows:
 
1. Check if ‘N’ is 0 or 1, return true.
2. Create two variables ‘a’...read more
Answered by CodingNinjas
View 1 more amswer
Q2. SQL Question
Write SQL query to find second highest salary from a Table.
Add your answer

Round duration - 30 Minutes
Round difficulty - Medium

Timing was 12 PM. Interviewer was not good.

Q1. Count Frequency
You are given a string 'S' of length 'N', you need to find the frequency of each of the characters from ‘a’ to ‘z’ in the given string.
Example :
Given 'S' : abcd...read more
Ans. Count Frequency
Since there are just 26 lower case characters, we can use an array of size 26 to store the result.
 
Here is the algorithm : 
 
1. Create an array (say, ‘FREQ’), where 0-th index stores the frequency of ‘a’, 1st index stores the frequency of ‘b’ and so on. So the last index i.e. 25th index stores the frequency of ‘z’.
2. Run a for loop from 0 to ‘N’ - 1 (say, iterator ‘i’), on the string and do the f...read more
Answered by CodingNinjas
Add your answer
Q2. DBMS Question
What is Normalization and 3NF?
Add your answer