[{"type_of":"article","id":3296124,"title":"Track My Cash: Building a Secure, Decoupled Ledger with Spring Boot, Vanilla JS, and Gemini","description":"This is a submission for the Built with Google Gemini: Writing Challenge  Reusing the side project...","readable_publish_date":"Feb 28","slug":"track-my-cash-building-a-secure-decoupled-ledger-with-spring-boot-vanilla-js-and-gemini-2d79","path":"/rohithv07/track-my-cash-building-a-secure-decoupled-ledger-with-spring-boot-vanilla-js-and-gemini-2d79","url":"https://dev.to/rohithv07/track-my-cash-building-a-secure-decoupled-ledger-with-spring-boot-vanilla-js-and-gemini-2d79","comments_count":0,"public_reactions_count":2,"collection_id":null,"published_timestamp":"2026-02-28T12:55:41Z","language":"en","subforem_id":1,"positive_reactions_count":2,"cover_image":"https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2F6a5r65gxiitybrsxn80r.png","social_image":"https://media2.dev.to/dynamic/image/width=1000,height=500,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2F6a5r65gxiitybrsxn80r.png","canonical_url":"https://dev.to/rohithv07/track-my-cash-building-a-secure-decoupled-ledger-with-spring-boot-vanilla-js-and-gemini-2d79","created_at":"2026-02-28T12:55:41Z","edited_at":"2026-03-01T08:15:43Z","crossposted_at":null,"published_at":"2026-02-28T12:55:41Z","last_comment_at":"2026-02-28T12:55:41Z","reading_time_minutes":4,"tag_list":["devchallenge","geminireflections","gemini"],"tags":"devchallenge, geminireflections, gemini","user":{"name":"Rohith V","username":"rohithv07","twitter_username":"vazhathody","github_username":"Rohithv07","user_id":480052,"website_url":"https://rohithv07.github.io/Tryouts/","profile_image":"https://media2.dev.to/dynamic/image/width=640,height=640,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Fuser%2Fprofile_image%2F480052%2Ff684c523-5316-4ac8-a73e-376d992dbcd4.jpeg","profile_image_90":"https://media2.dev.to/dynamic/image/width=90,height=90,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Fuser%2Fprofile_image%2F480052%2Ff684c523-5316-4ac8-a73e-376d992dbcd4.jpeg"}},{"type_of":"article","id":3278086,"title":"Building a Full-Stack Bookkeeping Ledger Using Antigravity","description":"I recently built a full-stack bookkeeping application to help track borrowed money and loan...","readable_publish_date":"Feb 23","slug":"building-a-full-stack-bookkeeping-ledger-using-antigravity-fd0","path":"/rohithv07/building-a-full-stack-bookkeeping-ledger-using-antigravity-fd0","url":"https://dev.to/rohithv07/building-a-full-stack-bookkeeping-ledger-using-antigravity-fd0","comments_count":0,"public_reactions_count":1,"collection_id":null,"published_timestamp":"2026-02-23T13:29:48Z","language":"en","subforem_id":1,"positive_reactions_count":1,"cover_image":"https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fo5x1227vhshk05bohk01.png","social_image":"https://media2.dev.to/dynamic/image/width=1000,height=500,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fo5x1227vhshk05bohk01.png","canonical_url":"https://dev.to/rohithv07/building-a-full-stack-bookkeeping-ledger-using-antigravity-fd0","created_at":"2026-02-23T13:29:48Z","edited_at":"2026-02-23T13:30:26Z","crossposted_at":null,"published_at":"2026-02-23T13:29:48Z","last_comment_at":"2026-02-23T13:29:48Z","reading_time_minutes":2,"tag_list":["java","javascript","gemini","webdev"],"tags":"java, javascript, gemini, webdev","user":{"name":"Rohith V","username":"rohithv07","twitter_username":"vazhathody","github_username":"Rohithv07","user_id":480052,"website_url":"https://rohithv07.github.io/Tryouts/","profile_image":"https://media2.dev.to/dynamic/image/width=640,height=640,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Fuser%2Fprofile_image%2F480052%2Ff684c523-5316-4ac8-a73e-376d992dbcd4.jpeg","profile_image_90":"https://media2.dev.to/dynamic/image/width=90,height=90,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Fuser%2Fprofile_image%2F480052%2Ff684c523-5316-4ac8-a73e-376d992dbcd4.jpeg"}},{"type_of":"article","id":3179104,"title":"Minimalism Defying Gravity: My Entry for the Google AI Portfolio Challenge 🚀","description":"This is a submission for the New Year, New You Portfolio Challenge Presented by Google AI          ...","readable_publish_date":"Jan 17","slug":"minimalism-defying-gravity-my-entry-for-the-google-ai-portfolio-challenge-1i6l","path":"/rohithv07/minimalism-defying-gravity-my-entry-for-the-google-ai-portfolio-challenge-1i6l","url":"https://dev.to/rohithv07/minimalism-defying-gravity-my-entry-for-the-google-ai-portfolio-challenge-1i6l","comments_count":2,"public_reactions_count":13,"collection_id":null,"published_timestamp":"2026-01-17T16:38:04Z","language":"en","subforem_id":1,"positive_reactions_count":13,"cover_image":"https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2F317hka6kug2q5poxbcby.png","social_image":"https://media2.dev.to/dynamic/image/width=1000,height=500,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2F317hka6kug2q5poxbcby.png","canonical_url":"https://dev.to/rohithv07/minimalism-defying-gravity-my-entry-for-the-google-ai-portfolio-challenge-1i6l","created_at":"2026-01-17T16:38:04Z","edited_at":"2026-01-26T17:40:15Z","crossposted_at":null,"published_at":"2026-01-17T16:38:04Z","last_comment_at":"2026-02-10T03:02:55Z","reading_time_minutes":7,"tag_list":["devchallenge","googleaichallenge","portfolio","gemini"],"tags":"devchallenge, googleaichallenge, portfolio, gemini","user":{"name":"Rohith V","username":"rohithv07","twitter_username":"vazhathody","github_username":"Rohithv07","user_id":480052,"website_url":"https://rohithv07.github.io/Tryouts/","profile_image":"https://media2.dev.to/dynamic/image/width=640,height=640,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Fuser%2Fprofile_image%2F480052%2Ff684c523-5316-4ac8-a73e-376d992dbcd4.jpeg","profile_image_90":"https://media2.dev.to/dynamic/image/width=90,height=90,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Fuser%2Fprofile_image%2F480052%2Ff684c523-5316-4ac8-a73e-376d992dbcd4.jpeg"}},{"type_of":"article","id":3178533,"title":"Automating Java Builds with GitHub Actions","description":"We've all been there. You write code, it runs perfectly on your laptop, you push it, and... the build...","readable_publish_date":"Jan 17","slug":"automating-java-builds-with-github-actions-4c0m","path":"/rohithv07/automating-java-builds-with-github-actions-4c0m","url":"https://dev.to/rohithv07/automating-java-builds-with-github-actions-4c0m","comments_count":0,"public_reactions_count":0,"collection_id":null,"published_timestamp":"2026-01-17T10:18:30Z","language":"en","subforem_id":1,"positive_reactions_count":0,"cover_image":"https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2F3qnvjloh5ag6byt0b1qu.png","social_image":"https://media2.dev.to/dynamic/image/width=1000,height=500,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2F3qnvjloh5ag6byt0b1qu.png","canonical_url":"https://dev.to/rohithv07/automating-java-builds-with-github-actions-4c0m","created_at":"2026-01-17T10:18:30Z","edited_at":null,"crossposted_at":null,"published_at":"2026-01-17T10:18:30Z","last_comment_at":"2026-01-17T10:18:30Z","reading_time_minutes":3,"tag_list":["java","devops","github","githubactions"],"tags":"java, devops, github, githubactions","user":{"name":"Rohith V","username":"rohithv07","twitter_username":"vazhathody","github_username":"Rohithv07","user_id":480052,"website_url":"https://rohithv07.github.io/Tryouts/","profile_image":"https://media2.dev.to/dynamic/image/width=640,height=640,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Fuser%2Fprofile_image%2F480052%2Ff684c523-5316-4ac8-a73e-376d992dbcd4.jpeg","profile_image_90":"https://media2.dev.to/dynamic/image/width=90,height=90,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Fuser%2Fprofile_image%2F480052%2Ff684c523-5316-4ac8-a73e-376d992dbcd4.jpeg"}},{"type_of":"article","id":3178199,"title":"Java Solution: Redundant Parenthesis Detection O(N)","description":"Problem   Given a string of balanced expression s, check if it contains a redundant...","readable_publish_date":"Jan 17","slug":"java-solution-redundant-parenthesis-detection-on-h17","path":"/rohithv07/java-solution-redundant-parenthesis-detection-on-h17","url":"https://dev.to/rohithv07/java-solution-redundant-parenthesis-detection-on-h17","comments_count":0,"public_reactions_count":1,"collection_id":null,"published_timestamp":"2026-01-17T06:29:45Z","language":"en","subforem_id":1,"positive_reactions_count":1,"cover_image":"https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2F4bejmq2gmu98h7gbyw6e.png","social_image":"https://media2.dev.to/dynamic/image/width=1000,height=500,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2F4bejmq2gmu98h7gbyw6e.png","canonical_url":"https://dev.to/rohithv07/java-solution-redundant-parenthesis-detection-on-h17","created_at":"2026-01-17T06:29:45Z","edited_at":"2026-01-17T06:30:31Z","crossposted_at":null,"published_at":"2026-01-17T06:29:45Z","last_comment_at":"2026-01-17T06:29:45Z","reading_time_minutes":3,"tag_list":["java","programming","coding","learning"],"tags":"java, programming, coding, learning","user":{"name":"Rohith V","username":"rohithv07","twitter_username":"vazhathody","github_username":"Rohithv07","user_id":480052,"website_url":"https://rohithv07.github.io/Tryouts/","profile_image":"https://media2.dev.to/dynamic/image/width=640,height=640,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Fuser%2Fprofile_image%2F480052%2Ff684c523-5316-4ac8-a73e-376d992dbcd4.jpeg","profile_image_90":"https://media2.dev.to/dynamic/image/width=90,height=90,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Fuser%2Fprofile_image%2F480052%2Ff684c523-5316-4ac8-a73e-376d992dbcd4.jpeg"}},{"type_of":"article","id":2682840,"title":"Leetcode 3613. Minimize Maximum Component Cost","description":"Problem Statement   You are given an undirected connected graph with n nodes labeled from 0...","readable_publish_date":"Jul 13 '25","slug":"leetcode-3613-minimize-maximum-component-cost-45ah","path":"/rohithv07/leetcode-3613-minimize-maximum-component-cost-45ah","url":"https://dev.to/rohithv07/leetcode-3613-minimize-maximum-component-cost-45ah","comments_count":0,"public_reactions_count":7,"collection_id":null,"published_timestamp":"2025-07-13T06:55:46Z","language":"en","subforem_id":1,"positive_reactions_count":7,"cover_image":"https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fyat4p4p9utxnmijstxiq.png","social_image":"https://media2.dev.to/dynamic/image/width=1000,height=500,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fyat4p4p9utxnmijstxiq.png","canonical_url":"https://dev.to/rohithv07/leetcode-3613-minimize-maximum-component-cost-45ah","created_at":"2025-07-13T06:55:46Z","edited_at":null,"crossposted_at":null,"published_at":"2025-07-13T06:55:46Z","last_comment_at":"2025-07-13T06:55:46Z","reading_time_minutes":3,"tag_list":["java","programming","learning","algorithms"],"tags":"java, programming, learning, algorithms","user":{"name":"Rohith V","username":"rohithv07","twitter_username":"vazhathody","github_username":"Rohithv07","user_id":480052,"website_url":"https://rohithv07.github.io/Tryouts/","profile_image":"https://media2.dev.to/dynamic/image/width=640,height=640,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Fuser%2Fprofile_image%2F480052%2Ff684c523-5316-4ac8-a73e-376d992dbcd4.jpeg","profile_image_90":"https://media2.dev.to/dynamic/image/width=90,height=90,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Fuser%2Fprofile_image%2F480052%2Ff684c523-5316-4ac8-a73e-376d992dbcd4.jpeg"}},{"type_of":"article","id":2669252,"title":"Leetcode 1751. Maximum Number of Events That Can Be Attended II","description":"Problem Statement   You are given an array of events where events[i] = [startDayi, endDayi,...","readable_publish_date":"Jul 8 '25","slug":"leetcode-1751-maximum-number-of-events-that-can-be-attended-ii-4ol6","path":"/rohithv07/leetcode-1751-maximum-number-of-events-that-can-be-attended-ii-4ol6","url":"https://dev.to/rohithv07/leetcode-1751-maximum-number-of-events-that-can-be-attended-ii-4ol6","comments_count":0,"public_reactions_count":5,"collection_id":null,"published_timestamp":"2025-07-08T18:33:04Z","language":"en","subforem_id":1,"positive_reactions_count":5,"cover_image":"https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2F6p80f7xuajxeyg9uo4eq.png","social_image":"https://media2.dev.to/dynamic/image/width=1000,height=500,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2F6p80f7xuajxeyg9uo4eq.png","canonical_url":"https://dev.to/rohithv07/leetcode-1751-maximum-number-of-events-that-can-be-attended-ii-4ol6","created_at":"2025-07-08T18:33:04Z","edited_at":"2025-07-08T19:57:42Z","crossposted_at":null,"published_at":"2025-07-08T18:33:04Z","last_comment_at":"2025-07-08T18:33:04Z","reading_time_minutes":3,"tag_list":["java","programming","algorithms","interview"],"tags":"java, programming, algorithms, interview","user":{"name":"Rohith V","username":"rohithv07","twitter_username":"vazhathody","github_username":"Rohithv07","user_id":480052,"website_url":"https://rohithv07.github.io/Tryouts/","profile_image":"https://media2.dev.to/dynamic/image/width=640,height=640,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Fuser%2Fprofile_image%2F480052%2Ff684c523-5316-4ac8-a73e-376d992dbcd4.jpeg","profile_image_90":"https://media2.dev.to/dynamic/image/width=90,height=90,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Fuser%2Fprofile_image%2F480052%2Ff684c523-5316-4ac8-a73e-376d992dbcd4.jpeg"}},{"type_of":"article","id":2665709,"title":"Next Greater Element in Circular Array","description":"Problem Statement   Given a circular integer array arr[], the task is to determine the next...","readable_publish_date":"Jul 7 '25","slug":"next-greater-element-in-circular-array-1g6k","path":"/rohithv07/next-greater-element-in-circular-array-1g6k","url":"https://dev.to/rohithv07/next-greater-element-in-circular-array-1g6k","comments_count":0,"public_reactions_count":6,"collection_id":null,"published_timestamp":"2025-07-07T18:28:21Z","language":"en","subforem_id":1,"positive_reactions_count":6,"cover_image":"https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fug6oafthdyvo9bodujim.png","social_image":"https://media2.dev.to/dynamic/image/width=1000,height=500,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fug6oafthdyvo9bodujim.png","canonical_url":"https://dev.to/rohithv07/next-greater-element-in-circular-array-1g6k","created_at":"2025-07-07T18:28:21Z","edited_at":null,"crossposted_at":null,"published_at":"2025-07-07T18:28:21Z","last_comment_at":"2025-07-07T18:28:21Z","reading_time_minutes":3,"tag_list":["java","programming","learning","algorithms"],"tags":"java, programming, learning, algorithms","user":{"name":"Rohith V","username":"rohithv07","twitter_username":"vazhathody","github_username":"Rohithv07","user_id":480052,"website_url":"https://rohithv07.github.io/Tryouts/","profile_image":"https://media2.dev.to/dynamic/image/width=640,height=640,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Fuser%2Fprofile_image%2F480052%2Ff684c523-5316-4ac8-a73e-376d992dbcd4.jpeg","profile_image_90":"https://media2.dev.to/dynamic/image/width=90,height=90,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Fuser%2Fprofile_image%2F480052%2Ff684c523-5316-4ac8-a73e-376d992dbcd4.jpeg"}},{"type_of":"article","id":2657664,"title":"Maximum Score From Subarray Mins","description":"Problem Statement   You are given an array arr[] of integers. Your task is to find the...","readable_publish_date":"Jul 5 '25","slug":"maximum-score-from-subarray-mins-4op6","path":"/rohithv07/maximum-score-from-subarray-mins-4op6","url":"https://dev.to/rohithv07/maximum-score-from-subarray-mins-4op6","comments_count":0,"public_reactions_count":10,"collection_id":null,"published_timestamp":"2025-07-05T06:39:25Z","language":"en","subforem_id":1,"positive_reactions_count":10,"cover_image":"https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fh4nv2esbttih0strftub.png","social_image":"https://media2.dev.to/dynamic/image/width=1000,height=500,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fh4nv2esbttih0strftub.png","canonical_url":"https://dev.to/rohithv07/maximum-score-from-subarray-mins-4op6","created_at":"2025-07-05T06:39:25Z","edited_at":null,"crossposted_at":null,"published_at":"2025-07-05T06:39:25Z","last_comment_at":"2025-07-05T06:39:25Z","reading_time_minutes":2,"tag_list":["java","programming","learning","algorithms"],"tags":"java, programming, learning, algorithms","user":{"name":"Rohith V","username":"rohithv07","twitter_username":"vazhathody","github_username":"Rohithv07","user_id":480052,"website_url":"https://rohithv07.github.io/Tryouts/","profile_image":"https://media2.dev.to/dynamic/image/width=640,height=640,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Fuser%2Fprofile_image%2F480052%2Ff684c523-5316-4ac8-a73e-376d992dbcd4.jpeg","profile_image_90":"https://media2.dev.to/dynamic/image/width=90,height=90,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Fuser%2Fprofile_image%2F480052%2Ff684c523-5316-4ac8-a73e-376d992dbcd4.jpeg"}},{"type_of":"article","id":2632400,"title":"Leetcode 2099. Find Subsequence of Length K With the Largest Sum","description":"Problem   You are given an integer array nums and an integer k. You want to find a...","readable_publish_date":"Jun 28 '25","slug":"leetcode-2099-find-subsequence-of-length-k-with-the-largest-sum-2c8e","path":"/rohithv07/leetcode-2099-find-subsequence-of-length-k-with-the-largest-sum-2c8e","url":"https://dev.to/rohithv07/leetcode-2099-find-subsequence-of-length-k-with-the-largest-sum-2c8e","comments_count":0,"public_reactions_count":5,"collection_id":null,"published_timestamp":"2025-06-28T06:43:30Z","language":"en","subforem_id":1,"positive_reactions_count":5,"cover_image":"https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Ft2muy38khfly3sb3497n.png","social_image":"https://media2.dev.to/dynamic/image/width=1000,height=500,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Ft2muy38khfly3sb3497n.png","canonical_url":"https://dev.to/rohithv07/leetcode-2099-find-subsequence-of-length-k-with-the-largest-sum-2c8e","created_at":"2025-06-28T06:43:31Z","edited_at":null,"crossposted_at":null,"published_at":"2025-06-28T06:43:30Z","last_comment_at":"2025-06-28T06:43:30Z","reading_time_minutes":2,"tag_list":["java","programming","learning","algorithms"],"tags":"java, programming, learning, algorithms","user":{"name":"Rohith V","username":"rohithv07","twitter_username":"vazhathody","github_username":"Rohithv07","user_id":480052,"website_url":"https://rohithv07.github.io/Tryouts/","profile_image":"https://media2.dev.to/dynamic/image/width=640,height=640,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Fuser%2Fprofile_image%2F480052%2Ff684c523-5316-4ac8-a73e-376d992dbcd4.jpeg","profile_image_90":"https://media2.dev.to/dynamic/image/width=90,height=90,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Fuser%2Fprofile_image%2F480052%2Ff684c523-5316-4ac8-a73e-376d992dbcd4.jpeg"}},{"type_of":"article","id":2632394,"title":"Leetcode 1432. Max Difference You Can Get From Changing an Integer","description":"Problem Statement   You are given an integer num. You will apply the following steps to num...","readable_publish_date":"Jun 28 '25","slug":"leetcode-1432-max-difference-you-can-get-from-changing-an-integer-3g2g","path":"/rohithv07/leetcode-1432-max-difference-you-can-get-from-changing-an-integer-3g2g","url":"https://dev.to/rohithv07/leetcode-1432-max-difference-you-can-get-from-changing-an-integer-3g2g","comments_count":0,"public_reactions_count":5,"collection_id":null,"published_timestamp":"2025-06-28T06:41:31Z","language":"en","subforem_id":1,"positive_reactions_count":5,"cover_image":"https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fvuucnrrbwuyshv6ikisp.png","social_image":"https://media2.dev.to/dynamic/image/width=1000,height=500,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fvuucnrrbwuyshv6ikisp.png","canonical_url":"https://dev.to/rohithv07/leetcode-1432-max-difference-you-can-get-from-changing-an-integer-3g2g","created_at":"2025-06-28T06:41:31Z","edited_at":null,"crossposted_at":null,"published_at":"2025-06-28T06:41:31Z","last_comment_at":"2025-06-28T06:41:31Z","reading_time_minutes":3,"tag_list":["java","programming","coding","learning"],"tags":"java, programming, coding, learning","user":{"name":"Rohith V","username":"rohithv07","twitter_username":"vazhathody","github_username":"Rohithv07","user_id":480052,"website_url":"https://rohithv07.github.io/Tryouts/","profile_image":"https://media2.dev.to/dynamic/image/width=640,height=640,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Fuser%2Fprofile_image%2F480052%2Ff684c523-5316-4ac8-a73e-376d992dbcd4.jpeg","profile_image_90":"https://media2.dev.to/dynamic/image/width=90,height=90,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Fuser%2Fprofile_image%2F480052%2Ff684c523-5316-4ac8-a73e-376d992dbcd4.jpeg"}},{"type_of":"article","id":2594109,"title":"Leetcode 1432. Max Difference You Can Get From Changing an Integer","description":"Problem Statement   You are given an integer num. You will apply the following steps to num...","readable_publish_date":"Jun 15 '25","slug":"leetcode-1432-max-difference-you-can-get-from-changing-an-integer-25g7","path":"/rohithv07/leetcode-1432-max-difference-you-can-get-from-changing-an-integer-25g7","url":"https://dev.to/rohithv07/leetcode-1432-max-difference-you-can-get-from-changing-an-integer-25g7","comments_count":1,"public_reactions_count":0,"collection_id":null,"published_timestamp":"2025-06-15T12:09:57Z","language":"en","subforem_id":1,"positive_reactions_count":0,"cover_image":"https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fvuucnrrbwuyshv6ikisp.png","social_image":"https://media2.dev.to/dynamic/image/width=1000,height=500,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fvuucnrrbwuyshv6ikisp.png","canonical_url":"https://dev.to/rohithv07/leetcode-1432-max-difference-you-can-get-from-changing-an-integer-25g7","created_at":"2025-06-15T12:10:00Z","edited_at":null,"crossposted_at":null,"published_at":"2025-06-15T12:09:57Z","last_comment_at":"2025-06-21T21:42:19Z","reading_time_minutes":3,"tag_list":["java","programming","coding","learning"],"tags":"java, programming, coding, learning","user":{"name":"Rohith V","username":"rohithv07","twitter_username":"vazhathody","github_username":"Rohithv07","user_id":480052,"website_url":"https://rohithv07.github.io/Tryouts/","profile_image":"https://media2.dev.to/dynamic/image/width=640,height=640,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Fuser%2Fprofile_image%2F480052%2Ff684c523-5316-4ac8-a73e-376d992dbcd4.jpeg","profile_image_90":"https://media2.dev.to/dynamic/image/width=90,height=90,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Fuser%2Fprofile_image%2F480052%2Ff684c523-5316-4ac8-a73e-376d992dbcd4.jpeg"}},{"type_of":"article","id":2594108,"title":"Leetcode 1432. Max Difference You Can Get From Changing an Integer","description":"Problem Statement   You are given an integer num. You will apply the following steps to num...","readable_publish_date":"Jun 15 '25","slug":"leetcode-1432-max-difference-you-can-get-from-changing-an-integer-4ko1","path":"/rohithv07/leetcode-1432-max-difference-you-can-get-from-changing-an-integer-4ko1","url":"https://dev.to/rohithv07/leetcode-1432-max-difference-you-can-get-from-changing-an-integer-4ko1","comments_count":0,"public_reactions_count":0,"collection_id":null,"published_timestamp":"2025-06-15T12:09:57Z","language":"en","subforem_id":1,"positive_reactions_count":0,"cover_image":"https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fvuucnrrbwuyshv6ikisp.png","social_image":"https://media2.dev.to/dynamic/image/width=1000,height=500,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fvuucnrrbwuyshv6ikisp.png","canonical_url":"https://dev.to/rohithv07/leetcode-1432-max-difference-you-can-get-from-changing-an-integer-4ko1","created_at":"2025-06-15T12:10:00Z","edited_at":null,"crossposted_at":null,"published_at":"2025-06-15T12:09:57Z","last_comment_at":"2025-06-15T12:09:57Z","reading_time_minutes":3,"tag_list":["java","programming","coding","learning"],"tags":"java, programming, coding, learning","user":{"name":"Rohith V","username":"rohithv07","twitter_username":"vazhathody","github_username":"Rohithv07","user_id":480052,"website_url":"https://rohithv07.github.io/Tryouts/","profile_image":"https://media2.dev.to/dynamic/image/width=640,height=640,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Fuser%2Fprofile_image%2F480052%2Ff684c523-5316-4ac8-a73e-376d992dbcd4.jpeg","profile_image_90":"https://media2.dev.to/dynamic/image/width=90,height=90,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Fuser%2Fprofile_image%2F480052%2Ff684c523-5316-4ac8-a73e-376d992dbcd4.jpeg"}},{"type_of":"article","id":2574842,"title":"Leetcode 2434 : Using a Robot to Print the Lexicographically Smallest String","description":"Problem Statement   You are given a string s and a robot that currently holds an empty...","readable_publish_date":"Jun 8 '25","slug":"leetcode-2434-using-a-robot-to-print-the-lexicographically-smallest-string-3ih6","path":"/rohithv07/leetcode-2434-using-a-robot-to-print-the-lexicographically-smallest-string-3ih6","url":"https://dev.to/rohithv07/leetcode-2434-using-a-robot-to-print-the-lexicographically-smallest-string-3ih6","comments_count":0,"public_reactions_count":0,"collection_id":null,"published_timestamp":"2025-06-08T07:07:49Z","language":"en","subforem_id":1,"positive_reactions_count":0,"cover_image":"https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fz1jyxpsaazyco25igcjm.png","social_image":"https://media2.dev.to/dynamic/image/width=1000,height=500,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fz1jyxpsaazyco25igcjm.png","canonical_url":"https://dev.to/rohithv07/leetcode-2434-using-a-robot-to-print-the-lexicographically-smallest-string-3ih6","created_at":"2025-06-08T07:07:51Z","edited_at":null,"crossposted_at":null,"published_at":"2025-06-08T07:07:49Z","last_comment_at":"2025-06-08T07:07:49Z","reading_time_minutes":2,"tag_list":["java","programming","learning","coding"],"tags":"java, programming, learning, coding","user":{"name":"Rohith V","username":"rohithv07","twitter_username":"vazhathody","github_username":"Rohithv07","user_id":480052,"website_url":"https://rohithv07.github.io/Tryouts/","profile_image":"https://media2.dev.to/dynamic/image/width=640,height=640,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Fuser%2Fprofile_image%2F480052%2Ff684c523-5316-4ac8-a73e-376d992dbcd4.jpeg","profile_image_90":"https://media2.dev.to/dynamic/image/width=90,height=90,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Fuser%2Fprofile_image%2F480052%2Ff684c523-5316-4ac8-a73e-376d992dbcd4.jpeg"}},{"type_of":"article","id":2519779,"title":"Leetcode 57. Insert Interval","description":"Problem Statement   You are given an array of non-overlapping intervals intervals where...","readable_publish_date":"May 23 '25","slug":"leetcode-57-insert-interval-ifk","path":"/rohithv07/leetcode-57-insert-interval-ifk","url":"https://dev.to/rohithv07/leetcode-57-insert-interval-ifk","comments_count":0,"public_reactions_count":1,"collection_id":null,"published_timestamp":"2025-05-23T20:46:32Z","language":"en","subforem_id":1,"positive_reactions_count":1,"cover_image":"https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2F4yslijbyzhi6daekhls8.png","social_image":"https://media2.dev.to/dynamic/image/width=1000,height=500,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2F4yslijbyzhi6daekhls8.png","canonical_url":"https://dev.to/rohithv07/leetcode-57-insert-interval-ifk","created_at":"2025-05-23T20:46:34Z","edited_at":null,"crossposted_at":null,"published_at":"2025-05-23T20:46:32Z","last_comment_at":"2025-05-23T20:46:32Z","reading_time_minutes":2,"tag_list":["java","programming","learning","algorithms"],"tags":"java, programming, learning, algorithms","user":{"name":"Rohith V","username":"rohithv07","twitter_username":"vazhathody","github_username":"Rohithv07","user_id":480052,"website_url":"https://rohithv07.github.io/Tryouts/","profile_image":"https://media2.dev.to/dynamic/image/width=640,height=640,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Fuser%2Fprofile_image%2F480052%2Ff684c523-5316-4ac8-a73e-376d992dbcd4.jpeg","profile_image_90":"https://media2.dev.to/dynamic/image/width=90,height=90,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Fuser%2Fprofile_image%2F480052%2Ff684c523-5316-4ac8-a73e-376d992dbcd4.jpeg"}},{"type_of":"article","id":2497289,"title":"Leetcode 138. Copy List with Random Pointer","description":"Problem Statement   A linked list of length n is given such that each node contains an...","readable_publish_date":"May 17 '25","slug":"leetcode-138-copy-list-with-random-pointer-4ji8","path":"/rohithv07/leetcode-138-copy-list-with-random-pointer-4ji8","url":"https://dev.to/rohithv07/leetcode-138-copy-list-with-random-pointer-4ji8","comments_count":0,"public_reactions_count":1,"collection_id":null,"published_timestamp":"2025-05-17T16:26:39Z","language":"en","subforem_id":1,"positive_reactions_count":1,"cover_image":"https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Ffkzqlwynwile6njaal2j.png","social_image":"https://media2.dev.to/dynamic/image/width=1000,height=500,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Ffkzqlwynwile6njaal2j.png","canonical_url":"https://dev.to/rohithv07/leetcode-138-copy-list-with-random-pointer-4ji8","created_at":"2025-05-17T16:26:40Z","edited_at":null,"crossposted_at":null,"published_at":"2025-05-17T16:26:39Z","last_comment_at":"2025-05-17T16:26:39Z","reading_time_minutes":3,"tag_list":["java","programming","algorithms","learning"],"tags":"java, programming, algorithms, learning","user":{"name":"Rohith V","username":"rohithv07","twitter_username":"vazhathody","github_username":"Rohithv07","user_id":480052,"website_url":"https://rohithv07.github.io/Tryouts/","profile_image":"https://media2.dev.to/dynamic/image/width=640,height=640,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Fuser%2Fprofile_image%2F480052%2Ff684c523-5316-4ac8-a73e-376d992dbcd4.jpeg","profile_image_90":"https://media2.dev.to/dynamic/image/width=90,height=90,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Fuser%2Fprofile_image%2F480052%2Ff684c523-5316-4ac8-a73e-376d992dbcd4.jpeg"}},{"type_of":"article","id":2476970,"title":"Leetcode 3. Longest Substring Without Repeating Characters","description":"Problem Statement   Given a string s, find the length of the longest substring without...","readable_publish_date":"May 11 '25","slug":"leetcode-3-longest-substring-without-repeating-characters-1gj7","path":"/rohithv07/leetcode-3-longest-substring-without-repeating-characters-1gj7","url":"https://dev.to/rohithv07/leetcode-3-longest-substring-without-repeating-characters-1gj7","comments_count":0,"public_reactions_count":0,"collection_id":null,"published_timestamp":"2025-05-11T07:35:24Z","language":"en","subforem_id":1,"positive_reactions_count":0,"cover_image":"https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2F6td4dq4ro7s2qy5jngqj.png","social_image":"https://media2.dev.to/dynamic/image/width=1000,height=500,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2F6td4dq4ro7s2qy5jngqj.png","canonical_url":"https://dev.to/rohithv07/leetcode-3-longest-substring-without-repeating-characters-1gj7","created_at":"2025-05-11T07:35:25Z","edited_at":null,"crossposted_at":null,"published_at":"2025-05-11T07:35:24Z","last_comment_at":"2025-05-11T07:35:24Z","reading_time_minutes":2,"tag_list":["java","programming","learning","algorithms"],"tags":"java, programming, learning, algorithms","user":{"name":"Rohith V","username":"rohithv07","twitter_username":"vazhathody","github_username":"Rohithv07","user_id":480052,"website_url":"https://rohithv07.github.io/Tryouts/","profile_image":"https://media2.dev.to/dynamic/image/width=640,height=640,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Fuser%2Fprofile_image%2F480052%2Ff684c523-5316-4ac8-a73e-376d992dbcd4.jpeg","profile_image_90":"https://media2.dev.to/dynamic/image/width=90,height=90,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Fuser%2Fprofile_image%2F480052%2Ff684c523-5316-4ac8-a73e-376d992dbcd4.jpeg"}},{"type_of":"article","id":2474156,"title":"Leetcode 2918. Minimum Equal Sum of Two Arrays After Replacing Zeros","description":"Problem Statement   You are given two arrays nums1 and nums2 consisting of positive...","readable_publish_date":"May 10 '25","slug":"leetcode-2918-minimum-equal-sum-of-two-arrays-after-replacing-zeros-p22","path":"/rohithv07/leetcode-2918-minimum-equal-sum-of-two-arrays-after-replacing-zeros-p22","url":"https://dev.to/rohithv07/leetcode-2918-minimum-equal-sum-of-two-arrays-after-replacing-zeros-p22","comments_count":0,"public_reactions_count":1,"collection_id":null,"published_timestamp":"2025-05-10T07:04:24Z","language":"en","subforem_id":1,"positive_reactions_count":1,"cover_image":"https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2F5qclbvbys7w7gxjrrfco.png","social_image":"https://media2.dev.to/dynamic/image/width=1000,height=500,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2F5qclbvbys7w7gxjrrfco.png","canonical_url":"https://dev.to/rohithv07/leetcode-2918-minimum-equal-sum-of-two-arrays-after-replacing-zeros-p22","created_at":"2025-05-10T07:04:25Z","edited_at":null,"crossposted_at":null,"published_at":"2025-05-10T07:04:24Z","last_comment_at":"2025-05-10T07:04:24Z","reading_time_minutes":2,"tag_list":["java","career","programming","learning"],"tags":"java, career, programming, learning","user":{"name":"Rohith V","username":"rohithv07","twitter_username":"vazhathody","github_username":"Rohithv07","user_id":480052,"website_url":"https://rohithv07.github.io/Tryouts/","profile_image":"https://media2.dev.to/dynamic/image/width=640,height=640,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Fuser%2Fprofile_image%2F480052%2Ff684c523-5316-4ac8-a73e-376d992dbcd4.jpeg","profile_image_90":"https://media2.dev.to/dynamic/image/width=90,height=90,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Fuser%2Fprofile_image%2F480052%2Ff684c523-5316-4ac8-a73e-376d992dbcd4.jpeg"}},{"type_of":"article","id":2456229,"title":"Leetcode 1007. Minimum Domino Rotations For Equal Row","description":"Problem Statement   In a row of dominoes, tops[i] and bottoms[i] represent the top and...","readable_publish_date":"May 3 '25","slug":"leetcode-1007-minimum-domino-rotations-for-equal-row-4hef","path":"/rohithv07/leetcode-1007-minimum-domino-rotations-for-equal-row-4hef","url":"https://dev.to/rohithv07/leetcode-1007-minimum-domino-rotations-for-equal-row-4hef","comments_count":0,"public_reactions_count":2,"collection_id":null,"published_timestamp":"2025-05-03T14:06:42Z","language":"en","subforem_id":1,"positive_reactions_count":2,"cover_image":"https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2F66rfyaqxzzr5wy9a1ugd.png","social_image":"https://media2.dev.to/dynamic/image/width=1000,height=500,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2F66rfyaqxzzr5wy9a1ugd.png","canonical_url":"https://dev.to/rohithv07/leetcode-1007-minimum-domino-rotations-for-equal-row-4hef","created_at":"2025-05-03T14:06:43Z","edited_at":null,"crossposted_at":null,"published_at":"2025-05-03T14:06:42Z","last_comment_at":"2025-05-03T14:06:42Z","reading_time_minutes":2,"tag_list":["java","programming","beginners","tutorial"],"tags":"java, programming, beginners, tutorial","user":{"name":"Rohith V","username":"rohithv07","twitter_username":"vazhathody","github_username":"Rohithv07","user_id":480052,"website_url":"https://rohithv07.github.io/Tryouts/","profile_image":"https://media2.dev.to/dynamic/image/width=640,height=640,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Fuser%2Fprofile_image%2F480052%2Ff684c523-5316-4ac8-a73e-376d992dbcd4.jpeg","profile_image_90":"https://media2.dev.to/dynamic/image/width=90,height=90,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Fuser%2Fprofile_image%2F480052%2Ff684c523-5316-4ac8-a73e-376d992dbcd4.jpeg"}},{"type_of":"article","id":2442813,"title":"Leetcode 2302. Count Subarrays With Score Less Than K","description":"Problem Statement   The score of an array is defined as the product of its sum and its...","readable_publish_date":"Apr 28 '25","slug":"leetcode-2302-count-subarrays-with-score-less-than-k-5die","path":"/rohithv07/leetcode-2302-count-subarrays-with-score-less-than-k-5die","url":"https://dev.to/rohithv07/leetcode-2302-count-subarrays-with-score-less-than-k-5die","comments_count":0,"public_reactions_count":0,"collection_id":null,"published_timestamp":"2025-04-28T16:28:53Z","language":"en","subforem_id":1,"positive_reactions_count":0,"cover_image":"https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fgdwmex5axqr969khflyf.png","social_image":"https://media2.dev.to/dynamic/image/width=1000,height=500,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fgdwmex5axqr969khflyf.png","canonical_url":"https://dev.to/rohithv07/leetcode-2302-count-subarrays-with-score-less-than-k-5die","created_at":"2025-04-28T16:28:54Z","edited_at":"2025-04-28T16:29:38Z","crossposted_at":null,"published_at":"2025-04-28T16:28:53Z","last_comment_at":"2025-04-28T16:28:53Z","reading_time_minutes":2,"tag_list":["java","learning","programming","tutorial"],"tags":"java, learning, programming, tutorial","user":{"name":"Rohith V","username":"rohithv07","twitter_username":"vazhathody","github_username":"Rohithv07","user_id":480052,"website_url":"https://rohithv07.github.io/Tryouts/","profile_image":"https://media2.dev.to/dynamic/image/width=640,height=640,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Fuser%2Fprofile_image%2F480052%2Ff684c523-5316-4ac8-a73e-376d992dbcd4.jpeg","profile_image_90":"https://media2.dev.to/dynamic/image/width=90,height=90,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Fuser%2Fprofile_image%2F480052%2Ff684c523-5316-4ac8-a73e-376d992dbcd4.jpeg"}},{"type_of":"article","id":2404517,"title":"Ninjas Training Coding Problem","description":"Problem statement   Ninja is planing this ‘N’ days-long training schedule. Each day, he can...","readable_publish_date":"Apr 13 '25","slug":"ninjas-training-coding-problem-218","path":"/rohithv07/ninjas-training-coding-problem-218","url":"https://dev.to/rohithv07/ninjas-training-coding-problem-218","comments_count":0,"public_reactions_count":6,"collection_id":null,"published_timestamp":"2025-04-13T17:56:57Z","language":"en","subforem_id":1,"positive_reactions_count":6,"cover_image":"https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fgqhjfmkcsewdahz298om.png","social_image":"https://media2.dev.to/dynamic/image/width=1000,height=500,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fgqhjfmkcsewdahz298om.png","canonical_url":"https://dev.to/rohithv07/ninjas-training-coding-problem-218","created_at":"2025-04-13T17:56:58Z","edited_at":"2025-04-13T19:03:11Z","crossposted_at":null,"published_at":"2025-04-13T17:56:57Z","last_comment_at":"2025-04-13T17:56:57Z","reading_time_minutes":6,"tag_list":["programming","algorithms","java","learning"],"tags":"programming, algorithms, java, learning","user":{"name":"Rohith V","username":"rohithv07","twitter_username":"vazhathody","github_username":"Rohithv07","user_id":480052,"website_url":"https://rohithv07.github.io/Tryouts/","profile_image":"https://media2.dev.to/dynamic/image/width=640,height=640,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Fuser%2Fprofile_image%2F480052%2Ff684c523-5316-4ac8-a73e-376d992dbcd4.jpeg","profile_image_90":"https://media2.dev.to/dynamic/image/width=90,height=90,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Fuser%2Fprofile_image%2F480052%2Ff684c523-5316-4ac8-a73e-376d992dbcd4.jpeg"}},{"type_of":"article","id":2385445,"title":"Alien Dictionary","description":"Problem statement   You have been given a sorted (lexical order) dictionary of an alien...","readable_publish_date":"Apr 6 '25","slug":"alien-dictionary-2jjb","path":"/rohithv07/alien-dictionary-2jjb","url":"https://dev.to/rohithv07/alien-dictionary-2jjb","comments_count":0,"public_reactions_count":0,"collection_id":null,"published_timestamp":"2025-04-06T05:52:03Z","language":"en","subforem_id":1,"positive_reactions_count":0,"cover_image":"https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fox8l8h7bccgm95yrlvcc.png","social_image":"https://media2.dev.to/dynamic/image/width=1000,height=500,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fox8l8h7bccgm95yrlvcc.png","canonical_url":"https://dev.to/rohithv07/alien-dictionary-2jjb","created_at":"2025-04-06T05:52:04Z","edited_at":null,"crossposted_at":null,"published_at":"2025-04-06T05:52:03Z","last_comment_at":"2025-04-06T05:52:03Z","reading_time_minutes":3,"tag_list":["programming","coding","java","algorithms"],"tags":"programming, coding, java, algorithms","user":{"name":"Rohith V","username":"rohithv07","twitter_username":"vazhathody","github_username":"Rohithv07","user_id":480052,"website_url":"https://rohithv07.github.io/Tryouts/","profile_image":"https://media2.dev.to/dynamic/image/width=640,height=640,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Fuser%2Fprofile_image%2F480052%2Ff684c523-5316-4ac8-a73e-376d992dbcd4.jpeg","profile_image_90":"https://media2.dev.to/dynamic/image/width=90,height=90,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Fuser%2Fprofile_image%2F480052%2Ff684c523-5316-4ac8-a73e-376d992dbcd4.jpeg"}},{"type_of":"article","id":2367643,"title":"Leetcode 2385. Amount of Time for Binary Tree to Be Infected","description":"Problems   You are given the root of a binary tree with unique values, and an integer start....","readable_publish_date":"Mar 31 '25","slug":"leetcode-2385-amount-of-time-for-binary-tree-to-be-infected-586i","path":"/rohithv07/leetcode-2385-amount-of-time-for-binary-tree-to-be-infected-586i","url":"https://dev.to/rohithv07/leetcode-2385-amount-of-time-for-binary-tree-to-be-infected-586i","comments_count":0,"public_reactions_count":0,"collection_id":null,"published_timestamp":"2025-03-31T08:44:53Z","language":"en","subforem_id":1,"positive_reactions_count":0,"cover_image":"https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fwbwdu8bhp6nfac4rb2vd.png","social_image":"https://media2.dev.to/dynamic/image/width=1000,height=500,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fwbwdu8bhp6nfac4rb2vd.png","canonical_url":"https://dev.to/rohithv07/leetcode-2385-amount-of-time-for-binary-tree-to-be-infected-586i","created_at":"2025-03-31T08:44:54Z","edited_at":null,"crossposted_at":null,"published_at":"2025-03-31T08:44:53Z","last_comment_at":"2025-03-31T08:44:53Z","reading_time_minutes":3,"tag_list":["coding","algorithms","java","learning"],"tags":"coding, algorithms, java, learning","user":{"name":"Rohith V","username":"rohithv07","twitter_username":"vazhathody","github_username":"Rohithv07","user_id":480052,"website_url":"https://rohithv07.github.io/Tryouts/","profile_image":"https://media2.dev.to/dynamic/image/width=640,height=640,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Fuser%2Fprofile_image%2F480052%2Ff684c523-5316-4ac8-a73e-376d992dbcd4.jpeg","profile_image_90":"https://media2.dev.to/dynamic/image/width=90,height=90,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Fuser%2Fprofile_image%2F480052%2Ff684c523-5316-4ac8-a73e-376d992dbcd4.jpeg"}},{"type_of":"article","id":2366634,"title":"Leetcode 621. Task Scheduler","description":"Problem   You are given an array of CPU tasks, each labeled with a letter from A to Z, and a...","readable_publish_date":"Mar 30 '25","slug":"leetcode-621-task-scheduler-59jn","path":"/rohithv07/leetcode-621-task-scheduler-59jn","url":"https://dev.to/rohithv07/leetcode-621-task-scheduler-59jn","comments_count":0,"public_reactions_count":0,"collection_id":null,"published_timestamp":"2025-03-30T16:40:37Z","language":"en","subforem_id":1,"positive_reactions_count":0,"cover_image":"https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2F1cj6olvar0qjopqnmyc4.png","social_image":"https://media2.dev.to/dynamic/image/width=1000,height=500,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2F1cj6olvar0qjopqnmyc4.png","canonical_url":"https://dev.to/rohithv07/leetcode-621-task-scheduler-59jn","created_at":"2025-03-30T16:40:38Z","edited_at":"2025-03-30T16:42:46Z","crossposted_at":null,"published_at":"2025-03-30T16:40:37Z","last_comment_at":"2025-03-30T16:40:37Z","reading_time_minutes":3,"tag_list":["coding","java","programming","learning"],"tags":"coding, java, programming, learning","user":{"name":"Rohith V","username":"rohithv07","twitter_username":"vazhathody","github_username":"Rohithv07","user_id":480052,"website_url":"https://rohithv07.github.io/Tryouts/","profile_image":"https://media2.dev.to/dynamic/image/width=640,height=640,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Fuser%2Fprofile_image%2F480052%2Ff684c523-5316-4ac8-a73e-376d992dbcd4.jpeg","profile_image_90":"https://media2.dev.to/dynamic/image/width=90,height=90,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Fuser%2Fprofile_image%2F480052%2Ff684c523-5316-4ac8-a73e-376d992dbcd4.jpeg"}},{"type_of":"article","id":2365277,"title":"Leetcode 79 : Word Search","description":"Problem   Given an m x n grid of characters board and a string word, return true if word...","readable_publish_date":"Mar 29 '25","slug":"leetcode-79-word-search-4b66","path":"/rohithv07/leetcode-79-word-search-4b66","url":"https://dev.to/rohithv07/leetcode-79-word-search-4b66","comments_count":0,"public_reactions_count":0,"collection_id":null,"published_timestamp":"2025-03-29T18:30:42Z","language":"en","subforem_id":1,"positive_reactions_count":0,"cover_image":"https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fefehc5ayoui92sy3fo0s.png","social_image":"https://media2.dev.to/dynamic/image/width=1000,height=500,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fefehc5ayoui92sy3fo0s.png","canonical_url":"https://dev.to/rohithv07/leetcode-79-word-search-4b66","created_at":"2025-03-29T18:30:43Z","edited_at":null,"crossposted_at":null,"published_at":"2025-03-29T18:30:42Z","last_comment_at":"2025-03-29T18:30:42Z","reading_time_minutes":2,"tag_list":["programming","java","learning","coding"],"tags":"programming, java, learning, coding","user":{"name":"Rohith V","username":"rohithv07","twitter_username":"vazhathody","github_username":"Rohithv07","user_id":480052,"website_url":"https://rohithv07.github.io/Tryouts/","profile_image":"https://media2.dev.to/dynamic/image/width=640,height=640,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Fuser%2Fprofile_image%2F480052%2Ff684c523-5316-4ac8-a73e-376d992dbcd4.jpeg","profile_image_90":"https://media2.dev.to/dynamic/image/width=90,height=90,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Fuser%2Fprofile_image%2F480052%2Ff684c523-5316-4ac8-a73e-376d992dbcd4.jpeg"}},{"type_of":"article","id":2364531,"title":"Leetcode 148 : Sort List","description":"Problem Statement   https://leetcode.com/problems/sort-list/description/  Given the head of...","readable_publish_date":"Mar 29 '25","slug":"leetcode-148-sort-list-p8n","path":"/rohithv07/leetcode-148-sort-list-p8n","url":"https://dev.to/rohithv07/leetcode-148-sort-list-p8n","comments_count":0,"public_reactions_count":3,"collection_id":null,"published_timestamp":"2025-03-29T18:18:40Z","language":"en","subforem_id":1,"positive_reactions_count":3,"cover_image":"https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fdhsbaxkcnjvuha2zardc.png","social_image":"https://media2.dev.to/dynamic/image/width=1000,height=500,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fdhsbaxkcnjvuha2zardc.png","canonical_url":"https://dev.to/rohithv07/leetcode-148-sort-list-p8n","created_at":"2025-03-29T09:41:05Z","edited_at":null,"crossposted_at":null,"published_at":"2025-03-29T18:18:40Z","last_comment_at":"2025-03-29T18:18:40Z","reading_time_minutes":2,"tag_list":["programming","algorithms","learning","computerscience"],"tags":"programming, algorithms, learning, computerscience","user":{"name":"Rohith V","username":"rohithv07","twitter_username":"vazhathody","github_username":"Rohithv07","user_id":480052,"website_url":"https://rohithv07.github.io/Tryouts/","profile_image":"https://media2.dev.to/dynamic/image/width=640,height=640,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Fuser%2Fprofile_image%2F480052%2Ff684c523-5316-4ac8-a73e-376d992dbcd4.jpeg","profile_image_90":"https://media2.dev.to/dynamic/image/width=90,height=90,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Fuser%2Fprofile_image%2F480052%2Ff684c523-5316-4ac8-a73e-376d992dbcd4.jpeg"}},{"type_of":"article","id":2364934,"title":"GeeksforGeeks : M Coloring Problem","description":"Problem   https://www.geeksforgeeks.org/problems/m-coloring-problem-1587115620/1  You are...","readable_publish_date":"Mar 29 '25","slug":"geeksforgeeks-m-coloring-problem-d16","path":"/rohithv07/geeksforgeeks-m-coloring-problem-d16","url":"https://dev.to/rohithv07/geeksforgeeks-m-coloring-problem-d16","comments_count":0,"public_reactions_count":1,"collection_id":null,"published_timestamp":"2025-03-29T13:57:51Z","language":"en","subforem_id":1,"positive_reactions_count":1,"cover_image":"https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fzro0zg55lytptfvas3i6.png","social_image":"https://media2.dev.to/dynamic/image/width=1000,height=500,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fzro0zg55lytptfvas3i6.png","canonical_url":"https://dev.to/rohithv07/geeksforgeeks-m-coloring-problem-d16","created_at":"2025-03-29T13:57:52Z","edited_at":"2025-03-29T13:59:24Z","crossposted_at":null,"published_at":"2025-03-29T13:57:51Z","last_comment_at":"2025-03-29T13:57:51Z","reading_time_minutes":3,"tag_list":["algorithms","programming","learning","java"],"tags":"algorithms, programming, learning, java","user":{"name":"Rohith V","username":"rohithv07","twitter_username":"vazhathody","github_username":"Rohithv07","user_id":480052,"website_url":"https://rohithv07.github.io/Tryouts/","profile_image":"https://media2.dev.to/dynamic/image/width=640,height=640,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Fuser%2Fprofile_image%2F480052%2Ff684c523-5316-4ac8-a73e-376d992dbcd4.jpeg","profile_image_90":"https://media2.dev.to/dynamic/image/width=90,height=90,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Fuser%2Fprofile_image%2F480052%2Ff684c523-5316-4ac8-a73e-376d992dbcd4.jpeg"}},{"type_of":"article","id":2364433,"title":"Leetcode 19 : Remove nth Node from end of List","description":"Problem...","readable_publish_date":"Mar 29 '25","slug":"leetcode-19-remove-nth-node-from-end-of-list-dai","path":"/rohithv07/leetcode-19-remove-nth-node-from-end-of-list-dai","url":"https://dev.to/rohithv07/leetcode-19-remove-nth-node-from-end-of-list-dai","comments_count":0,"public_reactions_count":1,"collection_id":null,"published_timestamp":"2025-03-29T08:15:42Z","language":"en","subforem_id":1,"positive_reactions_count":1,"cover_image":"https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Ffslevjn8iwszt3z0flpz.png","social_image":"https://media2.dev.to/dynamic/image/width=1000,height=500,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Ffslevjn8iwszt3z0flpz.png","canonical_url":"https://dev.to/rohithv07/leetcode-19-remove-nth-node-from-end-of-list-dai","created_at":"2025-03-29T08:15:43Z","edited_at":"2025-03-29T08:31:16Z","crossposted_at":null,"published_at":"2025-03-29T08:15:42Z","last_comment_at":"2025-03-29T08:15:42Z","reading_time_minutes":2,"tag_list":["programming","java","learning","algorithms"],"tags":"programming, java, learning, algorithms","user":{"name":"Rohith V","username":"rohithv07","twitter_username":"vazhathody","github_username":"Rohithv07","user_id":480052,"website_url":"https://rohithv07.github.io/Tryouts/","profile_image":"https://media2.dev.to/dynamic/image/width=640,height=640,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Fuser%2Fprofile_image%2F480052%2Ff684c523-5316-4ac8-a73e-376d992dbcd4.jpeg","profile_image_90":"https://media2.dev.to/dynamic/image/width=90,height=90,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Fuser%2Fprofile_image%2F480052%2Ff684c523-5316-4ac8-a73e-376d992dbcd4.jpeg"}},{"type_of":"article","id":2354193,"title":"LeetCode 3169. Count Days Without Meetings","description":"Problem Statement   You are given a positive integer days representing the total number of...","readable_publish_date":"Mar 24 '25","slug":"leetcode-3169-count-days-without-meetings-425l","path":"/rohithv07/leetcode-3169-count-days-without-meetings-425l","url":"https://dev.to/rohithv07/leetcode-3169-count-days-without-meetings-425l","comments_count":0,"public_reactions_count":4,"collection_id":null,"published_timestamp":"2025-03-24T18:43:19Z","language":"en","subforem_id":1,"positive_reactions_count":4,"cover_image":"https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fn4fqfct3mkhyl55wmw8d.png","social_image":"https://media2.dev.to/dynamic/image/width=1000,height=500,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fn4fqfct3mkhyl55wmw8d.png","canonical_url":"https://dev.to/rohithv07/leetcode-3169-count-days-without-meetings-425l","created_at":"2025-03-24T18:43:20Z","edited_at":null,"crossposted_at":null,"published_at":"2025-03-24T18:43:19Z","last_comment_at":"2025-03-24T18:43:19Z","reading_time_minutes":2,"tag_list":["programming","algorithms","learning","java"],"tags":"programming, algorithms, learning, java","user":{"name":"Rohith V","username":"rohithv07","twitter_username":"vazhathody","github_username":"Rohithv07","user_id":480052,"website_url":"https://rohithv07.github.io/Tryouts/","profile_image":"https://media2.dev.to/dynamic/image/width=640,height=640,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Fuser%2Fprofile_image%2F480052%2Ff684c523-5316-4ac8-a73e-376d992dbcd4.jpeg","profile_image_90":"https://media2.dev.to/dynamic/image/width=90,height=90,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Fuser%2Fprofile_image%2F480052%2Ff684c523-5316-4ac8-a73e-376d992dbcd4.jpeg"}},{"type_of":"article","id":2351207,"title":"Leetcode 1976 : Number of Ways to Arrive at Destination","description":"Problem Statement   You are in a city with n intersections numbered from 0 to n - 1 with...","readable_publish_date":"Mar 23 '25","slug":"number-of-ways-to-arrive-at-destination-52im","path":"/rohithv07/number-of-ways-to-arrive-at-destination-52im","url":"https://dev.to/rohithv07/number-of-ways-to-arrive-at-destination-52im","comments_count":0,"public_reactions_count":0,"collection_id":null,"published_timestamp":"2025-03-23T07:28:11Z","language":"en","subforem_id":1,"positive_reactions_count":0,"cover_image":"https://media2.dev.to/dynamic/image/width=1000,height=420,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2F79u368aei9v35mjubq1z.png","social_image":"https://media2.dev.to/dynamic/image/width=1000,height=500,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2F79u368aei9v35mjubq1z.png","canonical_url":"https://dev.to/rohithv07/number-of-ways-to-arrive-at-destination-52im","created_at":"2025-03-23T07:28:12Z","edited_at":"2025-03-23T07:31:57Z","crossposted_at":null,"published_at":"2025-03-23T07:28:11Z","last_comment_at":"2025-03-23T07:28:11Z","reading_time_minutes":3,"tag_list":["programming","algorithms","java","computerscience"],"tags":"programming, algorithms, java, computerscience","user":{"name":"Rohith V","username":"rohithv07","twitter_username":"vazhathody","github_username":"Rohithv07","user_id":480052,"website_url":"https://rohithv07.github.io/Tryouts/","profile_image":"https://media2.dev.to/dynamic/image/width=640,height=640,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Fuser%2Fprofile_image%2F480052%2Ff684c523-5316-4ac8-a73e-376d992dbcd4.jpeg","profile_image_90":"https://media2.dev.to/dynamic/image/width=90,height=90,fit=cover,gravity=auto,format=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Fuser%2Fprofile_image%2F480052%2Ff684c523-5316-4ac8-a73e-376d992dbcd4.jpeg"}}]