shivampalaskar/Preassingment_Q_3

Stars
1
Language
Created almost 5 years ago
Updated almost 5 years ago

shivampalaskar/Preassingment_Q_3

shivampalaskar

There are no reviews yet. Be the first to send feedback to the community and the maintainers!

Find two numbers in given unsorted array, so that sum of two numbers which is closest to K. Note that sum should be less than K. If there are more than one answer, print any one. Examples: Input: arr[] = {2, 1, 4, 9, 2, 3, 8, 5}, k = 18 Output: (9, 8) Input: arr[] = {2, 1, 4, 9, 2, 3, 8, 6}, k = 13 Output: (9, 3) or (8, 4)

PreAssign_Feb20_Q_6

PreAssign_Feb20_Q_3

PreAssign_Feb20_Q_5

PreAssign_Feb20_Q_4

PreAssign_Feb20_Q_1

PreAssign_Feb20_Q_7

PreAssign_Feb20_Q_8

PreAssign_Feb20_Q_9

PreAssign_Feb20_Q_2

PreAssignment2

Assignments before start of course

LinearDoublyLinkedList

CurrentDateAndTime

LinearSinglyLinkedList

PreAssignments4

Assignments before course

PreAssignment_Q_6

Write a program to convert given integer into Roman string. Here is a chart of Roman numerals for 1 to 100 for your reference.

PreAssignment3

Assignment before start of course

PreAssignment_Q_1

Given an array arr[] of N integers, the task is to sort the array without changing the position of negative numbers (if any) i.e. the negative numbers need not be sorted. Examples: Input: arr[] = {2, -6, -3, 8, 4, 1} Output: 1 -6 -3 2 4 8 Input: arr[] = {-2, -6, -3, -8, 4, 1} Output: -2 -6 -3 -8 1 4

StringSorting_BasedOn_Alphabet

PreAssignment_Q_2

Given an unsorted sequence a[], the task is to find the K-th missing contiguous element in the increasing sequence of the array elements i.e. consider the array in sorted order and find the kth missing number. If no k-th missing element is there output -1. Note: Only elements exist in the range of minimum and maximum element to be considered. Examples: Input: arr[] = {2, 4, 10, 7}, k = 5 Output: 9 Missing elements in the given array: 3, 5, 6, 8, 9 5th missing is 9. Input: arr[] = {1, 3, 4}, k = 5 Output: -1