Leetcode 21: Merge Two Sorted Lists

21. Merge Two Sorted Lists Total Accepted: 167826 Total Submissions: 448665 Difficulty: Easy Contributors: Admin Merge two sorted linked lists and return it as a new list. The new list should be made by splicing together the nodes of the first two lists. Code # Definition for singly-linked list. # class ListNode(object): # def __init__(self, …

Leetcode 14: Longest Common Prefix

14. Longest Common Prefix Total Accepted: 131998 Total Submissions: 438812 Difficulty: Easy Contributors: Admin Write a function to find the longest common prefix string amongst an array of strings.   Code class Solution(object): def longestCommonPrefix(self, strs): “”” :type strs: List[str] :rtype: str “”” if not strs: return “” prefix = “” for k in xrange(len(strs[0])): …

Leetcode 24: Swap Nodes in Pairs

24. Swap Nodes in Pairs  Total Accepted: 130373 Total Submissions: 354429 Difficulty: Easy Contributors: Admin Given a linked list, swap every two adjacent nodes and return its head. For example,Given 1->2->3->4, you should return the list as 2->1->4->3. Your algorithm should use only constant space. You may not modify the values in the list, only …

Leetcode 19: Remove Nth Node From End of List

19. Remove Nth Node From End of List  Total Accepted: 140954 Total Submissions: 445848 Difficulty: Easy Contributors: Admin Given a linked list, remove the nth node from the end of list and return its head. For example, Given linked list: 1->2->3->4->5, and n = 2. After removing the second node from the end, the linked …