
Harsh Bhardwaj
@harshuu369
Followers
34
Following
111
Media
54
Statuses
94
Full-stack & DevOps Developer | DSA | Web3 | Solana | AI & Infra Innovator • Creator of @SmartInvoice. https://t.co/Tw6j328Y1K
New Delhi, Delhi, India
Joined September 2024
hey folks,.After a month, I’m finally releasing a new video! "SmartInvoice is a modern invoicing web application designed to streamline billing for freelancers and small businesses". Let me know what you think!.Link :- .#buildinpublic #indiedev #solodev
0
0
2
#Leetcode solving some questions:(Strings).1.Longest Palidromic Substring.2.Letter combination of a phone number.3.Fizz Buzz
0
0
0
#Letcode Revising Solving Strings : (easy + medium).1.valid Parenthesis.2.valid Palidrome.3.Valid Anagrams
0
0
1
RT @gregisenberg: My 1 pager on what you need to know about today's OpenAI's gpt-oss announcement. OpenAI just made it possible to build AI….
0
254
0
#Leetcode solving Questions (Sliding Window):-.1. Subarrays with K Different Integers - (Hard).2.Max Points you can obtain from cards - (good)
0
0
1
SmartInvoice - Invoice Management System .launched on productHunt 1 mounth ago , we loved to your feedback , tell me how its looks like and what changes I need to change?.
producthunt.com
Create professional invoices with smart features, payment tracking, and automated reminders
2
0
2
#Leetcode some Q (Sliding Window):->>.1.Binary Subarray with Sum.2.Count Numbers of Nice Subarrays.3.MaxConsecutive Once ||| .if I look something that Q1 and Q2 are equal if you find some logic -> take odd = 0 , even = 1. try to solve , you will see the pattern sure in Q2.
0
0
1
Solving some problems:-(Sliding window).1.Longest Reapeating Character Replacement-(easy).2.Frequency of the most frequent Element-(easy).@Leetcode
0
0
1
#Leetcode Problem Solving:-.1. Fruits into Baskets : (Good prob)(based on Storytelling Problem). 2. Longest Substring without Repeating Characters-(good Prob).
0
0
1
#Leetcode Questions:-.1.Longest Substring with k Uniques:(good).2.Longest Substring without Reapeating char (good).3. Minimum Window Substring (Hard)**.if you solve these problems then you capable to solve any problem of Sliding Window.
0
0
1
#Leetcode Problem:-.1.Subarray Sum Equals k-(PrefixSum + HashMap).- for PositiveNum - Sliding Window.- for NegativeNum - PrefixSum + HashMap
0
0
1
RT @gregisenberg: 12 STARTUP IDEAS YOU CAN BUILD THIS WEEKEND (48 hours, AI native, all viable)
0
170
0