Day 5 of chaiForms saas challange
Challenge completed with mentioned tech
Deployed Link:
https://t.co/T640IP0fr4
Learning:
1. Can't make saas within 5 days with new tech
2. Nothing is hard BTW
3. First implement then improve
@huteshm87@piyushgarg_dev@ChaiCodeHQ
Day 4 with 3 of ChaiForms SaaS
Backend and frontend complete
Trying to make it as professional
So basic standard UI
Still work remaining backend side
Deployed
Day 4 with 3 of ChaiForms SaaS
Backend and frontend complete
Trying to make it as professional
So basic standard UI
Still work remaining backend side
Deployed
Day 4 with 3 of ChaiForms SaaS
Backend and frontend complete
Trying to make it as professional
So basic standard UI
Still work remaining backend side
Deployed
Day 2 of ChaiForms: Form Builder SaaS
- Auth done
- gemini integration done
- create form by ai and self done
- support for multilingual done
https://t.co/v1ukKA1HFN
Using tech - turborepo, tRPC, drizzle, prizma, redis
@Hiteshdotcom@piyushgarg_dev@ChaiCodeHQ
Day 2 of ChaiForms: Form Builder SaaS
- Auth done
- gemini integration done
- create form by ai and self done
- support for multilingual done
https://t.co/v1ukKA1HFN
Using tech - turborepo, tRPC, drizzle, prizma, redis
@Hiteshdotcom@piyushgarg_dev@ChaiCodeHQ
Best algo to find Max Sum of Subarray is Kadane's algo
Here we compare first element to next + first and store it has max till now
and then we store max number b/w maxSum and max sum till now
At the end it returns maximum sum of subarray
Finding max sum of subarray better approach then brute force is Prefix array
we use prefix array to store the sum of elements till the index
this leads to
O(n^2): time complexity
O(n): space complexity
which better than the basic algo which gives
TM: O(n^3)
Finding max sum of subarray better approach then brute force is Prefix array
we use prefix array to store the sum of elements till the index
this leads to
O(n^2): time complexity
O(n): space complexity
which better than the basic algo which gives
TM: O(n^3)
This is what I learned today
I'll try to post this type of explanation which is short simple and easy
and try means😁 I'm not consistent on X but as I'm making notes for what I'm learning so I'll try to post
This is what I learned today
I'll try to post this type of explanation which is short simple and easy
and try means😁 I'm not consistent on X but as I'm making notes for what I'm learning so I'll try to post
There was one developer on x he was sharing awesome notes on beautiful pages like handwritten
Somehow I didn't follow him now I'm searching for him and not able to find 😬