Skip to content
GeeksToCode
Live To Code, Code To Live
  • Home
  • Data Structures
  • Competitive Programming
  • JAVA
  • Problems

Problems

Table of Contents

  • BackTracking
  • Prefix Sum
  • Sliding window technique
  • Greedy Algorithm Problems
  • Binary Search Problems
  • Graph Problems
  • Sorting
  • Tree
  • Dynamic Programming
  • Range Sum Query

BackTracking

Problem 1: N queen problem using backtracking

Problem 2: Rat In A Maze Problem

Prefix Sum

Problem 1: Number of continuous sub array whose sum equals to k

Problem 2: Find Pivot Index

Problem 3: Little Girl and Maximum Sum

Sliding window technique

Problem: Set 1: Easy

Problem: Set 2: Medium

Greedy Algorithm Problems

Problem: Set 1: Easy

Problem: Set 2: The celebrity problem

Problem: Set 3: 0-1 Knapsack Problem

Binary Search Problems

Problem: Set 1: The Partition’s Problem

Graph Problems

Problem: Set 1: Island Problem

Problem: Set 2: Graph Coloring

Sorting

Problem: Set 1: Topological Sorting

Problem: Set 2: Duplicate and Missing Number

Tree

Problem: Set 1: Sub Tree Problems

Dynamic Programming

Problem: Set 1: Mashmokh And ACM

Problem: Set 2: BasketBall and Exercise

Range Sum Query

Problem: Set 1: Hilbert’s Hotel Editorial

Quick Access

  • About Us
  • Android Studio Tutorial
  • Competitive Programming
  • Contact
  • Data Structures
  • Disclaimer
  • JAVA
  • Privacy Policy
  • Problems
  • Sitemap

Archives

  • January 2021
  • October 2020
  • September 2020
  • August 2020
  • July 2020
  • June 2020
  • May 2020
  • April 2020
  • March 2020

Search…

GeeksToCode © 2020-2021

|