C Programming Codes

🚨 🚨 🚨 Free Course 🚨 🚨 🚨 🇺🇸 Figma Essential for User Interface and User Experience UI UX 🌎 Language : English 👤 Publisher : Learnify IT ⭐ Rate : 4.7 / 4 👥 Enroll : 2,104 💵 Price : $79 -> $0 https://www.discudemy.com/figma-essential-for-user-interface-and-user-experience-ui-ux

🚀 Build skills. Boost your career. For FREE. Only trusted content. Join 👇 https://t.me/skills_stream_free_courses

Unlock a world of free educational content, expert-led courses, and skill-building resources — all designed to empower you, grow your knowledge, and help you get certified with confidence. 💡 Tip for Success: Focus on one course at a time. Learn deeply, complete it fully, and apply what you learn. Mastery comes step by step! ⭐ Join & begin your journey today! https://t.me/skills_stream_free_courses

Leetcode 283: https://leetcode.com/problems/move-zeroes/

class Solution {
public:
    void moveZeroes(vector<int>& nums) {
        if (nums.size() < 2) {
            return;
        }
        
        int leftIdx = 0, rightIdx = 1;
        
        while (rightIdx < nums.size()) {
            if (nums[leftIdx] != 0) {
                leftIdx++;
                rightIdx++;
            } 
            else if (nums[rightIdx] == 0) {
                rightIdx++;
            } 
            else {
                swap(nums[leftIdx], nums[rightIdx]);
            }
        }
    }
};

Leetcode 66: https://leetcode.com/problems/plus-one/

class Solution {
public:
    std::vector<int> plusOne(std::vector<int>& digits) {
        int currentIndex = digits.size() - 1;
        
        while (digits[currentIndex] == 9) {
            if (currentIndex == 0) {
                std::vector<int> resultArr(digits.size() + 1, 0);
                resultArr[0] = 1;
                return resultArr;
            }
            digits[currentIndex] = 0;
            currentIndex--;
        }

        digits[currentIndex]++;
        return digits;
    }
};

Leetcode 350: https://leetcode.com/problems/intersection-of-two-arrays-ii/

class Solution {
public:
    std::vector<int> intersect(std::vector<int>& nums1, std::vector<int>& nums2) {
        std::unordered_map<int, int> numsMap;
        std::vector<int> intersectedNums;

        for (int num : nums1) {
            numsMap[num]++;
        }

        for (int num : nums2) {
            if (numsMap.find(num) != numsMap.end() && numsMap[num] > 0) {
                intersectedNums.push_back(num);
                numsMap[num]--;
                if (numsMap[num] == 0) {
                    numsMap.erase(num);
                }
            }
        }

        return intersectedNums;
    }
};

Leetcode 136: https://leetcode.com/problems/single-number/

class Solution {
public:
    int singleNumber(vector<int>& nums) {
        int finder = 0;
        for(int i = 0; i < nums.size(); i++) {
            finder = finder ^ nums[i];
        }
        return finder;
    }
};

Leetcode 217: https://leetcode.com/problems/contains-duplicate/description/

#include <vector>
#include <algorithm>

class Solution {
public:
    bool containsDuplicate(std::vector<int>& nums) {
        std::sort(nums.begin(), nums.end());
        for (size_t i = 0; i < nums.size() - 1; i++) {
            if (nums[i] == nums[i + 1]) {
                return true;
            }
        }
        return false;
    }
};