Published in Level Up Coding·PinnedLeetcode 706. Design HashMap- March LeetCoding Challenge 2021Today, we will solve the 7th problem of the March LeetCoding Challenge. Problem Statement Design a HashMap without using any built-in hash table libraries. To be specific, your design should include these functions: put(key, value) : Insert a (key, value) pair into the HashMap. If the value already exists in the HashMap…Software Development3 min read
Published in Dev Genius·PinnedRetrieve Vaccine Slots in your locality (Python Web-Scrapping)I know it is hard to get a vaccine slot. I have been trying to get a slot for the last two weeks; still have not got it. Therefore I decided to make a python script that will notify me about the vaccination slots. For this, we will use the…Python4 min read
May 3Custom View in AndroidLet’s just make a simple Emoji Face programmatically on Android. In the end of the tutorial, you will learn to make the following view programmatically. Before starting let’s first understand how a view is drawn in Android. Android draws the layout hierarchy in 3 layers: Measuring stage: each view must…Android4 min read
May 4, 2021MayLeetCoding Challenge 2021 — Day 4: Non-decreasing ArrayToday is May the 4th. Happy Star Wars Day everyone. Let’s solve some Leetcode problems today. Today we will solve the 4th problem of the May LeetCoding Challenge 2021. Problem Statement Given an array nums with n integers, your task is to check if it could become non-decreasing by modifying at most one element. We define an array is non-decreasing if nums[i] <= nums[i + 1] holds for every i (0-based) such that (0 <=…Software Development2 min read
May 4, 2021MayLeetCoding Challenge 2021 — Day 3: Minimum Operations to Make Array EqualToday, we will solve the 3rd problem of the May LeetCoding Challenge 2021. Problem Statement Given an array nums. We define a running sum of an array as runningSum[i] = sum(nums[0]…nums[i]). Return the running sum of nums. Example 1: Input: nums = [1,2,3,4] Output: [1,3,6,10] Explanation: Running sum is obtained as follows: [1, 1+2…Software Development1 min read
Published in LeetCode Simplified·Apr 6, 2021April LeetCoding Challenge 2021 — Day 6: Minimum Operations to Make Array EqualToday, we will solve the 6th problem of the April LeetCoding Challenge 2021. Problem Statement You have an array arr of length n where arr[i] = (2 * i) + 1 for all valid values of i (i.e. 0 <= i < n). In one operation, you can select two indices x…Software Development2 min read
Published in Dev Genius·Apr 1, 2021April LeetCoding Challenge 2021 — Day 1: Palindrome Linked ListFrom today, we will start doing the April LeetCoding Challenge. You can check the March LeetCoding Challenge problems on my profile. Problem Statement Given the head of a singly linked list, return true if it is a palindrome. Example 1:Software Development3 min read
Published in Dev Genius·Mar 21, 2021Leetcode 1797. Design Authentication Manager — Biweekly Contest 48Today we will solve the problem named Authentication Manager. Problem Statement There is an authentication system that works with authentication tokens. For each session, the user will receive a new authentication token that will expire timeToLive seconds after the currentTime. …Software3 min read
Published in Dev Genius·Mar 20, 2021March LeetCoding Challenge 2021 — Day 19: Keys and RoomsToday, we will solve the 19th problem of the March LeetCoding Challenge. Problem Statement There are N rooms and you start in room 0. Each room has a distinct number in 0, 1, 2, ..., N-1, and each room may have some keys to access the next room. Formally, each room i…Software Development3 min read
Published in Level Up Coding·Mar 18, 2021March LeetCoding Challenge 2021 — Day 18: Wiggle SubsequenceToday, we will solve the 18th problem of the March LeetCoding Challenge. Problem Statement Given an integer array nums, return the length of the longest wiggle sequence. A wiggle sequence is a sequence where the differences between successive numbers strictly alternate between positive and negative. The first difference (if one exists) may…Software Development3 min read
