abdheshnayak

All basic features are free to use.

I am sorry for your bad experience, I will update it to not restrict any user from checking it. But you can try it by rotating the phone(landscape orientation). I forced it because the layout is designed for landscape.

Hi HN!

I’m excited to share my hobby project, Typing Guru. It all started as a college project in my second semester, where I initially used C++. You can check out that project here: https://github.com/abdheshnayak/Type-Practice-Lite. A friend of mine was really impressed and encouraged me to develop a user interface. So, I created a version using JavaFX, which you can find here: https://github.com/abdheshnayak/typing-guru-java. This version was well-received by users from different countries.

As I continued to explore and learn, I transitioned to React and wanted to build something that could run on the web without installation, making it easier for me to maintain. This led to the development of Typing Guru in Next.js.

Features so far: - Stage-Based Lessons: Tailored lessons that adapt to your current skill level. - Customizable User Interface: Choose themes that reflect different skin tones for a more personalized experience. - Multi-Language Support: Lessons available in multiple languages to cater to a diverse audience.

The project is still in development, and I’d love to hear your thoughts, suggestions, or any features you think would make it better. Check it out here: https://typing-guru.com.

Thanks for your support!

On average, I code for 8-10 hours a day. However, if the task is particularly challenging, it can extend to 14-16 hours

Hey HN,

I’ve built a project called search-in-json (https://github.com/abdheshnayak/search-in-json) that allows searching through JSON objects of any structure using regex. It also returns the path to the matching content, making it easier to navigate nested data. However, I’m facing a performance challenge and could use some help improving it.

Current Issue: Right now, the implementation starts traversing from the root of the JSON for every search, even if some parts of the data have already been visited. This works fine for small JSON objects but becomes slow with larger, deeply nested structures.

What I’m Trying to Achieve: I want to cache previously traversed paths so that:

    If a search cursor lands after already visited nodes, it can resume from the last known point.
    This would reduce redundant traversals and improve performance, especially for large JSON files with multiple searches.

Challenges:

    Efficient caching: How to store paths in memory in a way that makes them quick to reuse.
    Edge cases: Handling complex JSON structures with nested objects and arrays.
    Minimal memory overhead: Avoid using too much memory for caching paths.

How You Can Help:

    Suggestions on data structures that might work well for caching paths.
    Advice on algorithmic improvements for path reuse.
    Any experience with similar traversal optimizations in tree-like data structures.

Here’s the link to the project: https://github.com/abdheshnayak/search-in-json

Looking forward to your ideas and suggestions! Any help would be greatly appreciated.

Thanks! Abdhesh