Subrat Yeeshu

Results 3 issues of Subrat Yeeshu

Given an integer array nums, return all the triplets [nums[i], nums[j], nums[k]] such that i != j, i != k, and j != k, and nums[i] + nums[j] + nums[k]...

good first issue
hacktoberfest
hacktoberfest-accepted

Please assign this issue to me under Hacktoberfest2022 @anomekumar08

good first issue
hacktoberfest
hacktoberfest-accepted

Please assign it to me under hacktoberfest2022 tag

invalid