Merge Two Sorted Lists - Swift Solution | Interview Question From Microsoft
Merge Two Sorted Lists, is a LeetCode problem from linked-list subdomain. This problem has also been asked in companies like Microsoft during the interview. In this post we will see how we can solve this challenge in Swift
Problem Description
You can find the full details of the problem Merge Two Sorted Lists at LeetCode
Solution
Time Complexity: O(n), Space Complexity: O(1)
Definition for singly-linked list.
public class ListNode {
public var val: Int
public var next: ListNode?
public init(_ val: Int) {
self.val = val
self.next = nil
}
}
Please check the main.swift snippet for the solution.
This solution originally posted at: Github by @soapyigu
Comments
Leave a comment
You are not LoggedIn but you can comment as an anonymous user which requires manual approval. For better experience please Login.