---
title: "Rajat Tiwari (@rajattiwari) | Hashnode"
description: "Aspiring Software Developer. Read the latest articles by Rajat Tiwari on Hashnode."
url: "https://hashnode.com/@rajattiwari"
---

@rajattiwari

# Rajat Tiwari

@rajattiwari · Rudrapur, Uttarakhand, India · Joined March 2021

Aspiring Software Developer

[Website](https://rajattiwari01.github.io/)

### [Two Sum - LeetCode Easy](https://rajattiwari.hashnode.dev/two-sum-leetcode-easy?utm_source=hashnode&utm_medium=feed)

Problem Link - https://leetcode.com/problems/two-sum/ class Solution { public: vector<int> twoSum(vector<int>& nums, int target) { int n=nums.size(); //finding the length of the dynamic array i.e., our vector unordered\_map<int,int...

1 min read · [rajattiwari.hashnode.dev](https://rajattiwari.hashnode.dev/two-sum-leetcode-easy?utm_source=hashnode&utm_medium=feed)

[Jul 14, 2022](https://hashnode.com/posts/two-sum-leetcode-easy/62d042b6dec7a6eae9b58a2e)

### [Introduction to Computer Network](https://rajattiwari.hashnode.dev/introduction-to-computer-network?utm_source=hashnode&utm_medium=feed)

What is Computer Network? A computer network is a collection of various computing devices that are connected using multiple paths for the purpose of sending/recieving data or media. A sender send a data to the reciever while both sender i.e, client a...

2 min read · [rajattiwari.hashnode.dev](https://rajattiwari.hashnode.dev/introduction-to-computer-network?utm_source=hashnode&utm_medium=feed)

[Jun 19, 2022](https://hashnode.com/posts/introduction-to-computer-network/62aebde20924134a80488ef9)

### [How to grow 1% Everyday?](https://rajattiwari.hashnode.dev/how-to-grow-1-everyday?utm_source=hashnode&utm_medium=feed)

Rule of 1.01 1.01 ^ 365 = 37.8 Everyday do a little to grow and atleast try to do. Here are 5 ways to grow 1% daily. 1. Fail more, Fail fast & Fail big: If we Fail more often, fail faster, fail bigger, we learn more & grow more. I used to avoid fai...

2 min read · [rajattiwari.hashnode.dev](https://rajattiwari.hashnode.dev/how-to-grow-1-everyday?utm_source=hashnode&utm_medium=feed)

[Apr 20, 2021](https://hashnode.com/posts/how-to-grow-1-everyday/607ef660c99e200d08f80c35)

### [Reverse Integer - Leetcode Solution](https://rajattiwari.hashnode.dev/reverse-integer-leetcode-solution?utm_source=hashnode&utm_medium=feed)

So, the problem statement is: Given a signed 32-bit integer x, return x with its digits reversed. If reversing x causes the value to go outside the signed 32-bit integer range \[-231, 231 - 1\], then return 0. The solution is in python. class Solutio...

1 min read · [rajattiwari.hashnode.dev](https://rajattiwari.hashnode.dev/reverse-integer-leetcode-solution?utm_source=hashnode&utm_medium=feed)

[Mar 20, 2021](https://hashnode.com/posts/reverse-integer-leetcode-solution/605601fd5f8d512169726cf8)

### [Two Sum - Leet Code Solution](https://rajattiwari.hashnode.dev/two-sum-leet-code-solution?utm_source=hashnode&utm_medium=feed)

So, the problem statement was: Given an array of integers nums and an integer target, return indices of the two numbers such that they add up to target. You may assume that each input would have exactly one solution, and you may not use the same elem...

2 min read · [rajattiwari.hashnode.dev](https://rajattiwari.hashnode.dev/two-sum-leet-code-solution?utm_source=hashnode&utm_medium=feed)

[Mar 20, 2021](https://hashnode.com/posts/two-sum-leet-code-solution/60556f4263a05a21443f1684)
