Airtel Africa Interview Questions and Answers

Find pairs in a list of integers that sum to a specified target value.

• Use a hash map to store numbers and their indices for quick lookup.

• Iterate through the list and check if (target - current number) exists in the hash map.

• Example: For list [1, 2, 3, 4] and target 5, pairs are (1, 4) and (2, 3).

• Consider edge cases like duplicates and negative numbers.

I have over 10 years of experience managing diverse projects, ensuring timely delivery and stakeholder satisfaction.

• Led a cross-functional team of 15 in a software development project, delivering ahead of schedule by 2 weeks.

• Implemented Agile methodologies, resulting in a 30% increase in team productivity.

• Managed a $2 million budget for a healthcare IT project, achieving a 15% cost saving through effective resourc...read more

The start point of a linked list is the first node in the list.

• The start point is typically referred to as the 'head' of the linked list.

• It is the entry point for traversing the linked list.

• Example: In a linked list with nodes A -> B -> C, A would be the start point.

View binding simplifies UI interactions in Android by providing type-safe access to views.

• View binding is enabled in the build.gradle file: 'android { viewBinding { enabled = true } }'

• It generates a binding class for each XML layout file, e.g., 'ActivityMainBinding' for 'activity_main.xml'.

• Access views directly using the binding object, e.g., 'binding.textView.setText('Hello World!')'.

• No need for 'findViewById', r...read more

Design a data pipeline to ingest data from streaming sources.

• Identify the streaming sources and their data formats

• Choose a streaming platform like Apache Kafka or AWS Kinesis

• Design the pipeline architecture with data ingestion, processing, and storage components

• Ensure scalability, fault-tolerance, and data consistency

• Monitor and optimize the pipeline performance

Merge two sorted linked lists without using extra space

• Traverse both lists simultaneously and compare nodes

• Attach smaller node to result list and move pointer to next node

• Repeat until both lists are exhausted

• Return the head of the merged list