@chetan77

Fractional Knapsack

2d ago · 2 min read · Problem Given two arrays, val[] and wt[] , representing the values and weights of items, and an integer capacity representing the maximum weight a knapsack can hold, determine the maximum total value

Maximum XOR With an Element From Array

Jan 17 · 3 min read · Problem You are given an array nums consisting of non-negative integers. You are also given a queries array, where queries[i] = [xi, mi]. (link) The answer to the ith query is the maximum bitwise XOR value of xi<...

Maximum XOR of Two Numbers in an Array

Jan 15 · 2 min read · Problem Given an integer array nums, return the maximum result of nums[i] XOR nums[j], where 0 <= i <= j < n. (link) Example 1: Input: nums = [3,10,5,25,2,8] Output: 28 Explanation: The maximum result is 5 XOR 25 = 28. Example 2: Input: nums = [14,7...

Count of distinct substrings

Jan 15 · 2 min read · Problem Given a string s consisting of lowercase English characters, determine the total number of distinct non-empty substrings present in the string. A substring is defined as a contiguous block of characters within the string. Two substrings are c...

Longest Valid Word with All Prefixes

Jan 15 · 2 min read · Problem Given an array of strings words[], find the longest string such that every prefix of it is also present in words[]. If multiple strings have the same maximum length, return the lexicographically smallest one. (link) If no such string is found...