How to organize your resume — On average, recruiters spend about 7.5 seconds scanning your resume. This means you must ensure the most relevant information is at the top. It is important to remember that a recruiter is looking for reasons not to hire you instead of reasons to hire you. …

Transforming a 2D vector to a 1D one — Problem statement Given a 2D grid of size m x n and an integer k. You need to shift the grid k times. In one shift operation: Element at grid[i][j] moves to grid[i][j + 1]. Element at grid[i][n - 1] moves to grid[i + 1][0]. Element at grid[m - 1][n - 1]…

5 Reasons Why You Should Invest In Having A Best Resume — If you are a foreigner in Denmark, you must always be available for a career change. Especially with those who are working as software developers like me in Copenhagen, changing jobs happens every 3–4 years. A resume is the first thing you need to apply for a job, and having…

An example of applying binary search — Problem statement You are given a sorted array consisting of only integers where every element appears exactly twice, except for one element which appears exactly once. Return the single element that appears only once. Your solution must run in O(log n) time and O(1) space. Example 1 Input: nums = [1,1,2,3,3,4,4,8,8] Output: 2 Example 2 Input…

Another way of sorting special arrays — Problem statement Given an integer array nums, you need to find one continuous subarray that if you only sort this subarray in ascending order, then the whole array will be sorted in ascending order. Return the shortest such subarray and output its length. Example 1 Input: nums = [2,6,4,8,10,9,15] Output: 5 Explanation: You need to sort…

An example of using a std::vector as a std::stack — Problem statement You are given a string s and an integer k, a k duplicate removal consists of choosing k adjacent and the same letters from s and removing them, causing the left and the right side of the deleted substring to concatenate together. We repeatedly make k duplicate removals on s…

An example of a recursive algorithm — Problem statement Given a string containing digits from 2-9 inclusive, return all possible letter combinations that the number could represent. Return the answer in any order. A mapping of digits to letters (just like on the telephone buttons) is given below. Note that 1 does not map to any letters.

An example of a string in C++ — Problem statement We define the usage of capitals in a word to be right when one of the following cases holds: All letters in this word are capitals, like "USA". All letters in this word are not capitals, like "leetcode". Only the first letter in this word is capitalized, like "Google". Given…

How to identify if an integer is a power of three — Problem statement Given an integer n, return true if it is a power of three. Otherwise, return false. An integer n is a power of three, if there exists an integer x such that n == 3^x. Example 1 Input: n = 27 Output: true Explanation: 27 = 3^3. Example 2 Input: n = 0 Output: false Explanation…