Data-Structures-and-Algorithms-LeetCode-

Collection of my solutions to LeetCode questions in C#, Python and Javascript - Created using LeetHub

LeetCode Topics

Array

Problem Name	Difficulty
0053-maximum-subarray	Medium
0283-move-zeroes	Easy
0322-coin-change	Medium
0350-intersection-of-two-arrays-ii	Easy
1877-minimize-maximum-pair-sum-in-array	Medium
1886-determine-whether-matrix-can-be-obtained-by-rotation	Easy
3731-find-missing-elements	Easy

Two Pointers

Problem Name	Difficulty
0283-move-zeroes	Easy
0350-intersection-of-two-arrays-ii	Easy
1877-minimize-maximum-pair-sum-in-array	Medium

Greedy

Problem Name	Difficulty
1877-minimize-maximum-pair-sum-in-array	Medium

Sorting

Problem Name	Difficulty
0350-intersection-of-two-arrays-ii	Easy
1877-minimize-maximum-pair-sum-in-array	Medium
3731-find-missing-elements	Easy

Matrix

Problem Name	Difficulty
1886-determine-whether-matrix-can-be-obtained-by-rotation	Easy

Dynamic Programming

Problem Name	Difficulty
0053-maximum-subarray	Medium
0322-coin-change	Medium

Breadth-First Search

Problem Name	Difficulty
0322-coin-change	Medium

Divide and Conquer

Problem Name	Difficulty
0053-maximum-subarray	Medium

Tree

Problem Name	Difficulty
0110-balanced-binary-tree	Easy

Depth-First Search

Problem Name	Difficulty
0110-balanced-binary-tree	Easy

Binary Tree

Problem Name	Difficulty
0110-balanced-binary-tree	Easy

Hash Table

Problem Name	Difficulty
0350-intersection-of-two-arrays-ii	Easy
3731-find-missing-elements	Easy

Binary Search

Problem Name	Difficulty
0350-intersection-of-two-arrays-ii	Easy

Math

Problem Name	Difficulty
3345-smallest-divisible-digit-product-i	Easy

Enumeration

Problem Name	Difficulty
3345-smallest-divisible-digit-product-i	Easy