Find the Binary Subsequence Less Than or Equal to k.cpp #211

Dipanita45 · 2025-06-26T05:39:24Z

No description provided.

Create Combination Sum.cpp

Create Count of Good Subarrays.java

Create Count Largest Group.java

Create Count of interested subarrays.java

Create Count of Subarray with Score less than k

Create .java

Update

Merge pull request #7 from Dipanita45/master

Create.java

Domino

…ay.java

Create Maximum Difference between adjacent elements in a Circular Arr…

Create Minimize the Maximum Difference of Pairs.java

Create Maximum Difference By Remapping a Digit.java

Create Max Difference You Can Get From Changing An Integer.cpp

Time Complexity : O(N) Space Complexity: O(100001)

TC: O(N) SC: O(N)

Create Partition Array Such That Maximum Difference is K.java

/** Time Complexity (TC): O(n), where n is the length of the input string. We go through the string once to skip spaces and read digits. Space Complexity (SC): O(1) No extra space is used apart from a few variables (sign, base, i). */

Time Complexity : O(N)

Time Complexity : O(N) Space Complexity: O(N)

Create Sum of k-Mirror Numbers.java

TC:O(N)

Time Complexity: O(N^2)

Dipanita45 added 30 commits April 14, 2025 12:03

Add maximum value of Ordered Triplets

d5ab1dd

U

797743f

Change

3cabcce

Combination_Sum

0390b5e

Create Combination Sum.cpp

Create Count of Good Subarrays.java

3c135ec

Merge pull request #2 from Dipanita45/Be

56f1e4a

Create Count of Good Subarrays.java

Add Create Equal and Divisible in an Array

1aa98be

Update

016f15c

u

5e4c852

Update

c9f3135

Change

a3f2228

Merge pull request #4 from Dipanita45/bas

ccb4566

Create Count Largest Group.java

Update

3fbaf29

Merge branch 'master' into bashh

3d6dfae

Merge pull request #5 from Dipanita45/bashh

3545219

Create Count of interested subarrays.java

Merge pull request #6 from Dipanita45/master

2856057

Create Count of Subarray with Score less than k

Merge pull request #7 from Dipanita45/master

d35b06f

Create .java

Merge pull request #8 from Dipanita45/dev

bdd87ff

Update

Merge pull request #9 from Dipanita45/bashd

f3a1508

Merge pull request #7 from Dipanita45/master

Merge branch 'kamyu104:master' into master

95e18d7

Create Count of Subarray with Score less than k.java

44dc2ab

Create.java

Domino

957c010

Merge branch 'master' into batchh

d587bff

Domino and Tromino Tiling .java

790b420

Domino

Create

c049719

Create Build Array from Permutation.java

dd4c0e8

Changes

577aa59

Create Find Minimum time to reach the last room I.java

48ff6a2

Create

df698de

Create Minimum Time to reach the last room II.java

c71b464

Dipanita45 added 30 commits June 12, 2025 08:22

Create Maximum Difference between adjacent elements in a Circular Arr…

73555fd

…ay.java

Merge pull request #50 from Dipanita45/Dipanita45-patch-22

df39c69

Create Maximum Difference between adjacent elements in a Circular Arr…

Create Minimize the Maximum Difference of Pairs.java

40a01be

Merge pull request #51 from Dipanita45/Dipanita45-patch-23

dc38113

Create Minimize the Maximum Difference of Pairs.java

Create Maximum Difference By Remapping a Digit.java

6be2239

Merge pull request #52 from Dipanita45/Dipanita45-patch-24

bb1ab49

Create Maximum Difference By Remapping a Digit.java

Create Max Difference You Can Get From Changing An Integer.cpp

502be16

Merge pull request #53 from Dipanita45/Dipanita45-patch-25

f768e3e

Create Max Difference You Can Get From Changing An Integer.cpp

Create Count the number of Arrays with K Matching Adjacent Elements.java

dd7ecf4

Merge pull request #54 from Dipanita45/Dipanita45-patch-26

c7c27e5

Time Complexity : O(N) Space Complexity: O(100001)

Create Divide Array Into Arrays With Max Difference.cpp

8f481bf

Create Divide Array Into Arrays With Max Difference.cpp

0ab4fcc

TC: O(N) SC: O(N)

Create Partition Array Such That Maximum Difference is K.java

c5b75b7

Merge pull request #56 from Dipanita45/Dipanita45-patch-28

a314bef

Create Partition Array Such That Maximum Difference is K.java

Create String to Integer(atoi).java

4d664d1

Create Remove Nth Node From End of the List.java

bdfca86

Create Remove Nth Node From End of the List.java

358d022

Time Complexity : O(N)

Create Divide a String into Groups of size K.java

2d6ed59

Create Divide a String into Groups of size k.java

7f69be6

Time Complexity : O(N) Space Complexity: O(N)

Create Sum of k-Mirror Numbers.java

981cb04

Merge pull request #60 from Dipanita45/Dipanita45-patch-32

6f1912e

Create Sum of k-Mirror Numbers.java

Create Find All K-Distant Indices in an Array.cpp

b4b55b8

Create Find All K-Distant Indices in an Array.cpp

c57c9cc

TC:O(N)

Create Find All K-Distant Indices in an Array.java

3470de5

Create Find All K-Distant Indices in an Array.java

8d4c119

Time Complexity: O(N^2)

Create Integer To Roman.java

49f03e5

Create Integer To Roman.java

e922939

Create Longest Binary Subsequence Less Than or Equal to k.cpp

750acb4

Create Find Longest Binary Subsequence Less Than or Equal to k.cpp

09923e3

Provide feedback

Saved searches

Use saved searches to filter your results more quickly

Uh oh!

Find the Binary Subsequence Less Than or Equal to k.cpp #211

Find the Binary Subsequence Less Than or Equal to k.cpp #211

Uh oh!

Dipanita45 commented Jun 26, 2025

Uh oh!

Uh oh!

Find the Binary Subsequence Less Than or Equal to k.cpp #211

Are you sure you want to change the base?

Find the Binary Subsequence Less Than or Equal to k.cpp #211

Uh oh!

Conversation

Dipanita45 commented Jun 26, 2025

Uh oh!

Uh oh!