DEV Community: vinnugollakoti

Lioric: Recent Updates.

vinnugollakoti — Wed, 03 Jun 2026 06:48:19 +0000

Hello Developers!

Recently, I released a new Lioric version 0.1.9

Now our Lioric Widget is completely customizable according to your website UI.

Changes happened in this update:

Now the model props in the Lioric tag are optional; you can just leave those props, our widget automatically takes the model name as "gemini-3-flash-preview." In the future, if we introduce any other models, you can just specify that model using the prop name as "model" as before.
Another major update about Liroic Widget, Now the Liroic Widget is completely customizable, starting from the widget logo to all the colours and Assistant name etc. Now the user can update the colors and the logo according to their website UI.

Updated Tag :

<Lioric
      apiKey="lioric_live_..."
      llmApiKey="your_gemini_api_key"
      assistantName="your_assisstant_name"
      logoSrc="/brand-bot.gif"
      logoAlt="Lioric"
      theme={{
        accentColor: "#2563eb",
        launcherBackground: "#111827",
        userMessageBackground: "#2563eb",
        assistantMessageBackground: "#f8fafc",
        assistantMessageTextColor: "#0f172a"
      }}
      position="bottom-left"
    />

Note: The theme prop is completely optional. If you don't want the customized colors, you can just remove them and use the default colors. same with logoAlt and logoSrc as well. All the customizations are not necessary.

That's all, Thanks!
Stay tuned for future updates with me...

Author/Builder : Vinnugollakoti

Lioric: A Simple AI Chatbot Widget

vinnugollakoti — Tue, 02 Jun 2026 11:43:23 +0000

Hello Developers,

Lioric is Live now!!

You can visit lioric.vercel.app.

Step 1: Sign in to the Lioric dashboard using your GitHub account.

Step 2: Click create project and add the project name and upload the PDF, which contains all the data, including ( Terms and conditions, policies, instructions) of your entire e-commerce. After uploading the PDF, click Create Project.

Step 3: After clicking the create project button, Lioric will take 1-2 minutes, and then it will give you the client api and instructions on how to use it.

That's it!!

You can create your own chatbot for your e-commerce website in just three steps.

If you still have any doubts, ask Grok.com. Include the npm package URL or command, and also include this blog link for better results.

Builder info:
Vinnugollakoti
Connect with me via X : vinnugollakoti
My GitHub: vinnugollakoti

Lioric: Seamless AI Chatbot Widget

vinnugollakoti — Mon, 18 May 2026 02:19:24 +0000

Hello Developers 👋!

Just now updated the Lioric SDK.

Current version : 0.1.5

Solved a major CSS issue, that we have to import a line with our Lioric import statement, then the imports looks like:

import { Lioric } from "lioric-react";
import "lioric-react/styles.css";

In Tomorrow's update ill be removing the second line, no need to import the CSS file, the Lioric tag automatically gets the CSS of the widget.

The Lioric dashboard also has some updates.
Now the Lioric dashboards shows analytics of each lioric client key. Analytics includes the number of api calls hits the backend with that client key and also the request success rate.

Major update from yesterday: The entire Lioric backend shifted from python to javascript.

Thanks!!

Lioric: An AI Chatbot Widget

vinnugollakoti — Sun, 17 May 2026 02:02:01 +0000

Hello Developers👋

Recently Im working on a project called Lioric: An AI chatbot widget.

Basically, it is just a tag in frontend, install the lioric-react package from npm, pnpm etc.

Import the tag like :

import { Lioric } from "lioric-react";

<Lioric
 apiKey="lioric_live_client_key"
 position="bottom-left"
/>

Its that simple, you just have to get the lioric client key by signing into the lioric dashboard and create a project and then upload all your website data via pdf and then select the cheapest model and manage your AI keys and then create your project.

Then, Lioric will give you a client key, paste the client key, and select the position of the AI assistant.

Soon adding the UI management, for example: adding images, gifs, colors, etc.

Im still building the product, but this is the complete idea of it.

Builder info:
Vinnugollakoti
Connect with me via X : vinnugollakoti
My GitHub: vinnugollakoti

Thanks!!

gpushx: The All-in-One CLI That Made My GitHub + Deployment Workflow 10x Faster

vinnugollakoti — Sat, 16 May 2026 09:32:09 +0000

Hey developers! 👋

I'm Vinnu (@vinnugollakoti), Software Engineer from India. Over the years, I’ve worked on Web2, Web3, and multiple AI projects. One thing that always frustrated me was the constant context-switching between terminal, browser, GitHub dashboard, Vercel, and Render.

So, I built gpushx — a lightweight, developer-friendly CLI that brings the entire workflow into the terminal.

What is gpushx?

gpushx is a smart CLI tool that lets you:

Create GitHub repositories
Push branches
Create Gists
Merge PRs
Deploy to Vercel (frontend)
Deploy to Render (backend)

…all with simple, memorable commands.

Install it right now:

pnpm i -g gpushx
# or
npm install -g gpushx

Why I Built gpushx ?

As a solo builder and indie hacker, I was tired of this repetitive flow:

Go to GitHub → Create repo → Copy commands
Push code
Go to Vercel/Render → Create project → Connect repo → Deploy

With gpushx, I reduced this entire process to just 2–3 commands.

Key Features That I Love

gpush setup, One-time GitHub login (Device Flow)
gpush init [name], Initialize git + create repo + first push
gpush create <branch-name>, "Create branch, commit, push + optional PR"
gpush merge <branch>, Merge branch into main via PR
gpush verify, Beautiful status of your repo
gpush gist <file>, Create GitHub Gist instantly
gpush deploy vercel --prod, Full Vercel deployment
gpush deploy render, Full Render backend deployment

Who Should Use gpushx?

Indie hackers & solo developers
Full-stack engineers who ship fast
Students and beginners who hate browser workflows
Anyone tired of GitHub CLI complexity

What’s Next?
I’m planning to add:
Support for Netlify & Railway
Better error handling and gpush doctor
Multi-platform support (GitLab coming soon?)

Final Thoughts
gpushx is still early, but it’s built with love for developers who just want to build and ship faster.
If you try it, I’d love to hear your feedback — what’s missing, what’s painful, or what you want next.
Drop a comment below 👇

About the Author
Vinnu Gollakoti
Building AI tools & developer experience products
Creator of gpushx, lioric-react, and more.
Follow me on X: @VinnuGollakoti

Day 38 Journal

vinnugollakoti — Sun, 22 Dec 2024 10:24:45 +0000

Hi, Folks! Today, I solved three problems on LeetCode: Letter Combination of a Phone Number, Container with Most Water, and Rotate Array. Solving different problems every day helps us to think about problems from different angles. There are various ways to solve a problem. If you find one way to solve it, don't stop there try to optimize the solution further. This will help you find the most efficient way to solve the given problem.

Letter Combination of a Phone Number: We can use the concept of backtracking with one base condition to solve this problem. We have to find all possible combinations of characters linked to specific digits in the given input. The base condition will help us stop the function's execution when necessary. This approach allows us to solve the problem effectively.

Container with Most Water: In this problem we need to find the maximum area that can be formed. We can traverse array using two pointers one which starts from the beginning and other from the end and thus we will efficiently able to find the solution for that.

Rotate Array: The problem here is to rotate the array by a given number of positions. We can do this by slicing the array according to the given position and creating a new array by appending the slices in the correct order. This approach solves the problem effectively.

I hope my experience will be helpful to you.

Day 60 Journal

vinnugollakoti — Tue, 17 Dec 2024 04:22:15 +0000

Hi, Folks! Today, I solved three problems on LeetCode: Single Number, First Missing Positive, and Next Greater Element III. There are some common mistakes that most of us make myself included. For instance, when we come across an easy problem, we might be tempted to ignore it or use a familiar approach to quickly solve it, then move on without exploring further. However, it’s important to use resources to determine whether the solution you found is the most efficient one. If it’s not, take the time to learn the more efficient solution.

Single Number is an easy problem, and I was familiar with one approach. However, I was curious to find the most efficient solution. When I discovered it, I was really surprised that the problem could be solved in such an efficient way.

Similarly, when solving First Missing Positive and Next Greater Element III, it’s crucial to focus on building a solid logic first. Then, break it down into smaller steps this will simplify the process. Approaching problems in this way helps to develop better solutions.

I hope my experience will be helpful to you.

Day 50 Journal

vinnugollakoti — Tue, 17 Dec 2024 04:20:32 +0000

I hope my experience will be helpful to you.

Day 54 Journal

vinnugollakoti — Tue, 17 Dec 2024 04:11:58 +0000

Hi, Folks! Today, I solved three problems on LeetCode : Rotting Oranges, Maximize confusion in exam, and Koko eating Bananas. All these examples are very conceptual and logical. The most important part is to observe that these three problems connect to our real life scenarios.

The problems that are related to real life can easily grasp our attention and easy for visualize. The real life examples will help us to remember the concepts for long time. let me give you a example:

Sliding window maximum is a problem solved using dequeue. When you first read the problem statement, it may seem like a purely mathematical problem involving array of numbers.

Rotting Oranges is another problem solved using dequeue. but, it is framed in a real life situation, which makes the concept more relatable and engaging.

So, now you can clearly observe that the problem related to real life will look more engaging when compared to mathematical problems.

Maximize confusion in exam : In this problem we can traverse through out the provided string and keep track of length. This will help us to interchange the position of Boolean values to get maximum possible length.

I hope my experience is helpful.

Day 52 Journal

vinnugollakoti — Tue, 17 Dec 2024 04:09:33 +0000

Hi, Folks! Today, I solved three questions on LeetCode: Basic Calculator II, Subsets, and Subsets II.

I have noticed that some problems on LeetCode are connected in terms of concepts and logics, like subsets and subsets II. Solving these related problems in a specific way can be a effective step in your learning process.

For Beginners:

If, you are just started. Plan to solve the connected problems on same day or at least on successive days. This helps the beginners to practice the same core concept multiple times along with some new concept.

For Advanced Solvers:

Plan to solve the connecting problems with a significant days gap in between. This method help you to test the ability to recall and apply the concepts after break, which is a right way to test problem solving skills.

In this way solving connecting problems in specific order can help you to enhance your learning.

As a beginner, I planned to solve subsets and subsets II together this helped me to practice the core recursive concept for multiple times and also helped me to learn the way to adapt the solution to solve second problem with additional complexity.

I hope my experience will be helpful.

Day 47 Journal

vinnugollakoti — Tue, 17 Dec 2024 03:59:07 +0000

Hi, Folks! Today I solved three problems on LeetCode : Unique Paths, Spiral matrix, and N-Queens. Let’s walk through these problems.

Unique paths problem

We are given two numbers, representing number of rows and number of columns. Our task is to find the total number of unique paths to reach the position (m-1,n-1) from (0,0). To solve this problem, we can follow recursive approach. We can start from (0,0) recursively find steps to travel right and bottom until we reach the required position. To find total unique paths, we would add the right steps to bottom steps and return it. However, there is a small issue with this approach: the solutions may repeat number of times. To overcome this, the alternative approach is to use DP matrix. We create a DP matrix with same number of rows and columns as input and we initialize all positions of DP matrix with 1. Finally, we return the value in the lats cell of DP matrix as total number off unique paths.

Spiral Matrix

We are given with a matrix and we have to return a list containing the elements of matrix in spiral order. To solve this problem, we can use indexing limits as conditions to run a loop. We traverse from left to right of matrix we can use one for loop. Then, we move from the top-right corner to the bottom-right corner with another loop. We traverse from the bottom-right corner to the bottom-left corner using a third loop. Finally, we move from the bottom-left corner to the top-left corner with a fourth loop. In this way, we use four different loops to traverse in all four directions, controlling them with indexing limits.

N-Queens

We are given with a input number n, we have to find the number of ways to place n queens in nxn matrix such that no two queens will attack each other. This means no two queens should be in same row, column, or diagonal. To solve this problem, we can use recursion and backtracking concepts. We can first perform recursion to repeat the process multiple times. because, we need to find all the possible ways to place queens. Backtracking is performed when we did not find the correct position to place queen then we can replace ‘Q’ with ‘.’ and repeat the process for the next position.

We can optimize the above solution by using three lists. One lists is to keep track of number of rows. lets say we have n rows we will place n zeros in the list and replace the respective zero by one if that specific row is having queen. This will avoid unnecessary backtracking. Similarly, the second list is for lower diagonal, and third list is for upper diagonal. Both diagonal lists have 2n-1 elements all initially set to zeros. As we traverse through the matrix to place queens, we update the respective row or diagonal list by replacing 0 with 1 when queen is placed. This indicates that no more queens can be placed in that respective diagonal or row. In this way, this approach works efficiently.

I hope my experience will be helpful.

Day 45 Journal

vinnugollakoti — Tue, 17 Dec 2024 03:55:14 +0000

Hi, folks! Today I solved three interesting problems on LeetCode : Palindrome linked list, Linked list cycle and Flatten Multilevel doubly linked list. As a Beginner, I felt Flatten Multilevel doubly linked list problem to be a bit challenging. We need to find a perfect recursive approach to solve this problem in efficient way. To determine the correct base condition and recursive function, we need to think in many possible approaches and dry run the code carefully. I also used some resources for the better understanding.

Linked list cycle is a conceptual problem that introduces a new type in linked list called a circular linked list. This problem helped me to gain conceptual clarity on circular linked list.

Palindrome linked list problem is having many ways to solve. One of them is using stack data structure and the another way is dividing the linked list into manageable parts and then comparing them. The second approach seems to be a bit lengthy, but it becomes easier when you divide the task into sub tasks and implement them in separate functions. This will make process simplify.

I hope my experiences will be helpful.