Word Search

gfg-potd

You are given a two-dimensional mat[][] of size n*m containing English alphabets and a string word. Check if the word exists on the mat. The word

Implement Pow

gfg-potd

Implement the function power(b, e), which calculates b raised to the power of e (i.e. be). Examples: Input: b = 3.00000, e = 5Output: 243.00000

Permutations of a String

gfg-potd

Given a string s, which may contain duplicate characters, your task is to generate and return an array of all unique permutations of

LRU Cache

gfg-potd

Design a data structure that works like a LRU Cache. Here cap denotes the capacity of the cache and Q denotes the number of queries.

1462. Course Schedule IV

leetcode-potd

There are a total of numCourses courses you have to take, labeled from 0 to numCourses – 1. You are given an array prerequisites where prerequisites[i] = [ai,

Scroll to Top