Microsoft & Amazon Mülakat Sorusu - 21. Merge Two Sorted Lists

Описание: LeetCode içerisinde bulunan "Merge Two Sorted Lists" sorusunun açıklaması ve çözümü. Bu soruda size sıralı olarak verilen iki tane linked list'i birleştirip yine sıralı olarak döndürmeniz isteniyor.

#leetcode #programming #linkedlist

► LeetCode 21. Merge Two Sorted Lists: https://leetcode.com/problems/merge-t...

00:00 | Intro
00:15 | Sorunun açıklaması
05:05 | Çözümün kodlanması
13:02 | Outro

► Problem açıklaması:

Merge two sorted linked lists and return it as a sorted list. The list should be made by splicing together the nodes of the first two lists.

Example 1:

https://assets.leetcode.com/uploads/2...

Input: l1 = [1,2,4], l2 = [1,3,4]
Output: [1,1,2,3,4,4]

Example 2:

Input: l1 = [], l2 = []
Output: []

Example 3:

Input: l1 = [], l2 = [0]
Output: [0]

Constraints:

The number of nodes in both lists is in the range [0, 50].
-100 lessEqual Node.val lessEqual 100
Both l1 and l2 are sorted in non-decreasing order.

***

Sosyal Medya

► Twitter'dan takip edin:   / sonergonul  
► Twitch'ten takip edin:   / sonergonul  
► Discord kanalımız:   / discord  
► Quora'dan takip edin: https://www.quora.com/profile/Soner-G...

Destek

► ByNoGame: https://www.bynogame.com/destekle/son...
► Stremlabs: https://streamlabs.com/sonergonul/tip