South Carolina Department of Corrections’ Post

When are you happy? Developer : I got merged😍. This was my first GirlScript Summer of Code and I found a project named Codeteria (a very good project with inbuilt online code runner and resources for head starts in tech domain) which lead to my first pr getting merged.🥹 Small fixes can contribute to big changes. Keeping that in mind I went for it and fixed some errors in the code which later got accepted and merged.😎 Check it out here : https://lnkd.in/dECtpyJ6 Would love to find more and contribute more. 😋 #gssoc #gssoccontribution #opensource #october

I'm sure most of you have traveled in the metro, but did you know that your ticket is coded? No, there are no tiny human beings inside each machine stamping your ticket and allowing you to cross the barriers. All of these ‘machines’ are programmed!!!!! Primarily, they're built using coding languages like Java and C++. Java ensures the software runs smoothly, and C++ is used for its high performance, handling the real-time processing needed for the transactions. So, next time you get your metro ticket, you'll know the incredible technology behind it. This was Day 8 of our series, "Code Behind It." Stay tuned for Day 9 and don't forget to share this with your metro companions! #CodeBehindIt #DelhiMetro #coding #codingninjas #ticket

🚀 Day 29: House Robber (198) In today's #100DaysOfCode challenge, we tackle the problem of maximizing robbery haul without alerting the police! 🧩 Problem: Given an array nums representing the money in each house, find the maximum money you can rob without adjacent houses being robbed on the same night. 🔍 Objective: Implement a Java function to calculate the maximum robbery amount without triggering the police alert. 🛠️ Solution: Use dynamic programming to keep track of the maximum money at each house, considering the previous two houses' maximum money to avoid adjacent robbing. Excited to solve this problem and optimize the robbery haul in Java! Let's keep advancing in coding and algorithms together! #CodingChallenge #JavaProgramming #DynamicProgramming #Optimization #TechSkills #SoftwareEngineering #LearnToCode #DeveloperCommunity #LinkedInConnections #LeetCode

Threw together a Node.js app for an interview, and here is one of the endpoints I created: #Coding #Node #Javacript

Wrapping Up an Amazing Course! I'm excited to share that I have completed a comprehensive Java Full Stack Development course at KodNest. During this program, I gained hands-on experience with Java Full Stack Development. Built robust applications using Java, Spring Boot, and Hibernate. Developed and optimized complex database queries. A big thanks to my mentors and team for their guidance and support. Looking forward to applying these skills in new challenges and opportunities. #JavaDevelopment #FullStackDevelopment #Software Engineering.

Day 257🔥of #365daysofcode #codingjourney #LeetCodeChallenge #LeetCodeStreak #LeetCode #ProgrammingLife Title: - 2678. Number of Senior Citizens My Solution: - https://lnkd.in/ga34j2K2

Hey developers out there, Solving my first Medium Leetcode problem was so easy! It was initially quite tricky, but once I understood the logic, it became straightforward. In this problem, we don't have access to the head node; we only have access to the node to be deleted. To solve this, I accessed the node's value and set it to the value of the next node. Then, I changed 'node.next' to 'node.next.next'. That's it! and Thanks to takeUforward for teaching Linked Lists in such a clear and understandable way! #java #leetcode #webdeveloper

🚀 Day 57: Minimizing the Maximum Products Distributed to Any Store 🚀 Today, I tackled LeetCode problem #2064 - Minimized Maximum of Products Distributed to Any Store. The goal was to distribute products to retail stores such that each store receives at most one type of product but can get any amount of it. The twist? We aim to minimize the maximum number of products that any store receives. Here's the approach I used: *Binary Search: To efficiently find the minimum possible maximum of products per store, binary search helped in narrowing down the optimal limit. *(isPossible): This function checks if a given maximum limit allows for all products to be distributed within the specified constraints. By adjusting limits in the binary search, we zeroed in on the smallest feasible maximum. Special thanks to Vignesh Reddy Julakanti for his guidance and support throughout my coding journey. #LeetCode #BinarySearch #CodingChallenge #Java #ProblemSolving #LearningEveryday

Yesterday, our cohort had the pleasure of meeting Hunter Hodnett. Not only did he give us fantastic guidance on creating our software development portfolios, but he also delivered an unexpected pep talk. We shared each of our "how we got to Carolina Code School" stories and were met with pure excitement about the power of our journeys. One concept Hunter mentioned stuck with me: "intrinsic drive." Though I had heard the phrase before, I hadn't truly grasped its meaning. After spending an hour exploring its psychology and some memes, I realized that intrinsic drive has made my software development journey unique. This journey is for me. It's what I look forward to every day. Facing challenges feels less daunting. While external motivation is beneficial, it is not the key to my success...I am! Thank you, Hunter! #NewBeginnings #JobSearch #FullStackDeveloper #CarolinaCodeSchool #TechJourney #SoftwareDeveloper #React #HTML #CSS #JavaScript #Python #SQL #PostgreSQL #Programmer #Code #WomenWhoCode #WomenInTech #Inspiration  #SoftwareDevelopment

🚀 Day 12 of LeetCode Daily Challenge! Today's challenge was "Sliding Puzzle" 🧩: Given a 2x3 board with tiles labeled 1-5 and an empty square (0), the task is to determine the minimum number of moves to arrange the board into its solved state [[1,2,3],[4,5,0]]. If unsolvable, return -1. This problem tested BFS for shortest path in state-space search and brought exciting moments of debugging and optimization! ✨ 👉 Solution in Java ✅ #LeetCode #DailyChallenge #ProblemSolving