Time Complexity: O(N+M)
Space Complexity: O(1) *If recursion stack is considered then it is O(N+M)
Problem link: https://leetcode.com/problems/merge-two-sorted-lists/
Java Code link: https://github.com/niteshnanda02/Leetcode/blob/master/21-merge-two-sorted-lists/21-merge-two-sorted-lists.java
๐๐ฒ๐ฒ๐น ๐ณ๐ฟ๐ฒ๐ฒ ๐๐ผ ๐ฐ๐ผ๐บ๐บ๐ฒ๐ป๐ ๐ถ๐ณ ๐๐ผ๐ ๐ต๐ฎ๐๐ฒ ๐ฎ๐ป๐ ๐ฑ๐ผ๐๐ฏ๐๐ ๐ฎ๐ฏ๐ผ๐๐ ๐๐ต๐ฒ ๐ฐ๐ผ๐ฑ๐ฒ ๐ผ๐ฟ ๐๐ต๐ฒ ๐น๐ผ๐ด๐ถ๐ฐ!!
๐ดMy contact details
LinkedIn: https://www.linkedin.com/in/nitesh-nanda-2590a6172/
Twitter: https://twitter.com/Nitesh_Nanda_
Instagram: https://www.instagram.com/nitesh_nanda_/
#LinkedList
#Recursion
#DataStructuresAndAlgorithms
#Leetcode
#ConsitencyChallenge
#NiteshNanda
