I would describe my internships as one of the experiences that have highlighted my collegiate career. From the recruiting process, to the summers spent working for different companies, I have learnt a lot of things that have helped me not only in my job search but also personally made me a better human.

Here are the five things that I have learnt over the years, which I hope will help you in your internship search.

When I began applying for internships, I remember submitting my resume to job application sites only to get a rejection a few hours later if not instantly. This was always such a bummer and it led me to consider dropping the whole internship search because I felt I was not qualified. During this time, as a last resort I had decided to send my resume to a friend for review and their feedback really helped with revamping my resume. I got to learn that for one the structure of your resume is very important. Moreover, the choice of words that you use in your resume can help in bringing out your strengths or sadly make you come off as a weak candidate. Therefore, it is important to take time in ensuring that your resume is structured and edited well enough. …

Summer 2019, I had just finished my sophomore year of college and declared CS as my major. Being a CS student, I had seen upper class students secure internships with big tech companies in Silicon Valley, and honestly the thought of having to prepare for a technical interview let alone secure a summer internship really scared me. At the time I had only taken basic CS and Math classes. I barely had any CS project on my portfolio and was not at all confident in my coding skills.

Having no solid experiences that I could add to my resume, I had chosen to dedicate that summer in preparing as well as honing my skills in readiness for the next recruiting season. Every day, I made it a goal to do at least two leetcode problems. I had also started working on CS projects for my portfolio. Trust me, it was not easy and there are times I felt so overwhelmed especially when I could not work my way in solving a leetcode problem. However, being part of a community online (Rewriting the Code) gave me the dedication and discipline to continue. A dedication that saw me become better in my problem-solving skills as well as completing my portfolio projects! …

This is another hard level leetcode problem commonly asked during coding interviews. To be able to solve this problem you first need to know how to solve the Merge Two sorted lists problem.Therefore make sure you check my approach of solving the merge two sorted lists problem first before going into this problem.

**The Question:**

Merge *k* sorted linked lists and return it as one sorted list. Analyze and describe its complexity.

Example:Input:[1->4->5,1->3->4,2->6]Output: 1->1->2->3->4->4->5->6

The brute force solution that someone would definitely first think about when it comes to solving this problem is to traverse all the linked lists and then collect all the values into an array. Afterwards you sort and iterate over this array to create a proper value of the nodes and then create a new sorted linked list with the new Nodes. …

This is another leetcode easy level problem and it is fundamental to as well learn how to quickly solve this when asked in an interview setting.

**The Question:**

Merge two sorted linked lists and return it as a new list. The new list should be made by splicing together the nodes of the first two lists.Example:Input: 1->2->4, 1->3->4Output: 1->1->2->3->4->4

**Problem solution approach**

We should create a new linked list and initialize a zero pointer that points to the first node. We then iterate using the pointer continuously adding nodes in the linked list while traversing both lists.

Here is the…

**The question:**

Given a 32-bit signed integer, reverse digits of an integer.

Example 1:Input:123Output:321Example 2:Input:-123Output:-321Example 3:Input:120Output:21

*Assume we are dealing with an environment which could only store integers within the 32-bit signed integer range: [−231, 231 − 1]. For the purpose of this problem, assume that your function returns 0 when the reversed integer overflows*.

This is a Leetcode easy level interview problem. The best and easiest way to approach this problem is through the use of strings.

**Here is a step by step approach of the…**

This problem is commonly found on leetcode and according to leetcode companies like Facebook and Amazon have tested this problem in their coding interviews! Therefore, it is actually quite important to learn how to approach and solve this problem.

**The Question:**

Given a string **s**, find the longest palindromic substring in **s**. You may assume that the maximum length of **s** is 1000.

Example 1:Input:“babad”Output:“bab”Note:“aba” is also a valid answer.Example 2:Input:“cbbd”Output:“bb”

**How to approach and solve this problem.**

The** Brute Force solution** when it comes to solving this problem is finding all the substrings we are given and checking whether all of them are palindromes and then finding the largest palindrome. …

We have probably all came across the saying or statement that Machine Learning and Artificial Intelligence are a big part of technological advancement and the future. Opportunities in Machine Learning and AI are definitely going to be big for the next decades since they are the main driver of emerging technologies.

If you are interested in technology or a career in tech, you have definitely come across Machine Learning. You have probably asked yourself about what it takes to become a Machine Learning Engineer and whether it is worth it especially with emerging careers in data science.

One thing you have to think about whenever you are presented with this question is that the adoption of Machine Learning and Artificial Intelligence in various verticals is continuing to grow and the demand for these professionals is also skyrocketing. Therefore this makes this career a hot field that will be a big part of the future and technology. …

In the previous articles we have been looking at **simple linear regression models **whereby we were predicting the relationship between two variables.

Multiple linear regression on the other hand attempts to model the relationship between two or more explanatory variables and a response variable by fitting a linear equation to observed data. (**We try to predict a variable based on two or more variables)**

Linear regression with multiple variables is also known as **“multivariate linear regression”.**

Here is an example:

Have a look at the table above. We are presented with different car variables. Let’s say we are required to predict its price. We can definitely predict the price of the car using the car model alone but using **multiple regression** the multiple variables like model, length or width of the car in this case help make our prediction more accurate. …

**The question: **You are given two **non-empty** linked lists representing two non-negative integers. The digits are stored in **reverse order** and each of their nodes contain a single digit. Add the two numbers and return it as a linked list.

You may assume the two numbers do not contain any leading zero, except the number 0 itself.

Example:Input:(2 -> 4 -> 3) + (5 -> 6 -> 4)Output:7 -> 0 -> 8Explanation:342 + 465 = 807.

When solving this problem, it is useful to remember how exactly addition works. Here is an example

512+…

**Given an array of integers, return indices of two numbers that add to a specific target.**

You may assume that each input would have ** exactly** one solution, and you may not use the

Fore example:

Given nums = [2, 8, 12, 15], target = 20,Because nums [1] + nums [2] = 8 + 12= 20,return [1, 2]

This here is a leetcode interview question and there are multiple ways of approaching this problem.

Unto the solution!

**Solution 1: Brute Force solution**

This is what many people would come up with after looking at the problem.

Whereby you would iterate the entire list and compare the numbers with every other number in the list and check whether they add up to the target. …

About