Devpost
Participate in our public hackathons
Devpost for Teams
Access your company's private hackathons
Grow your developer ecosystem and promote your platform
Drive innovation, collaboration, and retention within your organization
By use case
Blog
Insights into hackathon planning and participation
Customer stories
Inspiration from peers and other industry leaders
Planning guides
Best practices for planning online and in-person hackathons
Webinars & events
Upcoming events and on-demand recordings
Help desk
Common questions and support documentation
Solutions and Cloud Engineer | 3+ years of experience designing cloud-native platforms.
What really affects the quality of our beloved Pinot Noir? Here I analyse the relation between wine qualities, and various features which give wines their expensive aesthetic.
Want to see cute cats but are scrolling hours to get those cute kitty images. Cut the suffering by simply asking a twilio bot to do that for us; while being inspired to get up and get to work, too!
A divide and conquer approach to sort a list of integer elements using Python 3.7. This is a O (nlogn) time complexity algorithm, we are trying to reduce the brute force time and space complexity.
A simple, suave logo for my own brand: Dev Shruti: Tech for Womxn of Color
Brute force for sorting a list would take O(n^2). What all time complexities can we get at? MergeSort, uses a Divide and Conquer Algo, and can sort list in NLog(N). Implementation in Java:
This is a very simple python project which shows how computers rely heavily on math to produce a Gaussian Distribution of random numbers, but truly, these are pseudo random numbers.
This is a simple function which prints 'Hello, World!' in Go
