An extension of median of two sorted arrays of equal size problemġ. Merge two sorted lists and compute median, O(m + n) and O(m + n)Ģ. Remember the character index and current check pos, if character index >= current pos, then there is duplicateġ. Longest Substring Without Repeating CharactersĢ. Sort and search with two points O(n) and O(1) space. Check it out, if you are interested in big data and deep learning. I'm currently working on Analytics-Zoo - an unified Data Analytics and AI platform.
If you want full study checklist for code & whiteboard interview, please turn to jwasham's coding-interview-university.Īlso, there are open source implementations for basic data structs and algorithms, such as Algorithms in Python and Algorithms in Java. Remember solutions are only solutions to given problems.
Python & JAVA Solutions for Leetcode (inspired by haoel's leetcode)
0 kommentar(er)
