Small town Software Engineer #100Devs | IT Support 👨💻 | Want to connect with people in #Tech | Certified silly goose | Beekeeping age | Anime enthusiast 💥 | music maker 🎹 | Proud Cat Dad 🐈 https://linktr.ee/webdevcory https://github.com/ForLoopNelson
![python code for moving zeroes to back of an array while keeping order of other numbers intact. code is as follows:
def moveZeroes(nums):
index = 0
for num in nums:
if num != 0:
nums[index] = num
index += 1
for i in range(index, len(nums)):
nums[i] = 0
print(nums)
moveZeroes([0,1,0,5,13]) #Output: [1,5,13,0,0]
# Photo by Tim Oun on Unsplash](https://cdn.bsky.app/img/feed_thumbnail/plain/did:plc:elwt26habreytri5wmg2tgir/bafkreie55ddobbtqbj4kwuvixgjbbzmx6mz7w7qf6tvuvfpvmzongchz2y)
![Javascript code is as follows:
if (name1 === name2) {
if(killers.includes(name1)){
matchedKillers[name1]++;
}
const totalKillerPairs = Object.values(matchedKillers).filter(count => count >= 2).length
if (totalKillerPairs == 2) {
setTimeout(() => {
alert(`You got caught!`);
resetGame();
}, 500);
}](https://cdn.bsky.app/img/feed_thumbnail/plain/did:plc:elwt26habreytri5wmg2tgir/bafkreihjyc6tdimek5ornqukudzanwphafpchrpnlawt4egz2hzy6p47ga)
![JavaScript code with comments. Text is as follows:
/*A fine answer but doesn't adhere to leetcode's rules */
const merge = function(nums1, m, nums2, n) {
let arr1 = nums1.splice(0,m)
let arr2 = nums2.splice(0,n)
return arr1.concat(arr2).toSorted()
};
/*You are given two integer arrays nums1 and nums2, sorted in non-decreasing order, and two integers m and n, representing the number of elements in nums1 and nums2 respectively.
Merge nums1 and nums2 into a single array sorted in non-decreasing order.
The final sorted array should not be returned by the function, but instead be stored inside the array nums1. To accommodate this, nums1 has a length of m + n, where the first m elements denote the elements that should be merged, and the last n elements are set to 0 and should be ignored. nums2 has a length of n. */
const mergeLeet = function(nums1, m, nums2, n) {
let i = m - 1;
let j = n - 1;
let k = m + n - 1;
while (j >= 0) {
if (i >= 0 && nums1[i] > nums2[j]) {
nums1[k--] = nums1[i--];
} else {
nums1[k--] = nums2[j--];
}
}
};
console.log(merge([1,2,3,0,0,0],3,[2,5,6],3)) //[1,2,2,3,5,6]
console.log(mergeLeet([1,2,3,0,0,0],3,[2,5,6],3)) //[1,2,2,3,5,6]
// Photo by Guillaume de Germain on Unsplash](https://cdn.bsky.app/img/feed_thumbnail/plain/did:plc:elwt26habreytri5wmg2tgir/bafkreihab3p3uh43gcklk4n7uprzvmoqv54kulcw3xz7uvtsydmudkqaj4)
![code to check if user exists and create new user profile if not. code reads as follows :
exports.postSignup = async (req, res, next) => {
try {
const existingUser = await User.findOne({
$or: [{ email: req.body.email }, { userName: req.body.userName }],
});
if (existingUser) {
req.flash("errors", {
msg: "Account with that email address or username already exists.",
});
return res.redirect("../signup");
}
await user.save();
req.logIn(user, (err) => {
if (err) {
return next(err);
}
res.redirect("/profile");
});
} catch (err) {
return next(err);
}
};](https://cdn.bsky.app/img/feed_thumbnail/plain/did:plc:elwt26habreytri5wmg2tgir/bafkreigagpcju3mbwaj5mxdujjcvxvdsdlac3wfnozxbdpkqae5bgsc63e)
