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

@arpantiwari8266

# Arpan Tiwari

@arpantiwari8266 · Ranchi,Jharkhand,India · Joined January 2024

Developer

[Website](https://mega-bytes111.github.io/Portfolio/)

### [🎵 Building a Spotify Clone Using Pure HTML & CSS](https://arpantiwari1234.hashnode.dev/building-a-spotify-clone-using-pure-html-and-css?utm_source=hashnode&utm_medium=feed)

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...

2 min read · [arpantiwari1234.hashnode.dev](https://arpantiwari1234.hashnode.dev/building-a-spotify-clone-using-pure-html-and-css?utm_source=hashnode&utm_medium=feed)

[Sep 9, 2025](https://hashnode.com/posts/building-a-spotify-clone-using-pure-html-and-css/68bfeca853ea5b14d2e6365c)

### ["Calculating Factorials: Modulo Magic with 25 Natural Numbers" (10^9)+7](https://arpantiwari1234.hashnode.dev/calculating-factorials-modulo-magic-with-25-natural-numbers-1097?utm_source=hashnode&utm_medium=feed)

// 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 ...

1 min read · [arpantiwari1234.hashnode.dev](https://arpantiwari1234.hashnode.dev/calculating-factorials-modulo-magic-with-25-natural-numbers-1097?utm_source=hashnode&utm_medium=feed)

[Aug 29, 2025](https://hashnode.com/posts/calculating-factorials-modulo-magic-with-25-natural-numbers-1097/68b1f4ecf1a60b975c7465bb)

### [Kth symbol in grammar](https://arpantiwari1234.hashnode.dev/kth-symbol-in-grammar?utm_source=hashnode&utm_medium=feed)

#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; ...

1 min read · [arpantiwari1234.hashnode.dev](https://arpantiwari1234.hashnode.dev/kth-symbol-in-grammar?utm_source=hashnode&utm_medium=feed)

[Aug 29, 2025](https://hashnode.com/posts/kth-symbol-in-grammar/68b1f3c1e05f2e8e33ce6fda)

### [Unlocking the Power of Recursion: Mastering Leetcode's Generate Parentheses Challenge](https://arpantiwari1234.hashnode.dev/unlocking-the-power-of-recursion-mastering-leetcodes-generate-parentheses-challenge?utm_source=hashnode&utm_medium=feed)

#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 ...

1 min read · [arpantiwari1234.hashnode.dev](https://arpantiwari1234.hashnode.dev/unlocking-the-power-of-recursion-mastering-leetcodes-generate-parentheses-challenge?utm_source=hashnode&utm_medium=feed)

[Jun 26, 2025](https://hashnode.com/posts/unlocking-the-power-of-recursion-mastering-leetcodes-generate-parentheses-challenge/685cf4338e6a56933413ec08)

### [Finding Subarrays: Find all the subarray for a given integer array](https://arpantiwari1234.hashnode.dev/finding-subarrays-find-all-the-subarray-for-a-given-integer-array?utm_source=hashnode&utm_medium=feed)

#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; ...

2 min read · [arpantiwari1234.hashnode.dev](https://arpantiwari1234.hashnode.dev/finding-subarrays-find-all-the-subarray-for-a-given-integer-array?utm_source=hashnode&utm_medium=feed)

[Jun 23, 2025](https://hashnode.com/posts/finding-subarrays-find-all-the-subarray-for-a-given-integer-array/6858eb097d1c6fa3d1673442)
