The Coding Puzzle 🧩

Given an integer array nums and an integer val, remove all occurrences of val in nums in-place. The relative order of the elements may be changed.

Since it is impossible to change the length of the array in some languages, you must instead have the result be placed in the first part of the array nums. More formally, if there are k elements after removing the duplicates, then the first k elements of nums should hold the final result. It does not matter what you leave beyond the first k elements.

Return k after placing the final result in the first k slots of nums.

The Coding Puzzle 🧩

Last week’s puzzle: You are given two integer arrays nums1 and nums2, sorted in non-decreasing order, and two integers m and n, representing the number of elements in nums1 and nums2 respectively.

Merge nums1 and nums2 into a single array sorted in non-decreasing order.

The final sorted array should not be returned by the function, but instead be stored inside the array nums1. To accommodate this, nums1 has a length of m + n, where the first m elements denote the elements that should be merged, and the last n elements are set to 0 and should be ignored. nums2 has a length of n.

The Coding Puzzle 🧩

Last week's puzzle:

Given the array nums, for each nums[i] find out how many numbers in the array are smaller than it. That is, for each nums[i] you have to count the number of valid j's such that j != i and nums[j] < nums[i].

Return the answer in an array.

The Coding Puzzle 🧩

Last week's puzzle:

Given a string, write a function to check if it is a permutation of a palindrome. A palindrome is a word or phrase that is the same forwards and backwards. A permutation is a rearrangement of letters. The palindrome does not need to be limited to just dictionary words.

Solution for last week's problem:

The Coding Puzzle 🧩

Last week’s puzzle:

Given an integer array nums sorted in non-decreasing order, remove the duplicates in-place such that each unique element appears only once. The relative order of the elements should be kept the same.

Solution for last week’s problem:

The Coding Puzzle 🧩

Last week’s puzzle:

Given a positive integer N, returns the length of its longest binary gap. The function should return 0 if N doesn’t contain a binary gap.

Examples:

The Coding Puzzle 🧩

Last week’s puzzle:

Given an array of integers nums and an integer target, return indices of the two numbers such that they add up to target.

You may assume that each input would have exactly one solution, and you may not use the same element twice.

Hi DLU crew, I hope everyone enjoyed their 4th and are doing well! As always make sure to take some time to enjoy yourself and make time to be around those you care about, enjoy the newsletter and stay safe.

The Coding Puzzle 🧩

Solution for last week:

class Solution:
    def lengthOfLongestSubstring(self, s: str) -> int:
        n = len(s)
        ans = 0
        # mp stores the current index of a character
        mp = {}

        i = 0
        # try to extend the range [i, j]
        for j in range(n):
            if s[j] in mp:
                i = max(mp[s[j]], i)

            ans = max(ans, j - i + 1)
            mp[s[j]] = j + 1

        return ans

The Coding Puzzle 🧩

Given a string s, find the length of the longest substring without repeating characters.

Example 1:

Input: s = "abcabcbb" Output: 3 Explanation: The answer is "abc", with the length of 3.

Well, I guess someone has some explaining to do since the last newsletter was published in April. To be honest work, family, and school needed more attention, and even more specifically I had to focus as much of my extra time on preparing for my qualifying exams. The good news is I passed! It was one of the hardest things I have ever had to do in academia to date since I had to pass in order to stay in school. I hope to share some lessons learned from my experiences soon, but enough of my chatter enjoy the newsletter below!

The Coding Puzzle 🧩

Last coding puzzle Solution

 Developer Headlines 📢

The Coding Puzzle 🧩

Last Week's coding puzzle Solution

Remove duplicates from an unsorted linked list.

Example:

If the linked list is 12->11->12->21->41->43

removeDuplicates() should convert the list to 12->11->21->41->43.

The Coding Puzzle 🧩

Last Week’s coding puzzle

Determine if a string has all unique characters.

Hello Family!

Your Devs Like Us newsletter will look a little different this week. Make sure to check the new coding puzzle section, it should be a fun way to stay fresh on popular coding interview questions. Every week we will have a new coding problem along with the solution from the previous week so enjoy !

 The Coding Puzzle  🧩

Stay interview ready with the DLU coding puzzle

Hello Family!

Daylight savings just hit and now we get to enjoy some extra sunlight. I hope everyone is hanging in there and ready for another week. I’m enjoying the new spring feeling that’s around.

Speaking of new, have you ever just been ready for something new in your career? Lately, there has been a lot of talk in the developer community regarding the interviewing process for developers.

This process can be taxing and almost like working for free just to get your foot in the door. Take-home coding exercises, whiteboard interviews, and salary negotiations can all be enough to keep some unhappy and stuck at their current employer. This should never be the case, and I believe that together as a community we can ensure that we are always prepared to take on interviews.

Hello Family!

Have you ever been on the go without your laptop and wanted to get some code going? Well check this out, go to your browser and simply type github.surf in your browser, and just like that you have an in-browser vscode. You can also point to your repo by adding /{username}/{github_Repo} , now how cool is that?

 Developer Headlines 📢

Hello Family!

What do you all have going on this week? We would love to hear from you 📧 !

I had the opportunity to attend the first 🐦 speaker series and it was a great experience. Speakers covered testing, performance, web assembly, and how to start in open-source.

I hope everyone is safe and ready to be as productive as possible this week. Last week ended well for us as the DLU team tuned into the North America Global Diversity CFP Day. We learned a lot of great information for networking and speaking at conferences, we hope to share some of that info soon. One of the great speakers there was Angie Jones, you can check out her developer story at the GithHub ReadMe Project.

🐦

The Super Bowl is finished (hope everyone had some great food) and it’s time to get back to work! This weekend I had plenty of time to think and I started to think about process and patience. Not sure where you are in your developer journey, but I want to encourage everyone to enjoy your journey, don’t compare yourself to others, and seek others for help when you need it! We learn so much during our journey, take notes and prepare for the opportunities ahead.

Developer Spotlight 🔦 Tianna Lewis🤩

Developer Spotlight 🔦 Trenisha Goslee🤩

With over six years of teaching experience, Trenisha has done a wide range of things across many different states. From teaching 7th-grade math to creating STEM programs for two different schools to coaching a nationally ranked robotics team.

Trenisha is the founder of Awakening STEM where the mission is to provide quality STEM services centered around students of color in the DC area. With only 13% of people of color in the STEM industry, Awakening STEM’s purpose is to expose students to the skills necessary to break down the barriers put up against them. Be sure to check out their website, and Instagram page.

 Developer Headlines 🕫

Welcome to the Devs Like Us Weekly Newsletter!

Our goal with this newsletter is to connect you with valuable resources along with highlighting your great developer stories, projects, and accomplishments.

Wow, can you believe that we are already 25 days into the new year? If we are not careful the year will fly by without us reaching all of our goals. Of course, we will never let that happen, one great way to stay organized is to write down your goals and the steps you will take to reach them. Another option is to check out the Let's Start-Up Annual Planning Workbook so you can reach your goals for the year.

Developer Headlines 🕫