ProDeveloperTutorial.com
  • DSA
    • Algorithms and Data Structures Tutorial
    • Crack The Coding Interview (DSA Sheet)
    • ProDeveloperTutorial – Selected Competitive Programming Questions for Interview
    • System Design Tutorial
  • Coding Languages
    • C++ Tutorial
    • C language Tutorial
    • Linux Shell Scripting Tutorial
    • GIT Tutorial
    • Linux System Calls Tutorials
  • Protocols
    • 4G
    • 5G

ProDeveloperTutorial.com

  • DSA
    • Algorithms and Data Structures Tutorial
    • Crack The Coding Interview (DSA Sheet)
    • ProDeveloperTutorial – Selected Competitive Programming Questions for Interview
    • System Design Tutorial
  • Coding Languages
    • C++ Tutorial
    • C language Tutorial
    • Linux Shell Scripting Tutorial
    • GIT Tutorial
    • Linux System Calls Tutorials
  • Protocols
    • 4G
    • 5G
ProDeveloperTutorial.com

What are You Looking For?

  • Coding Interview Questions
  • C++ Tutorial
  • 5G NR
  • DataStructure and Algorithms
ProDeveloperTutorial
onAugust 26, 2026

Recursion: Given two numbers, add them recursively

Problem Statement: You are given 2 numbers. You need to perform bitwise recursive addition of the 2 integers. Example: Input: a = 20 b = 30…
Discover More
ProDeveloperTutorial
onAugust 26, 2026

Recursion: Reverse the queue using recursion

Problem Statement: Reverse the queue using recursion Example: Input: queue = [1, 2, 3, 4] Output: res = [4, 3, 2, 1] Solution Explanation:…
Discover More
ProDeveloperTutorial
onAugust 26, 2026

Recursion: Convert a given decimal number into binary using recursion

Problem Statement: You are given a decimal number, you need to convert into binary number using recursion. Example: Input: 15 Output: 1111…
Discover More
ProDeveloperTutorial
onAugust 26, 2026

Matrix: Given a matrix, set it to zero

Problem Statement: You are given a matrix. You need to set the entire row and column as zero if an element is zero. Example: Input: [[2, -5,…
Discover More
ProDeveloperTutorial
onAugust 26, 2026

Matrix: Given a 2D matrix, find the peak element.

Problem Statement: You are given a 2D matrix of size n * m, you need to find the peak element. An element is a peak element if it is greater…
Discover More
ProDeveloperTutorial
onAugust 26, 2026

Matrix: Given a matrix, count zero in row wise and column wise matrix

Problem Statement: You are given a 2D matrix of size n * n where all the elements are 0 or 1. They are sorted in ascending order. You need to…
Discover More
ProDeveloperTutorial
onAugust 26, 2026

Matrix: Given a matrix, you need to count the number of rows and columns whose sum equal to diagonal sum

Problem Statement: Given a 2D matrix of size n*n. You need to count the number of rows and columns whose sum equal to diagonal sum Example:…
Discover More
ProDeveloperTutorial
onAugust 26, 2026

Matrix: Given a binary matrix, find the rows with max 1s

Problem Statement: Given a matrix, you need to find the row with maximum 1s. Each rows are sorted Example: Input: 0 0 0 1 1 1 1 1 0 0 0 0 0 0…
Discover More
ProDeveloperTutorial
onAugust 26, 2026

Matrix: Given a matrix, find the saddle point

Problem Statement: You are given a matrix. You need to find saddle point. A saddle point is an element in the matrix, is an element such that,…
Discover More
ProDeveloperTutorial
onAugust 26, 2026

Matrix: Given a matrix, count the majority element

Problem Statement: You are given a 2D (m * n) matrix. You need to find the majority element. A majority element is a number whose count is…
Discover More

Posts pagination

Previous 1 … 40 41 42 … 129 Next
ProDeveloperTutorial.com
Tutorials and Programming Solutions
  • DSA
    • Algorithms and Data Structures Tutorial
    • Crack The Coding Interview (DSA Sheet)
    • ProDeveloperTutorial – Selected Competitive Programming Questions for Interview
    • System Design Tutorial
  • Coding Languages
    • C++ Tutorial
    • C language Tutorial
    • Linux Shell Scripting Tutorial
    • GIT Tutorial
    • Linux System Calls Tutorials
  • Protocols
    • 4G
    • 5G
© 2024 — ProDeveloperTutorial. All Rights Reserved.