Object Oriented Programming

GATE

Data Structures

Data Structures in Python

Power BI

Data Science

Django

Data Structure and Algorithm

Python

Recursion

Arrays

Searching

Sorting

String

Linked List

Data Structures in C

Maths

Strings

C++ Tricks

System Design

Theory of Computation

Computer Organization and Architecture

Operating System

Engineering Mathematics

Database

Digital Logic

Computer Networks

GATE 2022

Java

GeeksforGeeks School

Hashing

Competitive Programming

Problem of the Day

School

HTML

Javascript

Bootstrap

Web Development

Android

Microsoft Office

Machine Learning

Resume Builder

Miscellaneous

Gblog

TechTips

React

Advanced JavaScript

DSA Self Paced

CS-subjects

Data Structures and Algorithms

Operating Systems

C Language

DBMS

Basics of CPP

Data Structures ( Basics )

Object Oriented Design

Dynamic Programming

Data Interpretation and Logical Reasoning

Algorithms

Core Java

RESTful APIs

Spring Basics

CPP-Tricks

Basics of Java

Aptitude

GATE YT

Flutter

Application Development

Blockchain

GFG SDE Sheet

SDE Sheet

Deep Learning

Go Programming

Placement

C++ Programs

Data Visualisation

DevOps

Docker

Queue

Matrix

Trie

Stack

Graph

Tree

Magic Numbers

Divide and Conquer

React Native

React JS

Interview-Questions

Advanced Java

cloud-computing

income tax

Artificial Intelligence

Programming Languages

Computer Graphics

Cyber Security

Project Management

DSA / Placements

GATE Prep

Data Analytics / Data Science

Development

Cloud / DevOps

All Courses

Courses

ML & Data Science

Interview Corner

CS Subjects

School Learning

Software and Tools

Tutorials

Google Build with AI

Practice Coding Problems

Connect 1:1 with Experts

Practice

Apply Now!

Post Jobs

Jobs Updates

Jobs

Given an array of integers, find all combination of four elements in the array whose sum is equal to a given value X.&nbsp; For example, if the given array is {10, 2, 3, 4, 5, 9, 7, 8} and X = 23, then your function should print “3 5 7 8” (3 + 5 + 7 + 8 = 23). A Naive Solution is to generate all possible quadruples and compare the sum of every quadruple with X. The following code implements this simple method using four nested loops&nbsp; &nbsp;Find four elements that sum to a given value _ Set 1 (n^3 solution): <a href="https://www.geeksforgeeks.org/find-four-numbers-with-sum-equal-to-given-sum/">https://www.geeksforgeeks.org/find-four-numbers-with-sum-equal-to-given-sum/</a>

Find four elements that sum to a given value | Set 1 (n^3 solution)

Given an array of integers, find the first repeating element in it. We need to find the element that occurs more than once and whose index of first occurrence is smallest.Examples:Input: &nbsp;arr[] = {10, 5, 3, 4, 3, 5, 6} Output: 5 [5 is the first element that repeats]Input: &nbsp;arr[] = {6, 10, 5, 4, 9, 120, 4, 6, 10} Output: 6 [6 is the first element that repeats]Find the first repeating element in an array of integers : <a href="https://www.geeksforgeeks.org/find-first-repeating-element-array-integers/">https://www.geeksforgeeks.org/find-first-repeating-element-array-integers/</a>

Find the first repeating element in an array of integers

Welcome to the daily solving of our PROBLEM OF THE DAY with Geetesh Yadav We will discuss the entire problem step-by-step and work towards developing an optimized solution. This will not only help you brush up on your concepts of String but also build up problem-solving skills. Given two strings s1 and s2. Return a minimum number of times s1 has to be repeated such that s2 is a substring of it. If s2 can never be a substring then return -1.Note: Both the strings contain only lowercase letters.Examples:Input: s1 = "ww", s2 = "www"
Output: 2
Explanation: Repeating s1 two times (wwww), s2 is a substring of it. &nbsp;Give the problem a try before going through the video. All the best!!! Problem Link: <a href="https://www.geeksforgeeks.org/problems/minimum-times-a-has-to-be-repeated-such-that-b-is-a-substring-of-it--170645/0">https://www.geeksforgeeks.org/problems/minimum-times-a-has-to-be-repeated-such-that-b-is-a-substring-of-it--170645/0</a>

PROBLEM OF THE DAY : 08/11/2024 | Minimum Repeat to Make Substring

Welcome to the daily solving of our PROBLEM OF THE DAY with Saurabh Bansal We will discuss the entire problem step-by-step and work towards developing an optimized solution. This will not only help you brush up on your concepts of Arrays but also build up problem-solving skills. Given an array height representing the heights of buildings. You have to count the buildings that will see the sunrise (Assume the sun rises on the side of the array starting point). Note: The height of the building should be strictly greater than the height of the buildings left in order to see the sun. &nbsp;Examples :Input: height = [7, 4, 8, 2, 9]
Output: 3
Explanation: As 7 is the first element, it can see the sunrise. 4 can't see the sunrise as 7 is hiding it. 8 can see. 2 can't see the sunrise. 9 also can see the sunrise.Give the problem a try before going through the video. All the best!!! Problem Link: <a href="https://practice.geeksforgeeks.org/problems/facing-the-sun2126/1">https://practice.geeksforgeeks.org/problems/facing-the-sun2126/1</a>

PROBLEM OF THE DAY : 20/09/2024 | Facing the sun

Welcome to the daily solving of our PROBLEM OF THE DAY with Geetesh Yadav We will discuss the entire problem step-by-step and work towards developing an optimized solution. This will not only help you brush up on your concepts of Arrays but also build up problem-solving skills. You are given the heights of consecutive buildings. You can move from the roof of a building to the roof of the next adjacent building. You need to find the maximum number of consecutive steps you can put forward such that you gain an increase in altitude with each step.Examples:Input: arr[] = [1, 2, 2, 3, 2] Output: 1 Explanation: 1, 2, or 2, 3 are the only consecutive buildings with increasing heights thus maximum number of consecutive steps with an increase in gain in altitude would be 1 in both cases.Give the problem a try before going through the video. All the best!!! Problem Link: <a href="https://practice.geeksforgeeks.org/problems/roof-top-1587115621/1">https://practice.geeksforgeeks.org/problems/roof-top-1587115621/1</a>

PROBLEM OF THE DAY : 26/09/2024 | Roof Top

Welcome to the daily solving of our PROBLEM OF THE DAY with Nitin Kaplas We will discuss the entire problem step-by-step and work towards developing an optimized solution. This will not only help you brush up on your concepts of Arrays but also build up problem-solving skills. Given an array arr[] and an integer&nbsp;k where k is smaller than the size of the array, the task is to find the kth smallest element in the given array. It is given that all array elements are distinct.Follow up: Don't solve it using the inbuilt sort function.Examples :Input:arr[] = 7 10 4 3 20 15, k = 3
Output : &nbsp;7
Explanation :3rd smallest element in the given array is 7.Give the problem a try before going through the video. All the best!!! Problem Link: <a href="https://practice.geeksforgeeks.org/problems/kth-smallest-element5635/1">https://practice.geeksforgeeks.org/problems/kth-smallest-element5635/1</a>

PROBLEM OF THE DAY : 19/08/2024 | Kth Smallest

Welcome to the daily solving of our PROBLEM OF THE DAY with Devashish Khare We will discuss the entire problem step-by-step and work towards developing an optimized solution. This will not only help you brush up on your concepts of Searching but also build up problem-solving skills. Given an integer n, find the square root of n. If n is not a perfect square, then return the floor value.Floor value of any number is the greatest Integer which is less than or equal to that numberExamples:Input: n = 5
Output: 2
Explanation: Since, 5 is not a perfect square, floor of square_root of 5 is 2.Give the problem a try before going through the video. All the best!!! Problem Link: <a href="https://practice.geeksforgeeks.org/problems/square-root/1">https://practice.geeksforgeeks.org/problems/square-root/1</a>

PROBLEM OF THE DAY : 13/08/2024 | Square Root of a Number

Given two arrays: arr1[0..m-1] and arr2[0..n-1]. Find whether arr2[] is a subset of arr1[] or not. Both the arrays are not in sorted order. It may be assumed that elements in both array are distinct.Input: arr1[] = {11, 1, 13, 21, 3, 7}, arr2[] = {11, 3, 7, 1}&nbsp; Output: arr2[] is a subset of arr1[]Input: arr1[] = {1, 2, 3, 4, 5, 6}, arr2[] = {1, 2, 4}&nbsp; Output: arr2[] is a subset of arr1[] Find whether an array is subset of another array : <a href="https://www.geeksforgeeks.org/find-whether-an-array-is-subset-of-another-array-set-1/">https://www.geeksforgeeks.org/find-whether-an-array-is-subset-of-another-array-set-1/</a>

Find whether an array is subset of another array

Given an n x n matrix and a number x, find the position of x in the matrix if it is present in it. Otherwise, print “Not Found”. In the given matrix, every row and column is sorted in increasing order. The designed algorithm should have linear time complexity.Example:Input: mat[4][4] = { {10, 20, 30, 40}, &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; 15, 25, 35, 45}, &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {27, 29, 37, 48}, &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; {32, 33, 39, 50}} &nbsp; &nbsp; &nbsp; &nbsp; &nbsp; x = 29 Output: Found at (2, 1) Explanation: Element at (2,1) is 29Search in a row wise and column wise sorted matrix : <a href="https://www.geeksforgeeks.org/search-in-row-wise-and-column-wise-sorted-matrix/">https://www.geeksforgeeks.org/search-in-row-wise-and-column-wise-sorted-matrix/</a>

Search in a row wise and column wise sorted matrix

Welcome to the daily solving of our PROBLEM OF THE DAY with Soham Mukherjee. We will discuss the entire problem step-by-step and work towards developing an optimized solution. This will not only help you brush up on your concepts of Divide and Conquer but also build up problem-solving skills. Given a sorted and rotated array arr of n distinct elements which may be rotated at some point, and given an element key, the task is to find the index of the given element key in the array arr. The whole array arr is given as the range to search.Rotation shifts elements of the array by a certain number of positions, with elements that fall off one end reappearing at the other end.Note:- 0-based index is followed &amp; return -1 if the key is not present.Examples :Input: arr[] = {5, 6, 7, 8, 9, 10, 1, 2, 3}, key = 10
 Output: 5
 Explanation: 10 is found at index 5. Problem Link: <a href="https://practice.geeksforgeeks.org/problems/search-in-a-rotated-array4618/1">https://practice.geeksforgeeks.org/problems/search-in-a-rotated-array4618/1</a>

PROBLEM OF THE DAY : 08/07/2024 | Search in a Rotated Array

Welcome to the daily solving of our PROBLEM OF THE DAY with Saurabh Bansal. We will discuss the entire problem step-by-step and work towards developing an optimized solution. This will not only help you brush up on your concepts of Arrays but also build up problem-solving skills. You have given two sorted arrays arr1[] &amp; arr2[] of distinct elements. The first array has one element extra added in between. Return the index of the extra element.Note: 0-based indexing is followed.Example 1:Input: n = 7, arr1[] = {2,4,6,8,9,10,12}, arr2[] = {2,4,6,8,10,12}
 Output: 4
 Explanation: In the first array, 9 is extra added and it's index is 4.Give the problem a try before going through the video. All the best!!! Problem Link: <a href="https://practice.geeksforgeeks.org/problems/index-of-an-extra-element/1">https://practice.geeksforgeeks.org/problems/index-of-an-extra-element/1</a>

PROBLEM OF THE DAY : 08/06/2024 | Index of an Extra Element

Explore how to find the farthest smaller number on the right side in an array with our comprehensive tutorial. This guide is perfect for computer science students, programmers, and anyone interested in mastering array manipulation and efficient searching techniques.In this tutorial, you'll learn:Understanding the Problem: Gain a foundational understanding of the task, which involves finding the farthest element on the right side of each element in an array that is smaller than the current element.Approach and Strategy:<ul><li>Brute Force Approach: Learn how to solve the problem using a simple brute force method. This involves nested loops to compare each element with every element on its right, keeping track of the farthest smaller element found.</li><li>Optimized Approach: Discover more efficient algorithms to solve the problem using data structures like stacks to improve the time complexity.</li></ul>Algorithm Steps:<ol><li>Brute Force Method:<ul><li>Initialize an empty result array.</li><li>Use nested loops to iterate through the array, comparing each element with elements to its right.</li><li>Update the result array with the farthest smaller element found for each element.</li></ul></li><li>Optimized Method Using Stacks:<ul><li>Initialize an empty stack and an array to store the results.</li><li>Traverse the array from right to left.</li><li>Use the stack to keep track of elements and their indices, ensuring you always have access to the farthest smaller elements efficiently.</li></ul></li></ol>Step-by-Step Code Implementation: Detailed code examples in popular programming languages like Python, Java, and C++. These examples will demonstrate how to implement both the brute force and optimized approaches to solve the problem effectively.Complexity Analysis: Discuss the time and space complexity of each approach. The brute force method has a time complexity of 𝑂(𝑛2)O(n2), where 𝑛n is the number of elements in the array. The optimized stack-based method reduces the time complexity to 𝑂(𝑛)O(n) while maintaining 𝑂(𝑛)O(n) space complexity.Handling Edge Cases: Tips on managing various edge cases such as:<ul><li>Array with all elements the same: Handle cases where there are no smaller elements.</li><li>Empty Array: Ensure the implementation gracefully handles an empty array.</li><li>Single Element Array: Consider how the solution works when the array contains only one element.</li></ul>Visual Examples and Diagrams: Include diagrams to visually demonstrate the process of finding the farthest smaller element on the right for each element, helping to clarify the steps involved in both approaches.Applications and Real-World Use: Discuss real-world applications of this technique, such as in stock price analysis, where you might want to find the farthest lower stock price on the right side, and in competitive programming scenarios requiring efficient array manipulations.By the end of this tutorial, you’ll be well-equipped to find the farthest smaller number on the right side in an array using both brute force and optimized methods, enhancing your problem-solving skills and your ability to work with complex array operations.For a comprehensive guide on finding the farthest smaller number on the right side in an array, including detailed explanations, code examples, and practical tips, check out our full article at <a href="https://www.geeksforgeeks.org/find-the-farthest-smaller-number-in-the-right-side/">https://www.geeksforgeeks.org/find-the-farthest-smaller-number-in-the-right-side/</a>.This tutorial will not only improve your understanding of array manipulation and efficient searching techniques but also prepare you to tackle similar challenges in your software development and algorithmic problem-solving endeavours.

Farthest number | DSA Problem

Practice Problems

JavaScript

Linux