109. Convert Sorted List to Binary Search Tree - Day 6/31 Leetcode May Challenge

preview_player
Показать описание
Larry solves and analyzes this Leetcode problem as both an interviewer and an interviewee. This is a live recording of a real engineer solving a problem live - no cuts or edits!

#leetcode #coding #programming
Рекомендации по теме
Комментарии
Автор

Were you able to go back and forth on this one?

Algorithmist
Автор

I'm impressed. Your first insight and thought process were spot on, including the Big(0) analysis and the O(N) approach you mentioned at the end. Keep up the good work.

dandaman
Автор

It's funny, I did the same problem on binarysearch today without knowing it was a leetcode daily problem too haha. I did it using 3 pointers namely prev, slow and fast where slow being the mid. And prev being the part which i use to build subsequent tree on the left side.

tirthyme
join shbcf.ru