Update README.md

Author: Jaskaran Singh

README.md

@@ -10,6 +10,7 @@
 | 771 | Jewels and Stones | You're given strings J representing the types of stones that are jewels, and S representing the stones you have.  Each character in S is a type of stone you have.  You want to know how many of the stones you have are also jewels. The letters in J are guaranteed distinct, and all characters in J and S are letters. Letters are case sensitive, so "a" is considered a different type of stone from "A". | [Solution](jewels_and_stones.js) |
 | 1108 | Defanging an IP Address | Given a valid (IPv4) IP address, return a defanged version of that IP address. A defanged IP address replaces every period "." with "[.]". | [Solution](ip_defanging.js) |
 | 1281 | Subtract the Product and Sum of Digits of an Integer | Given an integer number n, return the difference between the product of its digits and the sum of its digits. | [Solution](subtract_product_and_sum_integer.js) |
+| 1295 | Numbers with Even Number of Digits | Given an array nums of integers, return how many of them contain an even number of digits. | [Solution](numbers_even_number_of_digits.js) |
 | 1313 | Decompress Run-Length Encoded List | We are given a list nums of integers representing a list compressed with run-length encoding. Consider each adjacent pair of elements [freq, val] = [nums[2*i], nums[2*i+1]] (with i >= 0).  For each such pair, there are freq elements with value val concatenated in a sublist. Concatenate all the sublists from left to right to generate the decompressed list. | [Solution](decompress_run_length_encoded_list.js) |
 | 1342 | Number of Steps to Reduce a Number to Zero | Given a non-negative integer num, return the number of steps to reduce it to zero. If the current number is even, you have to divide it by 2, otherwise, you have to subtract 1 from it. | [Solution](reduce_to_zero.js) |
 | 1365 | How Many Numbers Are Smaller Than the Current Number | Given the array nums, for each nums[i] find out how many numbers in the array are smaller than it. That is, for each nums[i] you have to count the number of valid j's such that j != i and nums[j] < nums[i]. | [Solution](numbers_smaller_than_current.js) |