Shivam Palaskar (@shivampalaskar)
github

shivampalaskar

Twitter logo Share LinkedIn logo Share Facebook logo Share
  • Stars
    star
    29
  • Global Rank 505,517 (Top 18 %)
  • Followers 12
  • Following 3
  • Registered almost 5 years ago
  • Most used languages
    C
         100.0 %
  • Location 🇮🇳 India
  • Country Total Rank 19,564
  • Country Ranking
    C
         320

Top repositories

1

PreAssign_Feb20_Q_6

C
2
star
2

PreAssign_Feb20_Q_3

C
2
star
3

PreAssign_Feb20_Q_5

C
2
star
4

PreAssign_Feb20_Q_4

C
2
star
5

PreAssign_Feb20_Q_1

C
2
star
6

PreAssign_Feb20_Q_7

C
2
star
7

PreAssign_Feb20_Q_8

C
2
star
8

PreAssign_Feb20_Q_9

C
2
star
9

PreAssign_Feb20_Q_2

C
2
star
10

PreAssignment2

Assignments before start of course
C
1
star
11

LinearDoublyLinkedList

C
1
star
12

CurrentDateAndTime

C
1
star
13

LinearSinglyLinkedList

C
1
star
14

PreAssignments4

Assignments before course
C
1
star
15

Preassingment_Q_3

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)
1
star
16

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.
C
1
star
17

PreAssignment3

Assignment before start of course
C
1
star
18

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
C
1
star
19

StringSorting_BasedOn_Alphabet

C
1
star
20

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
C
1
star