File tree

• .gitignore
• .problemList.json
• .problemSiteData.json
• README.md
• c
  • 0009-palindrome-number.c
  • 0015-3sum.c
  • 0028-find-the-index-of-the-first-occurrence-in-a-string.c
  • 0039-combination-sum.c
  • 0051-n-queens.c
  • 0058-length-of-the-last-word.c
  • 0083-remove-duplicates-from-sorted-list.c
  • 0084-largest-rectangle-in-histogram.c
  • 0142-linked-list-cycle-ii.c
  • 0148-sort-list.c
  • 0179-largest-number.c
  • 0206-reverse-linked-list.c
  • 0211-design-add-and-search-words-data-structure.c
  • 0303-range-sum-query-immutable.c
  • 0338-counting-bits.c
  • 0438-find-all-anagrams-in-a-string.c
  • 0523-continuous-subarray-sum.c
  • 0535-encode-and-decode-tinyurl.c
  • 0680-valid-palindrome-ii.c
  • 0706-design-hashmap.c
  • 1838-frequency-of-the-most-frequent-element.c
  • 1930-unique-length-3-palindromic-subsequences.c
  • 2001-number-of-pairs-of-interchangeable-rectangles.c
  • 2002-maximum-product-of-the-length-of-two-palindromic-subsequences.c
• cpp
  • 0006-zigzag-conversion.cpp
  • 0020-valid-parentheses.cpp
  • 0061-rotate-list.cpp
  • 0063-unique-paths-ii.cpp
  • 0092-reverse-linked-list-ii.cpp
  • 0215-kth-largest-element-in-an-array.cpp
  • 0219-Contains-Duplicate-II.cpp
  • 0236-Power-Of-Three.cpp
  • 0278-First-Bad-Version.cpp
  • 0279-Perfect-Squares.cpp
  • 0280-wiggle-sort.cpp
  • 0303-range-sum-query-immutable.cpp
  • 0342-Power-Of-Four.cpp
  • 0343-integer-break.cpp
  • 0377-combination-sum-iv.cpp
  • 0387-First-Unique-Character-In-A-String.cpp
  • 0621-task-scheduler.cpp
  • 0665-Non-Decreasing-Array.cpp
  • 0665-non-decreasing-array.cpp
  • 0973-k-closest-points-to-origin.cpp
  • 0983-minimum-cost-for-tickets.cpp
  • 1220-count-vowels-permutation.cpp
  • 1461-check-if-a-string-contains-all-binary-codes-of-size-k.cpp
  • 1838-frequency-of-the-most-frequent-element.cpp
  • 1911-maximum-alternating-subsequence-sum.cpp
  • 205-Isomorphic-Strings.cpp
  • 242-Valid-Anagram.cpp
  • 665-Non-decreasing-Array.cpp
  • neetcode_150
    • 01_arrays_&_hashing
      • contains_duplicate.cpp
      • encode_and_decode_strings.cpp
      • group_anagrams.cpp
      • longest_consecutive_sequence.cpp
      • product_of_array_except_self.cpp
      • top_k_frequent_elements.cpp
      • two_sum.cpp
      • valid_anagram.cpp
      • valid_anagram_hashmap.cpp
      • valid_sudoku.cpp
    • 02_two_pointers
      • 3sum.cpp
      • container_with_most_water.cpp
      • trapping_rain_water.cpp
      • two_sum_ii_-_input_array_is_sorted.cpp
      • valid_palindrome.cpp
    • 03_sliding_window
      • best_time_to_buy_and_sell_stock.cpp
      • longest_repeating_character_replacement.cpp
      • longest_substring_without_repeating_characters.cpp
      • minimum_window_substring.cpp
      • permutation_in_string.cpp
      • sliding_window_maximum.cpp
    • 04_stack
      • car_fleet.cpp
      • daily_temperatures.cpp
      • evaluate_reverse_polish_notation.cpp
      • generate_parentheses.cpp
      • largest_rectangle_in_histogram.cpp
      • min_stack.cpp
      • valid_parentheses.cpp
    • 05_binary_search
      • binary_search.cpp
      • find_minimum_in_rotated_sorted_array.cpp
      • koko_eating_bananas.cpp
      • median_of_two_sorted_arrays.cpp
      • search_a_2d_matrix.cpp
      • search_in_rotated_sorted_array.cpp
      • time_based_key_value_store.cpp
    • 06_linked_list
      • add_two_numbers.cpp
      • copy_list_with_random_pointer.cpp
      • find_the_duplicate_number.cpp
      • linked_list_cycle.cpp
      • lru_cache.cpp
      • merge_k_sorted_lists.cpp
      • merge_two_sorted_lists.cpp
      • remove_nth_node_from_end_of_list.cpp
      • reorder_list.cpp
      • reverse_linked_list.cpp
      • reverse_nodes_in_k-group.cpp
    • 07_trees
      • balanced_binary_tree.cpp
      • binary_tree_level_order_traversal.cpp
      • binary_tree_maximum_path_sum.cpp
      • binary_tree_right_side_view.cpp
      • construct_binary_tree_from_preorder_and_inorder.cpp
      • count_good_nodes_in_binary_tree.cpp
      • diameter_of_binary_tree.cpp
      • invert_binary_tree.cpp
      • kth_smallest_element_in_a_bst.cpp
      • lowest_common_ancestor_of_a_binary_search_tree.cpp
      • maximum_depth_of_binary_tree.cpp
      • same_tree.cpp
      • serialize_and_deserialize_binary_tree.cpp
      • subtree_of_another_tree.cpp
      • validate_binary_search_tree.cpp
    • 08_tries
      • design_add_and_search_words_data_structure.cpp
      • implement_trie_prefix_tree.cpp
      • word_search_ii.cpp
    • 09_heap_priority_queue
      • design_twitter.cpp
      • find_median_from_data_stream.cpp
      • k_closest_points_to_origin.cpp
      • kth_largest_element_in_a_stream.cpp
      • kth_largest_element_in_array.cpp
      • last_stone_weight.cpp
      • task_scheduler.cpp
    • 10_backtracking
      • combination_sum.cpp
      • combination_sum_ii.cpp
      • letter_combinations_phone_number.cpp
      • n-queens.cpp
      • palindrome_partitioning.cpp
      • permutations.cpp
      • subsets.cpp
      • subsets_ii.cpp
      • word_search.cpp
    • 11_graphs
      • clone_graph.cpp
      • course_schedule.cpp
      • course_schedule_ii.cpp
      • graph_valid_tree.cpp
      • max_area_of_island.cpp
      • number_of_connected_components_in_an_undirected_graph.cpp
      • number_of_islands.cpp
      • pacific_atlantic_water_flow.cpp
      • redundant_connection.cpp
      • rotting_oranges.cpp
      • surrounded_regions.cpp
      • walls_and_gates.cpp
      • word_ladder.cpp
    • 12_advanced_graphs
      • alien_dictionary.cpp
      • cheapest_flights_within_k_stops.cpp
      • min_cost_to_connect_all_points.cpp
      • network_delay_time.cpp
      • reconstruct_itinerary.cpp
      • swim_in_rising_water.cpp
    • 13_1-d_dynamic_programming
      • climbing_stairs.cpp
      • coin_change.cpp
      • decode_ways.cpp
      • house_robber.cpp
      • house_robber_ii.cpp
      • longest_increasing_subsequence.cpp
      • longest_palindrome_substring.cpp
      • maximum_product_subarray.cpp
      • min_cost_climbing_stairs.cpp
      • palindromic_substrings.cpp
      • partition_equal_subset_sum.cpp
      • word_break.cpp
    • 14_2-d_dynamic_programming
      • best_time_to_buy_and_sell_stock_with_cooldown.cpp
      • burst_balloons.cpp
      • coin_change_2.cpp
      • distinct_subsequences.cpp
      • edit_distance.cpp
      • interleaving_string.cpp
      • longest_common_subsequence.cpp
      • longest_increasing_path_in_a_matrix.cpp
      • regular_expression_matching.cpp
      • target_sum.cpp
      • unique_paths.cpp
    • 15_greedy
      • gas_station.cpp
      • hand_of_straights.cpp
      • jump_game.cpp
      • jump_game_ii.cpp
      • maximum_subarray.cpp
      • merge_triplets_to_form_target_triplet.cpp
      • partition_labels.cpp
      • valid_parenthesis_string.cpp
    • 16_intervals
      • insert_interval.cpp
      • meeting_rooms.cpp
      • meeting_rooms_ii.cpp
      • merge_intervals.cpp
      • minimum_interval_to_include_each_query.cpp
      • non-overlapping_intervals.cpp
    • 17_math_&_geometry
      • detect_squares.cpp
      • happy_number.cpp
      • multiply_strings.cpp
      • plus_one.cpp
      • pow_x_n.cpp
      • rotate_image.cpp
      • set_matrix_zeroes.cpp
      • spiral_matrix.cpp
    • 18_bit_manipulation
      • counting_bits.cpp
      • missing_number.cpp
      • number_of_1_bits.cpp
      • reverse_bits.cpp
      • reverse_integer.cpp
      • single_number.cpp
      • sum_of_two_integers.cpp
• csharp
  • 0315-count-of-smaller-numbers-after-self.cs
  • 0682-baseball-game.cs
  • 0876-middle-of-the-linked-list.cs
  • 70-Climbing-Stairs.cs
• go
  • 0006-zigzag-conversion.go
  • 0008-string-to-integer.go
  • 0016-3sum-closest.go
  • 0018-4sum.go
  • 0049-group-anagrams.go
  • 0093-restore-ip-addresses.go
  • 0110-balanced-binary-tree.go
  • 0352-data-stream-as-disjoint-intervals.go
  • 0472-concatenated-words.go
  • 0789-minimum-distance-between-two-bst-nodes.go
  • 0904-fruit-into-baskets.go
  • 0989-add-to-array-form-of-integer.go
  • 1071-greatest-common-divisor-of-strings..go
  • 1137-n-th-tribonacci-number.go
  • 1470-shuffle-the-array.go
• java
  • 0013-roman-to-integer.java
  • 0020-valid-parentheses.java
  • 0034-find-first-and-last-position-of-element-in-sorted-array.java
  • 0049-group-anagrams.java
  • 0061-rotate-list.java
  • 0086-partition-list.java
  • 0108-convert-sorted-array-to-binary-search-tree.java
  • 0122-best-time-to-buy-and-sell-stock-II.java
  • 0122-best-time-to-buy-and-sell-stock-ii.java
  • 0283-move-zeroes.java
  • 0367-valid-perfect-square.java
  • 0441-arranging-coins.java
  • 0901-online-stock-span.java
  • 0909-snakes-and-ladders.java
  • 0977-squares-of-a-sorted-array.java
• javascript
  • 0003-longest-substring-without-repeating-characters.js
  • 0015-3sum.js
  • 0049-group-anagrams.js
  • 0093-restore-ip-addresses.js
  • 0347-top-k-frequent-elements.js
  • 0352-data-stream-as-disjoint-intervals.js
  • 0392-is-subsequence.js
  • 0472-concatenated-words.js
  • 0560-subarray-sum-equals-k.js
  • 0682-baseball-game.js
  • 0789-minimum-distance-between-two-bst-nodes.js
  • 0876-middle-of-the-linked-list.js
  • 0904-fruit-into-baskets.js
  • 0937-k-closest-points-to-origin.js
  • 0989-add-to-array-form-of-integer.js
  • 1071-greatest-common-divisor-of-strings.js
  • 1137-n-th-tribonacci-number.js
  • 1470-shuffle-the-array.js
  • 1930-unique-length-3-palindromic-subsequences.js
  • 207-canFinish.js
  • 49-Rotate-Image.js
• kotlin
  • 0014-longest-common-prefix.kt
  • 0017-letter-combinations-of-a-phone-number.kt
  • 0026-remove-duplicates-from-sorted-array.kt
  • 0028-find-the-index-of-the-first-occurrence-in-a-string.kt
  • 0035-search-insert-position.kt
  • 0043-multiply-strings.kt
  • 0052-n-queens-ii.kt
  • 0063-unique-paths-ii.kt
  • 0072-edit-distance.kt
  • 0077-combinations.kt
  • 0080-remove-duplicates-from-sorted-array-ii.kt
  • 0083-remove-duplicates-from-sorted-list.kt
  • 0097-interleaving-string.kt
  • 0101-symmetric-tree.kt
  • 0103-binary-tree-zigzag-level-order-traversal.kt
  • 0108-convert-sorted-array-to-binary-search-tree.kt
  • 0112-path-sum.kt
  • 0118-pascals-triangle.kt
  • 0122-best-time-to-buy-and-sell-stock-ii.kt
  • 0129-sum-root-to-leaf-numbers.kt
  • 0160-intersection-of-two-linked-lists.kt
  • 0179-largest-number.kt
  • 0187-repeated-dna-sequences.kt
  • 0203-remove-linked-list-elements.kt
  • 0205-isomorphic-strings.kt
  • 0217-encode-and-decode-strings.kt
  • 0219-contains-duplicate-ii.kt
  • 0225-implement-stack-using-queues.kt
  • 0234-palindrome-linked-list.kt
  • 0280-wiggle-sort.kt
  • 0283-move-zeroes.kt
  • 0290-word-pattern.kt
  • 0303-range-sum-query-immutable.kt
  • 0304-range-sum-query-2d-immutable.kt
  • 0323-number-of-connected-components-in-an-undirected-graph.kt
  • 0344-reverse-string.kt
  • 0374-guess-number-higher-or-lower.kt
  • 0380-insert-delete-getrandom-o1.kt
  • 0427-construct-quad-tree.kt
  • 0441-arranging-coins.kt
  • 0448-find-all-numbers-disappeared-in-an-array.kt
  • 0450-delete-node-in-a-bst.kt
  • 0474-ones-and-zeroes.kt
  • 0496-next-greater-element-i.kt
  • 0502-ipo.kt
  • 0523-continuous-subarray-sum.kt
  • 0530-minimum-absolute-difference-in-bst.kt
  • 0535-encode-and-decode-tinyurl.kt
  • 0540-single-element-in-a-sorted-array.kt
  • 0560-subarray-sum-equals-k.kt
  • 0605-can-place-flowers.kt
  • 0617-merge-two-binary-trees.kt
  • 0647-palindromic-substrings.kt
  • 0652-find-duplicate-subtrees.kt
  • 0658-find-k-closest-elements.kt
  • 0665-non-decreasing-array.kt
  • 0680-valid-palindrome-ii.kt
  • 0682-baseball-game.kt
  • 0701-insert-into-a-binary-search-tree.kt
  • 0706-design-hashmap.kt
  • 0707-design-linked-list.kt
  • 0724-find-pivot-index.kt
  • 0783-minimum-distance-between-bst-nodes.kt
  • 0876-middle-of-the-linked-list.kt
  • 0895-maximum-frequency-stack.kt
  • 0904-fruit-into-baskets.kt
  • 0912-sort-an-array.kt
  • 0926-flip-string-to-monotone-increasing.kt
  • 0929-unique-email-addresses.kt
  • 0973-k-closest-points-to-origin.kt
  • 0989-add-to-array-form-of-integer.kt
  • 1011-capacity-to-ship-packages-within-d-days.kt
  • 1071-greatest-common-divisor-of-strings.kt
  • 1091-shortest-path-in-binary-matrix.kt
  • 1137-n-th-tribonacci-number.kt
  • 1162-as-far-from-land-as-possible.kt
  • 1189-maximum-number-of-balloons.kt
  • 1343-number-of-sub-arrays-of-size-k-and-average-greater-than-or-equal-to-threshold.kt
  • 1461-check-if-a-string-contains-all-binary-codes-of-size-k.kt
  • 1470-shuffle-the-array.kt
  • 1523-count-odd-numbers-in-an-interval-range.kt
  • 1675-minimize-deviation-in-array.kt
  • 1929-concatenation-of-array.kt
  • 1930-unique-length-3-palindromic-subsequences.kt
  • 1980-find-unique-binary-string.kt
  • 1984-minimum-difference-between-highest-and-lowest-of-k-scores.kt
  • 1985-find-the-kth-largest-integer-in-the-array.kt
  • 2130-maximum-twin-sum-of-a-linked-list.kt
  • 2306-naming-a-company.kt
  • 2477-minimum-fuel-cost-to-report-to-the-capital.kt
• python
  • 0052-n-queens-ii.py
  • 0061-rotate-list.py
  • 0063-unique-paths-ii.py
  • 0080-remove-duplicates-from-sorted-array-ii.py
  • 0086-partition-list.py
  • 0119-Pascal-Triangle-II.py
  • 0122-best-time-to-buy-and-sell-stock-ii.py
  • 0147-insertion-sort-list.py
  • 0148-sort-list.py
  • 0179-largest-number.py
  • 0219-contains-duplicate-ii.py
  • 0232-implement-queue-using-stacks.py
  • 0303-range-sum-query-immutable.py
  • 0380-insert-delete-getrandom-o1.py
  • 0383-ransom-note.py
  • 0450-delete-node-in-a-bst.py
  • 0474-ones-and-zeroes.py
  • 0502-ipo.py
  • 0509-fibonacci-number.py
  • 0554-Brick-Wall.py
  • 0622-design-circular-queue.py
  • 0698-partition-to-k-equal-sum-subsets.py
  • 0701-insert-into-a-binary-search-tree.py
  • 0706-design-hashmap.py
  • 0740-delete-and-earn.py
  • 0838-push-dominoes.py
  • 0862-shortest-subarray-with-sum-at-least-k.py
  • 0876-middle-of-the-linked-list.py
  • 0912-sort-an-array.py
  • 0931-minimum-falling-path-sum.py
  • 0978-longest-turbulent-subarray.py
  • 1046-Last-Stone-Weight.py
  • 1049-last-stone-weight-ii.py
  • 1091-shortest-path-in-binary-matrix.py
  • 1143-Longest-Common-Subsequence.py
  • 118-Pascals-Triangle.py
  • 1209-Remove-All-Adjacent-Duplicates-in-String-II.py
  • 1220-Count-Vowels-Permutation.py
  • 1239-Maximum-Length-of-a-Concatenated-String-with-Unique-Characters.py
  • 1299-Replace-Elements-With-Greatest-Element-On-Right-Side.py
  • 1343-number-of-sub-arrays-of-size-k-and-average-greater-than-or-equal-to-threshold.py
  • 1383-Maximum-Performance-Of-A-Team.py
  • 1448-Count-Good-Nodes-in-Binary-Tree.py
  • 1462-course-schedule-iv.py
  • 1514-path-with-maximum-probability.py
  • 1584-Min-Cost-to-Connect-all-Points.py
  • 1834-Single-Threaded-CPU.py
  • 1845-Seat-Reservation-Manager.py
  • 1849-Splitting-A-String-Into-Descending-Consecutive-Values.py
  • 1851-Minimum-Interval-to-Include-Each-Query.py
  • 1905-Count-Sub-Islands.py
  • 1929-concatenation-of-array.py
  • 1930-unique-length-3-palindromic-subsequences.py
  • 1980-Find-Unique-Binary-String.py
  • 1985-Find-The-Kth-Largest-Integer-In-The-Array.py
  • 2001-number-of-pairs-of-interchangeable-rectangles.py
  • 2013-Detect-Squares.py
  • 2017-Grid-Game.py
  • 2130-maximum-twin-sum-of-a-linked-list.py
  • 236-Lowest-Common-Ancestor-of-a-Binary-Tree.py
  • 40-Combinations-Sum-ii.py
  • 43-Number_of_Connected_Components_in_an_Undirected_Graph.py
• rust
  • 0017-letter-combinations-of-a-phone-number.rs
  • 0021-merge-two-sorted-lists.rs
  • 0035-search-insert-position.rs
  • 0046-permutations.rs
  • 0051-n-queens.rs
  • 0075-sort-colors.rs
  • 0090-subsets-ii.rs
  • 0093-restore-ip-addresses.rs
  • 0122-best-time-to-buy-and-sell-stock-ii.rs
  • 0309-best-time-to-buy-and-sell-stock-with-cooldown.rs
  • 0352-data-stream-as-disjoint-intervals..rs
  • 0472-concatenated-words.rs
  • 0554-brick-wall.rs
  • 0560-subarray-sum-equals-k.rs
  • 0567-permutation-in-string.rs
  • 0621-task-scheduler.rs
  • 0703-kth-largest-element-in-a-stream.rs
  • 0789-minimum-distance-between-two-bst-nodes.rs
  • 0876-middle-of-the-linked-list.rs
  • 0904-fruit-into-baskets.rs
  • 0973-k-closest-points-to-origin.rs
  • 0989-add-to-array-form-of-integer.rs
  • 1046-last-stone-weight.rs
  • 1071-greatest-common-divisor-of-strings.rs
  • 1137-n-th-tribonacci-number.rs
  • 1470-shuffle-the-array.rs
  • 1930-unique-length-3-palindromic-subsequences.rs
  • 2001-number-of-pairs-of-interchangeable-rectangles.rs
• scala
  • 0072-edit-distance.scala
  • 0097-interleaving-string.scala
  • 0208-implement-trie-prefix-tree.scala
  • 0211-design-add-and-search-words-data-structure.scala
  • 0215-kth-largest-element-in-an-array.scala
  • 0322-coin-change.scala
  • 0347-top-k-frequent-elements.scala
  • 0394-decode-string.scala
  • 0485-max-consecutive-ones.scala
  • 0509-fibonacci-number.scala
  • 0746-min-cost-climbing-stairs.scala
• swift
  • 0009-palindrome-number.swift
  • 0022-generate-parentheses.swift
  • 0034-find-first-and-last-position-of-element-in-sorted-array.swift
  • 0075-sort-colors.swift
  • 0076-minimum-window-substring.swift
  • 0155-min-stack.swift
  • 0263-ugly-number.swift
  • 0367-valid-perfect-square.swift
  • 0374-guess-number-higher-or-lower.swift
  • 0380-insert-delete-getrandom-o1.swift
  • 0392-is-subsequence.swift
  • 0424-longest-repeating-character-replacement.swift
  • 0535-encode-and-decode-tinyurl.swift
  • 0605-can-place-flowers.swift
  • 0682-baseball-game.swift
  • 0724-find-pivot-index.swift
• typescript
  • 0035-search-insert-position.ts
  • 0093-restore-ip-addresses.ts
  • 0352-data-stream-as-disjoint-intervals..ts
  • 0472-concatenated-words.ts
  • 0560-subarray-sum-equals-k.ts
  • 0789-minimum-distance-between-two-bst-nodes.ts
  • 0876-middle-of-the-linked-list.ts
  • 0904-fruit-into-baskets.ts
  • 0989-add-to-array-form-of-integer..ts
  • 1071-greatest-common-divisor-of-strings.ts
  • 1137-n-th-tribonacci-number.ts
  • 1470-shuffle-the-array.ts
  • 1930-unique-length-3-palindromic-subsequences.ts
  • 242-Valid-Anagrams.ts