Write an efficient program to find the sum of contiguous subarray within a one-dimensional array of numbers that has the largest sum....
Given an unsorted array of nonnegative integers, find a continuous subarray which adds to a given number. Examples :...
Write a function that takes a list sorted in non-decreasing order and deletes any duplicate nodes from the list. The list should only be traversed once. For example if the linked list is 11->11->11->21->43->43->60 then removeDuplicates() should convert the list to 11->21->43->60....
Given a linked list where every node represents a linked list and contains two pointers of its type:...
Given an unsorted array and a number n, find if there exists a pair of elements in the array whose difference is n. Examples:...
Given an unsorted array of nonnegative integers, find a continuous subarray which adds to a given number. Examples :...
Given an unsorted array and a number n, find if there exists a pair of elements in the array whose difference is n. Examples:...
Given an unsorted array and a number n, find if there exists a pair of elements in the array whose difference is n. Examples:...
I am thrilled to share my recent experience with the VISA campus recruitment drive, which proved to be both challenging and rewarding. This opportunity not only allowed me to showcase my skills but also provided insights into the intricacies of technical interviews and system design. Here’s a detailed account of my journey through the various rounds:...
Given a pointer to a node to be deleted, delete the node. Note that we don’t have a pointer to the head node....
Visa visited our college this August for both internship and full-time roles. I was an applicant for the full time. There was 1 coding round, post which shortlisted students attended 3 technical interviews....
