algo-learn

  • 2022-12-14
  • 浏览 (3740)

algo-learn

contains_duplicate

container_with_most_water

contains_duplicate_ii

majority_element

merge_sorted_array

move_zeros

pascals_triangle

plus_one

remove_duplicates

rotate_array

single_number

three_sum

two_sum

add_two_numbers

add_two_numbers_ii

intersection_two_lists

linked_list_cycle

linked_list_cycle_ii

mege_sorted_list

middle_node_list

odd_even_list

palindrome_linked_list

remove_duplicate_sorted_list

remove_nth_node

reverse_list

sort_linked_list

swap_node_pairs

stack_use_queue

binary_search

find_min_rotated_array

first_bad_version

first_last_in_array

search_rotate_array

single_non_duplicate

sqrtx

bubble_sort

merge_sort

selection_sort

min_stack

queue_use_stack

valid_parentheses

binary_tree_inorder

binary_tree_level_order

binary_tree_level_order_ii

binary_tree_max_height

binary_tree_max_width

binary_tree_min_height

binary_tree_postorder

binary_tree_preorder

binary_tree_right_side_view

flatten_binary_tree_to_linked_list

invert_binary_tree

kth_smallest_element_bst

lowest_common_ancestor_binary_tree

nary_tree_max_height

path_sum

valid_bst

array

array_test

best_time_buy_sell_stock

best_time_buy_sell_stock_ii

climb_stairs

container_with_most_water

contains_duplicate

contains_duplicate_ii

majority_element

merge_sorted_array

move_zero

pascals_triangle

plus_one

remove_duplicate

rotata_array

rotate_image

set_matrix_zeros

shuffle_array

single_number

three_sum

two_sum

valid_suduku

generate_parentheses

nqueues

nqueues_ii

permutations

phone_number_letter

subsets

word_search

bloom_filter

bloom_filter_test

friend_circles

number_of_isalands

union_find

union_find_test

powx_n

coin_change

decode_ways

delete_operation_two_strings

edit_distance

house_robber

longest_common_subsequence

longest_increasing_subsequence

massage

maximum_subarray

minimum_path_sum

unique_path

unique_path_ii

array_intersection

array_intersection_ii

find_all_anagrams

group_anagram

jewels_and_stones

longest_consecutive

lru_cache

randomized_set

valida_anagram

linked_map

binary_heap

min_kth_element

topk_frequent_elements

circular_linkedlist

circular_linkedlist_test

doubly_linkedlist

doubly_linkedlist_test

add_two_numbers

add_two_numbers_ii

intersection_linked_lists

linked_list_cycle

linked_list_cycle_ii

merge_two_sorted_lists

middle_node

odd_even_linked_list

palindrome_linked_list

remove_duplicates

remove_nth_node

reverse_linked_list

reverse_nodes_in_k_group

reverse_print

sort_linked_list

swap_node_in_pairs

singly_linked_list

singly_linked_list_test

array_queue

array_queue_test

circular_queue

circular_queue_test

design_circular_deque

design_circular_queue

sliding_window_maximum

stack_using_queues

linked_queue

linked_queue_test

bst_lowest_commona_ancestor

combinations

generate_parentheses

invert_binary_tree

lowest_common_ancestor

maximum_depth_binary_tree

minimum_depth_binary_tree

permutation

permutations_ii

valid_bst

binary_search

binary_search_test

first_and_last_in_sorted_array

first_bad_version

min_in_rotated_sorted_array

minimum_genetic_mutation

search_in_rotated_sorted_array

sqrtx

valid_perfect_square

word_ladder

skiplist

bubbleSort

bubbleSort_test

bucket_sort

bucket_sort_test

heap_sort

heap_sort_test

insertionSort

insertionSort_test

merge_intervals

relative_sort_array

sort_color

merge_sort

merge_sort_test

quick_sort

quick_sort_test

radix_sort

radix_sort_test

selectionSort

selectionSort_test

shell_sort

shell_sort_test

array_stack

array_stack_test

largest_rectangle_in_histogram

min_stack

next_greater_element_i

queue_using_stack

score_of_parentheses

valid_parentheses

linked_stack

linked_stack_test

brute_force

brute_force_test

isomorphic_strings

longest_common_prefix

rabin_karp

reverse_only_letters

reverse_string

reverse_word_in_string_iii

valid_palindrome

valid_palindrome_ii

binary_search_tree

binary_search_tree_test

binary_tree_inorder_traversal

binary_tree_level_order_traversal

binary_tree_postorder_traversal

binary_tree_preorder_traversal

binary_tree_right_side_view

has_path_sum

invert_binary_tree

kth_smallest_element_bst

maximum_depth_binary_tree

maximum_width_binary_tree

minimum_depth_binary_tree

nary_tree_level_order_traversal

nary_tree_postorder_traversal

nary_tree_preorder_traversal

preorder_inorder_bst

sorted_array_to_bst

sum_root_leaf_numbers

symmetric_tree

trie

valid_bst

Bag

EightQueues

GenerateParentheses

NQueues

NQueuesII

Permutations

PermutationsII

Subsets

WordSearch

BinarySearchWithCycle

BinarySearchWithRecursion

FindFirstEquals

FindFirstGreaterThan

FindLastEquals

FindLastSmallerThan

FirstBadVersion

FindMinRotatedArray

FindPeakElement

FirstBadVersion

SearchRotatedArray

PowxN

ReverseOrder

CoinChange

EditDistance

HouseRobber

LongestIncreasingSubsequence

MinimumPathSum

PalindromicSubstrings

UniquePath

UniquePathII

AssignCookie

BestTimeToBuyAndSellStock

CandyProblem

JumpGame

JumpGameII

LargestSumAfterKNegations

LastStoneWeight

MinDeletionSize

BstLowestCommonAncestor

ClimeStairs

Combinations

GenerateParentheses

InvertBinaryTree

LowestCommonAncestor

MaximumDepthBinaryTree

MinimumDepthBinaryTree

Permutations

PermutationsII

RecursionSample

ValidBinarySearchTree

BreadthFirstSearch

DepthFirstSearch

MinimumGeneticMutation

WordLadder

BubbleSort

BucketSort

CountingSort

HeapSort

InsertionSort

MergeSort

QuickSort

RadixSort

SelectionSort

ShellSort

MergeIntervals

RelativeSortArray

ValidAnagram

BM

BruteForce

KMP

RabinKarp

IsomorphicStrings

ReverseOnlyLetters

ReverseString

ReverseWordsInString

StringToInteger

ArrayTips

GenericArray

BestTimeBuySellStock

BestTimeBuySellStockII

BullsAndCows

ClimbStairs

ContainerWithMostWater

ContainsDuplicate

ContainsDuplicateII

CountPrimes

LongestCommonPrefix

MajorityElement

MergeSortedArray

MoveZero

PascalsTriangle

PlusOne

PowerOfThree

RemoveDuplicates

RotateArray

RotateImage

SetMatrixZeroes

ShuffleAnArray

SingleNumber

ThreeSum

TwoSum

ValidSudoku

BloomFilter

UnionFind

FriendCircles

Graph

LinkedMap

OpenAddressingMap

ArrayIntersection

ArrayIntersectionII

FindAnagrams

GroupAnagram

LRUCache

RandomizedSet

ValidAnagram

PriorityHeap

MinKthElement

SlidingWindow

TopKFrequentElements

TopKProblem

CircleLinkedList

DoubleLinkedList

SingleLinkedList

AddTwoNumbers

IntersectionLinkedList

LinkedListCycle

LinkedListCycleII

LruBasedLinkedList

MergeKSortedLists

MergeTwoSortedList

MiddleNode

OddEvenLinkedList

PalindromeLinkedList

RemoveDuplicatesFromSortedList

RemoveNthNode

ReverseLinkedList

ReverseNodesKGroup

SwapNodesInPairs

ArrayQueue

CircularQueue2

CycleQueue

LinkedQueue

MyCircularDeque

SlidingWindowMaximum

StackUseQueue

SkipList

ArrayStack

LinkedStack

LargestRectangleInHistogram

MinStack

MyQueue

NextGreaterElementI

ScoreParentheses

ValidParentheses

BinarySearchTree

RedBlackTree

Trie

BinaryTreeInorderTraversal

BinaryTreeLevelOrderTraversal

BinaryTreePostorderTraversal

BinaryTreePreorderTraversal

InvertBinaryTree

LowestCommonAncestorBinaryTree

MaximumDepthBinaryTree

MinimumDepthBinaryTree

NaryTreeLevelOrderTraversal

NaryTreePostorderTraversal

NaryTreePreorderTraversal

PathSum

SortedArrayToBst

Trie

WordSearchII

ZigZagLevelOrderTraversal

array

best_time_buy_sell_stock

best_time_buy_sell_stock_ii

climb_statirs

container_with_most_water

contains_duplicate

contains_duplicate_ii

intersect_array

majority_element

merge_sorted_array

missing_number

move_zero

pascals_triangle

plus_one

power_is_two

remove_deulicates

repeat_number

reverse_bits

rotate_array

rotate_image

set_matrix_zeros

shuffle_array

single_number

three_sum

two_sum

valid_suduko

generate_parentheses

nqueues

nqueues_ii

permutations

permutations_ii

phone_number_letter

subsets

word_search

find_peak_element

first_last_sort_array

perfect_square

search_rotated_sorted_array

sqrt_x

bloom_filter

friend_circles

number_of_islands

surrounded_regions

unoin_find

powx_n

coin_change

decode_ways

edit_distance

house_robber

longest_common_subsequence

longest_increasing_subsequence

maximal_square

maximum_product_subarray

maximum_subarray

min_cost_climbing_stairs

minimum_path_sum

triangle

unique_path

unique_path_ii

jump_game

array_intersection

array_intersection_ii

find_all_anagrams

group_anagram

jewels_and_stones

randomized_set

valid_anagram

kth_largest_element

top_k_frequent

circular_linked_list

doubly_linked_list

add_two_numbers

delete_nth_node

intersection_of_two_linked_lists

linked_list_cycle

linked_list_cycle_ii

merge_sorted_list

middle_of_the_linked_list

odd_even_linked_list

palindrome_linked_list

remove_duplicates_from_sorted_list

reverse_linked_list

reverse_nodes_in_k_group

swap_nodes_in_pairs

singly_linked_list

array_queue

circular_deque

circular_queue

linked_queue

sliding_window_maximum

stack_use_queue

word_ladder

bubble_sort

insertion_sort

merge_intervals

sort_color

merge_sort

quick_sort

selection_sort

test

array_stack

largest_rectangle_histogram

min_stack

next_greater_element_i

queue_use_stack

score_of_parentheses

valid_parentheses

linked_stack

first_unique_char

implement_strstr

is_palindrome

length_of_ast_word

longest_common_prefix

longest_substring_without_repeating_characters

reverse_string

reverse_string_ii

reverse_wrod_in_string

to_lower_case

average_levels_binary_tree

binary_tree_inorder_traversal

binary_tree_level_order_traversal

binary_tree_postorder_traversal

binary_tree_preorder_traversal

binary_tree_zigzag_level_order_traversal

kth_smallest_element_bst

maximum_depth_binary_tree

minimum_depth_binary_tree

populating_next_right_pointers_each_node

symmetric_tree

valid_bst

2  赞