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

For more details, please go through - <a href="https://www.geeksforgeeks.org/dsa/longest-consecutive-subsequence/">Longest Consecutive Subsequence</a>

Longest Consecutive Subsequence.

Open AddressingLike separate chaining, open addressing is a method for handling collisions. In Open Addressing, all elements are stored in the hash table itself. So at any point, the size of the table must be greater than or equal to the total number of keys (Note that we can increase table size by copying old data if needed). This approach is also known as closed hashing. This entire procedure is based upon probing. We will understand types of probing ahead.Hashing Set 3 (Open Addressing): <a href="https://www.geeksforgeeks.org/hashing-set-3-open-addressing/">https://www.geeksforgeeks.org/hashing-set-3-open-addressing/</a>

Hashing | Set 3 (Open Addressing)

Welcome to the daily solving of our PROBLEM OF THE DAY with Karan Mashru 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 Sliding-window but also build up problem-solving skills. Given two strings s and p. Find the smallest window in the string s consisting of all the characters(including duplicates) of the string p.&nbsp;&nbsp;Return "-1" in case there is no such window present.&nbsp;In case there are multiple such windows of same length, return the one with the least starting index. Note : All characters are in Lowercase alphabets.&nbsp;Examples:Input: s = "timetopractice", p = "toc"
Output: toprac
Explanation: "toprac" is the smallest
substring in which "toc" can be found.Give the problem a try before going through the video. All the best!!! Problem Link: <a href="https://practice.geeksforgeeks.org/problems/smallest-window-in-a-string-containing-all-the-characters-of-another-string-1587115621/1">https://practice.geeksforgeeks.org/problems/smallest-window-in-a-string-containing-all-the-characters-of-another-string-1587115621/1</a>

PROBLEM OF THE DAY : 24/09/2024 | Smallest window in a string containing all the characters of another string

Suppose we want to design a system for storing employee records keyed using phone numbers. And we want the following queries to be performed efficiently:&nbsp; &nbsp;Insert a phone number and corresponding information. Search a phone number and fetch the information. Delete a phone number and related information.Hashing Set 1 (Introduction): <a href="https://www.geeksforgeeks.org/hashing-set-1-introduction/">https://www.geeksforgeeks.org/hashing-set-1-introduction/</a>

Hashing | Set 1 (Introduction)

In this video we will see how to find the length of the longest sub-sequence from a given array, such that elements in the subsequence are consecutive integers, the consecutive numbers can be in any order.Example: Input: arr[] = {1, 9, 3, 10, 4, 20, 2} Output: 4 Explanation:&nbsp; The subsequence 1, 3, 4, 2 is the longest&nbsp; subsequence of consecutive elementsCheck out the video to see how we implement this!! Practice Problem: <a href="https://practice.geeksforgeeks.org/problems/longest-consecutive-subsequence2449/1">https://practice.geeksforgeeks.org/problems/longest-consecutive-subsequence2449/1</a> Article: <a href="https://www.geeksforgeeks.org/longest-consecutive-subsequence/">https://www.geeksforgeeks.org/longest-consecutive-subsequence/</a> SDE Sheet: <a href="https://www.geeksforgeeks.org/sde-sheet-a-complete-guide-for-sde-preparation/">https://www.geeksforgeeks.org/sde-sheet-a-complete-guide-for-sde-preparation/</a>

Longest consecutive subsequence | SDE Sheet | Hashing

Top view of a binary tree is the set of nodes visible when the tree is viewed from the top. Given a binary tree, print the top view of it. The output nodes can be printed in any order.A node x is there in output if x is the topmost node at its horizontal distance. Horizontal distance of left child of a node x is equal to horizontal distance of x minus 1, and that of right child is horizontal distance of x plus 1.Print Nodes in Top View of Binary Tree : <a href="https://www.geeksforgeeks.org/print-nodes-top-view-binary-tree/">https://www.geeksforgeeks.org/print-nodes-top-view-binary-tree/</a>

Print Nodes in Top View of Binary Tree

Given a text txt[0..n-1] and a pattern pat[0..m-1], write a function search(char pat[], char txt[]) that prints all occurrences of pat[] in txt[]. You may assume that n &gt; m.Examples:Input: &nbsp;txt[] = "THIS IS A TEST TEXT" &nbsp; &nbsp; &nbsp; &nbsp;pat[] = "TEST" Output: Pattern found at index 10 Rabin-Karp Algorithm &nbsp;Searching for Patterns: <a href="https://www.geeksforgeeks.org/rabin-karp-algorithm-for-pattern-searching/">https://www.geeksforgeeks.org/rabin-karp-algorithm-for-pattern-searching/</a>

Rabin-Karp Algorithm | Searching for Patterns

This video is part of the Hashing section under GFG SDE Sheet. Given an array A of integers and another number K. Find all the unique&nbsp;quadruple from the given array that sums up to K.Also note that all the quadruples which you return should be internally sorted, ie for any quadruple [q1, q2, q3, q4] the following should follow: q1 &lt;= q2 &lt;= q3 &lt;= q4.Example 1:Input: N = 5, K = 3&nbsp; A[] = {0,0,2,1,1}&nbsp; Output: 0 0 1 2&nbsp; Explanation: Sum of 0, 0, 1, 2 is equal to K. Try it out before watching the implementation of the problem in the video. We recommend watching the video, even if you can solve the problem. You may discover something new. All the best!!!Do check out:- Problem: <a href="https://www.geeksforgeeks.org/problems/find-all-four-sum-numbers1732/1">https://www.geeksforgeeks.org/problems/find-all-four-sum-numbers1732/1</a> SDE Sheet Link: <a href="https://www.geeksforgeeks.org/sde-sheet-a-complete-guide-for-sde-preparation/">https://www.geeksforgeeks.org/sde-sheet-a-complete-guide-for-sde-preparation/</a> Article Link: &nbsp;<a href="https://www.geeksforgeeks.org/find-four-elements-that-sum-to-a-given-value-set-2/">https://www.geeksforgeeks.org/find-four-elements-that-sum-to-a-given-value-set-2/</a>

SDE Sheet - Find all four sum numbers

This video is part of Hahisng section under GFG SDE Sheet. In this problem, we are an two positive integer arrays X of size M and Y of size N, find the number of pairs such that xy &gt; yx (raised to power of) where x is an element from X and y is an element from Y.Example :Input:&nbsp; M = 3, X[] = [2, 1, 6]&nbsp; N = 2, Y[] = [1, 5] Output: 3 Try it out before watching the implementation of the problem in the video. We recommend watching the video, even if you can solve the problem. You may discover something new. All the best!!!Do check out:- Article: <a href="https://www.geeksforgeeks.org/find-number-pairs-xy-yx/">https://www.geeksforgeeks.org/find-number-pairs-xy-yx/</a> Problem: <a href="https://www.geeksforgeeks.org/problems/number-of-pairs-1587115620/1">https://www.geeksforgeeks.org/problems/number-of-pairs-1587115620/1</a> SDE Sheet Link: <a href="https://www.geeksforgeeks.org/sde-sheet-a-complete-guide-for-sde-preparation/">https://www.geeksforgeeks.org/sde-sheet-a-complete-guide-for-sde-preparation/</a>

SDE Sheet - Number of pairs

Welcome to the daily solving of our PROBLEM OF THE DAY with Karan Mashru. 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 Array but will also help you build up problem-solving skills. In this problem, we are given, an array arr[] of N positive integers which can contain integers from 1 to P where elements can be repeated or can be absent from the array. Your task is to count the frequency of all numbers from 1 to N. Make in-place changes in arr[], such that arr[i] = frequency(i). Assume 1-based indexing. Note: The elements greater than N in the array can be ignored for counting and modifying the array in place.Example :Input: N = 5 arr[] = {2, 3, 2, 3, 5} P = 5 Output: 0 2 2 0 1 Explanation:&nbsp; Counting frequencies of each array element We have: 1 occurring 0 times. 2 occurring 2 times. 3 occurring 2 times. 4 occurring 0 times. 5 occurring 1 time. Give the problem a try before going through the video. All the best!!! Problem Link: <a href="https://practice.geeksforgeeks.org/problems/frequency-of-array-elements-1587115620/1">https://practice.geeksforgeeks.org/problems/frequency-of-array-elements-1587115620/1</a> Solution IDE Link: <a href="https://ide.geeksforgeeks.org/online-cpp-compiler/fd742a66-fb6f-433f-ab7e-802c40161763">https://ide.geeksforgeeks.org/online-cpp-compiler/fd742a66-fb6f-433f-ab7e-802c40161763</a>

PROBLEM OF THE DAY: 01/11/2023 | Frequencies of Limited Range Array Elements

JavaScript's Set: Taming Your Data's Uniqueness. Explore the power of Sets in JavaScript – your toolkit for managing collections of unique values. Join us to learn how Sets simplify your data wrangling tasks, ensuring only distinct elements take the spotlight!