Merge pull request vJechsmayr#235 from tanmoyee04/master

uploaded Problem no. 62 i.e. Unique Paths

Author: vJechsmayr

LeetCode/0062_Unique_Paths.py

@@ -0,0 +1,3 @@
+class Solution:
+ def uniquePaths(self, m: int, n: int) -> int:
+ return math.factorial(n+m-2)//(math.factorial(m-1)*math.factorial(n-1))

LeetCode/0083_Remove_Dupticates_from_Sorted_List.py

@@ -0,0 +1,19 @@
+# Definition for singly-linked list.
+# class ListNode:
+# def __init__(self, val=0, next=None):
+# self.val = val
+# self.next = next
+class Solution:
+ def deleteDuplicates(self, head: ListNode) -> ListNode:
+ if head==None:
+ return head
+ current= head.next
+ prev=head
+ while current!=None:
+ if current.val==prev.val:
+ prev.next=current.next
+ current=current.next
+ else:
+ current=current.next
+ prev=prev.next
+ return head