Competitive Programming

Another angle to look at Rust is to see it through the lenses of a competitive programmer. Those ninjas 🥷 enjoy quick brain work and the language skill that allows them to crush problems fast. …

Question: Link: https://leetcode.com/problems/design-parking-system/ Design a parking system for a parking lot. The parking lot has three kinds of parking spaces: big, medium, and small, with a fixed number of slots for each size. Implement the ParkingSystem class: ParkingSystem(int big, int medium, int small) Initializes object of the ParkingSystem class. …

Question: Link: https://leetcode.com/problems/stone-game-iii/ Alice and Bob continue their games with piles of stones. There are several stones arranged in a row, and each stone has an associated value which is an integer given in the array stoneValue. Alice and Bob take turns, with Alice starting first. On each player’s turn, that…

Question: Link: https://leetcode.com/problems/palindrome-number/ Given an integer x, return true if x is a palindrome , and false otherwise. Example 1: Input: x = 121 Output: true Explanation: 121 reads as 121 from left to right and from right to left. Example 2: Input: x = -121 Output: false Explanation: From left to right…

Question: Link: https://leetcode.com/problems/new-21-game/ Alice plays the following game, loosely based on the card game “21”. Alice starts with 0 points and draws numbers while she has less than k points. During each draw, she gains an integer number of points randomly from the range [1, maxPts], where maxPts is an integer…

It is a medium-level string problem asked in Microsoft. Its solution is pretty simple. I am going to write the code in Java language. Here is the complete solution to the problem. We consecutively check for (i, i) as well as (i, i+1). For example, for string “aaa”, we check…

Question: Link: https://leetcode.com/problems/maximum-subsequence-score/description/ You are given two 0-indexed integer arrays nums1 and nums2 of equal length n and a positive integer k. You must choose a subsequence of indices from nums1 of length k. For chosen indices i0, i1, ..., ik - 1, your score is defined as: The sum of…

Question: Link: https://leetcode.com/problems/kth-largest-element-in-a-stream/ Design a class to find the kth largest element in a stream. Note that it is the kth largest element in the sorted order, not the kth distinct element. Implement KthLargest class: KthLargest(int k, int[] nums) Initializes the object with the integer k and the stream of integers…

Introduction : What are vectors ? C++ vectors (also known as std::vector) are sequence containers that represent arrays that can change in size. They’re used to work with dynamic data, and they use contiguous storage locations for their elements and can be accessed and traversed using iterators. Vectors provide more flexibility to…