arun279 / leetcode-practice

practicing leetcode

leetcode-practice

This repository contains solutions to LeetCode problems from Grind 75, grouped by topics. Each solution file is named with the corresponding LeetCode problem number.

Usage

• To test, use the following command:

python -m unittest discover -s tests

• You can also run individual test methods in tests/test_all.py using your IDE's testing framework.

Questions Solved

Arrays

1. Two Sum
2. Valid Parentheses

Binary Tree

102. Binary Tree Level Order Traversal
103. Maximum Depth of Binary Tree

Graph

133. Clone Graph
134. Number of Islands

Hash Table

41. First Missing Positive
42. Insert Delete GetRandom O(1)
43. Ransom Note

Heap

215. Kth Largest Element in an Array

Linked List

146. LRU Cache
147. Reverse Linked List

Matrix

36. Valid Sudoku

Not in Grind 75

232. Implement Queue using Stacks

Not in Leetcode

1. Seven Segment Display to String

Contribute

If you would like to contribute, you can submit PRs with leetcode solutions from Grind 75 that have not already been added, following these requirements:

• Keep the naming contention: filename starts with LeetCode question number, followed by the question.
• The docstring in the file should be a link to the the LeetCode problem.
• Update the README.md with the solved questions added.
• For every problem, add a corresponding test method to tests/test_all.py.

PRs that don't follow these requirements won't be merged.

Note

run_tests has now been completely removed from master. Please checkout legacy_run_tests branch in order to use it.