This application contains a set of examples for all mayor linear algebraic algorithms. Within the source code there are definitions and complex descriptions to the different aspects of computing bidimentional arrays of any size. This project focuses in computing systems of equations of nxn size.

A team project on sorting algorithms

C solution to a LeetCode #5 (Longest Palindromic Substring) problem, fully documented and analyzed with an emphasis on optimal runtime and memory efficiency.

C solution to a LeetCode #6 (ZigZag Conversion) problem, fully documented and analyzed with an emphasis on optimal runtime and memory efficiency.

Sorting Algorithms Implementation in C. The main objective is to assess the performance of these algorithms across varying array sizes, offering insights into their time complexities and a Visual Representation of the trends in time complexities through graphs.

C solution to a LeetCode #7 (Reverse Integer) problem, fully documented and analyzed with an emphasis on optimal runtime and memory efficiency.

C solution to a LeetCode #3 (Longest Substring Without Repeating Characters) problem, fully documented and analyzed with an emphasis on optimal runtime and memory efficiency.