Cisco Software Developer Interview Questions and Answers

Program to convert 24hr input into AM-PM formatted output

• Create a function that takes a 24-hour time input as a string

• Use the datetime module in Python to convert the input to a datetime object

• Format the datetime object to display in AM-PM format

• Return the formatted time as a string

Add the values of two linked lists and return the sum as a new linked list.

• Traverse both linked lists simultaneously and add the corresponding values along with any carry from the previous sum.

• Handle cases where one linked list is longer than the other by considering the remaining nodes and any carry.

• Create a new linked list to store the sum values and return it as the result.

Object-oriented programming concepts that focus on objects and classes for code organization and reusability.

• Encapsulation: bundling data and methods that operate on the data into a single unit (class)

• Inheritance: ability of a class to inherit properties and behavior from another class

• Polymorphism: ability to present the same interface for different data types

Find the longest subarray with sum 0 in an array of integers.

• Use a hash table to store the sum and its index.

• Iterate through the array and calculate the cumulative sum.

• If the cumulative sum is already in the hash table, then the subarray between the current index and the index in the hash table has a sum of 0.

• Keep track of the longest subarray with sum 0 seen so far.

• Return the length of the longest subarray with s...read more

Looping statements are used to execute a block of code repeatedly. Branching statements alter the flow of control in a program.

• Looping statements are used when we want to execute a block of code repeatedly until a certain condition is met.

• Examples of looping statements include for, while, and do-while loops.

• Branching statements are used to alter the normal flow of control in a program.

• Examples of branching stateme...read more

Find the length of the longest contiguous subarray that sums to zero in an array of integers.

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

• Iterate through the array, updating the sum and checking if the current sum exists in the hashmap.

• If the sum exists in the hashmap, update the maximum length of subarray with sum zero.

• Return the maximum length of subarray with sum zero.