CODE-TIME

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

LeetCode Topics

Array

0015-3sum
0016-3sum-closest
0026-remove-duplicates-from-sorted-array
0075-sort-colors
0167-two-sum-ii-input-array-is-sorted
0209-minimum-size-subarray-sum
0904-fruit-into-baskets
0977-squares-of-a-sorted-array
1004-max-consecutive-ones-iii
1365-how-many-numbers-are-smaller-than-the-current-number
1431-kids-with-the-greatest-number-of-candies
3872-longest-arithmetic-sequence-after-changing-at-most-one-element
3873-maximum-points-activated-with-one-addition

Hash Table

0003-longest-substring-without-repeating-characters
0076-minimum-window-substring
0424-longest-repeating-character-replacement
0904-fruit-into-baskets
1365-how-many-numbers-are-smaller-than-the-current-number
3873-maximum-points-activated-with-one-addition

Union-Find

3873-maximum-points-activated-with-one-addition

Enumeration

3872-longest-arithmetic-sequence-after-changing-at-most-one-element

Math

0009-palindrome-number
0050-powx-n
0231-power-of-two
0326-power-of-three
0412-fizz-buzz
0509-fibonacci-number
1281-subtract-the-product-and-sum-of-digits-of-an-integer
1523-count-odd-numbers-in-an-interval-range
2520-count-the-digits-that-divide-a-number
3870-count-commas-in-range
3871-count-commas-in-range-ii

Dynamic Programming

0509-fibonacci-number

Recursion

0050-powx-n
0231-power-of-two
0326-power-of-three
0509-fibonacci-number

Memoization

0509-fibonacci-number

Bit Manipulation

0231-power-of-two

String

0003-longest-substring-without-repeating-characters
0076-minimum-window-substring
0412-fizz-buzz
0424-longest-repeating-character-replacement

Simulation

0412-fizz-buzz

Sorting

0015-3sum
0016-3sum-closest
0075-sort-colors
0977-squares-of-a-sorted-array
1365-how-many-numbers-are-smaller-than-the-current-number

Counting Sort

1365-how-many-numbers-are-smaller-than-the-current-number

Two Pointers

0015-3sum
0016-3sum-closest
0026-remove-duplicates-from-sorted-array
0075-sort-colors
0167-two-sum-ii-input-array-is-sorted
0977-squares-of-a-sorted-array

Binary Search

0167-two-sum-ii-input-array-is-sorted
0209-minimum-size-subarray-sum
1004-max-consecutive-ones-iii

Sliding Window

0003-longest-substring-without-repeating-characters
0076-minimum-window-substring
0209-minimum-size-subarray-sum
0424-longest-repeating-character-replacement
0904-fruit-into-baskets
1004-max-consecutive-ones-iii

Prefix Sum

0209-minimum-size-subarray-sum
1004-max-consecutive-ones-iii

GFG

This folder contains GeeksforGeeks practice problems prepared for the CODE-TIME repository.

Projects

• Max Sum Subarray
  • Computes the maximum sum of a contiguous subarray of size k.
• Triplets with Smaller Sum
  • Counts triplets with a sum smaller than a target value.

Structure

• Max Sum Subarray /Readme.md
• Max Sum Subarray /sol.py
• Triplets with Smaller Sum/Readme.md
• Triplets with Smaller Sum/sol.py

Usage

Open the problem folder and run the Python solution.

Example:

python3 "Max Sum Subarray /sol.py"

Notes

• Each subfolder contains a problem statement and a working Python solution.
• This folder is intended to be pushed into the gfg directory of the CODE-TIME repository.