A collection of LeetCode questions to ace the coding interview! - Created using LeetHub v2

LeetCode Topics

Tree

3439-find-minimum-diameter-after-merging-two-trees

Depth-First Search

3439-find-minimum-diameter-after-merging-two-trees

Breadth-First Search

3439-find-minimum-diameter-after-merging-two-trees

Graph

3439-find-minimum-diameter-after-merging-two-trees

Array

1196-filling-bookcase-shelves
1511-count-number-of-teams
1556-make-two-arrays-equal-by-reversing-subarrays
1615-range-sum-of-sorted-subarray-sums
2255-minimum-swaps-to-group-all-1s-together-ii

Dynamic Programming

0005-longest-palindromic-substring
1196-filling-bookcase-shelves
1511-count-number-of-teams

Binary Indexed Tree

1511-count-number-of-teams

Segment Tree

1511-count-number-of-teams

Sliding Window

2255-minimum-swaps-to-group-all-1s-together-ii

Hash Table

1556-make-two-arrays-equal-by-reversing-subarrays

Sorting

1556-make-two-arrays-equal-by-reversing-subarrays
1615-range-sum-of-sorted-subarray-sums

Two Pointers

0005-longest-palindromic-substring
1615-range-sum-of-sorted-subarray-sums

Binary Search

1615-range-sum-of-sorted-subarray-sums

String

0005-longest-palindromic-substring