Fixed suggestion and loading not matching size of search bar. Disabled search button for now

Author: abhitrueprogrammer

src/components/searchbar.tsx

@@ -81,17 +81,16 @@ function SearchBar () {
             placeholder="Search..." 
             className={`w-full rounded-xl border px-4 py-6 pr-10 bg-[#7480FF] placeholder:text-white text-white opacity-50 shadow-sm focus:outline-none focus:ring-2 ${loading ? 'opacity-70' : ''}`}
           />
-          <button type="submit" className="absolute inset-y-0 right-0 flex items-center pr-3" disabled={loading}>
+          <button type="submit" className="absolute inset-y-0 right-0 flex items-center pr-3" disabled>  {/* disabled={loading} */}
             <Search className="h-5 w-5 text-white opacity-50" />
           </button>
-        </div>
         {loading && (
           <div className="absolute z-20 w-full max-w-xl border bg-white border-[#7480FF] dark:bg-[#030712] rounded-md mt-2 p-2 text-center">
             Loading suggestions...
           </div>
         )}
         {(suggestions.length > 0 || error) && !loading && (
-          <ul ref={suggestionsRef} className="absolute mx-0.5 md:mx-0 md:w-full text-center max-w-xl z-20 border bg-white border-[#7480FF] dark:bg-[#030712] rounded-md mt-2">
+          <ul ref={suggestionsRef} className="absolute mx-0.5 md:mx-0 w-full text-center max-w-xl z-20 border bg-white border-[#7480FF] dark:bg-[#030712] rounded-md mt-2">
             {error ? (
               <li className="p-2 text-red">{error}</li>
             ) : (
@@ -108,6 +107,7 @@ function SearchBar () {
             )}
           </ul>
         )}
+        </div>
       </form>
     </div>
   );

test.c

@@ -0,0 +1,114 @@
+
+// C program to add two polynomials
+#include <stdio.h>
+#include <stdlib.h>
+
+struct Node
+{
+    int coeff;
+    int pow;
+    struct Node *next;
+};
+
+struct Node *createNode(int c, int p);
+
+struct Node *addPolynomial(struct Node *head1, struct Node *head2)
+{
+    struct Node *dummy = createNode(0, 0);
+
+    // Node to append other nodes to the end
+    // of list
+    struct Node *prev = dummy;
+    struct Node *curr1 = head1, *curr2 = head2;
+
+    while (curr1 != NULL && curr2 != NULL)
+    {
+        // if curr2.pow > curr1.pow, then
+        // append curr2 to list
+
+        if (curr1->pow < curr2->pow)
+        {
+            prev->next = curr2;  // dummy next = curr2
+            prev = curr2;        // now make prev as curr2, so after this next for curr2 changes.
+            curr2 = curr2->next; // now curr 2 is next value
+        }
+        // if curr1.pow > curr2.pow, then
+        // append curr2 to list
+        else if (curr1->pow > curr2->pow)
+        {
+            prev->next = curr1;
+            prev = curr1;
+            curr1 = curr1->next;
+        }
+
+        // else, add the sum of curr1->coeff and
+        // curr2->coeff to curr1->coeff, and append
+        // curr1 to the list
+        else
+        {
+            curr1->coeff = curr1->coeff + curr2->coeff;
+            prev->next = curr1;
+            prev = curr1;
+            curr1 = curr1->next;
+            curr2 = curr2->next;
+        }
+    }
+
+    // if curr1 is not null, then append the rest
+    // to the list
+    if (curr1 != NULL)
+    {
+        prev->next = curr1;
+    }
+
+    // if curr2 is not null, then append the rest
+    // to the list
+    if (curr2 != NULL)
+    {
+        prev->next = curr2;
+    }
+
+    return dummy->next;
+}
+
+void printList(struct Node *head)
+{
+    struct Node *curr = head;
+
+    while (curr != NULL)
+    {
+        printf("%d,%d ", curr->coeff, curr->pow);
+        curr = curr->next;
+    }
+
+    printf("\n");
+}
+
+struct Node *createNode(int c, int p)
+{
+    struct Node *newNode =
+        (struct Node *)malloc(sizeof(struct Node));
+    newNode->coeff = c;
+    newNode->pow = p;
+    newNode->next = NULL;
+    return newNode;
+}
+
+int main()
+{
+
+    // 1st polynomial: 5x^2+4x^1+2x^0
+    struct Node *head1 = createNode(5, 2);
+    head1->next = createNode(4, 1);
+    head1->next->next = createNode(2, 0);
+
+    // 2nd polynomial: -5x^1-5x^0
+    struct Node *head2 = createNode(-5, 1);
+    head2->next = createNode(-5, 0);
+
+    struct Node *head = addPolynomial(head1, head2);
+
+    printList(head);
+
+    return 0;
+}