Leetcode PracticeToday, we will work on some LeetCode questions to develop our approach to solving array problems. Question 169: Majority Element The question asks us to find the element that appears most frequently in an array called 'nums' of size n. There are mul...Jan 9, 2026·5 min read
What is Rate of growth?The rate of growth in time complexity refers to how the running time of an algorithm increases relative to the size of the input (usually denoted as n). It gives a way to compare the efficiency of different algorithms, especially for large inputs. S...Jul 14, 2025·5 min read
