×
Home Discussions Write at Opengenus IQ
×
  • Track your progress
  • RANDOM
  • Join our Internship 🎓
  • 100+ Graph Algorithms
  • 100+ DP Problems
  • 50+ Linked List Problems
  • 50+ Array Problems
  • One Liner
  • 50+ Binary Tree problems
  • #7daysOfCode
  • Linux 💽
  • 🔊 Data Structures
  • Graph Algorithms
  • Dynamic Programming 💑
  • Home

Sliding Window technique

A collection of 5 posts

String Algorithms

Find all anagrams of a given string

In this article, we have explained efficient algorithms to Find all anagrams of a given string. This involve techniques like sliding window approach.

Kartheesh Reddy Koripelli
Interview Problems on Array

Maximum consecutive ones when at most k zeros can be flipped

In this article, we have explored algorithms to Find the longest sequence of consecutive ones when at most k zeros can be altered to 1. This involve techniques like Sliding Window approach.

Kartheesh Reddy Koripelli
Algorithms

Fruit into Baskets

In this article, we have explained how to solve Fruit into Baskets problem efficiently using the idea of Sliding Window.

Akash Ilangovan
Algorithms

Shortest Subarray with at least K as sum

In this problem, we find the length of the Shortest Subarray with at least K as sum. This can be solved in O(N) time complexity. This brings in the ideas of Monotonic Queue and Sliding Window.

Sumit Kumar
Algorithms

Number of substrings with exactly k distinct characters

In this problem, we are given a string and our job is to count the total number of substrings of the given string that contains exactly k distinct characters. We have explored 3 approaches to solve this.

Raghavendra Achar C
OpenGenus IQ © 2022 All rights reserved â„¢ [email: team@opengenus.org]
Top Posts LinkedIn Twitter