Freaks City

Finding Saddle Points in a 2D Array A saddle point in an m×n matrix is an element that is both the maximum in its row and the minimum in its column. #include <stdio.h> void locateSaddlePoint(int matrix[100][100], int rows, int cols) { for (int row = 0; row < rows; row++) { int rowMax = matrix[row][0]; int maxCol = ...

Manacher's Algorithm for Longest Palindromic Substring Identifying the longest palindromic substring within a string requires handling both odd and even-length palindromes. A common approach involves expanding from each center, but this method fails to detect even-length palindromes. The solution is to insert a delimiter character between each ...

Dynamic Bound Tracking for Absolute Value SumsWhen calculating the maximum possible sum of an array where an absolute value operation can be applied to the running total at any point, tracking the exact moment to apply the operation is complex. A flawed approach might conditionally apply absolute values based on the sign of the next element and ...