AlgoChronicle - Daily DSA Problems https://www.algochronicle.com Track your coding growth, one commit at a time. Daily Data Structures and Algorithms practice log. en-us Thu, 15 Oct 2026 22:14:02 GMT Day 55: Kids With the Greatest Number of Candies https://github.com/srujanchidarla/dsa-problems/blob/main/day055_kids_with_greatest_candies/README.md algochronicle-day-55 Thu, 15 Oct 2026 22:14:02 GMT Kids With the Greatest Number of Candies

Platform: LeetCode (1431)

Optimized Complexity: O(n)

Brute Force Complexity: O(n²)

Space Complexity: O(1)


View Problem ]]> LeetCode (1431) Day 54: Best Time to Buy and Sell Stock https://github.com/srujanchidarla/dsa-problems/blob/main/day054_best_time_stock/README.md algochronicle-day-54 Thu, 15 Oct 2026 22:14:02 GMT Best Time to Buy and Sell Stock

Platform: LeetCode (121)

Optimized Complexity: O(n)

Brute Force Complexity: N/A

Space Complexity: O(1)


View Problem ]]> LeetCode (121) Day 53: Longest Substring Without Repeating Characters https://github.com/srujanchidarla/dsa-problems/blob/main/day053_longest_substring/README.md algochronicle-day-53 Thu, 15 Oct 2026 22:14:02 GMT Longest Substring Without Repeating Characters

Platform: LeetCode (3)

Optimized Complexity: O(n)

Brute Force Complexity: N/A

Space Complexity: O(min(n, alphabet))


View Problem ]]> LeetCode (3) Day 52: Product of Array Except Self https://github.com/srujanchidarla/dsa-problems/blob/main/day052_product_except_self/README.md algochronicle-day-52 Thu, 15 Oct 2026 22:14:02 GMT Product of Array Except Self

Platform: LeetCode (238)

Optimized Complexity: O(n)

Brute Force Complexity: N/A

Space Complexity: O(1) extra


View Problem ]]> LeetCode (238) Day 51: Maximum Subarray https://github.com/srujanchidarla/dsa-problems/blob/main/day051_maximum_subarray/README.md algochronicle-day-51 Thu, 15 Oct 2026 22:14:02 GMT Maximum Subarray

Platform: LeetCode (53)

Optimized Complexity: O(n)

Brute Force Complexity: N/A

Space Complexity: O(1)


View Problem ]]> LeetCode (53) Day 50: Reverse Linked List https://github.com/srujanchidarla/dsa-problems/blob/main/day050_reverse_linked_list/README.md algochronicle-day-50 Thu, 15 Oct 2026 22:14:02 GMT Reverse Linked List

Platform: LeetCode (206)

Optimized Complexity: O(n)

Brute Force Complexity: N/A

Space Complexity: O(1)


View Problem ]]> LeetCode (206) Day 49: Binary Search https://github.com/srujanchidarla/dsa-problems/blob/main/day049_binary_search/README.md algochronicle-day-49 Thu, 15 Oct 2026 22:14:02 GMT Binary Search

Platform: LeetCode (704)

Optimized Complexity: O(log n)

Brute Force Complexity: N/A

Space Complexity: O(1)


View Problem ]]> LeetCode (704) Day 48: Valid Palindrome https://github.com/srujanchidarla/dsa-problems/blob/main/day048_valid_palindrome/README.md algochronicle-day-48 Thu, 15 Oct 2026 22:14:02 GMT Valid Palindrome

Platform: LeetCode (125)

Optimized Complexity: O(n)

Brute Force Complexity: N/A

Space Complexity: O(1)


View Problem ]]> LeetCode (125) Day 47: Group Anagrams https://github.com/srujanchidarla/dsa-problems/blob/main/day047_group_anagrams/README.md algochronicle-day-47 Thu, 15 Oct 2026 22:14:02 GMT Group Anagrams

Platform: LeetCode (49)

Optimized Complexity: O(n · k log k)

Brute Force Complexity: N/A

Space Complexity: O(n · k)


View Problem ]]> LeetCode (49) Day 46: Valid Anagram https://github.com/srujanchidarla/dsa-problems/blob/main/day046_valid_anagram/README.md algochronicle-day-46 Thu, 15 Oct 2026 22:14:02 GMT Valid Anagram

Platform: LeetCode (242)

Optimized Complexity: O(n)

Brute Force Complexity: N/A

Space Complexity: O(1)


View Problem ]]> LeetCode (242) Day 45: Valid Parentheses https://github.com/srujanchidarla/dsa-problems/blob/main/day045_valid_parentheses/README.md algochronicle-day-45 Thu, 15 Oct 2026 22:14:02 GMT Valid Parentheses

Platform: LeetCode (20)

Optimized Complexity: O(n)

Brute Force Complexity: N/A

Space Complexity: O(n)


View Problem ]]> LeetCode (20) Day 44: Contains Duplicate https://github.com/srujanchidarla/dsa-problems/blob/main/day044_contains_duplicate/README.md algochronicle-day-44 Thu, 15 Oct 2026 22:14:02 GMT Contains Duplicate

Platform: LeetCode (217)

Optimized Complexity: O(n)

Brute Force Complexity: N/A

Space Complexity: O(n)


View Problem ]]> LeetCode (217) Day 43: Two Sum https://github.com/srujanchidarla/dsa-problems/blob/main/day043_two_sum/README.md algochronicle-day-43 Thu, 15 Oct 2026 22:14:02 GMT Two Sum

Platform: LeetCode (1)

Optimized Complexity: O(n)

Brute Force Complexity: O(n²)

Space Complexity: O(n)


View Problem ]]> LeetCode (1) Day 42: Maximum Nesting Depth of the Parentheses https://github.com/srujanchidarla/dsa-problems/blob/main/day042_max_nesting_depth_parentheses/README.md algochronicle-day-42 Thu, 15 Oct 2026 22:14:02 GMT Maximum Nesting Depth of the Parentheses

Platform: LeetCode (1614)

Optimized Complexity: O(n)

Brute Force Complexity: N/A

Space Complexity: O(1)


View Problem ]]> LeetCode (1614) Day 41: Merge Strings Alternately https://github.com/srujanchidarla/dsa-problems/blob/main/day041_merge_strings_alternately/README.md algochronicle-day-41 Thu, 15 Oct 2026 22:14:02 GMT Merge Strings Alternately

Platform: LeetCode (1768)

Optimized Complexity: O(m + n)

Brute Force Complexity: N/A

Space Complexity: O(m + n)


View Problem ]]> LeetCode (1768) Day 40: Remove Element https://github.com/srujanchidarla/dsa-problems/blob/main/day040_remove_element/README.md algochronicle-day-40 Thu, 15 Oct 2026 22:14:02 GMT Remove Element

Platform: LeetCode (27)

Optimized Complexity: O(n)

Brute Force Complexity: N/A

Space Complexity: O(1)


View Problem ]]> LeetCode (27) Day 39: Longest Subarray Divisible by K with At Most One Negation I https://github.com/srujanchidarla/dsa-problems/blob/main/day039_longest_subarray_divisible_by_k_one_negation/README.md algochronicle-day-39 Thu, 15 Oct 2026 22:14:02 GMT Longest Subarray Divisible by K with At Most One Negation I

Platform: LeetCode (4063)

Optimized Complexity: O(n²)

Brute Force Complexity: O(n³)

Space Complexity: O(k)


View Problem ]]> LeetCode (4063) Day 38: Transform Array Using Pair Operations https://github.com/srujanchidarla/dsa-problems/blob/main/day038_transform_array_pair_operations/README.md algochronicle-day-38 Thu, 15 Oct 2026 22:14:02 GMT Transform Array Using Pair Operations

Platform: LeetCode (4062)

Optimized Complexity: O(n)

Brute Force Complexity: N/A

Space Complexity: O(1)


View Problem ]]> LeetCode (4062) Day 37: Minimum Queen Moves to Reach Target https://github.com/srujanchidarla/dsa-problems/blob/main/day037_minimum_queen_moves/README.md algochronicle-day-37 Thu, 15 Oct 2026 22:14:02 GMT Minimum Queen Moves to Reach Target

Platform: LeetCode (4061)

Optimized Complexity: O(1)

Brute Force Complexity: N/A

Space Complexity: O(1)


View Problem ]]> LeetCode (4061) Day 36: Remove Duplicates from Sorted Array https://github.com/srujanchidarla/dsa-problems/blob/main/day036_remove_duplicates_sorted_array/README.md algochronicle-day-36 Thu, 15 Oct 2026 22:14:02 GMT Remove Duplicates from Sorted Array

Platform: LeetCode (26)

Optimized Complexity: O(n)

Brute Force Complexity: N/A

Space Complexity: O(1)


View Problem ]]> LeetCode (26)