Nov 6, 2025
diff --git a/c/0179-largest-number.c b/c/0179-largest-number.c
    // Sort the array with specified comparaotor.
    qsort(nums, numsSize, sizeof(int), compareInt);

    //Caculate the length of the return string.
    //Calculate the length of the return string.
    len = 1;
    for (i = 0; i < numsSize; i++) len +=  snprintf(NULL, 0, "%d", nums[i]);
    res = calloc(len, sizeof(char));

    // If thefirs element of sorted array is 0,
    // If thefirst element of sorted array is 0,
    // return a single digit of 0 no matter how long is the string.
    if (nums[0] == 0) {
        res[0] = '0';
diff --git a/cpp/0155-min-stack.cpp b/cpp/0155-min-stack.cpp
 /*
    Design stack that supports push, pop, top, &retriving min element
    Design stack that supports push, pop, top, &retrieving min element

    2 stacks, 1 normal & 1 monotonic decr, only push if lower than top

diff --git a/cpp/0278-first-bad-version.cpp b/cpp/0278-first-bad-version.cpp
    call isBadVersion(4) -> true

    1.- Find the number in the middle of the vector.
    2.- Takes a part (first or second), depending on whether or not the target is greater than themiddel.
    2.- Takes a part (first or second), depending on whether or not the target is greater than themiddle.
    3.- Change the current left or right part.
    3.- Do this process until the left reaches the right.

diff --git a/cpp/1921-eliminate-maximum-number-of-monsters.cpp b/cpp/1921-eliminate-maximum-number-of-monsters.cpp
      Explanation:
      In the beginning, the distances of the monsters are [1,3,4]. You eliminate the first monster.
      After a minute, the distances of the monsters are [X,2,3]. You eliminate the second monster.
      After a minute, the distances of the monsters are [X,X,2]. You eliminate thethrid monster.
      After a minute, the distances of the monsters are [X,X,2]. You eliminate thethird monster.
      All 3 monsters can be eliminated.

  Time  : O(N)
diff --git a/javascript/1882-process-tasks-using-servers.js b/javascript/1882-process-tasks-using-servers.js
    for (let i = 0; i < tasks.length; i++) {
        sec = Math.max(i, sec);

        // if the we don't have server available then jump to the nextimidiate
        // if the we don't have server available then jump to the nextimmediate
        // time when the server will be available.
        if (freeServers.isEmpty()) {
            sec = toBeCompleted.front()[0];
Original file line number	Diff line number	Diff line change
Expand Up		@@ -23,12 +23,12 @@ char * largestNumber(int* nums, int numsSize){
		// Sort the array with specified comparaotor.
		qsort(nums, numsSize, sizeof(int), compareInt);

		//Caculate the length of the return string.
		//Calculate the length of the return string.
		len = 1;
		for (i = 0; i < numsSize; i++) len += snprintf(NULL, 0, "%d", nums[i]);
		res = calloc(len, sizeof(char));

		// If thefirs element of sorted array is 0,
		// If thefirst element of sorted array is 0,
		// return a single digit of 0 no matter how long is the string.
		if (nums[0] == 0) {
		res[0] = '0';
Expand Down
Original file line number	Diff line number	Diff line change
		@@ -1,5 +1,5 @@
		/*
		Design stack that supports push, pop, top, &retriving min element
		Design stack that supports push, pop, top, &retrieving min element

		2 stacks, 1 normal & 1 monotonic decr, only push if lower than top

Expand Down
Original file line number	Diff line number	Diff line change
Expand Up		@@ -12,7 +12,7 @@
		call isBadVersion(4) -> true

		1.- Find the number in the middle of the vector.
		2.- Takes a part (first or second), depending on whether or not the target is greater than themiddel.
		2.- Takes a part (first or second), depending on whether or not the target is greater than themiddle.
		3.- Change the current left or right part.
		3.- Do this process until the left reaches the right.

Expand Down
Original file line number	Diff line number	Diff line change
Expand Up		@@ -15,7 +15,7 @@
		Explanation:
		In the beginning, the distances of the monsters are [1,3,4]. You eliminate the first monster.
		After a minute, the distances of the monsters are [X,2,3]. You eliminate the second monster.
		After a minute, the distances of the monsters are [X,X,2]. You eliminate thethrid monster.
		After a minute, the distances of the monsters are [X,X,2]. You eliminate thethird monster.
		All 3 monsters can be eliminated.

		Time : O(N)
Expand Down
Original file line number	Diff line number	Diff line change
Expand Up		@@ -33,7 +33,7 @@ var assignTasks = function (servers, tasks) {
		for (let i = 0; i < tasks.length; i++) {
		sec = Math.max(i, sec);

		// if the we don't have server available then jump to the nextimidiate
		// if the we don't have server available then jump to the nextimmediate
		// time when the server will be available.
		if (freeServers.isEmpty()) {
		sec = toBeCompleted.front()[0];
Expand Down