Take your skills to the next level with Geekster Masterclass - Free Registration
Skip to content

takeUforward

~ Strive for Excellence

  • Striver’s SDE Sheet
  • Striver’s A2Z DSA Course/Sheet
  • Striver’s DP Series
  • CS Subjects
    • SDE Core Sheet
    • Operating Systems
    • Computer Networks
  • Programming
    • Learn C++
    • C++ STL
    • C Programs
    • Data Structure
  • Interview Prep
    • Blind 75
    • Striver Tree Series
    • Striver’s CP Sheet
    • TCS NQT Coding Sheet
    • Interview Experience
    • Interview Prep Roadmap
  • Courses

Category: Data Structure

January 10, 2023 Data Structure / dynamic programming

Burst Balloons | Partition DP | DP 51

Problem Statement: You are given n balloons, indexed from 0 to n – 1. Each balloon is painted with a

Continue reading
January 10, 2023 Data Structure / dynamic programming

Evaluate Boolean Expression to True | Partition DP: DP 52

Problem Statement: Given an expression, A, with operands and operators (OR, AND, XOR), in how many ways can you evaluate

Continue reading
January 10, 2023 Data Structure / dynamic programming

Palindrome Partitioning – II | Front Partition : DP 53

Problem Statement: Given a string s, partition s such that every substring of the partition is a palindrome. Return the

Continue reading
January 10, 2023 Data Structure / dynamic programming

Partition Array for Maximum Sum | Front Partition : DP 54

Problem Statement: Given an integer array arr, partition the array into (contiguous) subarrays of length at most k. After partitioning,

Continue reading
January 10, 2023 Data Structure / dynamic programming

Maximum Rectangle Area with all 1’s | DP on Rectangles: DP 55

Problem Statement: Given a row X cols binary matrix filled with 0’s and 1’s, find the largest rectangle containing only

Continue reading
January 10, 2023 Data Structure / dynamic programming

Count Square Submatrices with All 1s | DP on Rectangles : DP 56

Problem Statement: Given an n * m matrix of ones and zeros, return how many square submatrices have all ones.

Continue reading
January 10, 2023 Data Structure / Graph

G-40: Number of Ways to Arrive at Destination

You are in a city that consists of n intersections numbered from 0 to n – 1 with bi-directional roads

Continue reading
January 10, 2023 Data Structure / Graph

G-38: Cheapest Flights Within K Stops

There are n cities and m edges connected by some number of flights. You are given an array of flights

Continue reading
January 5, 2023 Data Structure / Graph

G-37: Path With Minimum Effort

You are a hiker preparing for an upcoming hike. You are given heights, a 2D array of size rows x

Continue reading
January 5, 2023 Data Structure / Graph

G-36: Shortest Distance in a Binary Maze

Problem Statement:  Given an n * m matrix grid where each element can either be 0 or 1. You need

Continue reading

Posts navigation

1 2 3 … 43 Next Posts»

Subscribe

I want to receive latest posts and interview tips
Loading

Recent Posts

  • Find the highest/lowest frequency element
  • A Guide on Online C Compiler
  • Burst Balloons | Partition DP | DP 51
  • Evaluate Boolean Expression to True | Partition DP: DP 52
  • Palindrome Partitioning – II | Front Partition : DP 53

Accolite Digital Amazon Arcesium Bank of America Barclays BFS Binary Search Binary Search Tree Commvault CPP DE Shaw DFS DSA Self Paced google HackerEarth infosys inorder Java Juspay Kreeti Technologies Morgan Stanley Newfold Digital Oracle post order queue recursion Samsung SDE Core Sheet SDE Sheet Searching set-bits sorting Strivers A2ZDSA Course sub-array subarray Swiggy takeuforward TCQ NINJA TCS TCS CODEVITA TCS DIGITA; TCS Ninja TCS NQT VMware XOR

Copyright © 2022 takeuforward | All rights reserved