Arpan Tiwari

@arpantiwari8266

Developer

Ranchi,Jharkhand,IndiaJoined January 2024

About

BTech CSE student at IIIT Ranchi | Aspiring Software Engineer | Passionate about coding, building innovative projects, and solving real-world problems through technology. Currently diving into web development, Machine learning and deep learning. Always learning, creating, and pushing boundaries! #Tech #Coding

Available for

I am available to work as a Full stack developer.

Arpan Tiwari's blogs

Untitled Publicationarpantiwari1234.hashnode.dev28 posts

Articles Comments

Recently published

ATArpan Tiwariarpantiwari1234.hashnode.devSep 9, 2025 · 2 min read

🎵 Building a Spotify Clone Using Pure HTML & CSS

Perfect 👍 I’ll draft a simple Hashnode blog post for your Spotify clone. You can copy-paste this directly and tweak it in your own style. 🎵 Building a Spotify Clone Using Pure HTML & CSS Introduction I recently built a Spotify UI clone using nothi...

0

ATArpan Tiwariarpantiwari1234.hashnode.devAug 29, 2025 · 1 min read

"Calculating Factorials: Modulo Magic with 25 Natural Numbers" (10^9)+7

// Print factorial of 25 natural numbers and result it by modulo 10^9 +7... #include <bits/stdc++.h> using namespace std; vector<long long int> factorial(int n) { vector<long long int> v(n + 1, 1); int MOD = 1000000000 + 7; for (int i ...

0

ATArpan Tiwariarpantiwari1234.hashnode.devAug 29, 2025 · 1 min read

Kth symbol in grammar

#kthsymbolingrammar_leetcode class Solution { public: int kthGrammar(int n, int k) { if(n==1) return 0; if(k%2==0){// flip int x = kthGrammar(n-1,k/2); if(x==0) return 1; else return 0; ...

0

ATArpan Tiwariarpantiwari1234.hashnode.devJun 26, 2025 · 1 min read

Unlocking the Power of Recursion: Mastering Leetcode's Generate Parentheses Challenge

#well_formed_parentheses.. In this article, we delve into the art of recursion by tackling Leetcode's Generate Parentheses challenge. This problem is a classic example of how recursion can be used to generate all possible combinations of well-formed ...

0

ATArpan Tiwariarpantiwari1234.hashnode.devJun 23, 2025 · 2 min read

Finding Subarrays: Find all the subarray for a given integer array

#include <bits/stdc++.h> using namespace std; void subArray(vector<int> v, int arr[], int n, int idx) { if (idx == n) { for (int i = 0; i < v.size(); i++) { cout << v[i] << " "; } cout << endl; ...

0

Arpan Tiwari

About

Available for

Arpan Tiwari's blogs

Recently published

🎵 Building a Spotify Clone Using Pure HTML & CSS

"Calculating Factorials: Modulo Magic with 25 Natural Numbers" (10^9)+7

Kth symbol in grammar

Unlocking the Power of Recursion: Mastering Leetcode's Generate Parentheses Challenge

Finding Subarrays: Find all the subarray for a given integer array

Search Hashnode

Arpan Tiwari

About

Available for

Arpan Tiwari's blogs

Recently published

🎵 Building a Spotify Clone Using Pure HTML & CSS

"Calculating Factorials: Modulo Magic with 25 Natural Numbers" (10^9)+7

Kth symbol in grammar

Unlocking the Power of Recursion: Mastering Leetcode's Generate Parentheses Challenge

Finding Subarrays: Find all the subarray for a given integer array