LeetCode-TypeScript-JavaScript Solutions

This repository contains solutions for LeetCode problems implemented in TypeScript (JavaScript) and Python.

Overview

The purpose of this repository is to provide clear, efficient, and well-explained solutions for various LeetCode problems. Each solution is accompanied by detailed comments that explain the logic and approach used to solve the problem.

Languages

• TypeScript
• JavaScript
• Python
• Java

Usage

Each problem has its own directory, and within each problem's directory, you will find a solution file for both TypeScript and JavaScript. Feel free to explore and use these solutions to understand and solve LeetCode problems more effectively.

Contributing

Contributions are welcome! If you have a better solution or a solution to a problem that is not currently in the repository, feel free to make a pull request.

LeetCode Topics

Array

Problem Name	Difficulty
1536-minimum-swaps-to-arrange-a-binary-grid	Medium
1582-special-positions-in-a-binary-matrix	Easy
1727-largest-submatrix-with-rearrangements	Medium
1878-get-biggest-three-rhombus-sums-in-a-grid	Medium
1980-find-unique-binary-string	Medium
3070-count-submatrices-with-top-left-element-and-sum-less-than-k	Medium
3212-count-submatrices-with-equal-frequency-of-x-and-y	Medium
3296-minimum-number-of-seconds-to-make-mountain-height-zero	Medium

Greedy

Problem Name	Difficulty
1536-minimum-swaps-to-arrange-a-binary-grid	Medium
1727-largest-submatrix-with-rearrangements	Medium
3296-minimum-number-of-seconds-to-make-mountain-height-zero	Medium
3600-maximize-spanning-tree-stability-with-upgrades	Hard

Matrix

Problem Name	Difficulty
1536-minimum-swaps-to-arrange-a-binary-grid	Medium
1582-special-positions-in-a-binary-matrix	Easy
1727-largest-submatrix-with-rearrangements	Medium
1878-get-biggest-three-rhombus-sums-in-a-grid	Medium
3070-count-submatrices-with-top-left-element-and-sum-less-than-k	Medium
3212-count-submatrices-with-equal-frequency-of-x-and-y	Medium

String

Problem Name	Difficulty
1415-the-k-th-lexicographical-string-of-all-happy-strings-of-length-n	Medium
1545-find-kth-bit-in-nth-binary-string	Medium
1758-minimum-changes-to-make-alternating-binary-string	Easy
1784-check-if-binary-string-has-at-most-one-segment-of-ones	Easy
1888-minimum-number-of-flips-to-make-the-binary-string-alternating	Medium
1980-find-unique-binary-string	Medium

Recursion

Problem Name	Difficulty
1545-find-kth-bit-in-nth-binary-string	Medium

Simulation

Problem Name	Difficulty
1545-find-kth-bit-in-nth-binary-string	Medium

Dynamic Programming

Problem Name	Difficulty
1888-minimum-number-of-flips-to-make-the-binary-string-alternating	Medium
3129-find-all-possible-stable-binary-arrays-i	Medium
3130-find-all-possible-stable-binary-arrays-ii	Hard

Sliding Window

Problem Name	Difficulty
1888-minimum-number-of-flips-to-make-the-binary-string-alternating	Medium

Hash Table

Problem Name	Difficulty
1980-find-unique-binary-string	Medium

Backtracking

Problem Name	Difficulty
1415-the-k-th-lexicographical-string-of-all-happy-strings-of-length-n	Medium
1980-find-unique-binary-string	Medium

Prefix Sum

Problem Name	Difficulty
1878-get-biggest-three-rhombus-sums-in-a-grid	Medium
3070-count-submatrices-with-top-left-element-and-sum-less-than-k	Medium
3129-find-all-possible-stable-binary-arrays-i	Medium
3130-find-all-possible-stable-binary-arrays-ii	Hard
3212-count-submatrices-with-equal-frequency-of-x-and-y	Medium

Bit Manipulation

Problem Name	Difficulty
1009-complement-of-base-10-integer	Easy

Binary Search

Problem Name	Difficulty
3296-minimum-number-of-seconds-to-make-mountain-height-zero	Medium
3600-maximize-spanning-tree-stability-with-upgrades	Hard

Union-Find

Problem Name	Difficulty
3600-maximize-spanning-tree-stability-with-upgrades	Hard

Graph Theory

Problem Name	Difficulty
3600-maximize-spanning-tree-stability-with-upgrades	Hard

Minimum Spanning Tree

Problem Name	Difficulty
3600-maximize-spanning-tree-stability-with-upgrades	Hard

Math

Problem Name	Difficulty
1622-fancy-sequence	Hard
1878-get-biggest-three-rhombus-sums-in-a-grid	Medium
3296-minimum-number-of-seconds-to-make-mountain-height-zero	Medium

Heap (Priority Queue)

Problem Name	Difficulty
1878-get-biggest-three-rhombus-sums-in-a-grid	Medium
3296-minimum-number-of-seconds-to-make-mountain-height-zero	Medium

Design

Problem Name	Difficulty
1622-fancy-sequence	Hard

Segment Tree

Problem Name	Difficulty
1622-fancy-sequence	Hard

Sorting

Problem Name	Difficulty
1727-largest-submatrix-with-rearrangements	Medium
1878-get-biggest-three-rhombus-sums-in-a-grid	Medium