1295-find-numbers-with-even-number-of-digits-a

Author: mzeeshan138

1295-find-numbers-with-even-number-of-digits-a.js

@@ -0,0 +1,13 @@
+/**
+ * @param {number[]} nums
+ * @return {number}
+ */
+var findNumbers = function (nums) {
+  let count = 0;
+  for (let num of nums) {
+    if ((num.toString().length & 1) === 0) {
+      count++;
+    }
+  }
+  return count;
+};

README.md

@@ -0,0 +1,106 @@
+# 🚀 LeetCode JS Easy Solutions
+
+Welcome to my **LeetCode JavaScript Easy Solutions** repository! 🎉 This repository contains solutions to various **easy-level** problems from LeetCode. Each solution is written in JavaScript, and I provide detailed analysis of the problem and my approach to solving it. 📝
+
+## 👨‍💻 Author: Muhammad Zeeshan
+
+🔗 **Portfolio:** [ZeePortfolio](https://mzeeshan138.github.io/ZeePortfolio/)  
+🐙 **GitHub:** [mzeeshan138](https://github.com/mzeeshan138)  
+📧 **Email:** muhammadzeeshan588685@gmail.com  
+🔗 **LinkedIn:** [Muhammad Zeeshan](https://www.linkedin.com/in/muhammad-zeeshan-087584306/)  
+🔗 **LeetCode Profile:** [Zeeshan's LeetCode Profile](https://leetcode.com/u/zeeshan106/)
+
+---
+
+## 📂 Problem List
+
+This repository currently includes solutions for LeetCode's **easy-level** problems. Here's the breakdown:
+
+- **9. Palindrome Number**
+
+---
+
+## 🎯 Problem: Palindrome Number (LeetCode 9)
+
+### Problem Statement:
+
+Given an integer `x`, return `true` if `x` is a palindrome, and `false` otherwise.
+
+Example 1:  
+Input: `x = 121`  
+Output: `true`  
+Explanation: `121` reads the same backward as forward.
+
+Example 2:  
+Input: `x = -121`  
+Output: `false`  
+Explanation: `-121` is not a palindrome. Reading it from right to left gives `121-`.
+
+Example 3:  
+Input: `x = 10`  
+Output: `false`  
+Explanation: `10` is not a palindrome since the reverse is `01`.
+
+---
+
+### 🔍 **Solution Analysis:**
+
+- **Time Complexity:**  
+  ⏱️ O(log n)  
+  We reverse half of the digits of the number, so the time complexity depends on the number of digits in `x`.
+
+- **Space Complexity:**  
+  💾 O(1)  
+  We only use a constant amount of space to store the `reverted` number.
+
+- **Test Cases:**  
+  ✅ Passed all **11,511** hidden and sample test cases on LeetCode!
+
+---
+
+### 🏆 **Performance Results:**
+
+- ⚡️ **Runtime:** 3 ms (Beats **98.69%** of JavaScript solutions)
+- 🧮 **Memory Usage:** 63.98 MB (Beats **79.21%** of JavaScript solutions)
+
+---
+
+### 🔗 **GitHub Repo:**
+
+🔗 [leetcode-js-easy-solutions](https://github.com/mzeeshan138/leetcode-js-easy-solutions.git)  
+You can find the code for this solution in the file `9-palindrome-number.js`.
+
+---
+
+## 🛠️ Technologies Used
+
+- **JavaScript (ES6+)** – Core programming language
+- **Git & GitHub** – Version control and collaboration
+
+---
+
+## 🌟 Features
+
+✅ **Efficient and optimized solutions** 💻  
+✅ **Beginner-friendly and easy to understand** 🎓  
+✅ **Clear explanations and performance analysis** 🧠  
+✅ **Well-organized problem-solving approach** 🏆
+
+---
+
+## 🤝 Contributing
+
+Feel free to fork this repository, add your solutions, and submit a pull request! 🚀  
+Let's improve and grow together. 🎉
+
+---
+
+## 📬 Contact
+
+📧 **Email:** muhammadzeeshan588685@gmail.com  
+🔗 **LinkedIn:** [Muhammad Zeeshan](https://www.linkedin.com/in/muhammad-zeeshan-087584306/)  
+🐙 **GitHub:** [mzeeshan138](https://github.com/mzeeshan138)
+
+---
+
+⭐ **If you find this repository helpful, please give it a star!** ⭐