| Title | Topics | Action | |||
|---|---|---|---|---|---|
| 526 | Linear SearchWrite `linear_search(values: list[int], target: int) -> int` that walks the list... | easy | ○ Not Started | Data Structures & Algorithms | Solve |
| 527 | Duplicates By Brute ForceWrite `has_duplicates_brute(values: list[int]) -> bool` that returns `True` when... | easy | ○ Not Started | Data Structures & AlgorithmsBig-O | Solve |
| 528 | Duplicates With A SetWrite `has_duplicates_set(values: list[int]) -> bool` that walks the list once, ... | easy | ○ Not Started | Data Structures & AlgorithmsBig-O | Solve |
| 529 | First Repeated ValueWrite `first_duplicate(values: list[int]) -> int` that returns the first value w... | easy | ○ Not Started | Data Structures & Algorithms | Solve |
| 530 | Queue On A DequeComplete the `Queue` class built on `from collections import deque`: `enqueue(it... | easy | ○ Not Started | Data Structures & Algorithms | Solve |
| 531 | Partition Around A PivotWrite `partition(values: list[int], pivot: int) -> tuple[list[int], list[int], l... | easy | ○ Not Started | Data Structures & Algorithms | Solve |
| 532 | Array Children Of A NodeA complete binary tree can be stored in a list, row by row, with the root at ind... | easy | ○ Not Started | Data Structures & Algorithms | Solve |
| 533 | Reverse In PlaceWrite `reverse_in_place(values: list[int]) -> None` that reverses the list witho... | easy | ○ Not Started | Data Structures & Algorithms | Solve |
| 534 | Two Sum By Brute ForceWrite `two_sum_brute(values: list[int], target: int) -> tuple[int, int]` that re... | easy | ○ Not Started | Data Structures & AlgorithmsBig-O | Solve |
| 535 | Count Pairs That SumWrite `count_pairs(values: list[int], target: int) -> int` that returns how many... | easy | ○ Not Started | Data Structures & AlgorithmsBig-O | Solve |
| 536 | Is The List SortedWrite `is_sorted(values: list[int]) -> bool` that returns `True` when the list i... | easy | ○ Not Started | Data Structures & Algorithms | Solve |
| 537 | Remove Duplicates Keep OrderWrite `remove_duplicates_keep_order(values: list[int]) -> list[int]` that return... | easy | ○ Not Started | Data Structures & Algorithms | Solve |
| 538 | Rotate Left By SlicingWrite `rotate_left(values: list[int], k: int) -> list[int]` that returns a new l... | easy | ○ Not Started | Data Structures & AlgorithmsSlicing | Solve |
| 539 | Count Frequency With A DictWrite `count_frequency(words: list[str]) -> dict[str, int]` that returns a dicti... | easy | ○ Not Started | Data Structures & Algorithms | Solve |
| 540 | Bubble SortComplete `bubble_sort(values: list[int]) -> None`, which sorts the list in place... | easy | ○ Not Started | Data Structures & AlgorithmsBig-O | Solve |
| 541 | Count OccurrencesWrite `count_occurrences(values: list[int], target: int) -> int` that returns ho... | easy | ○ Not Started | Data Structures & Algorithms | Solve |
| 542 | Index Of The LargestWrite `index_of_max(values: list[int]) -> int` that returns the index of the lar... | easy | ○ Not Started | Data Structures & Algorithms | Solve |
| 543 | Running MinimumWrite `smallest(values: list[int]) -> int` that returns the smallest value using... | easy | ○ Not Started | Data Structures & Algorithms | Solve |
| 544 | Every Index Of A TargetWrite `all_indexes(values: list[int], target: int) -> list[int]` that returns a ... | easy | ○ Not Started | Data Structures & Algorithms | Solve |
| 545 | Reverse A Word With A StackThe `Stack` class is given. Write `reverse_word(text: str) -> str` that pushes e... | easy | ○ Not Started | Data Structures & Algorithms | Solve |
| 546 | Take Turns In A QueueWrite `take_turns(names: list[str], rounds: int) -> list[str]` using `from colle... | easy | ○ Not Started | Data Structures & Algorithms | Solve |
| 547 | Array Parent Of A NodeIn a complete binary tree stored in a list, the children of index `i` are at `2 ... | easy | ○ Not Started | Data Structures & Algorithms | Solve |
| 548 | Common Values With SetsWrite `common_values(first: list[int], second: list[int]) -> list[int]` that ret... | easy | ○ Not Started | Data Structures & Algorithms | Solve |
| 549 | Find The Missing NumberWrite `missing_number(values: list[int]) -> int`: the list holds every whole num... | easy | ○ Not Started | Data Structures & Algorithms | Solve |
| 550 | Kth Smallest ValueWrite `kth_smallest(values: list[int], k: int) -> int` that returns the k-th sma... | easy | ○ Not Started | Data Structures & Algorithms | Solve |
| 551 | Greedy Coins UsedWrite `greedy_coins_used(amount: int, coins: list[int]) -> list[int]` that retur... | easy | ○ Not Started | Data Structures & Algorithms | Solve |
| 552 | Search A GridWrite `search_grid(grid: list[list[int]], target: int) -> tuple[int, int]` that ... | easy | ○ Not Started | Data Structures & Algorithms | Solve |
| 553 | Remove Every MatchWrite `remove_all(values: list[int], target: int) -> list[int]` that returns a n... | easy | ○ Not Started | Data Structures & Algorithms | Solve |
| 554 | Subarray Sums By Brute ForceWrite `max_subarray_brute(values: list[int]) -> int` that returns the largest su... | easy | ○ Not Started | Data Structures & AlgorithmsBig-O | Solve |
| 555 | Binary Search IterativeWrite `binary_search(values: list[int], target: int) -> int`, the iterative vers... | medium | ○ Not Started | Data Structures & AlgorithmsBig-O | Solve |
| 556 | Stack On A ListComplete the `Stack` class built on a list, where the end of the list is the top... | medium | ○ Not Started | Data Structures & Algorithms | Solve |
| 557 | Balanced BracketsThe `Stack` class is given. Write `balanced_brackets(text: str) -> bool` that re... | medium | ○ Not Started | Data Structures & Algorithms | Solve |
| 558 | Hot PotatoWrite `hot_potato(names: list[str], k: int) -> str` using `from collections impo... | medium | ○ Not Started | Data Structures & Algorithms | Solve |
| 559 | Two Finger MergeWrite `merge(left: list[int], right: list[int]) -> list[int]`, the two-finger me... | medium | ○ Not Started | Data Structures & AlgorithmsBig-O | Solve |
| 560 | Greedy CoinsWrite `greedy_coins(amount: int, coins: list[int]) -> int` that returns how many... | medium | ○ Not Started | Data Structures & Algorithms | Solve |
| 561 | Largest Subarray SumWrite `max_subarray_sum(values: list[int]) -> int` that returns the largest sum ... | medium | ○ Not Started | Data Structures & AlgorithmsBig-O | Solve |
| 562 | Selection SortWrite `selection_sort(values: list[int]) -> None` that sorts the list in place: ... | medium | ○ Not Started | Data Structures & AlgorithmsBig-O | Solve |
| 563 | Insertion SortWrite `insertion_sort(values: list[int]) -> None` that sorts the list in place: ... | medium | ○ Not Started | Data Structures & AlgorithmsBig-O | Solve |
| 564 | Second Largest In One PassWrite `second_largest(values: list[int]) -> int` that returns the second largest... | medium | ○ Not Started | Data Structures & Algorithms | Solve |
| 565 | Queen Safety CheckIn the N-Queens puzzle the queens placed so far are stored as a list `queens` wh... | medium | ○ Not Started | Data Structures & Algorithms | Solve |
| 571 | Postfix Calculator With A StackThe `Stack` class is given. Write `evaluate_postfix(tokens: list[str]) -> int` t... | medium | ○ Not Started | Data Structures & Algorithms | Solve |
| 572 | Most Frequent ValueWrite `most_frequent(values: list[int]) -> int` that returns the value appearing... | medium | ○ Not Started | Data Structures & Algorithms | Solve |
| 573 | Two Sum With Two PointersWrite `two_sum_sorted(values: list[int], target: int) -> tuple[int, int]` for a ... | medium | ○ Not Started | Data Structures & AlgorithmsBig-O | Solve |
| 574 | Count Binary Search StepsWrite `binary_search_steps(values: list[int], target: int) -> int` that runs a b... | medium | ○ Not Started | Data Structures & AlgorithmsBig-O | Solve |
| 575 | Min Heap Property CheckA min-heap stored in a list has every parent no larger than its children, where ... | medium | ○ Not Started | Data Structures & Algorithms | Solve |
| 566 | Merge SortWrite `merge_sort(values: list[int]) -> list[int]` that returns a new sorted lis... | hard | ○ Not Started | Data Structures & AlgorithmsBig-O | Solve |
| 567 | Quick Sort With PartitionWrite `quick_sort(values: list[int]) -> list[int]` that returns a new sorted lis... | hard | ○ Not Started | Data Structures & AlgorithmsBig-O | Solve |
| 568 | Binary Search TreeThe `Node` class and the `BST` class header are given. Write the rest of a binar... | hard | ○ Not Started | Data Structures & Algorithms | Solve |
| 569 | Eight Queens CountWrite `n_queens_count(n: int) -> int` that returns how many ways `n` queens can ... | hard | ○ Not Started | Data Structures & Algorithms | Solve |
| 570 | Fewest Coins With A TableWrite `count_min_coins_dp(amount: int, coins: list[int]) -> int` that returns th... | hard | ○ Not Started | Data Structures & Algorithms | Solve |