10+ Adani Enterprises Interview Questions and Answers

Merge two sorted arrays into one sorted array with one traversal.

• Use two pointers to track the current elements in arrays A and B.

• Compare the elements at the current pointers and insert the smaller one into array A.

• Move the pointer of the array from which the smaller element was inserted.

• Repeat the above steps until all elements are merged into array A.

To get the mth element of a stack with n elements, without using another stack.

• Create a temporary variable to store the mth element

• Pop the top (n-m) elements from the stack and discard them

• Pop and store the mth element in the temporary variable

• Push back the discarded elements to the stack

• Return the temporary variable as the result

Sort a linked list by nodes whose alternate nodes are already sorted.

• Traverse the linked list and identify the alternate nodes.

• Sort the alternate nodes using any sorting algorithm.

• Merge the sorted alternate nodes back into the original linked list.

Macros are preprocessor directives that replace code at compile time. They offer faster execution but can be error-prone.

• Macros are faster than functions as they are replaced at compile time

• Macros can be used for conditional compilation

• Macros can be used to define constants

• Macros can be error-prone as they do not undergo type-checking

• Macros can make code harder to read and debug

A function to delete nodes from a Dequeue.

• Create a function that takes the Dequeue and the value of the node to be deleted as parameters.

• Traverse the Dequeue to find the node with the given value.

• If the node is found, update the pointers of the previous and next nodes to bypass the node to be deleted.

• If the node is the first or last node, update the head or tail pointers accordingly.

• Free the memory allocated to the node.

• Handle cases where the Dequeue is empty or the node is n...read more

I have completed my major training in computer science and have future plans to specialize in software development.

• Completed major training in computer science

• Future plans to specialize in software development

• Continuously learning and updating skills

• Attending relevant workshops and conferences

• Building personal projects to enhance practical knowledge

The answer provides a solution to print all permutations of a given string.

• Use recursion to generate all possible permutations

• Swap characters at different positions to generate different permutations

• Use a set to avoid duplicates

Answering questions related to file transfer, server health check, core in Linux, and server connectivity.

• For file transfer, use tools like SCP, SFTP, or Rsync.

• To check server health, use monitoring tools like Nagios, Zabbix, or Prometheus.

• To check core in Linux, use the command 'cat /proc/cpuinfo' or 'lscpu'.

• To connect one server to another, use tools like SSH or VPN.

• Ensure proper network configuration and security measures are in place.

• Regularly update and maintain servers ...read more

Yes, I have worked in international geographies.

• I have worked in multiple countries including the United States, Canada, and the United Kingdom.

• I have experience in managing international teams and collaborating with stakeholders from different cultures.

• I have successfully executed projects in diverse geographies, adapting to local regulations and business practices.

• I have a strong understanding of global markets and have helped organizations expand their presence internation...read more

To structure a Google Campaign, you need to define goals, create ad groups, select keywords, write compelling ad copy, set bids and budgets, and regularly monitor and optimize performance.

• Define campaign goals and objectives

• Create ad groups based on themes or product categories

• Select relevant keywords for each ad group

• Write compelling ad copy that includes keywords

• Set bids and budgets to control spending

• Regularly monitor campaign performance and make necessary optimizations