thecodepathshala - Learn to Code and Code to Learn

88. Merge Sorted Array (Easy)

April 15, 2024April 15, 2024 thecodepathshala No Comments

https://leetcode.com/problems/merge-sorted-array/?envType=study-plan-v2&envId=top-interview-150 You are given two integer arrays nums1 and nums2, sorted in non-decreasing order, and two integers m and n, representing the number of elements in nums1 and nums2 respectively. Merge nums1 and nums2 into a single array sorted in non-decreasing order. The final sorted array should not be returned by the function, but instead be stored inside the array nums1. To accommodate this, nums1 has a length of m + n, where the first m elements denote…

Competitive Programming, DS & Algo, Leetcode Problems

Low Level Design Interview (All Topics in Details)

March 23, 2024March 23, 2024 thecodepathshala No Comments

Cornerstones of Object-oriented Programming Background of Object-oriented Programming (OOP) Encapsulation Abstraction Inheritance Polymorphism Object-oriented Design Introduction to Object-oriented Analysis and Design (OOAD) Introduction to the Unified Modeling Language Types of UML Diagrams Use Case Diagram Class Diagram Sequence Diagram Activity Diagram Object-oriented Design Principles Introduction to SOLID Design Principles SOLID: Single Responsibility Principle SOLID: Open…

LLD, Low-level design, System Design

Low-level design interview preparation

March 23, 2024March 23, 2024 thecodepathshala No Comments

Preparing for a low-level design interview involves understanding various concepts related to designing software systems at a detailed level. Here’s a comprehensive list of topics you should cover: Object-Oriented Design Principles: SOLID principles (Single Responsibility, Open/Closed, Liskov Substitution, Interface Segregation, Dependency Inversion) DRY (Don’t Repeat Yourself) principle KISS (Keep It Simple, Stupid) principle YAGNI (You…

System Design

GFG : Maximum MEX from all subarrays of length K

March 12, 2024March 12, 2024 thecodepathshala No Comments

Given an array arr[] consisting of N distinct integers and an integer K, the task is to find the maximum MEX from all subarray of length K. The MEX is the smallest positive integer that is not present in the array. Solution :

Algo, Competitive Programming, DS & Algo, fixed size sliding window, GFG, Interview Questions, sliding window

GFG : Max Sum Subarray of size K

March 8, 2024March 8, 2024 thecodepathshala No Comments

Problem: Given an array of integers Arr of size N and a number K. Return the maximum sum of a subarray of size K. NOTE*: A subarray is a contiguous part of any given array. Solution:

Algo, Competitive Programming, DS & Algo, fixed size sliding window, GFG, sliding window

GFG : First negative integer in every window of size k

March 6, 2024March 6, 2024 thecodepathshala No Comments

Problem Given an array A[] of size N and a positive integer K, find the first negative integer for each and every window(contiguous subarray) of size K. Solution-1 Solution-2

Algo, Competitive Programming, DS & Algo, fixed size sliding window, GFG, sliding window

GFG : Count distinct elements in every window

March 6, 2024March 6, 2024 thecodepathshala No Comments

Problem : Given an array of integers and a number K. Find the count of distinct elements in every window of size K in the array. Solution:

Algo, Competitive Programming, DS & Algo, GFG, Leetcode Problems

GFG : IPL 2021 – Match Day 2

March 6, 2024March 6, 2024 thecodepathshala No Comments

Problem : Due to the rise of covid-19 cases in India, this year BCCI decided to organize knock-out matches in IPL rather than a league. Today is matchday 2 and it is between the most loved team Chennai Super Kings and the most underrated team – Punjab Kings. Stephen Fleming, the head coach of CSK, analyzing the…

Algo, Competitive Programming, DS & Algo, GFG

121. Best Time to Buy and Sell Stock.

March 6, 2024March 6, 2024 thecodepathshala No Comments

Problem : You are given an array prices where prices[i] is the price of a given stock on the ith day. You want to maximize your profit by choosing a single day to buy one stock and choosing a different day in the future to sell that stock. Return the maximum profit you can achieve from this transaction. If you cannot achieve any profit, return 0. Solution…

Algo, Competitive Programming, DS, DS & Algo, GFG, Leetcode Problems

LeetCode : 2461. Maximum Sum of Distinct Subarrays With Length K

March 6, 2024March 6, 2024 thecodepathshala No Comments

Problem: You are given an integer array nums and an integer k. Find the maximum subarray sum of all the subarrays of nums that meet the following conditions: The length of the subarray is k, andAll the elements of the subarray are distinct.Return the maximum subarray sum of all the subarrays that meet the conditions….

Algo, Competitive Programming, DS, DS & Algo, GFG, Leetcode Problems