×
Home Discussions Write at Opengenus IQ
×
  • About
  • Track your progress
  • Deep Learning Projects
  • Python Projects
  • Join our Internship 🎓
  • RANDOM
  • 100+ Graph Algorithms
  • 100+ DP Problems
  • 50+ Linked List Problems
  • 50+ Array Problems
  • One Liner
  • 50+ Binary Tree problems
  • Home
  • Rust Projects

Mudit Garg

Mudit Garg is a B. Tech Computer Science Student at UPES, Dehradun

Dehradun •
2 posts •
Dynamic Programming (DP)

Longest Increasing Subsequence [3 techniques]

In this article, we have explained the problem of Longest Increasing Subsequence along with 3 techniques (Brute force, Binary Search, Dynamic Programming).

Mudit Garg
Data Structures

Dynamic Array

Dynamic Array solves the problem of array where the size needs to fixed beforehand. On average, dynamic array achieves same performance as an array by using resize operation.

Mudit Garg
OpenGenus IQ © 2023 All rights reserved â„¢ [email: team@opengenus.org]
Top Posts LinkedIn Twitter