Skip to content

takeUforward

~ Strive for Excellence

  • Striver’s SDE Sheet
  • SDE Core Sheet
  • Interview Experience
  • Data Structure
  • Advertise with us
  • Join takeUforward

Category: Recursion

April 16, 2022 Recursion

Recursion Tree Method For Solving Recurrence

What is Recurrence? ● The literal meaning of the word Recurrence means something that occurs again and again.● In programming

Continue reading
March 12, 2022 Arrays / Data Structure / dynamic programming / Recursion

Longest Common Subsequence | (DP – 25)

Problem Statement: Introduction to DP on Strings – Longest Common Subsequence In the coming articles, we will discuss problems related to

Continue reading
March 7, 2022 Arrays / Data Structure / dynamic programming / Recursion

Rod Cutting Problem | (DP – 24)

Problem Statement:  Rod Cutting Problem Problem Link: Rod Cutting Problem We are given a rod of size ‘N’. It can

Continue reading
March 7, 2022 Arrays / Data Structure / dynamic programming / Recursion / String / Two-pointer Approach

Check if a String is a subsequence of other

Problem Statement: Let there are two strings S1 and S2. If the S1 is a subsequence of S2 return true

Continue reading
March 2, 2022 Arrays / Data Structure / Recursion

Josephus Problem

Problem Statement: There are n people standing in a circle waiting to be executed. The counting out begins at some

Continue reading
March 2, 2022 Recursion

Base cases in Recursion

Writing base cases in Recursion: Recursion: A Function calling itself again and again directly or indirectly is called Recursion, and

Continue reading
February 27, 2022 Arrays / Data Structure / dynamic programming / Recursion

Coin Change 2 (DP – 22)

Problem Link: Ways to Make a Coin Change We are given an array Arr with N distinct coins and a

Continue reading
February 27, 2022 Arrays / Data Structure / dynamic programming / Recursion

Target Sum (DP – 21)

Problem Link: Target Sum Problem Description: We are given an array ‘ARR’ of size ‘N’ and a number ‘Target’. Our

Continue reading
February 23, 2022 Arrays / Data Structure / dynamic programming / Recursion

Minimum Coins (DP – 20)

Problem Statement:  Minimum Coins Problem Link: Minimum Coins We are given a target sum of ‘X’ and ‘N’ distinct numbers

Continue reading
February 15, 2022 Arrays / Data Structure / dynamic programming / Recursion

0/1 Knapsack (DP – 19)

Problem Statement: 0/1 Knapsack Problem Link: 0/1 Knapsack A thief wants to rob a store. He is carrying a bag

Continue reading

Posts navigation

1 2 3 4 Next Posts»

Subscribe

I want to receive latest posts and interview tips
Loading

Recent Posts

  • Input, Output, and Import in Python
  • Python Operators
  • Python Data Types
  • Type Conversion in Python
  • BuildHeap(), DecreaseKey(), and Delete() in Binary Heap

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 pre-order queue recursion Samsung SDE Core Sheet SDE Sheet Searching set-bits sorting sub-array subarray Swiggy takeuforward TCQ NINJA TCS TCS CODEVITA TCS DIGITA; TCS Ninja TCS NQT VMware XOR

Copyright © 2022 takeuforward | All rights reserved