Open in app

Sign In

Write

Sign In

Jaydeep
Jaydeep

75 Followers

Home

About

Feb 8

Find the Smallest Divisor Given a Threshold

Given an array of integers nums and an integer threshold, we will choose a positive integer divisor, divide all the array by it, and sum the division's result. Find the smallest divisor such that the result mentioned above is less than or equal to threshold. Each result of the division…

Algorithms

6 min read

Find the Smallest Divisor Given a Threshold
Find the Smallest Divisor Given a Threshold
Algorithms

6 min read


Feb 6

Find All Anagrams in a String

Given two strings s and p, return an array of all the start indices of p's anagrams in s. You may return the answer in any order. An Anagram is a word or phrase formed by rearranging the letters of a different word or phrase, typically using all the original…

Algorithms

6 min read

Find All Anagrams in a String
Find All Anagrams in a String
Algorithms

6 min read


Jan 28

Bus Routes

You are given an array routes representing bus routes where routes[i] is a bus route that the ith bus repeats forever. For example, if routes[0] = [1, 5, 7], this means that the 0th bus travels in the sequence 1 -> 5 -> 7 -> 1 -> 5 -> 7…

Algorithms

3 min read

Bus Routes
Bus Routes
Algorithms

3 min read


Jan 27

Concatenated Words

Given an array of strings words (without duplicates), return all the concatenated words in the given list of words. A concatenated word is defined as a string that is comprised entirely of at least two shorter words in the given array. Example 1: Input: words = ["cat","cats","catsdogcats","dog","dogcatsdog","hippopotamuses","rat","ratcatdogcat"] Output: ["catsdogcats","dogcatsdog","ratcatdogcat"] Explanation: "catsdogcats" can…

Algorithms

2 min read

Concatenated Words
Concatenated Words
Algorithms

2 min read


Jan 25

Find Closest Node to Given Two Nodes

You are given a directed graph of n nodes numbered from 0 to n - 1, where each node has at most one outgoing edge. The graph is represented with a given 0-indexed array edges of size n, indicating that there is a directed edge from node i to node…

Algorithms

3 min read

Find Closest Node to Given Two Nodes
Find Closest Node to Given Two Nodes
Algorithms

3 min read


Nov 30, 2022

Best Time to Buy and Sell Stock with Transaction Fee

You are given an array prices where prices[i] is the price of a given stock on the ith day, and an integer fee representing a transaction fee. Find the maximum profit you can achieve. …

Algorithms

3 min read

Best Time to Buy and Sell Stock with Transaction Fee
Best Time to Buy and Sell Stock with Transaction Fee
Algorithms

3 min read


Nov 6, 2022

Maximum Area of a Piece of Cake After Horizontal and Vertical Cuts

You are given a rectangular cake of size h x w and two arrays of integers horizontalCuts and verticalCuts where: horizontalCuts[i] is the distance from the top of the rectangular cake to the ith horizontal cut and similarly, and verticalCuts[j] is the distance from the left of the rectangular cake…

Algorithms

2 min read

Maximum Area of a Piece of Cake After Horizontal and Vertical Cuts
Maximum Area of a Piece of Cake After Horizontal and Vertical Cuts
Algorithms

2 min read


Nov 6, 2022

Maximum Points You Can Obtain from Cards

There are several cards arranged in a row, and each card has an associated number of points. The points are given in the integer array cardPoints. In one step, you can take one card from the beginning or from the end of the row. …

Algorithms

2 min read

Maximum Points You Can Obtain from Cards
Maximum Points You Can Obtain from Cards
Algorithms

2 min read


Sep 8, 2022

Furthest Building You Can Reach

You are given an integer array heights representing the heights of buildings, some bricks, and some ladders. You start your journey from building 0 and move to the next building by possibly using bricks or ladders. While moving from building i to building i+1 (0-indexed), If the current building’s height…

Algorithms

3 min read

Furthest Building You Can Reach
Furthest Building You Can Reach
Algorithms

3 min read


Apr 28, 2022

Path With Minimum Effort

You are a hiker preparing for an upcoming hike. You are given heights, a 2D array of size rows x columns, where heights[row][col] represents the height of cell (row, col). You are situated in the top-left cell, (0, 0), and you hope to travel to the bottom-right cell, (rows-1, columns-1)…

Algorithms

4 min read

Path With Minimum Effort
Path With Minimum Effort
Algorithms

4 min read

Jaydeep

Jaydeep

75 Followers

Full Stack Programmer, love to solve problem’s during free time.

Following
  • The woman

    The woman

  • JIN

    JIN

  • Yudhajit Adhikary

    Yudhajit Adhikary

  • John Au-Yeung

    John Au-Yeung

  • Akhauri Shaurya

    Akhauri Shaurya

See all (70)

Help

Status

Writers

Blog

Careers

Privacy

Terms

About

Text to speech

Teams