Solutions-To-Problems

KO | EN

gitlite — search

#javascript #ai #typescript #golang #android #rust #docker #macos #nodejs #awesome #pytorch #mcp #ios #open-source

Solutions-To-Problems

(★ 94)

Solutions to coding problems of Java, Python and SQL that can occur through high-tier interviews or while implementing algorithms used here in daily jobs & preparation advices for interviews.

Solutions-To-Problems 최신버젼 다운로드

최종 버전 다운로드 (.zip)

// repository documentation

Was this content helpful?

★ 0 (0 ratings)

<img height="222px" src="https://github.com/aurimas13/Solutions-To-Problems/blob/main/Public/solution.jpeg"/>

<h1 align="center"> Welcome to the Amazing World of Solutions! 🎉🎩🔮 </h1>
 Brace yourself as we dive into the most common solutions to problems from interviews of high-tier companies. 
 Featuring dazzling Python, Java, SQL & Pandas Solutions to challenges on LeetCode & HackerRank. 
 

 <a href="https://github.com/aurimas13/Solutions-To-Problems/tree/main/LeetCode/Python%20Solutions"><img alt="python" src="https://img.shields.io/badge/language-python-blue.svg?style=social&logo=python")></a>
 <a href="https://github.com/aurimas13/Solutions-To-Problems/tree/main/LeetCode/Java%20Solutions"><img alt="java" src="https://img.shields.io/badge/language-Java-blue.svg?style=social&logo=java"></a>
 <a href="https://github.com/aurimas13/Solutions-To-Problems/tree/main/LeetCode/SQL%20Solutions"><img alt="sql" src="https://img.shields.io/badge/language-SQL-blue.svg?style=social&logo=postgresql"></a>
 <a href="https://img.shields.io/github/last-commit/aurimas13/Solutions-To-Problems"><img alt="lastcommit" src="https://img.shields.io/github/last-commit/aurimas13/Solutions-To-Problems?style=social"/></a>
 <a href="https://img.shields.io/github/stars/aurimas13/Solutions-To-Problems"><img alt="stars" src="https://img.shields.io/github/stars/aurimas13/Solutions-To-Problems?style=social"/></a>
 <a href="https://img.shields.io/github/forks/aurimas13/Solutions-To-Problems"><img alt="twitter" src="https://img.shields.io/github/forks/aurimas13/Solutions-To-Problems?style=social"/>
 <a href="https://twitter.com/aanausedas"><img alt="twitter" src="https://img.shields.io/twitter/follow/aanausedas?style=social"/></a>

[//]: # ( <a href="https://github.com/aurimas13/HackerRank-LeetCode/blob/main/LICENSE"><img alt="license" src="https://img.shields.io/npm/l/express?style=social"></a>)

[//]: # ( <a href="https://github.com/badges/shields/pulse"><img alt="activity" src="https://img.shields.io/github/checks-status/aurimas13/Solutions-To-Problems></a>)
[//]: # ( <a href="https://coveralls.io/github/badges/shields"><img alt="coverage" src="https://img.shields.io/coveralls/github/badges/shields"></a>)

[//]: # ( <a href="https://github.com/aurimas13/Solutions-To-Problems/tree/main/LeetCode/SQL%20Solutions"><img alt="sql" src="https://img.shields.io/badge/language-sql-orange.svg?style=social&logo=sql"&#41;></a>)

[//]: # ( <a href="https://github.com/aurimas13/HackerRank-LeetCode/blob/main/LICENSE"><img alt="license" src="https://img.shields.io/npm/l/express?style=social"></a>)

[//]: # ()

[//]: # (https://activity-graph.herokuapp.com/graph?username=aurimas13&theme=minimal)

------

📢 Roll up, roll up! Welcome to the grand repository of brilliant code solutions. Constantly updated with enchanting **Python**, **Java**, **SQL** or **Pandas** solutions to bewitching problems found at [LeetCode](https://leetcode.com/problemset/all/) (mostly) or [HackerRank](https://www.hackerrank.com/domains/python). Share the thrill as we unravel the mysteries of high-tier companies like Google, Meta, Amazon, Apple, Spotify, and more!

🎪 Behold the mesmerizing progress of the LeetCode account, sprinkled with magical blog posts providing explanations on select solutions. Gaze upon it [here](https://leetcode.com/aurimas13/).

🎡 Marvel at the colorful array of LeetCode solutions in **Python** - [here](https://github.com/aurimas13/Solutions-To-Problems/tree/main/LeetCode/Python%20Solutions), **HackerRank** solutions in **Python** - [here](https://github.com/aurimas13/Solutions-To-Problems/tree/main/HackerRank/Python%20Solutions), **LeetCode** solutions in **Java** - [here](https://github.com/aurimas13/Solutions-To-Problems/tree/main/LeetCode/Java%20Solutions) and **LeetCode** [SQL Solutions](https://github.com/aurimas13/Solutions-To-Problems/tree/main/LeetCode/SQL%20Solutions) as well as **LeetCode** [Pandas Solutions](https://github.com/aurimas13/Solutions-To-Problems/tree/main/LeetCode/Pandas%20Solutions) and be fascinated by some videos of how I tackled problems [here](https://github.com/aurimas13/Solutions-To-Problems/tree/main/Video).

🔮 Each problem folder unveils the description of the problem and, sometimes, the solution and explanation. Click the name of the problem in the [Problems and Solutions](#problems-and-solutions), [Must Do Problems](#must-do-problems) or [Google Top](#google-top) to reveal its secrets.

🎭 Currently enchanting the world with **Python** & a touch of **Java** from **LeetCode** with a hand in **SQL** and sometimes **Pandas**. A daily Python problem from [LeetCode](https://leetcode.com/problemset/all/) has been vanquished since 28th of May 2022 and a daily Java solution also is being addded since 19<sump>th May 2023.

🎠 The magic continues with **SQL** & **Pandas** solutions of problems at *HackerRank* & *LeetCode*, coming soon to [HackerRank SQL Solutions]((https://github.com/aurimas13/Solutions-To-Problems/tree/main/HackerRank/SQL%20Solutions)) while now doing  [LeetCode SQL Solutions](https://github.com/aurimas13/Solutions-To-Problems/tree/main/LeetCode/SQL%20Solutions) and [LeetCode Pandas Solutions](https://github.com/aurimas13/Solutions-To-Problems/tree/main/LeetCode/Pandas%20Solutions).

# Table of Contents

- [Table of contents](#table-of-contents)
- [Preparation for Interiews](#preparation-for-interviews)
- [Problems and Solutions](#problems-and-solutions)
- [Total Number](#total-number)
- [Must Do Problems](#must-do-problems)
- [Google Top](#google-top)
- [License](#license)

# Preparation for Interviews

[(Back to top)](#table-of-contents)

🎩 To prepare for a mystical journey through a MAANG interview or a MAANG-level company interview and land a job in the enchanted realm of tech giants, we highly recommend the following spells:

1. Solve as many problems from our mesmerizing list as possible.
2. Join the mystical [Hackpack](https://www.hackpack.io/) community to learn the art of sorcery from fellow wizards.
3. Conjure your skills by solving the [Top LeetCode Problems](https://github.com/aurimas13/Solutions-To-Problems/blob/main/Public/TopLeetCodeProblems.md).
4. Master the incantations of [Python Skills](https://github.com/aurimas13/Solutions-To-Problems/blob/main/Public/PythonResources.md).
5. Test your wit with [Multiple Choice Questions]((https://github.com/aurimas13/Solutions-To-Problems/blob/main/Public/MCQ.txt)) to prove your magical prowess.
Embrace the magical journey of interview preparation, and may your code be ever enchanting! 🌟🌈🔮

# Problems and Solutions

There are over 500 solutions of all four languages of **Python** - [here](https://github.com/aurimas13/Solutions-To-Problems/tree/main/HackerRank/Python%20Solutions), **Java** - [here](https://github.com/aurimas13/Solutions-To-Problems/tree/main/LeetCode/Java%20Solutions) **Pandas** - [here](https://github.com/aurimas13/Solutions-To-Problems/tree/main/LeetCode/Pandas%20Solutions) and **SQL** - [here](https://github.com/aurimas13/Solutions-To-Problems/tree/main/LeetCode/SQL%20Solutions) with details which problems are solved at the particular folder.

### Total Number

Total number of LeetCode solutions per company are shown below:*

| Company Name | Total Solutions |
|--------|----------|
| Amazon | 433 |
| Google | 420 |
| Meta | 335 |
| Apple | 332 |
| Microsoft | 312 |
| Bloomberg | 285 |
| Adobe | 274 |
| Uber | 241 |
| Goldman Sachs | 200 |
| TikTok | 154 |
| LinkedIn | 125 |
| Airbnb | 97 |
| Tesla | 88 |
| X (Twitter) | 73 |
| DE Shaw | 44 |
| Spotify | 38 |
| Reddit | 21 |
| Netflix | 11 |
| Others | 770 |

* Updated daily. Details of the problems that belong to a specific company are linked to it.

-------

### Must Do Problems

[(Back to top)](#table-of-contents)

| No. | Question | Solution | Time Complexity | Space Complexity |
|-----|------------------------------------------------------------------------------------------------------------------------------------------------------|--------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|-----------------|----------------|
| 1   | [Two Sum](https://leetcode.com/problems/two-sum)                                                                                                     | [Two Sum](https://github.com/aurimas13/Solutions-To-Problems/blob/main/LeetCode/Python%20Solutions/Two%20Sum/two_sum.py)                                                                                                                   | O(n)            | O(n)           |
| 2   | [Merge Two Sorted Lists](https://leetcode.com/problems/merge-two-sorted-lists)                                                                       | [Merge Two Sorted Lists](https://github.com/aurimas13/Solutions-To-Problems/blob/main/LeetCode/Python%20Solutions/Merge%20Two%20Sorted%20Lists/merge_sorted.py)                                                                            | O(n)            | O(n)           |
| 3   | [Merge k Sorted Lists](https://leetcode.com/problems/merge-k-sorted-lists)                                                                           | [Merge k Sorted Lists](https://github.com/aurimas13/Solutions-To-Problems/blob/main/LeetCode/Python%20Solutions/Merge%20k%20Sorted%20Lists/sorted.py)                                                                                      | O(n log n)      | O(1)           |
| 4   | [Best Time to Buy and Sell Stock](https://leetcode.com/problems/best-time-to-buy-and-sell-stock)                                                     | [Best Time to Buy and Sell Stock](https://github.com/aurimas13/Solutions-To-Problems/blob/main/LeetCode/Python%20Solutions/Best%20Time%20to%20Buy%20and%20Sell%20Stock/best_buy_sell.py)                                                   | O(n)            | O(1)           |
| 5   | [Reverse Bits](https://leetcode.com/problems/reverse-bits)                                                                                           | [Reverse bits](https://github.com/aurimas13/Solutions-To-Problems/blob/main/LeetCode/Python%20Solutions/Reverse%20Bits/reverse.py)                                                                                                         | O(1)            | O(1)           |
| 6   | [Number of 1 Bits](https://leetcode.com/problems/number-of-1-bits)                                                                                   | [Number of 1 bits](https://github.com/aurimas13/Solutions-To-Problems/blob/main/LeetCode/Python%20Solutions/Number%20of%201%20bits/bits.py)                                                                                                | O(log n)        | O(1)           |
| 7   | [Contains Duplicate](https://leetcode.com/problems/contains-duplicate)                                                                               | [Contains Duplicate](https://github.com/aurimas13/Solutions-To-Problems/blob/main/LeetCode/Python%20Solutions/Contains%20Duplicate/duplicate.py)                                                                                           | O(n)            | O(n)           |
| 8   | [Meeting Rooms](https://leetcode.com/problems/meeting-rooms)                                                                                         | [Meeting Rooms](https://github.com/aurimas13/Solutions-To-Problems/blob/main/LeetCode/Python%20Solutions/Meeting%20Rooms/meeting_rooms.py)                                                                                                 | O(n log n)      | O(1)           |
| 9   | [Missing Number](https://leetcode.com/problems/missing-number)                                                                                       | [Missing Number](https://github.com/aurimas13/Solutions-To-Problems/blob/main/LeetCode/Python%20Solutions/Missing%20Number/missing_number.py)                                                                                              | O(n)            | O(1)           |
| 10  | [Counting Bits](https://leetcode.com/problems/counting-bits)                                                                                         | [Counting bits](https://github.com/aurimas13/Solutions-To-Problems/blob/main/LeetCode/Python%20Solutions/Counting%20Bits/bits.py)                                                                                                          | O(n log n)      | O(n)           |
| 11  | [Merge Intervals](https://leetcode.com/problems/merge-intervals)                                                                                     | [Merge Intervals](https://github.com/aurimas13/Solutions-To-Problems/blob/main/LeetCode/Python%20Solutions/Merge%20Intervals/merge.py)                                                                                                     | O(n log n)      | O(n)           |
| 12  | [Insert Interval](https://leetcode.com/problems/insert-interval)                                                                                     | [Insert Interval](https://github.com/aurimas13/Solutions-To-Problems/blob/main/LeetCode/Python%20Solutions/Insert%20Interval/insert.py)                                                                                                    | O(n)            | O(n)           |
| 13  | [Valid Palindrome](https://leetcode.com/problems/valid-palindrome)                                                                                   | [Valid Palindrome](https://github.com/aurimas13/Solutions-To-Problems/blob/main/LeetCode/Python%20Solutions/Valid%20Palindrome/palidrome.py)                                                                                               | O(n)            | O(n)           |
| 14  | [Valid Parentheses](https://leetcode.com/problems/valid-parentheses)                                                                                 | [Valid Parentheses](https://github.com/aurimas13/Solutions-To-Problems/blob/main/LeetCode/Python%20Solutions/Valid%20Parentheses/valid.py)                                                                                                 | O(n)            | O(n)           |
| 15  | [Climbing Stairs](https://leetcode.com/problems/climbing-stairs)                                                                                     | [Climbing Stairs](https://github.com/aurimas13/Solutions-To-Problems/blob/main/LeetCode/Python%20Solutions/Climbing%20Stairs/climb_stairs.py)                                                                                              | O(n)            | O(n)           |
| 16  | [Same Tree](https://leetcode.com/problems/same-tree)                                                                                                 | [Same Tree](https://github.com/aurimas13/Solutions-To-Problems/blob/main/LeetCode/Python%20Solutions/Same%20Tree/same_tree.py)                                                                                                             | O(log n)        | O(1)           |
| 17  | [Maximum Depth of Binary Tree](https://leetcode.com/problems/maximum-depth-of-binary-tree)                                                           | [Maximum Depth of Binary Tree](https://github.com/aurimas13/Solutions-To-Problems/blob/main/LeetCode/Python%20Solutions/Maximum%20Depth%20of%20Binary%20Tree/maximum_depth.py)                                                             | O(n)            | O(n)           |
| 18  | [Linked List Cycle](https://leetcode.com/problems/linked-list-cycle)                                                                                 | [Linked List Cycle](https://github.com/aurimas13/Solutions-To-Problems/blob/main/LeetCode/Python%20Solutions/Linked%20List%20Cycle/linked_list_cycle.py)                                                                                   | O(n)            | O(n)           |
| 19  | [Reverse Linked List](https://leetcode.com/problems/reverse-linked-list)                                                                             | [Reverse Linked List](https://github.com/aurimas13/Solutions-To-Problems/blob/main/LeetCode/Python%20Solutions/Reverse%20Linked%20List/reverse.py)                                                                                         | O(n)            | O(n)           |
| 20  | [Invert Binary Tree](https://leetcode.com/problems/invert-binary-tree)                                                                               | [Invert Binary Tree](https://github.com/aurimas13/Solutions-To-Problems/blob/main/LeetCode/Python%20Solutions/Invert%20Binary%20Tree/invert.py)                                                                                            | O(n)            | O(1)           |
| 21  | [Valid Anagram](https://leetcode.com/problems/valid-anagram)                                                                                         | [Valid Anagram](https://github.com/aurimas13/Solutions-To-Problems/blob/main/LeetCode/Python%20Solutions/Valid%20Anagram/valid.py)                                                                                                         | O(n)            | O(n)           |
| 22  | [Lowest Common Ancestor of a Binary Search Tree](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-search-tree)                       | [Lowest Common Ancestor of a Binary Search Tree](https://github.com/aurimas13/Solutions-To-Problems/blob/main/LeetCode/Python%20Solutions/Lowest%20Common%20Ancestor%20of%20a%20Binary%20Search%20Tree/lowest.py)                          | O(n)            | O(1)           |
| 23  | [Subtree of Another Tree](https://leetcode.com/problems/subtree-of-another-tree)                                                                     | [Subtree of Another Tree](https://github.com/aurimas13/Solutions-To-Problems/blob/main/LeetCode/Python%20Solutions/Subtree%20of%20Another%20Tree/subtree.py)                                                                               | O(n^2)          | O(n)           |
| 24  | [Combination Sum](https://leetcode.com/problems/combination-sum)                                                                                     | [Combination Sum](https://github.com/aurimas13/Solutions-To-Problems/blob/main/LeetCode/Python%20Solutions/Combination%20Sum/combine.py)                                                                                                   | O(2^n)          | O(n)           |
| 25  | [Container With Most Water](https://leetcode.com/problems/container-with-most-water)                                                                 | [Container With Most Water](https://github.com/aurimas13/Solutions-To-Problems/blob/main/LeetCode/Python%20Solutions/Container%20With%20Most%20Water/container.py)                                                                         | O(n)            | O(1)           |
| 26  | [3Sum](https://leetcode.com/problems/3sum)                                                                                                           | [3Sum](https://github.com/aurimas13/Solutions-To-Problems/blob/main/LeetCode/Python%20Solutions/3Sum/3Sum.py)                                                                                                                              | O(n^2)          | O(n)           |
| 27  | [Longest Substring Without Repeating Characters](https://leetcode.com/problems/longest-substring-without-repeating-characters)                       | [Longest Substring Without Repeating Characters](https://github.com/aurimas13/Solutions-To-Problems/blob/main/LeetCode/Python%20Solutions/Longest%20Substring%20Without%20Repeating%20Characters/longest.py)                               | O(n)            | O(n)           |
| 28  | [Longest Palindromic Substring](https://leetcode.com/problems/longest-palindromic-substring)                                                         | [Longest Palindromic Substring](https://github.com/aurimas13/Solutions-To-Problems/blob/main/LeetCode/Python%20Solutions/Longest%20Palindromic%20Substring/longest.py)                                                                     | O(n^2)          | O(1)           |
| 29  | [Rotate Image](https://leetcode.com/problems/rotate-image)                                                                                           | [Rotate Image](https://github.com/aurimas13/Solutions-To-Problems/blob/main/LeetCode/Python%20Solutions/Rotate%20Image/rotate.py)                                                                                                          | O(n^2)          | O(1)           |
| 30  | [Search in Rotated Sorted Array](https://leetcode.com/problems/search-in-rotated-sorted-array)                                                       | [Search in Rotated Sorted Array](https://github.com/aurimas13/Solutions-To-Problems/blob/main/LeetCode/Python%20Solutions/Search%20in%20Rotated%20Sorted%20Array/search.py)                                                                | O(log n)        | O(1)           |
| 31  | [Word Search](https://leetcode.com/problems/word-search)                                                                                             | [Word Search](https://github.com/aurimas13/Solutions-To-Problems/blob/main/LeetCode/Python%20Solutions/Word%20Search/search.py)                                                                                                            | O(n^2)          | O(n)           |
| 32  | [Word Break](https://leetcode.com/problems/word-break)                                                                                               | [Word Break](https://github.com/aurimas13/Solutions-To-Problems/blob/main/LeetCode/Python%20Solutions/Word%20Break/break.py)                                                                                                               | O(n^2)          | O(n)           |
| 33  | [Number of Islands](https://leetcode.com/problems/number-of-islands)                                                                                 | [Number of Islands](https://github.com/aurimas13/Solutions-To-Problems/blob/main/LeetCode/Python%20Solutions/Number%20of%20Islands/number.py)                                                                                              | O(n^2)          | O(n^2)         |
| 34  | [Coin Change](https://leetcode.com/problems/coin-change)                                                                                             | [Coin Change](https://github.com/aurimas13/Solutions-To-Problems/blob/main/LeetCode/Python%20Solutions/Coin%20Change/change.py)                                                                                                            | O(n^2)          | O(n)           |
| 35  | [Course Schedule](https://leetcode.com/problems/course-schedule)                                                                                     | [Course Schedule](https://github.com/aurimas13/Solutions-To-Problems/blob/main/LeetCode/Python%20Solutions/Course%20Schedule/course.py)                                                                                                    | O(n)            | O(n)           |
| 36  | [Decode Ways](https://leetcode.com/problems/decode-ways)                                                                                             | [Decode Ways](https://github.com/aurimas13/Solutions-To-Problems/blob/main/LeetCode/Python%20Solutions/Decode%20Ways/decode.py)                                                                                                            | O(n)            | O(n)           |
| 37  | [House Robber](https://leetcode.com/problems/house-robber)                                                                                           | [House Robber](https://github.com/aurimas13/Solutions-To-Problems/blob/main/LeetCode/Python%20Solutions/House%20Robber/house.py)                                                                                                           | O(n)            | O(1)           |
| 38  | [Group Anagrams](https://leetcode.com/problems/group-anagrams)                                                                                       | [Group Anagrams](https://github.com/aurimas13/Solutions-To-Problems/blob/main/LeetCode/Python%20Solutions/Group%20Anagrams/group.py)                                                                                                       | O(n)            | O(n)           |
| 39  | [Find the Duplicate Number](https://leetcode.com/problems/find-the-duplicate-number/)                                                                | [Find the Duplicate Number](https://github.com/aurimas13/Solutions-To-Problems/blob/main/LeetCode/Python%20Solutions/Find%20the%20Duplicate%20Number/find.py)                                                                              | O(n)            | O(n)           |
| 40  | [Find Minimum in Rotated Sorted Array](https://leetcode.com/problems/find-minimum-in-rotated-sorted-array)                                           | [Find Minimum in Rotated Sorted Array](https://github.com/aurimas13/Solutions-To-Problems/blob/main/LeetCode/Python%20Solutions/Find%20Minimum%20in%20Rotated%20Sorted%20Array/find.py)                                                    | O(log n)        | O(1)           |
| 41  | [Sum of Two Integers](https://leetcode.com/problems/sum-of-two-integers)                                                                             | [Sum of Two Integers](https://github.com/aurimas13/Solutions-To-Problems/blob/main/LeetCode/Python%20Solutions/Sum%20of%20Two%20Integers/sum.py)                                                                                           | O(1)            | O(1)           |
| 42  | [Maximum Subarray](https://leetcode.com/problems/maximum-subarray)                                                                                   | [Maximum Subarray](https://github.com/aurimas13/Solutions-To-Problems/blob/main/LeetCode/Python%20Solutions/Maximum%20Subarray/maximum.py)                                                                                                 | O(n)            | O(n)           |
| 43  | [Set Matrix Zeroes](https://leetcode.com/problems/set-matrix-zeroes)                                                                                 | [Set Matrix Zeroes](https://github.com/aurimas13/Solutions-To-Problems/blob/main/LeetCode/Python%20Solutions/Set%20Matrix%20Zeroes/set.py)                                                                                                 | O(n^2)          | O(n)           |
| 44  | [Maximum Product Subarray](https://leetcode.com/problems/maximum-product-subarray)                                                                   | [Maximum Product Subarray](https://github.com/aurimas13/Solutions-To-Problems/blob/main/LeetCode/Python%20Solutions/Maximum%20Product%20Subarray/maximum.py)                                                                               | O(n)            | O(n)           |
| 45  | [Longest Consecutive Sequence](https://leetcode.com/problems/longest-consecutive-sequence)                                                           | [Longest Consecutive Sequence](https://github.com/aurimas13/Solutions-To-Problems/blob/main/LeetCode/Python%20Solutions/Longest%20Consecutive%20Sequence/longest.py)                                                                       | O(n log n)      | O(1)           |
| 46  | [Palindromic Substrings](https://leetcode.com/problems/palindromic-substrings)                                                                       | [Palindromic Substrings](https://github.com/aurimas13/Solutions-To-Problems/blob/main/LeetCode/Python%20Solutions/Palindromic%20Substrings/palindromic.py)                                                                                 | O(n^2)          | O(n^2)         |
| 47  | [Spiral Matrix](https://leetcode.com/problems/spiral-matrix)                                                                                         | [Spiral Matrix](https://github.com/aurimas13/Solutions-To-Problems/blob/main/LeetCode/Python%20Solutions/Spiral%20Matrix/spiral.py)                                                                                                        | O(n^2)          | O(n^2)         |
| 48  | [Product of Array Except Self](https://leetcode.com/problems/product-of-array-except-self)                                                           | [Product of Array Except Self](https://github.com/aurimas13/Solutions-To-Problems/blob/main/LeetCode/Python%20Solutions/Product%20of%20Array%20Except%20Self/product.py)                                                                   | O(n)            | O(n)           |
| 49  | [Graph Valid Tree](https://leetcode.com/problems/graph-valid-tree)                                                                                   | [Graph Valid Tree](https://github.com/aurimas13/Solutions-To-Problems/blob/main/LeetCode/Python%20Solutions/Graph%20Valid%20Tree/graph.py)                                                                                                 | O(n)            | O(n)           |
| 50  | [Unique Paths](https://leetcode.com/problems/unique-paths)                                                                                           | [Unique Paths](https://github.com/aurimas13/Solutions-To-Problems/blob/main/LeetCode/Python%20Solutions/Unique%20Paths/unique.py)                                                                                                          | O(n^2)          | O(n^2)         |
| 51  | [Minimum Window Substring](https://leetcode.com/problems/minimum-window-substring)                                                                   | [Minimum Window Substring](https://github.com/aurimas13/Solutions-To-Problems/blob/main/LeetCode/Python%20Solutions/Minimum%20Window%20Substring/window.py)                                                                                | O(n)            | O(n)           |
| 52  | [Remove Nth Node From End of List](https://leetcode.com/problems/remove-nth-node-from-end-of-list)                                                   | [Remove Nth Node From End of List](https://github.com/aurimas13/Solutions-To-Problems/blob/main/LeetCode/Python%20Solutions/Remove%20Nth%20Node%20From%20End%20of%20List/remove.py)                                                        | O(n)            | O(1)           |
| 53  | [Jump Game](https://leetcode.com/problems/jump-game)                                                                                                 | [Jump Game](https://github.com/aurimas13/Solutions-To-Problems/blob/main/LeetCode/Python%20Solutions/Jump%20Game/jump.py)                                                                                                                  | O(n^2)          | O(1)           |
| 54  | [Reorder List](https://leetcode.com/problems/reorder-list)                                                                                           | [Reorder List](https://github.com/aurimas13/Solutions-To-Problems/blob/main/LeetCode/Python%20Solutions/Reorder%20List/reorder.py)                                                                                                         | O(n)            | O(n)           |
| 55  | [Validate Binary Search Tree](https://leetcode.com/problems/validate-binary-search-tree)                                                             | [Validate Binary Search Tree](https://github.com/aurimas13/Solutions-To-Problems/blob/main/LeetCode/Python%20Solutions/Validate%20Binary%20Search%20Tree/validate.py)                                                                      | O(n)            | O(n)           |
| 56  | [Binary Tree Level Order Traversal](https://leetcode.com/problems/binary-tree-level-order-traversal)                                                 | [Binary Tree Level Order Traversal](https://github.com/aurimas13/Solutions-To-Problems/blob/main/LeetCode/Python%20Solutions/Binary%20Tree%20Level%20Order%20Traversal/binary.py)                                                          | O(n)            | O(n)           |
| 57  | [Construct Binary Tree from Preorder and Inorder Traversal](https://leetcode.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal) | [Construct Binary Tree from Preorder and Inorder Traversal](https://github.com/aurimas13/Solutions-To-Problems/blob/main/LeetCode/Python%20Solutions/Construct%20Binary%20Tree%20from%20Preorder%20and%20Inorder%20Traversal/construct.py) | O(n)            | O(n)           | :heavy_check_mark:|:heavy_check_mark:|:heavy_check_mark:|:heavy_check_mark:|:heavy_check_mark:|:heavy_check_mark:|:x:|:x:|:x:|:x:|:x:|:x:|:x:|:x:|:x:|:x:|:x:|:x:|:heavy_check_mark:|
| 58  | [Clone Graph](https://leetcode.com/problems/clone-graph)                                                                                             | [Clone Graph](https://github.com/aurimas13/Solutions-To-Problems/blob/main/LeetCode/Python%20Solutions/Clone%20Graph/clone.py)                                                                                                             | O(n)            | O(n)           |
| 59  | [Kth Smallest Element in a BST](https://leetcode.com/problems/kth-smallest-element-in-a-bst)                                                         | [Kth Smallest Element in a BST](https://github.com/aurimas13/Solutions-To-Problems/blob/main/LeetCode/Python%20Solutions/Kth%20Smallest%20Element%20in%20a%20BST/smallest.py)                                                              | O(n)            | O(n)           |
| 60  | [Encode and Decode Strings](https://leetcode.com/problems/encode-and-decode-strings)                                                                 | [Encode and Decode Strings](https://github.com/aurimas13/Solutions-To-Problems/blob/main/LeetCode/Python%20Solutions/Encode%20and%20Decode%20Strings/encode_decode.py)                                                                     | O(n)            | O(n)           |
| 61  | [Design Add and Search Words Data Structure](https://leetcode.com/problems/design-add-and-search-words-data-structure)                               | [Design Add and Search Words Data Structure](https://github.com/aurimas13/Solutions-To-Problems/blob/main/LeetCode/Python%20Solutions/Design%20Add%20and%20Search%20Words%20Data%20Structure/design_add_search.py)                         | O(n)            | O(n)           |
| 62  | [Serialize and Deserialize BST](https://leetcode.com/problems/serialize-and-deserialize-bst)                                                         | [Serialize and Deserialize BST](https://github.com/aurimas13/Solutions-To-Problems/blob/main/LeetCode/Python%20Solutions/Serialize%20and%20Deserialize%20BST/serialialize_deserialize.py)                                                  | O(n)            | O(n)           |
| 63  | [Longest Common Subsequence](https://leetcode.com/problems/longest-common-subsequence)                                                               | [Longest Common Subsequence](https://github.com/aurimas13/Solutions-To-Problems/blob/main/LeetCode/Python%20Solutions/Longest%20Common%20Subsequence/longest.py)                                                                           | O(n)            | O(n)           |
| 64  | [Longest Increasing Subsequence](https://leetcode.com/problems/longest-increasing-subsequence)                                                       | [Longest Increasing Subsequence](https://github.com/aurimas13/Solutions-To-Problems/blob/main/LeetCode/Python%20Solutions/Longest%20Increasing%20Subsequence/longest.py)                                                                   | O(n^2)          | O(n)           |
| 65  | [Pacific Atlantic Water Flow](https://leetcode.com/problems/pacific-atlantic-water-flow)                                                             | [Pacific Atlantic Water Flow](https://github.com/aurimas13/Solutions-To-Problems/blob/main/LeetCode/Python%20Solutions/Pacific%20Atlantic%20Water%20Flow/pacific.py)                                                                       | O(n^2)          | O(n^2)         |
| 66  | [Top K Frequent Elements](https://leetcode.com/problems/top-k-frequent-elements)                                                                     | [Top K Frequent Elements](https://github.com/aurimas13/Solutions-To-Problems/blob/main/LeetCode/Python%20Solutions/Top%20K%20Frequent%20Elements/frequent.py)                                                                              | O(n)            | O(n)           |
| 67  | [Longest Repeating Character Replacement](https://leetcode.com/problems/longest-repeating-character-replacement)                                     | [Longest Repeating Character Replacement](https://github.com/aurimas13/Solutions-To-Problems/blob/main/LeetCode/Python%20Solutions/Longest%20Repeating%20Character%20Replacement/longest.py)                                               | O(n)            | O(1)           |
| 68  | [Non-overlapping Intervals](https://leetcode.com/problems/non-overlapping-intervals)                                                                 | [Non-overlapping intervals](https://github.com/aurimas13/Solutions-To-Problems/blob/main/LeetCode/Python%20Solutions/Non-overlapping%20Intervals/interval.py)                                                                              | O(n)            | O(n)           |
| 69  | [Number of Connected Components in an Undirected Graph](https://leetcode.com/problems/number-of-connected-components-in-an-undirected-graph)         | [Number of Connected Components in an Undirected Graph](https://github.com/aurimas13/Solutions-To-Problems/blob/main/LeetCode/Python%20Solutions/Number%20of%20Connected%20Components%20in%20an%20Undirected%20Graph/connected.py)         | O(log n)        | O(n)           |
| 70  | [Alien Dictionary](https://leetcode.com/problems/alien-dictionary)                                                                                   | [Alien Dictionary](https://github.com/aurimas13/Solutions-To-Problems/blob/main/LeetCode/Python%20Solutions/Alien%20Dictionary/alien.py)                                                                                                   | O(n log n)      | O(n)           |
| 71  | [Lowest Common Ancestor of a Binary Tree](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree)                                     | [Lowest Common Ancestor of a Binary Tree](https://github.com/aurimas13/Solutions-To-Problems/blob/main/LeetCode/Python%20Solutions/Lowest%20Common%20Ancestor%20of%20a%20Binary%20Tree/lowest.py)                                          | O(n)            | O(1)           |
| 72  | [Implement Trie (Prefix Tree)](https://leetcode.com/problems/implement-trie-prefix-tree)                                                             | [Implement Trie (Prefix Tree)](https://github.com/aurimas13/Solutions-To-Problems/blob/main/LeetCode/Python%20Solutions/Implement%20Trie%20(Prefix%20Tree)/implement.py)                                                                   | O(n)            | O(n)           |
| 73  | [House Robber II](https://leetcode.com/problems/house-robber-ii)                                                                                     | [House Robber II](https://github.com/aurimas13/Solutions-To-Problems/blob/main/LeetCode/Python%20Solutions/House%20Robber%20II/house.py)                                                                                                   | O(n)            | O(n)           |
| 74  | [Meeting Rooms II](https://leetcode.com/problems/meeting-rooms-ii)                                                                                   | [Meeting Rooms II](https://github.com/aurimas13/Solutions-To-Problems/blob/main/LeetCode/Python%20Solutions/Meeting%20Rooms%20II/meeting_rooms.py)                                                                                         | O(n log n)      | O(n)           |
| 75  | [Word Search II](https://leetcode.com/problems/word-search-ii)                                                                                       | [Word Search II](https://github.com/aurimas13/Solutions-To-Problems/blob/main/LeetCode/Python%20Solutions/Word%20Search%20II/search.py)                                                                                                    | O(n^2)          | O(n^2)         |
| 76  | [Binary Tree Maximum Path Sum](https://leetcode.com/problems/binary-tree-maximum-path-sum)                                                           | [Binary Tree Maximum Path Sum](https://github.com/aurimas13/Solutions-To-Problems/blob/main/LeetCode/Python%20Solutions/Binary%20Tree%20Maximum%20Path%20Sum/binary.py)                                                                    | O(n)            | O(n)           |
| 77  | [Find Median from Data Stream](https://leetcode.com/problems/find-median-from-data-stream)                                                           | [Find Median from Data Stream](https://github.com/aurimas13/Solutions-To-Problems/blob/main/LeetCode/Python%20Solutions/Find%20Median%20from%20Data%20Stream/median.py)                                                                    | O(log n)        | O(n)           |

---

### Google Top

[(Back to top)](#table-of-contents)

| No. | Question                                                                                                            | Solutiion                                                                                                                                          | Time Complexity | Space Complexity |
|-----|----------------------------------------------------------------------------------------------------------------------|--------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|-----------------|------------------|
| 1   | [Two Sum](https://leetcode.com/problems/two-sum)                                                                     | [Two Sum](https://github.com/aurimas13/Solutions-To-Problems/blob/main/LeetCode/Python%20Solutions/Two%20Sum/two_sum.py)                                                                         | O(n)            | O(n)             |
| 2   | [Maximal Rectangle](https://leetcode.com/problems/maximal-rectangle)                                                 | [Maximal Rectangle](https://github.com/aurimas13/Solutions-To-Problems/blob/main/LeetCode/Python%20Solutions/Maximal%20Rectangle/maximal.py)                                                     | O(n)            | O(n)             |
| 3   | [Insert Interval](https://leetcode.com/problems/insert-interval)                                                     | [Insert Interval](https://github.com/aurimas13/Solutions-To-Problems/blob/main/LeetCode/Python%20Solutions/Insert%20Interval/insert.py)                                                          | O(n)            | O(n)             |
| 4   | [X of a Kind in a Deck of Cards](https://leetcode.com/problems/x-of-a-kind-in-a-deck-of-cards)                       | [X of a Kind in a Deck of Cards](https://github.com/aurimas13/Solutions-To-Problems/blob/main/LeetCode/Python%20Solutions/X%20of%20a%20Kind%20in%20a%20Deck%20of%20Cards/deck.py)                | O(n log n)      | O(n)             |
| 5   | [Maximal Square](https://leetcode.com/problems/maximal-square)                                                       | [Maximal Square](https://github.com/aurimas13/Solutions-To-Problems/blob/main/LeetCode/Python%20Solutions/Maximal%20Square/maximal.py)                                                           | O(n^2)          | O(n^2)           |
| 6   | [Bulls and Cows](https://leetcode.com/problems/bulls-and-cows)                                                       | [Bulls and Cows](https://github.com/aurimas13/Solutions-To-Problems/blob/main/LeetCode/Python%20Solutions/Bulls%20and%20Cows/bulls_and_cows.py)                                                  | O(n)            | O(1)             |
| 7   | [Evaluate Division](https://leetcode.com/problems/evaluate-division)                                                 | [Evaluate Division](https://github.com/aurimas13/Solutions-To-Problems/blob/main/LeetCode/Python%20Solutions/Evaluate%20Division/evaluate.py)                                                    | O(n^2) | O(n^2) |
| 8   | [Decode String](https://leetcode.com/problems/decode-string)                                                         | [Decode String](https://github.com/aurimas13/Solutions-To-Problems/blob/main/LeetCode/Python%20Solutions/Decode%20String/decode.py)                                                              | O(n) | O(n) |
| 9   | [Longest String Chain](https://leetcode.com/problems/longest-string-chain)                                           | [Longest String Chain](https://github.com/aurimas13/Solutions-To-Problems/blob/main/LeetCode/Python%20Solutions/Longest%20String%20Chain/longest.py)                                                                                                                       |O(n log n)|O(n)|
| 10  | [Validate Stack Sequences](https://leetcode.com/problems/validate-stack-sequences)                                   | [Validate Stack Sequences](https://github.com/aurimas13/Solutions-To-Problems/blob/main/LeetCode/Python%20Solutions/Validate%20Stack%20Sequences/validate.py)                                    |O(n)|O(n)|
| 11  | [Minimum Window Substring](https://leetcode.com/problems/minimum-window-substring)                                   | [Minimum Window Substring](https://github.com/aurimas13/Solutions-To-Problems/blob/main/LeetCode/Python%20Solutions/Minimum%20Window%20Substring/window.py)                                      | O(n)            | O(n)             |
| 12  | [The Skyline Problem](https://leetcode.com/problems/the-skyline-problem)                                             | [The Skyline Problem](https://github.com/aurimas13/Solutions-To-Problems/blob/main/LeetCode/Python%20Solutions/The%20Skyline%20Problem/skyline.py)                                               | O(n log n)      | O(n)             |
| 13  | [Longest Increasing Path in a Matrix](https://leetcode.com/problems/longest-increasing-path-in-a-matrix)             | [Longest Increasing Path in a Matrix](https://github.com/aurimas13/Solutions-To-Problems/blob/main/LeetCode/Python%20Solutions/Longest%20Increasing%20Path%20in%20a%20Matrix/longest.py)          |O(n^2)|O(n^2)|
| 14  | [Find Median from Data Stream](https://leetcode.com/problems/find-median-from-data-stream)                           | [Find Median from Data Stream](https://github.com/aurimas13/Solutions-To-Problems/blob/main/LeetCode/Python%20Solutions/Find%20Median%20from%20Data%20Stream/median.py)                          | O(log n)        | O(n)             |
| 15  | [Count of Smaller Numbers After Self](https://leetcode.com/problems/count-of-smaller-numbers-after-self)             | [Count of Smaller Numbers After Self](https://github.com/aurimas13/Solutions-To-Problems/blob/main/LeetCode/Python%20Solutions/Count%20of%20Smaller%20Numbers%20After%20Self/count.py)           |O(n log n)|O(n)|
| 16  | [Network Delay Time](https://leetcode.com/problems/network-delay-time)                                               | [Network Delay Time](https://github.com/aurimas13/Solutions-To-Problems/blob/main/LeetCode/Python%20Solutions/Network%20Delay%20Time/network.py)                                               |O(n log n)|O(n)  |
| 17  | [Subarray Sum Equals K](https://leetcode.com/problems/subarray-sum-equals-k)                                         | [Subarray Sum Equals K](https://github.com/aurimas13/Solutions-To-Problems/blob/main/LeetCode/Python%20Solutions/Subarray%20Sum%20Equals%20K/subarray.py)                                        |O(n)|O(n)|
| 18  | [Max Sum of Rectangle No Larger Than K](https://leetcode.com/problems/max-sum-of-rectangle-no-larger-than-k)         | [Max Sum of Rectangle No Larger Than K](https://github.com/aurimas13/Solutions-To-Problems/blob/main/LeetCode/Python%20Solutions/Max%20Sum%20of%20Rectangle%20No%20Larger%20Than%20K/max.py)    |n log(n)|O(n)|
| 19  | [Split Array into Consecutive Subsequences](https://leetcode.com/problems/split-array-into-consecutive-subsequences) | [Split Array into Consecutive Subsequences](https://github.com/aurimas13/Solutions-To-Problems/blob/main/LeetCode/Python%20Solutions/Split%20Array%20into%20Consecutive%20Subsequences/split.py) |O(n)|O(n)|
| 20  | [Split Array Largest Sum](https://leetcode.com/problems/split-array-largest-sum)                                     | [Split Array Largest Sum](https://github.com/aurimas13/Solutions-To-Problems/blob/main/LeetCode/Python%20Solutions/Split%20Array%20Largest%20Sum%20/split.py)                                    |O(log n|O(1)|
| 21  | [Minimum Domino Rotations For Equal Row](https://leetcode.com/problems/minimum-domino-rotations-for-equal-row)       | [Minimum Domino Rotations For Equal Row](https://github.com/aurimas13/Solutions-To-Problems/blob/main/LeetCode/Python%20Solutions/Minimum%20Domino%20Rotations%20For%20Equal%20Row/minimum.py) | O(n)|O(1)|
| 22  | [Random Pick with Weight](https://leetcode.com/problems/random-pick-with-weight)                                     | [Random Pick with Weight](https://github.com/aurimas13/Solutions-To-Problems/blob/main/LeetCode/Python%20Solutions/Random%20Pick%20with%20Weight/random.py)                                      |O(log n)|O(n)|

---

# License

[//]: # ()
[LICENSE](https://github.com/aurimas13/HackerRank-Leetcode/blob/main/LICENSE)

Solutions-To-Problems

Solutions-To-Problems 최신버젼 다운로드

오늘의 추천 프로젝트

Was this content helpful?

Recent Feedback

Solutions-To-Problems

Solutions-To-Problems 최신버젼 다운로드

오늘의 추천 프로젝트

Was this content helpful?

Recent Feedback

Download README