ConsultAdd Interview Questions, Process, and Tips

Q1. Given an array Reverse array
Ans. 
Reverse array of strings
• Iterate through the array and swap elements from start to end

• Use two pointers, one at the beginning and one at the end, and swap elements until they meet
Answered by AI
Add your answer
Q2. Giaven a string Reverse string
Ans. 
Reverse a given string
• Use built-in functions like reverse() or loop through the string in reverse order

• Create a new string and append characters from the original string in reverse order

• Convert the string to an array of characters, reverse the array, and then join it back into a string
Answered by AI
Add your answer
Q3. Given array find sum of all elements
Ans. 
Calculate sum of all elements in a given array of strings
• Iterate through the array and convert each element to integer before adding to sum

• Handle edge cases like empty array or non-numeric elements

• Return the final sum after iterating through all elements
Answered by AI
Add your answer

Q1. What is an abstract class?
Ans. 
An abstract class is a class that cannot be instantiated and may contain abstract methods that must be implemented by its subclasses.
• Cannot be instantiated directly

• May contain abstract methods

• Used as a blueprint for other classes
Answered by AI
Add your answer
Q2. What is abstraction?
Ans. 
Abstraction is the process of hiding complex details and showing only the essential features of an object or system.
• Abstraction allows us to focus on what an object does, rather than how it does it

• It helps in simplifying complex systems by breaking them down into smaller, more manageable parts

• Examples of abstraction include using a car without needing to understand its internal combustion engine, or using a smartphone
Answered by AI
Add your answer
Q3. Best sorting algo?time complexity of it?
Ans. 
QuickSort is one of the best sorting algorithms with an average time complexity of O(n log n).
• QuickSort is a divide and conquer algorithm that works by selecting a 'pivot' element and partitioning the array around the pivot.

• It has an average time complexity of O(n log n) and a worst-case time complexity of O(n^2).

• Example: ['apple', 'banana', 'cherry', 'date', 'fig'] can be sorted using QuickSort.

• Example: ['3', '1', '4'...read more
Answered by AI
Add your answer
Q4. You have been provided a sorted list time complexity achieved after we apply bubble sorting
Ans. 
Bubble sorting has a time complexity of O(n^2) for a sorted list.
• Bubble sorting has a worst-case time complexity of O(n^2) for a sorted list.

• The time complexity does not change even if the list is already sorted.

• Example: If we have a sorted list of size n, bubble sorting will still take O(n^2) time.
Answered by AI
Add your answer

Q1. Have you ever been to a state other than jharkhand?
Ans. 
Yes, I have been to multiple states other than Jharkhand.
• I have traveled to states like Maharashtra, Karnataka, and Tamil Nadu for work and leisure.

• I have visited tourist destinations in states like Rajasthan, Kerala, and Himachal Pradesh.

• I have family in states like Uttar Pradesh, Bihar, and West Bengal, which I have visited multiple times.
Answered by AI
Add your answer

Questions related to rfp and procurement law

Q1. Regarding indian contract act
Add your answer
Q2. Regarding indian competition law
Add your answer

Q1. Question related to oops
Add your answer
Q2. Question related to coding
Add your answer
Q3. I was rejected after 2nd round
Add your answer

Q1. Question related to advanced topic in oops
Add your answer
Q2. Question related to coding
Add your answer