https://github.com/vkazakevich/leetcode

Leetcode solutions in Python 🐍 and TypeScript
https://github.com/vkazakevich/leetcode

leetcode leetcode-javascript leetcode-practice leetcode-python leetcode-python-solutions leetcode-solutions

Last synced: about 1 month ago
JSON representation

Leetcode solutions in Python 🐍 and TypeScript

• Host: GitHub
• URL: https://github.com/vkazakevich/leetcode
• Owner: vkazakevich
• License: mit
• Created: 2023-01-29T18:49:26.000Z (almost 2 years ago)
• Default Branch: main
• Last Pushed: 2023-11-23T16:47:32.000Z (about 1 year ago)
• Last Synced: 2023-11-23T17:42:28.152Z (about 1 year ago)
• Topics: leetcode, leetcode-javascript, leetcode-practice, leetcode-python, leetcode-python-solutions, leetcode-solutions
• Language: Python
• Homepage:
• Size: 8.79 KB
• Stars: 2
• Watchers: 1
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md
  • License: LICENSE

Awesome Lists containing this project

README

        
![Language](https://img.shields.io/badge/Language-Python3-orange.svg?logo=Python&logoColor=yellow) ![Update](https://img.shields.io/badge/Update-Weekly-green.svg)

# Python solution for LeetCode

The repository contains the best versions of my solutions to [LeetCode](https://leetcode.com/) problems using Python3 and TypeScript.

## Solutions TypeScript

| # | Title | Solution | Time | Space |

|---| ----- | -------- | ---- | ----- |

|1814|[Count Nice Pairs in an Array](https://leetcode.com/problems/contains-duplicate/)|[TypeScript](./Solutions/TypeScript/1814-count-nice-pairs-in-an-array.ts)|O(n)|O(n)|

|2|[Add Two Numbers](https://leetcode.com/problems/add-two-numbers/)|[TypeScript](./Solutions/TypeScript/2-add-two-numbers.ts)|O(n)|O(n)|

## Solutions Python

| # | Title | Solution | Time | Space |

|---| ----- | -------- | ---- | ----- |

|217|[Contains Duplicate](https://leetcode.com/problems/contains-duplicate/)|[Python](./Solutions/217-contains-duplicate.py)|O(n)|O(n)|

|53|[Maximum Subarray](https://leetcode.com/problems/maximum-subarray/)|[Python](./Solutions/53-maximum-subarray.py)|O(n)|O(1)|

|1|[Two Sum](https://leetcode.com/problems/two-sum/)|[Python](./Solutions/1-two-sum.py)|O(n^2)|O(1)|

|88|[Merge Sorted Array](https://leetcode.com/problems/merge-sorted-array/)|[Python](./Solutions/88-merge-sorted-array.py)|O(n + k)|O(k)|

|1480|[Running Sum of 1d Array](https://leetcode.com/problems/running-sum-of-1d-array/)|[Python](./Solutions/1480-running-sum-of-1d-array.py)|O(n)|O(1)|