# Tag Archives: Flipkart

Write an efficient program to find the sum of contiguous subarray within a one-dimensional array of numbers that has the largest sum.    Recommended: Please… Read More
Given two numbers represented by two linked lists, write a function that returns the sum list. The sum list is linked list representation of the… Read More
Given two numbers represented by two linked lists, write a function that returns the sum list. The sum list is linked list representation of the… Read More
Given two numbers represented by two linked lists, write a function that returns the sum list. The sum list is linked list representation of the… Read More
Given two numbers represented by two linked lists, write a function that returns the sum list. The sum list is linked list representation of the… Read More
Given a singly linked list, find the middle of the linked list. For example, if the given linked list is 1->2->3->4->5 then the output should… Read More
Given a singly linked list, find the middle of the linked list. For example, if the given linked list is 1->2->3->4->5 then the output should… Read More
Given a singly linked list, find the middle of the linked list. For example, if the given linked list is 1->2->3->4->5 then the output should… Read More
Given a singly linked list, find the middle of the linked list. For example, if the given linked list is 1->2->3->4->5 then the output should… Read More
Given a singly linked list, find the middle of the linked list. For example, if the given linked list is 1->2->3->4->5 then the output should… Read More
An element in a sorted array can be found in O(log n) time via binary search. But suppose we rotate an ascending order sorted array… Read More
An element in a sorted array can be found in O(log n) time via binary search. But suppose we rotate an ascending order sorted array… Read More
An element in a sorted array can be found in O(log n) time via binary search. But suppose we rotate an ascending order sorted array… Read More
An element in a sorted array can be found in O(log n) time via binary search. But suppose we rotate an ascending order sorted array… Read More
An element in a sorted array can be found in O(log n) time via binary search. But suppose we rotate an ascending order sorted array… Read More