NPTEL » Programming, Data Structures And Algorithms Using Python

Please scroll down for latest Programs. 👇

Week 2 Programming Assignment

Due on 2023-08-10, 23:59 IST

Write three Python functions as specified below. Paste the text for all three functions together into the submission window. Your function will be called automatically with various inputs and should return values as specified. Do not write commands to read any input or print any output.

You may define additional auxiliary functions as needed.
In all cases you may assume that the value passed to the function is of the expected type, so your function does not have to check for malformed inputs.
For each function, there are normally some public test cases and some (hidden) private test cases.
"Compile and run" will evaluate your submission against the public test cases.
"Submit" will evaluate your submission against the hidden private test cases. There are 12 private test cases, with equal weightage. You will get feedback about which private test cases pass or fail, though you cannot see the actual test cases.
Ignore warnings about "Presentation errors".

A positive integer m is a prime product if it can be written as p×q, where p and q are both primes. .
Write a Python function primeproduct(m) that takes an integer m as input and returns True if m is a prime product and False otherwise. (If m is not positive, your function should return False.)
Here are some examples of how your function should work.
```
>>> primeproduct(6)
True

>>> primeproduct(188)
False

>>> primeproduct(202)
True
```
Write a function delchar(s,c) that takes as input strings s and c, where c has length 1 (i.e., a single character), and returns the string obtained by deleting all occurrences of c in s. If c has length other than 1, the function should return s
Here are some examples to show how your function should work.
```
 
>>> delchar("banana","b")
'anana'

>>> delchar("banana","a")
'bnn'

>>> delchar("banana","n")
'baaa'

>>> delchar("banana","an")
'banana'
```
Write a function shuffle(l1,l2) that takes as input two lists, 11 and l2, and returns a list consisting of the first element in l1, then the first element in l2, then the second element in l1, then the second element in l2, and so on. If the two lists are not of equal length, the remaining elements of the longer list are appended at the end of the shuffled output.
Here are some examples to show how your function should work.
```
>>> shuffle([0,2,4],[1,3,5])
[0, 1, 2, 3, 4, 5]

>>> shuffle([0,2,4],[1])
[0, 1, 2, 4]

>>> shuffle([0],[1,3,5])
[0, 1, 3, 5]
```

Your last recorded submission was on 2023-08-04, 15:25 IST

Select the Language for this assignment.

def factors(n):
    factorlist = []
    for i in range(1,n+1):
        if n%i == 0:
            factorlist.append(i)
    return(factorlist)
​
def isprime(n):
    return(factors(n) == [1,n])
​
def primeproduct(n):
    for i in range(1,n+1):
        if n%i == 0:
            if isprime(i) and isprime(n//i):
                return(True)
    return(False)
​
def delchar(s,c):
    if len(c) != 1:
        return(s)
    snew = ""
    for char in s:
        if char != c:
            snew = snew + char
    return(snew)
​
def shuffle(l1,l2):
    if len(l1) < len(l2):
        minlength = len(l1)
    else:
        minlength = len(l2)
    shuffled = []
    for i in range(minlength):
        shuffled.append(l1[i])
        shuffled.append(l2[i])
    shuffled = shuffled + l1[minlength:] + l2[minlength:]
    return(shuffled)

~~~THERE IS SOME INVISIBLE CODE HERE~~~

You may submit any number of times before the due date. The final submission will be considered for grading.

This assignment has Public Test cases. Please click on "Compile & Run" button to see the status of Public test cases. Assignment will be evaluated only after submitting using Submit button below. If you only save as or compile and run the Program , your assignment will not be graded and you will not see your score after the deadline.

Compilation : Passed
Public Test Cases: 10 / 10 Passed

Note: These tests may not be considered while scoring. Know more.

Public Test Cases	Input	Expected Output	Actual Output	Status
Test Case 1	primeproduct(6)	True	True\n	Passed after ignoring Presentation Error
Test Case 2	primeproduct(188)	False	False\n	Passed after ignoring Presentation Error
Test Case 3	primeproduct(202)	True	True\n	Passed after ignoring Presentation Error
Test Case 4	delchar("banana","b")	anana	anana\n	Passed after ignoring Presentation Error
Test Case 5	delchar("banana","a")	bnn	bnn\n	Passed after ignoring Presentation Error
Test Case 6	delchar("banana","n")	baaa	baaa\n	Passed after ignoring Presentation Error
Test Case 7	delchar("banana","an")	banana	banana\n	Passed after ignoring Presentation Error
Test Case 8	shuffle([0,2,4],[1,3,5])	[0, 1, 2, 3, 4, 5]	[0, 1, 2, 3, 4, 5]\n	Passed after ignoring Presentation Error
Test Case 9	shuffle([0,2,4],[1])	[0, 1, 2, 4]	[0, 1, 2, 4]\n	Passed after ignoring Presentation Error
Test Case 10	shuffle([0],[1,3,5])	[0, 1, 3, 5]	[0, 1, 3, 5]\n	Passed after ignoring Presentation Error

Private Test cases used for Evaluation	Status
Test Case 1	Passed
Test Case 2	Passed
Test Case 3	Passed
Test Case 4	Passed
Test Case 5	Passed
Test Case 6	Passed
Test Case 7	Passed
Test Case 8	Passed
Test Case 9	Passed
Test Case 10	Passed
Test Case 11	Passed
Test Case 12	Passed

........................................................................................................................................................

Week 3 Programming Assignment

Due on 2023-08-17, 23:59 IST

You may define additional auxiliary functions as needed.
In all cases you may assume that the value passed to the function is of the expected type, so your function does not have to check for malformed inputs.
For each function, there are normally some public test cases and some (hidden) private test cases.
"Compile and run" will evaluate your submission against the public test cases.
"Submit" will evaluate your submission against the hidden private test cases. There are 12 private test cases, with equal weightage. You will get feedback about which private test cases pass or fail, though you cannot see the actual test cases.
Ignore warnings about "Presentation errors".

Write a function expanding(l) that takes as input a list of integer l and returns True if the absolute difference between each adjacent pair of elements strictly increases.
Here are some examples of how your function should work.
```
  >>> expanding([1,3,7,2,9])
  True
```
Explanation: Differences between adjacent elements are 3-1 = 2, 7-3 = 4, 7-2 = 5, 9-2 = 7.
```
  >>> expanding([1,3,7,2,-3]) 
  False
```
Explanation: Differences between adjacent elements are 3-1 = 2, 7-3 = 4, 7-2 = 5, 2-(-3) = 5, so not strictly increasing.
```
  >>> expanding([1,3,7,10])
  False
```
Explanation: Differences between adjacent elements are 3-1 = 2, 7-3 = 4, 10-7 = 3, so not increasing.
Write a Python function sumsquare(l) that takes a nonempty list of integers and returns a list [odd,even], where odd is the sum of squares all the odd numbers in l and even is the sum of squares of all the even numbers in l.
Here are some examples to show how your function should work.
```
>>> sumsquare([1,3,5])
[35, 0]

>>> sumsquare([2,4,6])
[0, 56]

>>> sumsquare([-1,-2,3,7])
[59, 4]
```
A two dimensional matrix can be represented in Python row-wise, as a list of lists: each inner list represents one row of the matrix. For instance, the matrix
```
1  2  3  4
5  6  7  8
```
would be represented as [[1, 2, 3, 4], [5, 6, 7, 8]].
The transpose of a matrix converts each row into a column. The transpose of the matrix above is:
```
1  5
2  6
3  7
4  8
```
which would be represented as [[1, 5], [2, 6], [3, 7], [4, 8]].
Write a Python function transpose(m) that takes as input a two dimensional matrix m and returns the transpose of m. The argument m should remain undisturbed by the function.
Here are some examples to show how your function should work. You may assume that the input to the function is always a non-empty matrix.
```
>>> transpose([[1,2,3],[4,5,6]])
[[1, 4], [2, 5], [3, 6]]

>>> transpose([[1],[2],[3]])
[[1, 2, 3]]

>>> transpose([[3]])
[[3]]
```

Your last recorded submission was on 2023-08-10, 16:23 IST

Select the Language for this assignment.

def expanding(l):
    if len(l) < 3:
        return(True)
    for i in range(len(l)-2):
        diff = abs(l[i+1]-l[i])
        if diff >= abs(l[i+2]-l[i+1]):
            return(False)
    return(True)
​
def sumsquare(l):
    odd = 0
    even = 0
    for x in l:
        if x%2 :
            odd = odd + x**2
        else:
            even = even + x**2
    return([odd,even])
​
def transpose(m):
  list=[]
  c=len(m[0])
  r=len(m)
  for i in range(0,c):
    li=[]
    for j in range(0,r):
      li=li+[m[j][i]]
    list=list+[li] 
  return(list)

~~~THERE IS SOME INVISIBLE CODE HERE~~~

You may submit any number of times before the due date. The final submission will be considered for grading.

Private Test cases used for Evaluation	Status
Test Case 1	Passed
Test Case 2	Passed
Test Case 3	Passed
Test Case 4	Passed
Test Case 5	Passed
Test Case 6	Passed
Test Case 7	Passed
Test Case 8	Passed
Test Case 9	Passed
Test Case 10	Passed
Test Case 11	Passed
Test Case 12	Passed

........................................................................................................................................................

Week 4 Programming Assignment

Due on 2023-08-24, 23:59 IST

Write two Python functions as specified below. Paste the text for both functions together into the submission window. Your function will be called automatically with various inputs and should return values as specified. Do not write commands to read any input or print any output.

You may define additional auxiliary functions as needed.
In all cases you may assume that the value passed to the function is of the expected type, so your function does not have to check for malformed inputs.
For each function, there are normally some public test cases and some (hidden) private test cases.
"Compile and run" will evaluate your submission against the public test cases.
"Submit" will evaluate your submission against the hidden private test cases. There are 10 private test cases, with equal weightage. You will get feedback about which private test cases pass or fail, though you cannot see the actual test cases.
Ignore warnings about "Presentation errors".

Write a Python function histogram(l) that takes as input a list of integers with repetitions and returns a list of pairs as follows:.
- for each number n that appears in l, there should be exactly one pair (n,r) in the list returned by the function, where r is the number of repetitions of n in l.
- the final list should be sorted in ascending order by r, the number of repetitions. For numbers that occur with the same number of repetitions, arrange the pairs in ascending order of the value of the number.
For instance:
```
>>> histogram([13,12,11,13,14,13,7,7,13,14,12])
[(11, 1), (7, 2), (12, 2), (14, 2), (13, 4)]

>>> histogram([7,12,11,13,7,11,13,14,12])
[(14, 1), (7, 2), (11, 2), (12, 2), (13, 2)]

>>> histogram([13,7,12,7,11,13,14,13,7,11,13,14,12,14,14,7])
[(11, 2), (12, 2), (7, 4), (13, 4), (14, 4)]
```
A college maintains academic information about students in three separate lists
- Course details: A list of pairs of form (coursecode,coursename), where both entries are strings. For instance,
  [ ("MA101","Calculus"),("PH101","Mechanics"),("HU101","English") ]
- Student details: A list of pairs of form (rollnumber,name), where both entries are strings. For instance,
  [ ("UGM2018001","Rohit Grewal"),("UGP2018132","Neha Talwar") ]
- A list of triples of the form (rollnumber,coursecode,grade), where all entries are strings. For instance,
  [ ("UGM2018001", "MA101", "AB"), ("UGP2018132", "PH101", "B"), ("UGM2018001", "PH101", "B") ]. You may assume that each roll number and course code in the grade list appears in the student details and course details, respectively.
Your task is to write a function transcript (coursedetails,studentdetails,grades) that takes these three lists as input and produces consolidated grades for each student. Each of the input lists may have its entries listed in arbitrary order. Each entry in the returned list should be a tuple of the form
(rollnumber, name,[(coursecode_1,coursename_1,grade_1),...,(coursecode_k,coursename_k,grade_k)])
where the student has grades for k ≥ 1 courses reported in the input list grades.
The output list should be organized as follows.
- The tuples shold sorted in ascending order by rollnumber
- Each student's grades should sorted in ascending order by coursecode
For instance
```
 
>>>transcript([("MA101","Calculus"),("PH101","Mechanics"),("HU101","English")],[("UGM2021001","Rohit Grewal"),("UGP2021132","Neha Talwar")],[("UGM2021001","MA101","AB"),("UGP2021132","PH101","B"),("UGM2021001","PH101","B")])

[('UGM2021001', 'Rohit Grewal', [('MA101', 'Calculus', 'AB'), ('PH101', 'Mechanics', 'B')]), ('UGP2021132', 'Neha Talwar', [('PH101', 'Mechanics', 'B')])]

>>>transcript([("T1","Test 1"),("T2","Test 2"),("T3","Test 3")],[("Captain","Rohit Sharma"),("Batsman","Virat Kohli"),("No3","Cheteshwar Pujara")],[("Batsman","T1","14"),("Captain","T1","33"),("No3","T1","30"),("Batsman","T2","55") ,("Captain","T2","158"),("No3","T2","19"), ("Batsman","T3","33"),("Captain","T3","95"),("No3","T3","51")])

[('Batsman', 'Virat Kohli', [('T1', 'Test 1', '14'), ('T2', 'Test 2', '55'), ('T3', 'Test 3', '33')]), ('Captain', 'Rohit Sharma', [('T1', 'Test 1', '33'), ('T2', 'Test 2', '158'), ('T3', 'Test 3', '95')]),('No3', 'Cheteshwar Pujara', [('T1', 'Test 1', '30'), ('T2', 'Test 2', '19'), ('T3', 'Test 3', '51')])]
```

Your last recorded submission was on 2023-08-20, 15:49 IST

Select the Language for this assignment.

def histogram(l):
  tuplelist=[]
  for i in range(len(l)):
    v=l[i]
    count=0
    
    for j in range(len(l)):
      if l[j] == v:
        count+=1
    if i==0:
        tuplelist+=[(v,count)]
    else :
        for k in range(len(tuplelist)):
          if tuplelist[k] == (v,count):
            break
        else:
          tuplelist+=[(v,count)]
  
  SelectionSort(tuplelist)
  return(tuplelist)
​
​
def SelectionSort(l):
  for start in range(len(l)):
    minpos = start
    for i in range(start,len(l)):
      if l[i][1] < l[minpos][1]:
        minpos = i
      elif l[i][1] == l[minpos][1]:
        if l[i][0] < l[minpos][0]:
          minpos = i
    (l[start],l[minpos]) = (l[minpos],l[start])
  
def transcript (cd,st,gra):
  list=[]
  for i in range(len(st)):
    rollno = st[i][0]
    student_name= st[i][1]
    clist=[]
    for j in range(len(gra)):
      if gra[j][0] == rollno:
        coursecode= gra[j][1]
        grade= gra[j][2]
        for k in range(len(cd)):
          if cd[k][0] == coursecode:
            coursename = cd[k][1]
            break
        clist+=[(coursecode,coursename,grade)]
        csort(clist)
    list+=[(rollno,student_name,clist)]
  csort(list)
  return(list)
​
def csort(l):
  for start in range(len(l)): 
    minpos = start
    for i in range(start,len(l)):
      if l[i][0] < l[minpos][0]:
        minpos = i
    (l[start],l[minpos]) = (l[minpos],l[start])

~~~THERE IS SOME INVISIBLE CODE HERE~~~

You may submit any number of times before the due date. The final submission will be considered for grading.

Private Test cases used for Evaluation	Status
Test Case 1	Passed
Test Case 2	Passed
Test Case 3	Passed
Test Case 4	Passed
Test Case 5	Passed
Test Case 6	Passed
Test Case 7	Passed
Test Case 8	Passed
Test Case 9	Passed
Test Case 10	Passed

........................................................................................................................................................

Week 5 Programming Assignment

Due on 2023-08-31, 23:59 IST

For this assignment, you have to write a complete Python program. Paste your code in the window below.

You may define additional auxiliary functions as needed.
In all cases you may assume that the input to your program has the expected format, so your program does not have to check for malformed inputs.
There are some public test cases and some (hidden) private test cases.
"Compile and run" will evaluate your submission against the public test cases.
"Submit" will evaluate your submission against the hidden private test cases. There are 6 private test cases, with equal weightage. You will get feedback about which private test cases pass or fail, though you cannot see the actual test cases.
Ignore warnings about "Presentation errors".

The academic office at the Hogwarts School of Witchcraft and Wizardry has compiled data about students' grades. The data is provided as text from standard input in three parts: information about courses, information about students and information about grades. Each part has a specific line format, described below..

Information about courses
Line format: Course Code~Course Name~Semester~Year~Instructor
Information about students
Line format: Roll Number~Full Name
Information about grades
Line format: Course Code~Semester~Year~Roll Number~Grade

The possible grades are A, AB, B, BC, C, CD, D with corresponding grade points 10, 9, 8, 7, 6, 5 and 4. The grade point average of a student is the sum of his/her grade points divided by the number of courses. For instance, if a student has taken two courses with grades A and C, the grade point average is 8.50 = (10+7)÷2. If a student has not completed any courses, the grade point average is defined to be 0.

You may assume that the data is internally consistent. For every grade, there is a corresponding course code and roll number in the input data.

Each section of the input starts with a line containing a single keyword. The first section begins with a line containing Courses. The second section begins with a line containing Students. The third section begins with a line containing Grades. The end of the input is marked by a line containing EndOfInput.

Write a Python program to read the data as described above and print out a line listing the grade point average for each student in the following format:

Roll Number~Full Name~Grade Point Average

Your output should be sorted by Roll Number. The grade point average should be rounded off to 2 digits after the decimal point. Use the built-in function round().

Here is a sample input and its corresponding output.

Sample Input

Courses
TRAN~Transfiguration~1~2011-2012~Minerva McGonagall
CHAR~Charms~1~2011-2012~Filius Flitwick
Students
SLY2301~Hannah Abbott
SLY2302~Euan Abercrombie
SLY2303~Stewart Ackerley
SLY2304~Bertram Aubrey
SLY2305~Avery
SLY2306~Malcolm Baddock
SLY2307~Marcus Belby
SLY2308~Katie Bell
SLY2309~Sirius Orion Black
Grades
TRAN~1~2011-2012~SLY2301~AB
TRAN~1~2011-2012~SLY2302~B
TRAN~1~2011-2012~SLY2303~B
TRAN~1~2011-2012~SLY2305~A
TRAN~1~2011-2012~SLY2306~BC
TRAN~1~2011-2012~SLY2308~A
TRAN~1~2011-2012~SLY2309~AB
CHAR~1~2011-2012~SLY2301~A
CHAR~1~2011-2012~SLY2302~BC
CHAR~1~2011-2012~SLY2303~B
CHAR~1~2011-2012~SLY2305~BC
CHAR~1~2011-2012~SLY2306~C
CHAR~1~2011-2012~SLY2307~B
CHAR~1~2011-2012~SLY2308~AB
EndOfInput

Sample Output

SLY2301~Hannah Abbott~9.5
SLY2302~Euan Abercrombie~7.5
SLY2303~Stewart Ackerley~8.0
SLY2304~Bertram Aubrey~0
SLY2305~Avery~8.5
SLY2306~Malcolm Baddock~6.5
SLY2307~Marcus Belby~8.0
SLY2308~Katie Bell~9.5
SLY2309~Sirius Orion Black~9.0

Your last recorded submission was on 2023-08-22, 17:14 IST

Select the Language for this assignment.

# Convert letter grade to grade point
def gradetonum(grade):
    if grade == 'A':
        return(10)
    elif grade == 'AB':
        return(9)
    elif grade == 'B':
        return(8)
    elif grade == 'BC':
        return(7)
    elif grade == 'C':
        return(6)
    elif grade == 'CD':
        return(5)
    elif grade == 'D':
        return(4)
    else:
        return(0)
                   
# Set up three dictionaries to store data
rollname = {}    # Key: roll number, Value: Name
gradepoint = {}  # Key: roll number, Value: Cumulative grade points
coursecount = {} # Key: roll number, Value: Number of courses taken
​
nextline = input().strip()
while nextline.find("Courses") < 0:
    nextline = input().strip()
​
# Read course data
while nextline.find("Students") < 0:
    nextline = input().strip()
    # Course data is irrelevant for this problem!
​
# Read students data
nextline = input().strip()
while nextline.find("Grades") < 0:
    fields = nextline.split('~')
    roll=fields[0]
    name=fields[1]
    rollname[roll] = name   # Initialize
    gradepoint[roll] = 0    # Initialize
    coursecount[roll] = 0   # Initialize
    nextline = input().strip()
​
# Read grades data
nextline = input().strip()
while nextline.find("EndOfInput") < 0:
    fields = nextline.split('~')
    roll=fields[3]
    grade=fields[4]
    gradepoint[roll] += gradetonum(grade)  # Update
    coursecount[roll] += 1                 # Update
    nextline = input().strip()
​
# Print output
for roll in sorted(rollname.keys()):
    if coursecount[roll] > 0:
        gpa = round(gradepoint[roll]/coursecount[roll],2)
    else:
        gpa = 0
    print(roll,rollname[roll],gpa,sep='~',end='\n' )
​

You may submit any number of times before the due date. The final submission will be considered for grading.

Private Test cases used for Evaluation	Status
Test Case 1	Passed
Test Case 2	Passed
Test Case 3	Passed
Test Case 4	Passed
Test Case 5	Passed
Test Case 6	Passed

Week 8 Programming Assignment - Dividing Sequences

Due on 2023-09-21, 23:59 IST

For this assignment, you have to write a complete Python program. Paste your code in the window below.

You may define additional auxiliary functions as needed.
There are some public test cases and some (hidden) private test cases.
"Compile and run" will evaluate your submission against the public test cases
"Submit" will evaluate your submission against the hidden private test cases. There are 10 private test cases, with equal weightage. You will get feedback about which private test cases pass or fail, though you cannot see the actual test cases.
Ignore warnings about "Presentation errors".

Dividing Sequences

(IARCS OPC Archive, K Narayan Kumar, CMI)

This problem is about sequences of positive integers a1,a2,…,aN. A subsequence of a sequence is anything obtained by dropping some of the elements. For example, 3,7,11,3 is a subsequence of 6,3,11,5,7,4,3,11,5,3 , but 3,3,7 is not a subsequence of 6,3,11,5,7,4,3,11,5,3 .

A fully dividing sequence is a sequence a1,a2,…,aN where ai divides aj whenever i < j. For example, 3,15,60,720 is a fully dividing sequence.

Given a sequence of integers your aim is to find the length of the longest fully dividing subsequence of this sequence.

Consider the sequence 2,3,7,8,14,39,145,76,320

It has a fully dividing sequence of length 3, namely 2,8,320, but none of length 4 or greater.

Consider the sequence 2,11,16,12,36,60,71,17,29,144,288,129,432,993 .

It has two fully dividing subsequences of length 5,

2,11,16,12,36,60,71,17,29,144,288,129,432,993 and
2,11,16,12,36,60,71,17,29,144,288,129,432,993

and none of length 6 or greater.

Solution hint

Let the input be a1, a2, …, aN. Let us define Best(i) to be the length of longest dividing sequence in a1,a2,…ai that includes ai.

Write an expression for Best(i) in terms of Best(j) with j<i, with base case Best(1) = 1. Solve this recurrence using dynamic programming.

Full solution

Input format

The first line of input contains a single positive integer N indicating the length of the input sequence. Lines 2,…,N+1 contain one integer each. The integer on line i+1 is ai.

Output format

Your output should consist of a single integer indicating the length of the longest fully dividing subsequence of the input sequence.

Test Data

You may assume that N ≤ 2500.

Example:

Here are the inputs and outputs corresponding to the two examples discussed above.

Sample input 1:

Sample output 1:

Sample input 2:

Sample output 2:

Select the Language for this assignment.

n = int(input())
L = list()
bestvals =list()
best_stored = list()
for x in range(n):
  L.append(int(input()))
  best_stored.append(0)
​
best_stored[0] = 1
​
for i in range(n):
  maxval = 1
  for j in range(i):
    if L[i] % L[j] == 0:
      maxval = max(maxval,(best_stored[j])+1)
  best_stored[i] = maxval
​
print(max(best_stored),end="")

You may submit any number of times before the due date. The final submission will be considered for grading.

Compilation : Passed
Public Test Cases: 2 / 2 Passed

Note: These tests may not be considered while scoring. Know more.

Public Test Cases	Input	Expected Output	Actual Output	Status
Test Case 1	9 2 3 7 8 14 39 145 76 320	3	3	Passed
Test Case 2	14 2 11 16 12 36 60 71 17 29 144 288 129 432 993	5	5	Passed

Private Test cases used for Evaluation	Status
Test Case 1	Passed
Test Case 2	Passed
Test Case 3	Passed
Test Case 4	Passed
Test Case 5	Passed
Test Case 6	Passed
Test Case 7	Passed
Test Case 8	Passed
Test Case 9	Passed
Test Case 10	Passed

Swayam Solver

NPTEL Programming, Data Structures And Algorithms Using Python July 2023

Week 2 Programming Assignment

Week 3 Programming Assignment

Week 4 Programming Assignment

Week 5 Programming Assignment

Week 8 Programming Assignment - Dividing Sequences

Dividing Sequences

Solution hint

Input format

Output format

Test Data

Example:

Sample input 1:

Sample output 1:

Sample input 2:

Sample output 2:

No comments:

Post a Comment