- Python | askopenfile() function in Tkinter
- Python | Binding function in Tkinter
- Check whether an array can be made strictly decreasing by modifying at most one element
- Python PIL | ImageChops.subtract() and ImageChops.subtract_modulo() method
- Python PIL | Image.crop() method
- Python | Creating a button in tkinter
- Python | Add style to tkinter button
- Python | Tkinter ttk.Checkbutton and comparison with simple Checkbutton
- Tkinter | Adding style to the input text using ttk.Entry widget
- Python | How to dynamically change text of Checkbutton
- Python Tkinter | Create LabelFrame and add widgets to it
- Python | asksaveasfile() function in Tkinter
- Python | geometry method in Tkinter
- Python | after method in Tkinter
- Python | Menu widget in Tkinter
- Python | Create a digital clock using Tkinter
- resizable() method in Tkinter | Python
- minsize() method in Tkinter | Python
- maxsize() method in Tkinter | Python
- Python | Add image on a Tkinter button
- getdate() and setdate() function in C with Examples
- destroy() method in Tkinter | Python
- Getting screen's height and width using Tkinter | Python
- Progressbar widget in Tkinter | Python
- std::string::front() in C++with Examples
- std::string::back() in C++ with Examples
- iconphoto() method in Tkinter | Python
- Different messages in Tkinter | Python
- Collapsible Pane in Tkinter | Python
- Python | forget_pack() and forget_grid() method in Tkinter
- RadioButton in Tkinter | Python
- Python | winfo_ismapped() and winfo_exist() in Tkinter
- Python math library | isfinite() and remainder() method
- Check whether an array can be made strictly increasing by modifying atmost one element
- Python Tkinter | Moving objects using Canvas.move() method
- Python math library | isclose() method
- Python PIL | ImageEnhance.Color() and ImageEnhance.Contrast() method
- Python PIL | ImageChops.screen() and ImageChops.offset() method
- Python string | capwords() method
- Python | PanedWindow Widget in Tkinter
- Python | place() method in Tkinter
- Python | pack() method in Tkinter
- Python | grid() method in Tkinter
- Python Tkinter | Create different type of lines using Canvas class
- Python PIL | Image.new() method
- Python Tkinter | Create different shapes using Canvas class
- Python PIL | getbands() and getextrema() method
- Python PIL | paste() and rotate() method
- Python | setting and retrieving values of Tkinter variable
- Python PIL | ImageChops.darker() method
- Python PIL | Image.split() method
- Python | focus_set() and focus_get() method
- Python PIL | ImageChops.add_modulo() and ImageChops.difference() method
- Python PIL | ImageEnhance.Brightness() and ImageEnhance.Sharpness() method
- Python Tkinter | grid_location() and grid_size() method

- Maximum and minimum of an array using minimum number of comparisons
- Print all permutations with repetition of characters
- String matching where one string contains wildcard characters
- Print all ways to break a string in bracket form
- Kth smallest element in a row-wise and column-wise sorted 2D array | Set 1
- Check a given sentence for a given set of simple grammer rules
- Manacher's Algorithm - Linear Time Longest Palindromic Substring - Part 4
- Find all distinct palindromic sub-strings of a given string
- Build Lowest Number by Removing n digits from a given number
- Converting Decimal Number lying between 1 to 3999 to Roman Numerals
- Shortest Superstring Problem
- Z algorithm (Linear time pattern searching Algorithm)
- Count total number of N digit numbers such that the difference between sum of even and odd digits is 1
- Given a string, print all possible palindromic partitions
- Range Minimum Query (Square Root Decomposition and Sparse Table)
- Count number of subsets of a set with GCD equal to a given number
- Farey Sequence
- Form minimum number from given sequence
- Repeated subsequence of length 2 or more
- Find all strings formed from characters mapped to digits of a number
- Printing Shortest Common Supersequence
- Smallest Subarray with given GCD
- Generate all binary strings from given pattern
- Printing Longest Common Subsequence | Set 2 (Printing All)
- Remove duplicates from an array of small primes
- Construction of Longest Increasing Subsequence(LIS) and printing LIS sequence
- Printing Maximum Sum Increasing Subsequence
- Printing Longest Bitonic Subsequence
- Range LCM Queries
- Add elements of given arrays with given constraints
- Check if string follows order of characters defined by a pattern or not | Set 1
- Check if string follows order of characters defined by a pattern or not | Set 2
- Check if string follows order of characters defined by a pattern or not | Set 3
- Pairs of complete strings in two sets of strings
- Binary Indexed Tree : Range Update and Range Queries
- Maximum and Minimum Product Subsets
- Count Substrings with equal number of 0s, 1s and 2s
- Check if a string can become empty by recursively deleting a given sub-string
- Removing a number from array to make it Geometric Progression
- Distinct strings with odd and even changes allowed
- Remove a character from a string to make it a palindrome
- Aliquot Sequence
- Group all occurrences of characters according to first appearance
- Check for Palindrome after every character replacement Query
- Convert to a string that is repetition of a substring of k length
- Subarrays with distinct elements
- Check loop in array according to given constraints
- Program to implement Collatz Conjecture
- Find sum of divisors of all the divisors of a natural number
- Hierholzer's Algorithm for directed graph
- Queries for characters in a repeated string
- Sqrt (or Square Root) Decomposition | Set 2 (LCA of Tree in O(sqrt(height)) time)
- Three way partitioning of an array around a given range
- Minimum time required to produce m items
- Maximum difference between frequency of two elements such that element having greater frequency is also greater
- Print consecutive characters together in a line
- Count number of edges in an undirected graph
- Search in an array of strings where non-empty strings are sorted
- Find the largest multiple of 3 from array of digits | Set 2 (In O(n) time and O(1) space)
- Count ways to increase LCS length of two strings by one
- Find Duplicates of array using bit array
- 0-1 BFS (Shortest Path in a Binary Weight Graph)
- Different substrings in a string that start and end with given strings
- Sorting Strings using Bubble Sort
- Program to print all palindromes in a given range
- Check if given string can be split into four distinct strings
- Minimum edges required to add to make Euler Circuit
- Find a peak element in a 2D array
- Move weighting scale alternate under given constraints
- Karp's minimum mean (or average) weight cycle algorithm
- Sort an array of strings according to string lengths
- Convert characters of a string to opposite case
- Find duplicates in a given array when elements are not limited to a range
- Reverse an array without using subtract sign ‘-‘ anywhere in the code
- Ropes Data Structure (Fast String Concatenation)
- Shortest Uncommon Subsequence
- Program to remove vowels from a String
- Determine whether a universal sink exists in a directed graph
- Length Of Last Word in a String
- Put spaces between words starting with capital letters
- Print modified array after multiple array range increment operations
- Pyramid form (increasing then decreasing) consecutive array using reduce operations
- Number of elements less than or equal to a given number in a given subarray | Set 2 (Including Updates)
- Minimum product of k integers in an array of positive Integers
- String containing first letter of every word in a given string with spaces
- URLify a given string (Replace spaces is %20)
- Queries for number of distinct elements in a subarray
- Reverse vowels in a given string
- Boyer Moore Algorithm | Good Suffix heuristic
- Rearrange a string in sorted order followed by the integer sum
- Check whether the sum of absolute difference of adjacent digits is Prime or not
- Lexicographically n-th permutation of a string
- Query for ancestor-descendant relationship in a tree
- Maximum length substring having all same characters after k changes
- Distinct adjacent elements in an array
- Range query for Largest Sum Contiguous Subarray
- Count of Numbers in Range where the number does not contain more than K non zero digits
- Get level of a node in binary tree | iterative approach
- Find top k (or most frequent) numbers in a stream
- Number of turns to reach from one node to other in binary tree
- Print the longest common substring
- Print all Subsequences of String which Start with Vowel and End with Consonant.
- Longest Common Substring in an Array of Strings
- Print all subsequences of a string
- Form the smallest number using at most one swap operation
- Sum and Product of Prime Frequencies of Characters in a String
- Generating distinct subsequences of a given string in lexicographic order
- Best meeting point in 2D binary array
- All possible binary numbers of length n with equal sum in both halves
- Index of kth set bit in a binary array with update queries
- C++ Program for Longest Increasing Subsequence
- Check if two unsorted arrays (with duplicates allowed) have same elements
- Count number of digits after decimal on dividing a number
- Check if there is a cycle with odd weight sum in an undirected graph
- Array range queries over range queries
- Find longest bitonic sequence such that increasing and decreasing parts are from two different arrays
- Lexicographically first alternate vowel and consonant string
- Number of closing brackets needed to complete a regular bracket sequence
- Longest Common Subsequence with at most k changes allowed
- Steps to make array empty by removing maximum and its right side
- Lexicographically largest subsequence such that every character occurs at least k times
- Generate permutations with only adjacent swaps allowed
- Cumulative frequency of count of each element in an unsorted array
- No of pairs (a[j] >= a[i]) with k numbers in range (a[i], a[j]) that are divisible by x
- Longest subsequence of the form 0*1*0* in a binary string
- Check if two expressions with brackets are same
- Longest Increasing subarray with one change allowed
- Largest increasing subsequence of consecutive integers
- Traveling Salesman Problem (TSP) Implementation
- Largest number with prime digits
- Dividing an array into two halves of same sum
- Closest greater element for every array element from another array
- Construct lexicographically smallest palindrome
- Length of longest strict bitonic subsequence
- Sum of first K even-length Palindrome numbers
- Count occurrences of a word in string
- Print n smallest elements from given array in their original order
- Number of ways to insert a character to increase the LCS by one
- Print number of words, vowels and frequency of each character
- Form the largest palindromic number using atmost two swaps
- Find if it is possible to reach the end through given transitions
- Number of terms in Geometric Series with given conditions
- Count of subsequences having maximum distinct elements
- Find the Kth smallest element in the sorted generated array
- Subsequence queries after removing substrings
- Find the starting indices of the substrings in string (S) which is made by concatenating all words from a list(L)
- Find a string in lexicographic order which is in between given two strings
- Minimum number of deletions to make a string palindrome | Set 2
- Reverse individual words
- Latin alphabet cipher
- Convert string X to an anagram of string Y with minimum replacements
- Find the Degree of a Particular vertex in a Graph
- Partitioning into two contiguous element subarrays with equal sums
- Find the minimum time after which one can exchange notes
- Connell Sequence
- Removing row or column wise duplicates from matrix of characters
- Queries for frequencies of characters in substrings
- Total numbers with no repeated digits in a range
- Count of numbers appearing in the given ranges at-least K times
- Print distinct sorted permutations with duplicates allowed in input
- Find minimum length sub-array which has given sub-sequence in it
- Lowest Common Ancestor in a Binary Tree | Set 3 (Using RMQ)
- Find k-th smallest element in given n ranges
- Print Bracket Number
- Dynamic Programming on Trees | Set-1
- Lemoine's Conjecture
- Find k numbers which are powers of 2 and have sum N | Set 1
- Append a digit in the end to make the number equal to the length of the remaining string
- Find one extra character in a string
- Number of subarrays having sum exactly equal to k
- Eulerian Path in undirected graph
- Array range queries for elements with frequency same as value
- Program to print reciprocal of letters
- Array range queries for searching an element
- Print all funny words in a string
- Check for balanced parentheses in an expression | O(1) space | O(N^2) time complexity
- Range and Update Query for Chessboard Pieces
- Find the node whose sum with X has minimum set bits
- Program to replace a word with asterisks in a sentence
- Minimum number of operations to convert a given sequence into a Geometric Progression
- Maximum average sum partition of an array
- Printing longest Increasing consecutive subsequence
- Number of shortest paths in an unweighted and directed graph
- Find all palindromic sub-strings of a given string | Set 2
- Palindrome by swapping only one character
- Minimum increment/decrement to make array non-Increasing
- Find sub-string with given power
- Segment Tree | Set 2 (Range Maximum Query with Node Update)
- Find if given vertical level of binary tree is sorted or not
- Convert Hexadecimal value String to ASCII value String
- Print reverse string after removing vowels
- Program to reverse a string (Iterative and Recursive)
- Range query for count of set bits
- Queries to find distance between two nodes of a Binary tree
- Reverse String according to the number of words
- Queries to find distance between two nodes of a Binary tree - O(logn) method
- Given two numbers as strings, find if one is a power of other
- Longest arithmetic progression with the given common difference
- Print all possible ways to convert one string into another string | Edit-Distance
- Smallest number in BST which is greater than or equal to N
- Check if array sum can be made K by three operations on it
- Check for balanced parenthesis without using stack
- Find the node whose xor with x gives maximum value
- Print all distinct circular strings of length M in lexicographical order
- Minimum operations required to make all the elements distinct in an array
- Iterative Segment Tree (Range Maximum Query with Node Update)
- Number of subsets with sum divisible by m
- Perform n steps to convert every digit of a number in the format [count][digit]
- Program to print last N lines | Set-2
- Square of large number represented as String
- Check if concatenation of two strings is balanced or not
- Sum of all even frequency elements in Matrix
- Sum of all maximum frequency elements in Matrix
- Detect cycle in an undirected graph using BFS
- Iterative Segment Tree (Range Minimum Query)
- Number of elements greater than K in the range L to R using Fenwick Tree (Offline queries)
- Longest substring with count of 1s more than 0s
- Smallest Greater Element on Right Side
- Print all the cycles in an undirected graph
- Print all the combinations of a string in lexicographical order
- First strictly greater element in a sorted array in Java
- Find total number of distinct years from a string
- Prim's Algorithm (Simple Implementation for Adjacency Matrix Representation)
- Program to print the initials of a name with the surname
- Lexicographically smallest and largest substring of size k
- Next smallest prime palindrome
- Product of lengths of all cycles in an undirected graph
- Printing all subsets of {1,2,3,...n} without using array or loop
- Minimum operation require to make first and last character same
- Generating all possible Subsequences using Recursion
- Queries on insertion of an element in a Bitonic Sequence
- Printing Matrix Chain Multiplication (A Space Optimized Solution)
- Queries to check if a number lies in N ranges of L-R
- Find a palindromic string B such that given String A is a subsequense of B
- Print the number of set bits in each node of a Binary Tree
- Program to check if all characters have even frequency
- Find the node whose xor with x gives minimum value
- Remove a given word from a String
- Check if the elements of stack are pairwise sorted
- Queries to check whether a given digit is present in the given Range
- Modify the string such that it contains all vowels at least once
- Count the number of pop operations on stack to get each element of the array
- Arrange a binary string to get maximum value within a range of indices
- Sum of all odd frequency elements in an array
- Find if an undirected graph contains an independent set of a given size
- Minimum Bitwise AND operations to make any two array elements equal
- Minimum operations required to transform a sequence of numbers to a sequence where a[i]=a[i+2]
- Sum of all minimum frequency elements in Matrix
- Numbers that are bitwise AND of at least one non-empty sub-array
- Count triplets in a sorted doubly linked list whose product is equal to a given value x
- Online Queries for GCD of array after divide operations
- Remove duplicates from unsorted array using Map data structure
- Remove elements that appear strictly less than k times
- String with frequency of characters in Lucas Sequence
- Number of ways to partition a string into two balanced subsequences
- Most frequent word in first String which is not present in second String
- Count elements such that there are exactly X elements with values greater than or equal to X
- Check whether frequency of characters in a string makes Fibonacci Sequence
- Shortest distance to every other character from given character
- Count pairs in an array such that frequency of one is at least value of other
- Sum and product of k smallest and k largest composite numbers in the array
- Find number from given list for which value of the function is closest to A
- Minimum number of elements to be replaced to make the given array a Fibonacci Sequence
- Check if frequency of character in one string is a factor or multiple of frequency of same character in other string
- Minimum swaps to group similar characters side by side?
- Maximum even length sub-string that is permutation of a palindrome
- Detect Cycle in a Directed Graph using BFS
- Closest greater or same value on left side for every element in array
- Find largest number smaller than N with same set of digits
- Find closest smaller value for every element in array
- Find closest greater value for every element in array
- Find the node whose absolute difference with X gives maximum value
- Number of sub-strings which are anagram of any sub-string of another string
- Ceiling of every element in same array
- Move all special char to the end of the String
- Range and Update Sum Queries with Factorial
- Minimum Distance Between Words of a String
- Count numbers in a range having GCD of powers of prime factors equal to 1
- Count of Numbers in Range where first digit is equal to last digit of the number
- Count of Numbers in a Range where digit d occurs exactly K times
- Distinct palindromic sub-strings of the given string using Dynamic Programming
- Count of Numbers in a Range divisible by m and having digit d in even positions
- Find the sums for which an array can be divided into sub-arrays of equal sum
- Replace all occurrences of a string with space
- Count pairs of parentheses sequences such that parentheses are balanced
- Convert given string so that it holds only distinct characters
- Check if a binary string has two consecutive occurrences of one everywhere
- Program to implement Inverse Interpolation using Lagrange Formula
- Acronym words
- Count of words that are present in all the given sentences
- Minimum number of stacks possible using boxes of given capacities
- Maximum length of the sub-array whose first and last elements are same
- Count Numbers in Range with difference between Sum of digits at even and odd positions as Prime
- Count all elements in the array which appears at least K times after their first occurrence
- Check if frequency of characters are in Recaman Series
- Greatest number less than equal to B that can be formed from the digits of A
- Find d to maximize the number of zeros in array c[] created as c[i] = d*a[i] + b[i]
- Remove first adjacent pairs of similar characters until possible
- First string from the given array whose reverse is also present in the same array
- Find the numbers of strings that can be formed after processing Q queries
- Construct Binary Tree from given Parent Array representation | Iterative Approach
- Count of pairs of strings which differ in exactly one position
- LCA in a tree using Binary Lifting Technique
- Find the number of different numbers in the array after applying the given operation q times
- Arrange given numbers to form the smallest number
- Number of ways of choosing K equal substrings of any length for every query
- Detect cycle in the graph using degrees of nodes of graph
- Print the first and last character of each word in a String
- Divide array into increasing and decreasing subsequence without changing the order
- Number of Positions to partition the string such that atleast m characters with same frequency are present in each substring
- Find the number of sub arrays in the permutation of first N natural numbers such that their median is M
- Count arrays of length K whose product of elements is same as that of given array
- Number of times the given string occurs in the array in the range [l, r]
- Check if a directed graph is connected or not
- Roots of the quadratic equation when a + b + c = 0 without using Shridharacharya formula
- Convert Directed Graph into a Tree
- Bellman Ford Algorithm (Simple Implementation)
- Find a number which give minimum sum when XOR with every number of array of integers
- Maximize the size of array by deleting exactly k sub-arrays to make array prime
- Find the node whose sum with X has maximum set bits
- Find the node whose absolute difference with X gives minimum value
- Find the time which is palindromic and comes after the given time
- Minimum number of pairs required to make two strings same
- Sort an alphanumeric string such that the positions of alphabets and numbers remain unchanged
- Reduce the array to a single integer with the given operation
- Queries to find the last non-repeating character in the sub-string of a given string
- Count the nodes of the given tree whose weighted string is a palindrome
- Maximum Sum Subsequence of length k
- Find max length odd parity substring
- Queries to check if string B exists as substring in string A
- Print all the nodes except the leftmost node in every level of the given binary tree
- Queries for number of distinct elements in a subarray | Set 2
- Queries to find the first non-repeating character in the sub-string of a string
- Count of integers in a range which have even number of odd digits and odd number of even digits
- Maximum number of nodes which can be reached from each node in a graph.
- Case-specific Sorting of Strings
- Count numbers in given range such that sum of even digits is greater than sum of odd digits
- Minimum operations required to make every element greater than or equal to K
- Flip minimum signs of array elements to get minimum sum of positive elements possible
- Encrypt the given string with the following operations
- Maximum XOR with given value in the path from root to given node in the tree
- Find the longest string that can be made up of other strings from the array
- Find a partition point in array to maximize its xor sum
- Find distinct characters in distinct substrings of a string
- Number of N length sequences whose product is M
- Number formed by the rightmost set bit in N
- Partition an array of non-negative integers into two subsets such that average of both the subsets is equal
- Check if all the elements can be made equal on dividing with X and Y
- Generate all possible strings such that char at index i is either str1[i] or str2[i]
- Distinct strings such that they contains given strings as sub-sequences
- Case-specific sorting of Strings in O(n) time and O(1) space
- Longest subsequence such that every element in the subsequence is formed by multiplying previous element with a prime
- Probability of distributing M items among X bags such that first bag contains N items
- Minimum Bitwise OR operations to make any two array elements equal
- Divide the array in K segments such that the sum of minimums is maximized
- Find array such that no subarray has xor zero or Y
- Maximum value after merging all elements in the array
- Map every character of one string to another such that all occurrences are mapped to the same character
- Alternate XOR operations on sorted array
- Removing a number from array without changing its arithmetic mean
- Number of balanced parenthesis substrings
- Check whether a large number represented as array is divisible by Y
- Check whether the triangle is valid or not if angles are given
- Remove minimum elements from the array such that 2*min becomes more than max
- Longest subsequence with at least one character appearing in every string
- Insert a Character in a Rotated String
- Find maximum and minimum element in binary tree without using recursion or stack or queue
- Gijswijt's Sequence
- Queries to print the character that occurs the maximum number of times in a given range
- Nambiar Number Generator
- Recursive program to replace all occurrences of pi with 3.14 in a given string
- Repeat substrings of the given String required number of times
- Concentric Hexagonal Numbers
- Find the diagonal of the Cube
- Find the number of cells in the table contains X
- Nearest greater number by interchanging the digits
- Lexicographically smallest string formed by appending a character from first K characters of a string | Set 2
- Lexicographical smallest alternate Array
- Round the given number to nearest multiple of 10 | Set-2
- Find number of triplets in array such that a[i]>a[j]>a[k] and i<j<k
- Count smaller elements on right side and greater elements on left side using Binary Index Tree
- Program to duplicate Vowels in String
- Shortest cycle in an undirected unweighted graph
- Check if string can be rearranged so that every Odd length Substring is Palindrome
- Find F(n) when F(i) and F(j) of a sequence are given
- Delete the last leaf node in a Binary Tree
- Check if a cycle of length 3 exists or not in a graph that satisfy a given condition
- Find if a degree sequence can form a simple graph | Havel-Hakimi Algorithm
- Count number of substrings of a string consisting of same characters
- Check if the bracket sequence can be balanced with at most one change in the position of a bracket
- Find the longest sub-string which is prefix, suffix and also present inside the string | Set 2
- Print characters having prime frequencies in order of occurrence
- Perform append, update, delete and range sum queries on the given array
- Absolute difference between the XOR of Non-Prime numbers and Prime numbers of an Array
- Find the maximum possible Binary Number from given string
- XOR of K largest prime and composite numbers from the given array
- XOR of K smallest prime and composite numbers from the given array
- Convert N to M with given operations using dynamic programming
- Find maximum count of duplicate nodes in a Binary Search Tree
- Generate Binary Strings of length N using Branch and Bound
- Length of the longest subsegment which is UpDown after inserting atmost one integer
- Minimum numbers with one's place as 9 to be added to get N
- Find distance of nodes from root in a tree for multiple queries
- Maximum height of the binary search tree created from the given array
- Count of triplets in an array that satisfy the given conditions
- Check if any K ranges overlap at any point
- Maximum circular subarray sum of size K
- Sum of subsets of all the subsets of an array | O(3^N)
- Longest subsequence with a given AND value
- Minimum number to be added to all digits of X to make X > Y
- Check whether the string S1 can be made equal to S2 with the given operation
- Minimum number of edges that need to be added to form a triangle
- Kth ancestor of a node in an N-ary tree using Binary Lifting Technique
- Count of numbers whose sum of increasing powers of digits is equal to the number itself