To Do#7

### For additional Interview - [ ] [Non overlapping Intervals](https://leetcode.com/problems/non-overlapping-intervals/) - [ ] [Word ladder](https://leetcode.com/problems/word-ladder/) - [ ] [Max Profit Job Scheduling](https://leetcode.com/problems/maximum-profit-in-job-scheduling/) - [ ] Represent a number into bits using repetitive division - [ ] [Beautiful Array](https://leetcode.com/problems/beautiful-array/) - [ ] [Bitwise AND of range of numbers](https://leetcode.com/problems/bitwise-and-of-numbers-range/) - [ ] Closest Binary Search Tree Value - [ ] [Shortest distance from all buildings](https://www.lintcode.com/problem/803/description) ### Checks: - [x] Recent questions of the company via blind, leetcode discuss - [ ] Most frequent questions of the company - [x] Blind top 75 questions list - [x] Top interview questions - [ ] Leetcode curated algo 170 (use leetfree/ lintcode) - [ ] SDE Sheet by Striver - [x] Top 100 Liked questions - [x] [others](https://tenderleo.gitbooks.io/leetcode-solutions-/content/GoogleMedium/334.html) * Understand and calculate complexity of standard solutions (eg BFS, dp) ### Python - [x] heapq - [ ] sorted containers: [Contains Duplicate III](https://leetcode.com/problems/contains-duplicate-iii/) - [x] deque - [ ] bisect