An open API service indexing awesome lists of open source software.

https://github.com/doantrunghuy/practice-interview-code

Practice coding every day to train your problem-solving mindset. Includes lessons on gready, dynamic programming, graphs and algorithms, data structures and other techniques.
https://github.com/doantrunghuy/practice-interview-code

algorithms-and-data-structures leetcode-solutions

Last synced: 3 months ago
JSON representation

Practice coding every day to train your problem-solving mindset. Includes lessons on gready, dynamic programming, graphs and algorithms, data structures and other techniques.

Awesome Lists containing this project

README

          


Practice coding every day to train your problem-solving mindset. Includes lessons on gready, dynamic programming, graphs and algorithms, data structures and other techniques.



Practice coding every day



Leetcode: https://leetcode.com/doantrunghuy/  
badge knight


# LeetCode Topics
## Array
| |
| ------- |
| [1478-maximum-number-of-events-that-can-be-attended](https://github.com/DoanTrungHuy/practice-interview-code/tree/master/1478-maximum-number-of-events-that-can-be-attended) |
| [2144-maximum-difference-between-increasing-elements](https://github.com/DoanTrungHuy/practice-interview-code/tree/master/2144-maximum-difference-between-increasing-elements) |
| [2358-number-of-ways-to-split-array](https://github.com/DoanTrungHuy/practice-interview-code/tree/master/2358-number-of-ways-to-split-array) |
| [3460-count-the-number-of-inversions](https://github.com/DoanTrungHuy/practice-interview-code/tree/master/3460-count-the-number-of-inversions) |
| [3743-reschedule-meetings-for-maximum-free-time-i](https://github.com/DoanTrungHuy/practice-interview-code/tree/master/3743-reschedule-meetings-for-maximum-free-time-i) |
| [3821-count-cells-in-overlapping-horizontal-and-vertical-substrings](https://github.com/DoanTrungHuy/practice-interview-code/tree/master/3821-count-cells-in-overlapping-horizontal-and-vertical-substrings) |
## Prefix Sum
| |
| ------- |
| [2059-unique-length-3-palindromic-subsequences](https://github.com/DoanTrungHuy/practice-interview-code/tree/master/2059-unique-length-3-palindromic-subsequences) |
| [2358-number-of-ways-to-split-array](https://github.com/DoanTrungHuy/practice-interview-code/tree/master/2358-number-of-ways-to-split-array) |
## Hash Table
| |
| ------- |
| [2059-unique-length-3-palindromic-subsequences](https://github.com/DoanTrungHuy/practice-interview-code/tree/master/2059-unique-length-3-palindromic-subsequences) |
## String
| |
| ------- |
| [2059-unique-length-3-palindromic-subsequences](https://github.com/DoanTrungHuy/practice-interview-code/tree/master/2059-unique-length-3-palindromic-subsequences) |
| [3821-count-cells-in-overlapping-horizontal-and-vertical-substrings](https://github.com/DoanTrungHuy/practice-interview-code/tree/master/3821-count-cells-in-overlapping-horizontal-and-vertical-substrings) |
## Bit Manipulation
| |
| ------- |
| [2059-unique-length-3-palindromic-subsequences](https://github.com/DoanTrungHuy/practice-interview-code/tree/master/2059-unique-length-3-palindromic-subsequences) |
## Rolling Hash
| |
| ------- |
| [3821-count-cells-in-overlapping-horizontal-and-vertical-substrings](https://github.com/DoanTrungHuy/practice-interview-code/tree/master/3821-count-cells-in-overlapping-horizontal-and-vertical-substrings) |
## String Matching
| |
| ------- |
| [3821-count-cells-in-overlapping-horizontal-and-vertical-substrings](https://github.com/DoanTrungHuy/practice-interview-code/tree/master/3821-count-cells-in-overlapping-horizontal-and-vertical-substrings) |
## Matrix
| |
| ------- |
| [3821-count-cells-in-overlapping-horizontal-and-vertical-substrings](https://github.com/DoanTrungHuy/practice-interview-code/tree/master/3821-count-cells-in-overlapping-horizontal-and-vertical-substrings) |
## Hash Function
| |
| ------- |
| [3821-count-cells-in-overlapping-horizontal-and-vertical-substrings](https://github.com/DoanTrungHuy/practice-interview-code/tree/master/3821-count-cells-in-overlapping-horizontal-and-vertical-substrings) |
## Dynamic Programming
| |
| ------- |
| [0629-k-inverse-pairs-array](https://github.com/DoanTrungHuy/practice-interview-code/tree/master/0629-k-inverse-pairs-array) |
| [3460-count-the-number-of-inversions](https://github.com/DoanTrungHuy/practice-interview-code/tree/master/3460-count-the-number-of-inversions) |
## Greedy
| |
| ------- |
| [1478-maximum-number-of-events-that-can-be-attended](https://github.com/DoanTrungHuy/practice-interview-code/tree/master/1478-maximum-number-of-events-that-can-be-attended) |
| [3743-reschedule-meetings-for-maximum-free-time-i](https://github.com/DoanTrungHuy/practice-interview-code/tree/master/3743-reschedule-meetings-for-maximum-free-time-i) |
## Sorting
| |
| ------- |
| [1478-maximum-number-of-events-that-can-be-attended](https://github.com/DoanTrungHuy/practice-interview-code/tree/master/1478-maximum-number-of-events-that-can-be-attended) |
## Heap (Priority Queue)
| |
| ------- |
| [1478-maximum-number-of-events-that-can-be-attended](https://github.com/DoanTrungHuy/practice-interview-code/tree/master/1478-maximum-number-of-events-that-can-be-attended) |
## Sliding Window
| |
| ------- |
| [3743-reschedule-meetings-for-maximum-free-time-i](https://github.com/DoanTrungHuy/practice-interview-code/tree/master/3743-reschedule-meetings-for-maximum-free-time-i) |
## Linked List
| |
| ------- |
| [1411-convert-binary-number-in-a-linked-list-to-integer](https://github.com/DoanTrungHuy/practice-interview-code/tree/master/1411-convert-binary-number-in-a-linked-list-to-integer) |
## Math
| |
| ------- |
| [1411-convert-binary-number-in-a-linked-list-to-integer](https://github.com/DoanTrungHuy/practice-interview-code/tree/master/1411-convert-binary-number-in-a-linked-list-to-integer) |