Merge branch 'main' of github.com:All3yp/Daily-Coding-problems

Author: All3yp

Readme.md

@@ -6,11 +6,11 @@
 
 ## 🚀 Problem 1 [Easy]
 
-This problem was recently asked by Google.
+#### This problem was recently asked by Google.
 
-Given a list of numbers and a number k, return whether any two numbers 
-rom the list add up to k.
-For example, given [10, 15, 3, 7] and k of 17, return true since 10 + 7 is 17.
+Given a list of numbers and a number `k`, return whether any two numbers 
+rom the list add up to `k`.
+For example, given `[10, 15, 3, 7]` and `k` of `17`, return true since `10 + 7` is `17`.
 
 Bonus: Can you do this in one pass?
 
@@ -20,15 +20,15 @@ Bonus: Can you do this in one pass?
 
 ## 🚀 Problem 2 [Easy]
 
-This problem was asked by Uber.
+#### This problem was asked by Uber.
 
 Given an array of integers, return a new array such that each element 
-at index i of the new array is the product of all the numbers in the 
-original array except the one at i.
+at index `i` of the new array is the product of all the numbers in the 
+original array except the one at `i`.
 
-For example, if our input was [1, 2, 3, 4, 5], the expected output 
-would be [120, 60, 40, 30, 24]. If our input was [3, 2, 1], 
-the expected output would be [2, 3, 6].
+For example, if our input was `[1, 2, 3, 4, 5]`, the expected output 
+would be `[120, 60, 40, 30, 24]`. If our input was `[3, 2, 1]`, 
+the expected output would be `[2, 3, 6]`.
 
 Follow-up: what if you can't use division?
 
@@ -38,9 +38,9 @@ Follow-up: what if you can't use division?
 
 ## 🚀 Problem 3 [Medium]
 
-This problem was asked by Google.
+#### This problem was asked by Google.
 
-Given the root to a binary tree, implement serialize(root), which serializes the tree into a string, and deserialize(s), which deserializes the string back into the tree.
+Given the root to a binary tree, implement `serialize(root)`, which serializes the tree into a string, and `deserialize(s)`, which deserializes the string back into the tree.
 
 For example, given the following Node class
 
@@ -70,7 +70,7 @@ expect(deserialize(serialize(node)).left.left.val).toEqual('left.left');
 
 ## 🚀 Problem 4 [Hard]
 
-This problem was asked by Stripe.
+#### This problem was asked by Stripe.
 
 Given an array of integers, find the first missing positive integer in linear time and constant space. In other words, find the lowest positive integer that does not exist in the array. The array can contain duplicates and negative numbers as well.
 
@@ -84,9 +84,9 @@ You can modify the input array in-place.
 
 ## 🚀 Problem 5 [Medium]
 
-This problem was asked by Jane Street.
+#### This problem was asked by Jane Street.
 
-cons(a, b) constructs a pair, and car(pair) and cdr(pair) returns the first and last element of that pair. For example, car(cons(3, 4)) returns 3, and cdr(cons(3, 4)) returns 4.
+`cons(a, b)` constructs a pair, and `car(pair)` and `cdr(pair)` returns the first and last element of that pair. For example, `car(cons(3, 4))` returns 3, and `cdr(cons(3, 4))` returns 4.
 
 Given this implementation of cons:
 
@@ -109,7 +109,7 @@ Implement car and cdr.
 
 ## 🚀 Problem 6 [Hard]
 
-This problem was asked by Google.
+#### This problem was asked by Google.
 
 An XOR linked list is a more memory efficient doubly linked list. Instead of each node holding next and prev fields, it holds a field named both, which is an XOR of the next node and the previous node. Implement an XOR linked list; it has an `add(element)` which adds the element to the end, and a `get(index)` which returns the node at index.
 
@@ -122,13 +122,11 @@ If using a language that has no pointers (such as Python), you can assume you ha
 
 ## 🚀 Problem 7 [Medium]
 
-This problem was asked by Facebook.
+#### This problem was asked by Facebook.
 
-Given the mapping a = 1, b = 2, ... z = 26, and an encoded message, count the number of ways it can be decoded.
-
-For example, the message '111' would give 3, since it could be decoded as 'aaa', 'ka', and 'ak'.
-
-You can assume that the messages are decodable. For example, '001' is not allowed.
+Given the mapping `a = 1, b = 2, ... z = 26`, and an encoded message, count the number of ways it can be decoded.
+For example, the message `'111'` would give 3, since it could be decoded as `'aaa'`, `'ka'`, and `'ak'`.
+You can assume that the messages are decodable. For example, `'001'` is not allowed.
 
 [Solution 🎉](https://github.com/All3yp/Daily-Coding-problems/blob/main/Daily_Coding_Problem-07.cpp)
 #### Click [__*here*__](https://leetcode.com/problems/decode-ways/) to visit this question on [*LeetCode*](https://leetcode.com/).