Longest Repeating Character Replacement - a faster approach
Date: 3/10/2024Tags:algorithmsleetcodesliding_windowThe code implements an algorithm that maintains the maximum window length by advancing the start pointer when needed, as the end pointer moves forward while comparing maxFreq with hashTB[s[end]] to track the new maximum character frequency for a problem related to replacing characters for Longest Repeating Character Replacement.
Longest Repeating Character Replacement
Date: 3/10/2024Tags:algorithmsleetcodesliding_windowThe journal entry explores the "Longest Repeating Character Replacement" problem, offering a binary search solution to find the length of the longest substring with the same letter by changing characters within a given limit, while delving further into related algorithms.
Valid Sudoku
Date: 3/8/2024Tags:algorithmsleetcodehash_tableThe journal entry discusses a solution to the "Valid Sudoku" problem by creating hash tables for rows, columns, and squares in a Sudoku board and checking for any number repetition to determine if the board is valid.
Network Delay Time - Dijkstra's Algorithm
Date: 3/8/2024Tags:algorithmsleetcodeheap_sortgraphThe journal entry discusses the application of Dijkstra's Algorithm to find the shortest path to all nodes in a graph, explaining a step-by-step process followed by an implementation code that uses a min heap to calculate the network delay time between nodes effectively.
Network Delay Time - Breadth First Search Approach
Date: 3/7/2024Tags:algorithmsleetcodegraphbreadth_first_searchThe described journal entry presents a solution utilizing a breadth-first search strategy to efficiently solve the Network Delay Time problem, outperforming the depth-first search approach and ensuring optimal path allocation based on node distances in an adjacency list, with code implementing the algorithm for calculating network delay times for a given set of connections and source node.