codingkaro logo
Home
Contests
Quizzes
Write Blog
For Developers
Offers
Home
Contests
Jobs & Internships
Browse latest opportunities
LeetCode Compensation
Salary insights & data
Interview Experiences
Real interview stories
Free Interview Prep
AI-powered mock interviews
Quizzes
Write Blog
For Developers
Offers

Latest Posts in Coding

CreateBlog Picture

#include bits/stdc++.h not working in VS Code Mac | include <bits/stdc++.h> with Visual Studio does not compile

Raunit Verma- inCoding

How to Fix <bits/stdc++.h> File not Found in MacOS? File Not Found Error while including bits/stdc++.h | How to include bits/stdc++.h header file on macOS

CreateBlog Picture

Quadeye Online Assessment Questions 2025 | Quadeye OA 2025 | Good Subsequences | Shader Loader | Substring Removal

Raunit Verma- inCoding

Quadeye Latest Online Assessment Questions 2025 | Quadeye OA 2025 Python Developer | Insights into Quadeye OA 2025 for Aspiring Python Developers

CreateBlog Picture

Number Patterns & Finding the Possible Smallest Numeric Value | Solution | C++

Raunit Verma- inCoding

Given a Pattern containing only Ns and M’s. N represents ascending and M represents descending, Each character (M or N) needs to display sequence of numbers(2 numbers) explaining the ascending or descending order (for ex: 21 -> represents descending -> M). The second character in the pattern takes the last digit from first character and builds the sequence and so on.

CreateBlog Picture

Poisonous Plants | Solution | Explanation | C++

Raunit Verma- inCoding

There are a number of plants in a garden. Each of the plants has been treated with some amount of pesticide. After each day, if any plant has more pesticide than the plant on its left, being weaker than the left one, it dies. You are given the initial values of the pesticide in each of the plants. Determine the number of days after which no plant dies, i.e. the time after which there is no plant with more pesticide content than the plant to its left.

CreateBlog Picture

Number of subsequences in a string divisible by N | Interview Question | Find count of subsequences which are divisible by 4.

Raunit Verma- inCoding

Given a large number as string (size upto 10^5). Find count of subsequences which are divisible by 4 ( asked in salesforce ). Find count of subsequences which are divisible by N.

CreateBlog Picture

Number Checker | Solution | C++

Raunit Verma- inCoding

Given an integer array as input, find out the integers which contain the digits 1, 2, and 3 in their formation

    Product

  • Get Link

  • CodingKaro

  • MDM Calculator

    Company

  • Contact Us

  • Careers

    Resource

  • Blogs

© 2025 Shypt Solution. All Rights Reserved.