Канал: Coding Simplified

AI Learnings: Introduction to OpenAI | OpenAI functionalities | ChatGPT

AI Learnings: Introduction to OpenAI | OpenAI functionalities | ChatGPT

Type Modifiers in C++ | How to Find the Range of a Data Type | ASCII Value

Type Modifiers in C++ | How to Find the Range of a Data Type | ASCII Value

Understanding DI (Dependency Injection) Pattern using Examples

Understanding DI (Dependency Injection) Pattern using Examples

Understanding IoC Principal & Dependency Inversion Principal (DIP) | With Examples

Understanding IoC Principal & Dependency Inversion Principal (DIP) | With Examples

C++ Tutorial: Data Types in C++ | Primary Data Types

C++ Tutorial: Data Types in C++ | Primary Data Types

Parse JSON using Java

Parse JSON using Java

How to Enable or Disable XAML Hot Reload option in Visual studio

How to Enable or Disable XAML Hot Reload option in Visual studio

How to start preparing for IT Companies from your college days | Understand Focus Areas

How to start preparing for IT Companies from your college days | Understand Focus Areas

Different type of positions exists in IT Companies | Select position as per your interest

Different type of positions exists in IT Companies | Select position as per your interest

How to apply for IT Companies | Software Companies

How to apply for IT Companies | Software Companies

C# Tutorial: Type-testing operators & Cast expression

C# Tutorial: Type-testing operators & Cast expression

C# Tutorial: Understanding Nullable value type in C#

C# Tutorial: Understanding Nullable value type in C#

How to download & Install Visual Studio | Install SDKs | Modify SDKs | Windows OS

How to download & Install Visual Studio | Install SDKs | Modify SDKs | Windows OS

C# Tutorial: Explaining 'namespace' in C# | Why 'namespace' is used

C# Tutorial: Explaining 'namespace' in C# | Why 'namespace' is used

C# Tutorial: Understanding Properties in C# | When to use Properties

C# Tutorial: Understanding Properties in C# | When to use Properties

C# Tutorial: ref keyword | How to use 'ref' keyword | With Examples

C# Tutorial: ref keyword | How to use 'ref' keyword | With Examples

C# Tutorial: Difference b/w ?:, ??, ??=, ?. in C#

C# Tutorial: Difference b/w ?:, ??, ??=, ?. in C#

How to crack Google Technical Interviews

How to crack Google Technical Interviews

How to crack Microsoft Technical Interviews

How to crack Microsoft Technical Interviews

How to crack Amazon SDET Technical Interviews | Quality/ Testing Role | SDET Role

How to crack Amazon SDET Technical Interviews | Quality/ Testing Role | SDET Role

How to crack Amazon Technical Interviews | Developer/SDE Role | SDE - 1 | SDE - 2 | SDE - 3

How to crack Amazon Technical Interviews | Developer/SDE Role | SDE - 1 | SDE - 2 | SDE - 3

Technical Interview Process & Preparation

Technical Interview Process & Preparation

Technical Interviews: Low level Design Interview Preparation

Technical Interviews: Low level Design Interview Preparation

Technical Interviews: Preparation for Language specific questions (C, Java, JavaScript, etc.)

Technical Interviews: Preparation for Language specific questions (C, Java, JavaScript, etc.)

Technical Interviews: Hiring Manager Round Preparation

Technical Interviews: Hiring Manager Round Preparation

Technical Interviews: Explaining Last Project done & it’s preparation

Technical Interviews: Explaining Last Project done & it’s preparation

How to uninstall Visual Studio from Windows

How to uninstall Visual Studio from Windows

How to Downgrade Visual Studio version

How to Downgrade Visual Studio version

How to answer - Tell me about yourself

How to answer - Tell me about yourself

Technical Interviews: Things to consider while solving System Design Question in Interview

Technical Interviews: Things to consider while solving System Design Question in Interview

HR Round Process & Preparations | How to prepare for HR Round

HR Round Process & Preparations | How to prepare for HR Round

Technical Interviews: Solving a Coding Question in Coding Round

Technical Interviews: Solving a Coding Question in Coding Round

Technical Interviews: How to answer Behavioral questions asked

Technical Interviews: How to answer Behavioral questions asked

How to do Salary Negotiations | Things to note down before Salary Negotiations

How to do Salary Negotiations | Things to note down before Salary Negotiations

Things to take care before joining a new company

Things to take care before joining a new company

Linked List in Java: 7 (Iterative Method) - Delete element at given position

Linked List in Java: 7 (Iterative Method) - Delete element at given position

Linked List in Java: 8 (Iterative Method) - Get size of list | Length of Linked List |

Linked List in Java: 8 (Iterative Method) - Get size of list | Length of Linked List |

Linked List in Java - 4 (Iterative Method) : Insert element at any given position

Linked List in Java - 4 (Iterative Method) : Insert element at any given position

Linked List in Java - 2 (Iterative Method) : Print element of Linked list

Linked List in Java - 2 (Iterative Method) : Print element of Linked list

Linked List in Java 1 (Iterative Method) - Create new Linked List | Insert element at last

Linked List in Java 1 (Iterative Method) - Create new Linked List | Insert element at last

How to Prepare for System Design Interviews | Tutorial | Strategy | Experience

How to Prepare for System Design Interviews | Tutorial | Strategy | Experience

How to Prepare for Data Structure Coding Interviews | Tutorials | Strategy | Role | Experience

How to Prepare for Data Structure Coding Interviews | Tutorials | Strategy | Role | Experience

C# Tutorial - 12: Arrays in C#

C# Tutorial - 12: Arrays in C#

C# Tutorial - 11: Usages of break & continue statement in C# loops

C# Tutorial - 11: Usages of break & continue statement in C# loops

C# Tutorial - 10: Using Loops in C# | for loop | while loop | do-while loop

C# Tutorial - 10: Using Loops in C# | for loop | while loop | do-while loop

C# Tutorial - 9: Understand how to use Switch statement in C#

C# Tutorial - 9: Understand how to use Switch statement in C#

C# Tutorial - 8: How to use if-else statement in C#

C# Tutorial - 8: How to use if-else statement in C#

C# Tutorial - 7: C# Operators

C# Tutorial - 7: C# Operators

C# Tutorial - 6: C# Data Types & Type Casting

C# Tutorial - 6: C# Data Types & Type Casting

C# Tutorial - 5: C# Variables

C# Tutorial - 5: C# Variables

C# Tutorial - 4: Executing C# code in Debug Mode in Visual Studio

C# Tutorial - 4: Executing C# code in Debug Mode in Visual Studio

C# Tutorial - 3: C# Comment | How to add comment for a single line or multiple lines

C# Tutorial - 3: C# Comment | How to add comment for a single line or multiple lines

C# Tutorial - 2: Understanding First Hello World Application

C# Tutorial - 2: Understanding First Hello World Application

C# Tutorial - 1: C# Introduction & Launching first Hello World Application

C# Tutorial - 1: C# Introduction & Launching first Hello World Application

Selenium - 9: Selenium Reports | Extent Reports

Selenium - 9: Selenium Reports | Extent Reports

Selenium - 8: Selenium Screenshot Option | How to take screenshot in Test case

Selenium - 8: Selenium Screenshot Option | How to take screenshot in Test case

Selenium - 7: Selenium operations on Dropdown | Get Values | Select values

Selenium - 7: Selenium operations on Dropdown | Get Values | Select values

Array - 53: Segregate 0s & 1s in given Array

Array - 53: Segregate 0s & 1s in given Array

Array - 52: Segregate Odd & Even Numbers in given Array

Array - 52: Segregate Odd & Even Numbers in given Array

Visual Studio - How to Modify/Add/Remove Workloads in Visual Studio

Visual Studio - How to Modify/Add/Remove Workloads in Visual Studio

BST - 28: Find the closest element for a given value in BST

BST - 28: Find the closest element for a given value in BST

Selenium - 6: Selenium Validations | Check if element is Present | Displayed | Selected | Enabled

Selenium - 6: Selenium Validations | Check if element is Present | Displayed | Selected | Enabled

BST - 27: Create BST from given PreOrder Traversal

BST - 27: Create BST from given PreOrder Traversal

Selenium - 5: End to end test script using Selenium

Selenium - 5: End to end test script using Selenium

Selenium - 4: Understanding Selenium Xpath Locator

Selenium - 4: Understanding Selenium Xpath Locator

BST - 26: Create BST from given PostOrder Traversal

BST - 26: Create BST from given PostOrder Traversal

BST - 25: Remove BST Nodes outside the given range

BST - 25: Remove BST Nodes outside the given range

BST - 24: Get Floor & Ceil for a given value in Binary Search Tree (BST)

BST - 24: Get Floor & Ceil for a given value in Binary Search Tree (BST)

BST - 23: Get Inorder Predecessor for a given value in BST

BST - 23: Get Inorder Predecessor for a given value in BST

BST - 22: Construct Balanced BST from given values | Sorted Array to Balanced BST

BST - 22: Construct Balanced BST from given values | Sorted Array to Balanced BST

BST - 21: Convert BST to Sorted Doubly Linked List (DLL)

BST - 21: Convert BST to Sorted Doubly Linked List (DLL)

Selenium - 3: Understanding Selenium Locators

Selenium - 3: Understanding Selenium Locators

BST - 20: Check if given Binary Tree is BST

BST - 20: Check if given Binary Tree is BST

BST - 19: Check if elements of two BST are same

BST - 19: Check if elements of two BST are same

BST - 18: Get Kth Largest element in given Binary Search Tree (BST)

BST - 18: Get Kth Largest element in given Binary Search Tree (BST)

BST - 17: Get Kth Smallest element in given Binary Search Tree (BST)

BST - 17: Get Kth Smallest element in given Binary Search Tree (BST)

Selenium - 2: Selenium Hello World Example

Selenium - 2: Selenium Hello World Example

BST - 16: Find Lowest Common Ancestor (LCA) for given values in Binary Search Tree

BST - 16: Find Lowest Common Ancestor (LCA) for given values in Binary Search Tree

BST - 15: Check if there exists a Triplet for given Sum in BST

BST - 15: Check if there exists a Triplet for given Sum in BST

BST - 14: Check if there exists a pair for given Sum in BST | Using Set | Using Inorder

BST - 14: Check if there exists a pair for given Sum in BST | Using Set | Using Inorder

Binary Tree - 86: Check if there exists a pair for given Sum in Binary Tree

Binary Tree - 86: Check if there exists a pair for given Sum in Binary Tree

String - 19: Get the frequency of every word in given String | Java Implementation

String - 19: Get the frequency of every word in given String | Java Implementation

Selenium - 1: Introduction to Selenium | Selenium Architecture

Selenium - 1: Introduction to Selenium | Selenium Architecture

String - 18: Get Most Frequent word in String after excluding given words | Java Implementation

String - 18: Get Most Frequent word in String after excluding given words | Java Implementation

String - 17: Get Most Frequent word in String | Java Implementation

String - 17: Get Most Frequent word in String | Java Implementation

Mockito Introduction - How to use Mockito

Mockito Introduction - How to use Mockito

Coding Problem: Insert new Interval to already arranged Intervals

Coding Problem: Insert new Interval to already arranged Intervals

JUnit Tutorial - 5: JUnit Miscellaneous Topics

JUnit Tutorial - 5: JUnit Miscellaneous Topics

JUnit Reporting - 4: Reporting in JUnit

JUnit Reporting - 4: Reporting in JUnit

JUnit Tutorial - 3: JUnit Assertions

JUnit Tutorial - 3: JUnit Assertions

Coding Problem: Merge given Intervals

Coding Problem: Merge given Intervals

JUnit Tutorial - 2: Annotations in JUnit

JUnit Tutorial - 2: Annotations in JUnit

JUnit Tutorial - 1: Introduction to Junit

JUnit Tutorial - 1: Introduction to Junit

Linked List - 86: Reverse the Linked List from given Positions

Linked List - 86: Reverse the Linked List from given Positions

Array - 51: Find the first K missing Positive number

Array - 51: Find the first K missing Positive number

String - 16: Reverse Vowels order in Given String | Java Implementation

String - 16: Reverse Vowels order in Given String | Java Implementation

Array - 50: Find first missing positive number in given array

Array - 50: Find first missing positive number in given array

Introduction to CSV Data Parsing in Java | How to parse the data from given CSV in Java

Introduction to CSV Data Parsing in Java | How to parse the data from given CSV in Java

Introduction to Xml Data Parsing in Java | How to parse the data from given xml in Java

Introduction to Xml Data Parsing in Java | How to parse the data from given xml in Java

Array - 49: Reverse array elements | Using new array | Using Swapping elements | Using Library Func

Array - 49: Reverse array elements | Using new array | Using Swapping elements | Using Library Func

String - 16: Find Substrings formed using Concatenation of all given words

String - 16: Find Substrings formed using Concatenation of all given words

Array - 48: Longest Sub-array with all 1s if at max ‘k’ 0s can be replaced with 1s

Array - 48: Longest Sub-array with all 1s if at max ‘k’ 0s can be replaced with 1s

Jacoco Tutorial: Introduction to Jacoco

Jacoco Tutorial: Introduction to Jacoco

String - 15: Max sub-string length with same letters if max 'K' characters can be replaced | Java

String - 15: Max sub-string length with same letters if max 'K' characters can be replaced | Java

String - 14: Smallest Sub-string which contains all the characters of given Pattern | Java Code

String - 14: Smallest Sub-string which contains all the characters of given Pattern | Java Code

Solve Sudoku Problem | Backtracking Code Implementation

Solve Sudoku Problem | Backtracking Code Implementation

Binary Tree - 85: Find all paths from root to leaf where sum of nodes is equal to given sum

Binary Tree - 85: Find all paths from root to leaf where sum of nodes is equal to given sum

Binary Tree - 84: Find Average of each Level in Binary Tree

Binary Tree - 84: Find Average of each Level in Binary Tree

N-Queen Problem | Backtracking | Print Queen Positions

N-Queen Problem | Backtracking | Print Queen Positions

Rat – Maze Problem | Backtracking | Print Rat Path

Rat – Maze Problem | Backtracking | Print Rat Path

Graph - 19: Prim's Algo | Minimum Spanning Tree in weighted Graph (Min Distance to cover all nodes)

Graph - 19: Prim's Algo | Minimum Spanning Tree in weighted Graph (Min Distance to cover all nodes)

Graph -18: Dijkstra Algorithm (Min distance b/w source to destination in Weighted Graph)

Graph -18: Dijkstra Algorithm (Min distance b/w source to destination in Weighted Graph)

Graph - 17: Min distance b/w Source to Destination in Unweighted Graph

Graph - 17: Min distance b/w Source to Destination in Unweighted Graph

Graph - 15: Topological Sort using Adjacency List on Graph

Graph - 15: Topological Sort using Adjacency List on Graph

Graph - 12: Check if Undirected Graph has Cycle

Graph - 12: Check if Undirected Graph has Cycle

Graph -13: Check if Directed Graph has Cycle (Using DFS)

Graph -13: Check if Directed Graph has Cycle (Using DFS)

Graph -14: Check if Directed Graph has Cycle (Using InDegree/BFS)

Graph -14: Check if Directed Graph has Cycle (Using InDegree/BFS)

Java - Compare the Objects using equals() & hashCode()

Java - Compare the Objects using equals() & hashCode()

Java - Sort the Object array or Object List

Java - Sort the Object array or Object List

Graph -11: Check if Source to Destination Path exists in Directed Graph

Graph -11: Check if Source to Destination Path exists in Directed Graph

Graph - 8: Check if Directed Graph is Strongly Connected

Graph - 8: Check if Directed Graph is Strongly Connected

Graph - 10: Find if Source to Destination is reachable in Undirected Graph

Graph - 10: Find if Source to Destination is reachable in Undirected Graph

Graph - 9: Get Connected Components in Undirected Graph

Graph - 9: Get Connected Components in Undirected Graph

Graph - 7: Check if Undirected Graph is Connected

Graph - 7: Check if Undirected Graph is Connected

Graph - 4: Depth First Search (DFS) using Adjacency List | Undirected Graph | Directed Graph

Graph - 4: Depth First Search (DFS) using Adjacency List | Undirected Graph | Directed Graph

Graph - 5: Breadth First Search (BFS) using Adjacency List | On Undirected Graph | On Directed Graph

Graph - 5: Breadth First Search (BFS) using Adjacency List | On Undirected Graph | On Directed Graph

Array - 47: Find all Missing and Duplicate values present in 1 to n numbers range

Array - 47: Find all Missing and Duplicate values present in 1 to n numbers range

Array - 46: Find Duplicate value present in 1 to n numbers range

Array - 46: Find Duplicate value present in 1 to n numbers range

Array - 45: Find Corrupt Pair in 1 to n numbers range

Array - 45: Find Corrupt Pair in 1 to n numbers range

Array - 44: Find Missing Number in 1 to n+1 numbers range

Array - 44: Find Missing Number in 1 to n+1 numbers range

Heap - 12: Connect different ropes into one big rope with minimum cost

Heap - 12: Connect different ropes into one big rope with minimum cost

Heap - 11: Find the ‘k’ closest point near to origin

Heap - 11: Find the ‘k’ closest point near to origin

Array - 43: Cyclic Sort | Sort the elements from 1 to n

Array - 43: Cyclic Sort | Sort the elements from 1 to n

Array - 42: Check if cycle is present in Circular array

Array - 42: Check if cycle is present in Circular array

String - 13: Find all anagrams present in String for a given pattern | Java Implementation

String - 13: Find all anagrams present in String for a given pattern | Java Implementation

String - 12: Check if String contains any permutation/anagram of given pattern | Java Implementation

String - 12: Check if String contains any permutation/anagram of given pattern | Java Implementation

Check if given number is Happy Number (If sum of the square of each number lead to 1)

Check if given number is Happy Number (If sum of the square of each number lead to 1)

String - 11: Compare two Strings with backspace characters | Java Implementation

String - 11: Compare two Strings with backspace characters | Java Implementation

Array - 41: Find Subarrays with Multiplication of elements less than given Number

Array - 41: Find Subarrays with Multiplication of elements less than given Number

Array - 40: Find Minimum subarray length such that If we sort this subarray, whole array be Sorted

Array - 40: Find Minimum subarray length such that If we sort this subarray, whole array be Sorted

Array - 39: Find Triplet Sum which is closest to target Sum

Array - 39: Find Triplet Sum which is closest to target Sum

Array - 38: Find Triplets with sum smaller than Target Sum

Array - 38: Find Triplets with sum smaller than Target Sum

Array - 37: Find all Quadruple for given Sum

Array - 37: Find all Quadruple for given Sum

Array - 36: Find all Triplets for given Sum | Check if Triplet exists for given Sum

Array - 36: Find all Triplets for given Sum | Check if Triplet exists for given Sum

Array - 34: Remove all duplicates from Sorted Array

Array - 34: Remove all duplicates from Sorted Array

Array - 35: Square a sorted array of +/- numbers in sorted way

Array - 35: Square a sorted array of +/- numbers in sorted way

Array - 9: Implement Quick Sort | Quick Sort on Array

Array - 9: Implement Quick Sort | Quick Sort on Array

Array - 8: Merge Sort on array elements

Array - 8: Merge Sort on array elements

Array - 6: Insertion Sort on array elements

Array - 6: Insertion Sort on array elements

Array - 7: Selection Sort on array elements

Array - 7: Selection Sort on array elements

Array - 33: Sort array based on frequency of value (If frequency is same then sort per occurrence)

Array - 33: Sort array based on frequency of value (If frequency is same then sort per occurrence)

Array - 32: Sort array based on frequency of value (If frequency is same then sort based on value)

Array - 32: Sort array based on frequency of value (If frequency is same then sort based on value)

Heap - 10: Frequency Sort (Sort element based on frequency)

Heap - 10: Frequency Sort (Sort element based on frequency)

Heap - 9: Get Top K frequent elements in given array

Heap - 9: Get Top K frequent elements in given array

Heap - 8: Heap Sort | Sort the array using Heap

Heap - 8: Heap Sort | Sort the array using Heap

Heap - 7: Top K Largest value present in array

Heap - 7: Top K Largest value present in array

Heap - 6: Find Kth Smallest Value in given Stream of numbers

Heap - 6: Find Kth Smallest Value in given Stream of numbers

Heap - 5: Find Kth Smallest Value in given array

Heap - 5: Find Kth Smallest Value in given array

Heap - 4: Find Kth Largest Value in given Stream of numbers

Heap - 4: Find Kth Largest Value in given Stream of numbers

Heap - 3: Find Kth Largest Value in given array | Using Min Heap | Using Max Heap

Heap - 3: Find Kth Largest Value in given array | Using Min Heap | Using Max Heap

Heap - 2: Implement Heap using Java Library Function (PriorityQueue)

Heap - 2: Implement Heap using Java Library Function (PriorityQueue)

Heap - 1: Heap Introduction | Max-Heap | Min-Heap | Heap Internal Implementation

Heap - 1: Heap Introduction | Max-Heap | Min-Heap | Heap Internal Implementation

Array - 31: Shuffle the array number | Shuffle the Cards

Array - 31: Shuffle the array number | Shuffle the Cards

Matrix - Minimum Time required to rot all oranges

Matrix - Minimum Time required to rot all oranges

Matrix - Find Number of Islands

Matrix - Find Number of Islands

Queue - Print first non-repeating character in given Stream | Using Queue & Map | Java Code

Queue - Print first non-repeating character in given Stream | Using Queue & Map | Java Code

Array - 30: Get Maximum of all sub-arrays of size K

Array - 30: Get Maximum of all sub-arrays of size K

LRU Cache Implementation | Codewise explanation using Queue & Map | Java Code

LRU Cache Implementation | Codewise explanation using Queue & Map | Java Code

Stack - Get Minimum element in O(1) operation from Stack

Stack - Get Minimum element in O(1) operation from Stack

Stack - Print next larger element of each array element

Stack - Print next larger element of each array element

Stack - Implement Stack using Queue

Stack - Implement Stack using Queue

Queue - Implement Queue using Stack | Code in Java

Queue - Implement Queue using Stack | Code in Java

DP - 25: Count all Palindrome sub-string in given String

DP - 25: Count all Palindrome sub-string in given String

DP - 24: Minimum Deletion to make a String Palindrome

DP - 24: Minimum Deletion to make a String Palindrome

DP - 23: Find maximum sum of array elements if consecutive elements are not allowed

DP - 23: Find maximum sum of array elements if consecutive elements are not allowed

DP - 22: Find Max pieces retrieved after cutting a piece of given length

DP - 22: Find Max pieces retrieved after cutting a piece of given length

String - 10: Longest sub-string length with no repeating characters | Java Implementation

String - 10: Longest sub-string length with no repeating characters | Java Implementation

String - 9: Find longest sub-string length with K distinct characters | Java Implementation

String - 9: Find longest sub-string length with K distinct characters | Java Implementation

String - 8: Find number of unique characters in given String | Java Implementation

String - 8: Find number of unique characters in given String | Java Implementation

Array - 29: Find sub-array with maximum sum | Kadane Algo | Largest Subarray Sum

Array - 29: Find sub-array with maximum sum | Kadane Algo | Largest Subarray Sum

Array - 28: Find smallest sub-array length with given Sum

Array - 28: Find smallest sub-array length with given Sum

Array - 27: Find Maximum Sum of sub-array with given size K

Array - 27: Find Maximum Sum of sub-array with given size K

Array - 26: Find Sub-array whose sum is equal to given sum

Array - 26: Find Sub-array whose sum is equal to given sum

DP - 21: Target Sum | (Count sets whose sum is equal to given sum if any element can be +/-)

DP - 21: Target Sum | (Count sets whose sum is equal to given sum if any element can be +/-)

DP - 20: Count of subsets with Sum equal to given Sum

DP - 20: Count of subsets with Sum equal to given Sum

DP - 19: Min jumps to reach till the end (Each value represents the max jumps it can take)

DP - 19: Min jumps to reach till the end (Each value represents the max jumps it can take)

DP - 18: Rod Cutting Problem | Cut the Road in pieces such that it gets Maximum Profit

DP - 18: Rod Cutting Problem | Cut the Road in pieces such that it gets Maximum Profit

DP - 17: Minimum Coin Change Problem | Min coins required to make given sum with given coins

DP - 17: Minimum Coin Change Problem | Min coins required to make given sum with given coins

DP - 16: Coin Change Problem | Total ways to make Sum from given coins

DP - 16: Coin Change Problem | Total ways to make Sum from given coins

DP - 15: Unbounded Knapsack | Get Max Profit for a given capacity | Given weights & their profits

DP - 15: Unbounded Knapsack | Get Max Profit for a given capacity | Given weights & their profits

Matrix - 3: Find number of elements greater than given value in row & column wise Sorted Matrix

Matrix - 3: Find number of elements greater than given value in row & column wise Sorted Matrix

Matrix - 2: Find number of elements lesser than or equal to given value in Sorted Matrix

Matrix - 2: Find number of elements lesser than or equal to given value in Sorted Matrix

Matrix - 1: Find element in row & column wise Sorted Matrix

Matrix - 1: Find element in row & column wise Sorted Matrix

DP - 14: Partition Set into two Subset such that Subset Sum have Minimum Difference

DP - 14: Partition Set into two Subset such that Subset Sum have Minimum Difference

DP - 13: Check if Equal sum partition exists of given array

DP - 13: Check if Equal sum partition exists of given array

DP - 12: Subset Sum Problem (If there exists a subset with sum equal to given sum)

DP - 12: Subset Sum Problem (If there exists a subset with sum equal to given sum)

Linked list - 85: Delete Largest element from Linked list

Linked list - 85: Delete Largest element from Linked list

Linked List - 84: Get Largest/Smallest element in Linked List

Linked List - 84: Get Largest/Smallest element in Linked List

DP - 11: 0/1 Knapsack Problem | Get max profit for given weights & their profit for a capacity

DP - 11: 0/1 Knapsack Problem | Get max profit for given weights & their profit for a capacity

DP-10: Longest Palindromic Substring

DP-10: Longest Palindromic Substring