Skip to content
View printf-dj's full-sized avatar
:octocat:
Hi there...
:octocat:
Hi there...
  • Uttarakhand, India
  • 02:15 (UTC +05:30)
  • X @printf_dj
Block or Report

Block or report printf-dj

Block user

Prevent this user from interacting with your repositories and sending you notifications. Learn more about blocking users.

You must be logged in to block users.

Please don't include any personal information such as legal names or email addresses. Maximum 100 characters, markdown supported. This note will be visible to only you.
Report abuse

Contact GitHub support about this user’s behavior. Learn more about reporting abuse.

Report abuse
printf-dj/README.md

Hi 👋, I'm Dixit Jhinkwan

A passionate frontend developer from India.

printf-dj

Connect with me:

 
 

Languages and Tools:

c     csharp     cplusplus     java     html5     css3     sass     javascript     angular     bootstrap     tailwind     nodejs     mongodb     mysql     mssql     aws     gcp     nginx     git     bash     linux     xd     figma    

printf-dj


printf-dj

Stay tuned, website under development

Pinned Loading

  1. Printing a string 1000 times without... Printing a string 1000 times without using any kind of loop in JAVA
    1
    /* printf-dj
    2
    This program will print a string 1000 times without using any kind of loop.
    3
    It is just using a string fuction replaceAll().
    4
    Warning:- JAVA code ahead
    5
    HAPPY CODING....
  2. This program will generate the nth p... This program will generate the nth prime number. The below given code can find prime numbers between 1 to 100000000, although it can be changed as per requirement.
    1
    /* printf-dj
    2
    This program will generate the nth prime number.
    3
    This program basically generates the prime numbers from 1 to 1000 and store them in an array.
    4
    Then as per the value of n, it returns the prime number by looking up in the array.
    5
    The range can be increased, but it will take more time and space for the program execution.