In a recent mock technical interview, I was presented with an interesting coding exercise that asked me to compare two string inputs & whether one string is a “rotated” string of the second string. The question was stated as follows:
Note that this problem is also on Leetcode (question #796). Link to the question: https://leetcode.com/problems/rotate-string/
We are given two strings,
A shift on
A consists of taking string
A and moving the leftmost character to the rightmost position. For example, if
A = 'abcde', then it will be
'bcdea' after one shift on
Welcome to the Matrix. No, not that Matrix, sadly.
As I prowl the pages of Leetcode, or in this case, binarysearch.com, I tend to shy away from inputs that I am unfamiliar with. I get scared very easily (this is not a lie!)
Matrixes are no different. Up to this point, I’ve immediately moved onto another problem if I saw a matrix as an input. However, today I was forced to stand up to my fears as my friend and I took on this problem during a pair programming session. …
I have no choice but to meander the journey of post coding bootcamp with my fellow job-seekers trying to crack into the tech industry.
Meander: To follow a winding or intricate course, as defined by the Merriam-Webster dictionary.
There’s nothing more accurate to paint the picture of life of thousands of coding bootcamp students; from our decision to change course in our careers and put our life on hold to learn new skills, to maneuvering the challenges that our bootcamps taught us, and to facing the harsh reality of life after graduation & the difficulties the market presents to land…
I recently completed my first live code challenge & was presented with this deceivingly challenging question, which asked to check whether the input string contained a balanced parentheses or not.
While I had an overall positive experience & ended up finishing (with help) in the allocated time, I still feel like it was an underwhelming performance & would be surprised if I make it to the next round. After I finished, I kept thinking about the problem & re-visiting the challenge in my head and whether I could’ve performed better.
Want to read this story later? Save it in Journal.
If you’re like me and knee deep in Leetcode (or any other sites that offer practice problems in algorithms & data structures), you’ve probably come across this catchy term: binary search.
Sounds catchy right? So catchy that there’s a Leetcode-type website named after it.
Tired of Leetcode or need a change of scenery? Check out: https://binarysearch.com/. In addition to offering practice problems, I like their private room feature where you can create a room for you & your friends to solve problems in a timed setting (you set the time limit, # of questions and difficulty level). …
To learn more about Code The Dream & how you can get involved, visit their website! https://codethedream.org/
While I was excited to get my hands dirty with Ruby again, I unexpectedly learned that the first couple of weeks in CTD’s curriculum was SQL, or Structured Query Language.
Oh man…I definitely glossed over this part when…
And here I thought I was making decent progress with my early studies of algorithms.
Enter recursion. Even now, studying recursion feels like I keep getting pushed back to the starting line of the same race each time I hit the mile mark.
If you’re still here after that lame recursion joke, thank you for not giving up on me.
However, with anything in life, there’s nothing like practice in developing a certain comfort level in a skill. Someday, hopefully, recursion will become second nature, like going for a run or pouring water into a cup.
Maybe not. But one…
Welcome to the world of data structures algorithms, reader.
Coding bootcamps are a past now, but we’ve been introduced to this cruel but fascinating world. I’ve quickly developed a love-hate relationship in solving algorithm questions — I’ve spent the last couple of weeks being introduced to different algorithm patterns and complex problems on the web, most notably Leetcode.
I hate it because it’s such a humbling experience tackling each problem (and often times I question my ability & confidence), but I love it because each problem offers a opportunity to learn something new — a new way to use a…
On September 4th 2020, I received a call from my employer at the time, informing me of their decision to place me on furlough with no set return date. Like many individuals, my employment was affected by the COVID-19 pandemic and the future was uncertain.
I anticipated the call, and honestly speaking thought the decision would have been made much sooner, but the news was still devastating. I had already changed my career just a couple of years ago & barely got my feet wet. …
When I found out that there is a concept in functional programming with the same namesake as one of my favorite dishes in the world, it was only natural for me to “follow my nose” and dig deeper into the topic.
During my initial research, I quickly realized that the fundamental idea of currying is not as exotic & spicy as our favorite dish. Currying, in it’s simplest definition, a technique of evaluating functions with multiple arguments, and decomposing it into a sequence of functions with a single argument.
In other words, a “curried” function, instead of taking all arguments…
Uncovering the truths of Software Engineering one story at a time. Former Healthcare Administrator and proud dad of my Pomeranian, Nami. Based in Brooklyn, NY