sanjeev2552
sanjeev2552
  1. Python | askopenfile() function in Tkinter
  2. Python | Binding function in Tkinter
  3. Check whether an array can be made strictly decreasing by modifying at most one element
  4. Python PIL | ImageChops.subtract() and ImageChops.subtract_modulo() method
  5. Python PIL | Image.crop() method
  6. Python | Creating a button in tkinter
  7. Python | Add style to tkinter button
  8. Python | Tkinter ttk.Checkbutton and comparison with simple Checkbutton
  9. Tkinter | Adding style to the input text using ttk.Entry widget
  10. Python | How to dynamically change text of Checkbutton
  11. Python Tkinter | Create LabelFrame and add widgets to it
  12. Python | asksaveasfile() function in Tkinter
  13. Python | geometry method in Tkinter
  14. Python | after method in Tkinter
  15. Python | Menu widget in Tkinter
  16. Python | Create a digital clock using Tkinter
  17. resizable() method in Tkinter | Python
  18. minsize() method in Tkinter | Python
  19. maxsize() method in Tkinter | Python
  20. Python | Add image on a Tkinter button
  21. getdate() and setdate() function in C with Examples
  22. destroy() method in Tkinter | Python
  23. Getting screen's height and width using Tkinter | Python
  24. Progressbar widget in Tkinter | Python
  25. std::string::front() in C++with Examples
  26. std::string::back() in C++ with Examples
  27. iconphoto() method in Tkinter | Python
  28. Different messages in Tkinter | Python
  29. Collapsible Pane in Tkinter | Python
  30. Python | forget_pack() and forget_grid() method in Tkinter
  31. RadioButton in Tkinter | Python
  32. Python | winfo_ismapped() and winfo_exist() in Tkinter
  33. Python math library | isfinite() and remainder() method
  34. Check whether an array can be made strictly increasing by modifying atmost one element
  35. Python Tkinter | Moving objects using Canvas.move() method
  36. Python math library | isclose() method
  37. Python PIL | ImageEnhance.Color() and ImageEnhance.Contrast() method
  38. Python PIL | ImageChops.screen() and ImageChops.offset() method
  39. Python string | capwords() method
  40. Python | PanedWindow Widget in Tkinter
  41. Python | place() method in Tkinter
  42. Python | pack() method in Tkinter
  43. Python | grid() method in Tkinter
  44. Python Tkinter | Create different type of lines using Canvas class
  45. Python PIL | Image.new() method
  46. Python Tkinter | Create different shapes using Canvas class
  47. Python PIL | getbands() and getextrema() method
  48. Python PIL | paste() and rotate() method
  49. Python | setting and retrieving values of Tkinter variable
  50. Python PIL | ImageChops.darker() method
  51. Python PIL | Image.split() method
  52. Python | focus_set() and focus_get() method
  53. Python PIL | ImageChops.add_modulo() and ImageChops.difference() method
  54. Python PIL | ImageEnhance.Brightness() and ImageEnhance.Sharpness() method
  55. Python Tkinter | grid_location() and grid_size() method
You may use GeeksforGeeks CONTRIBUTE portal to help other geeks. For more info, please refer this.

  1. Maximum and minimum of an array using minimum number of comparisons
  2. Print all permutations with repetition of characters
  3. String matching where one string contains wildcard characters
  4. Print all ways to break a string in bracket form
  5. Kth smallest element in a row-wise and column-wise sorted 2D array | Set 1
  6. Check a given sentence for a given set of simple grammer rules
  7. Manacher's Algorithm - Linear Time Longest Palindromic Substring - Part 4
  8. Find all distinct palindromic sub-strings of a given string
  9. Build Lowest Number by Removing n digits from a given number
  10. Converting Decimal Number lying between 1 to 3999 to Roman Numerals
  11. Shortest Superstring Problem
  12. Z algorithm (Linear time pattern searching Algorithm)
  13. Count total number of N digit numbers such that the difference between sum of even and odd digits is 1
  14. Given a string, print all possible palindromic partitions
  15. Range Minimum Query (Square Root Decomposition and Sparse Table)
  16. Count number of subsets of a set with GCD equal to a given number
  17. Farey Sequence
  18. Form minimum number from given sequence
  19. Repeated subsequence of length 2 or more
  20. Find all strings formed from characters mapped to digits of a number
  21. Printing Shortest Common Supersequence
  22. Smallest Subarray with given GCD
  23. Generate all binary strings from given pattern
  24. Printing Longest Common Subsequence | Set 2 (Printing All)
  25. Remove duplicates from an array of small primes
  26. Construction of Longest Increasing Subsequence(LIS) and printing LIS sequence
  27. Printing Maximum Sum Increasing Subsequence
  28. Printing Longest Bitonic Subsequence
  29. Range LCM Queries
  30. Add elements of given arrays with given constraints
  31. Check if string follows order of characters defined by a pattern or not | Set 1
  32. Check if string follows order of characters defined by a pattern or not | Set 2
  33. Check if string follows order of characters defined by a pattern or not | Set 3
  34. Pairs of complete strings in two sets of strings
  35. Binary Indexed Tree : Range Update and Range Queries
  36. Maximum and Minimum Product Subsets
  37. Count Substrings with equal number of 0s, 1s and 2s
  38. Check if a string can become empty by recursively deleting a given sub-string
  39. Removing a number from array to make it Geometric Progression
  40. Distinct strings with odd and even changes allowed
  41. Remove a character from a string to make it a palindrome
  42. Aliquot Sequence
  43. Group all occurrences of characters according to first appearance
  44. Check for Palindrome after every character replacement Query
  45. Convert to a string that is repetition of a substring of k length
  46. Subarrays with distinct elements
  47. Check loop in array according to given constraints
  48. Program to implement Collatz Conjecture
  49. Find sum of divisors of all the divisors of a natural number
  50. Hierholzer's Algorithm for directed graph
  51. Queries for characters in a repeated string
  52. Sqrt (or Square Root) Decomposition | Set 2 (LCA of Tree in O(sqrt(height)) time)
  53. Three way partitioning of an array around a given range
  54. Minimum time required to produce m items
  55. Maximum difference between frequency of two elements such that element having greater frequency is also greater
  56. Print consecutive characters together in a line
  57. Count number of edges in an undirected graph
  58. Search in an array of strings where non-empty strings are sorted
  59. Find the largest multiple of 3 from array of digits | Set 2 (In O(n) time and O(1) space)
  60. Count ways to increase LCS length of two strings by one
  61. Find Duplicates of array using bit array
  62. 0-1 BFS (Shortest Path in a Binary Weight Graph)
  63. Different substrings in a string that start and end with given strings
  64. Sorting Strings using Bubble Sort
  65. Program to print all palindromes in a given range
  66. Check if given string can be split into four distinct strings
  67. Minimum edges required to add to make Euler Circuit
  68. Find a peak element in a 2D array
  69. Move weighting scale alternate under given constraints
  70. Karp's minimum mean (or average) weight cycle algorithm
  71. Sort an array of strings according to string lengths
  72. Convert characters of a string to opposite case
  73. Find duplicates in a given array when elements are not limited to a range
  74. Reverse an array without using subtract sign ‘-‘ anywhere in the code
  75. Ropes Data Structure (Fast String Concatenation)
  76. Shortest Uncommon Subsequence
  77. Program to remove vowels from a String
  78. Determine whether a universal sink exists in a directed graph
  79. Length Of Last Word in a String
  80. Put spaces between words starting with capital letters
  81. Print modified array after multiple array range increment operations
  82. Pyramid form (increasing then decreasing) consecutive array using reduce operations
  83. Number of elements less than or equal to a given number in a given subarray | Set 2 (Including Updates)
  84. Minimum product of k integers in an array of positive Integers
  85. String containing first letter of every word in a given string with spaces
  86. URLify a given string (Replace spaces is %20)
  87. Queries for number of distinct elements in a subarray
  88. Reverse vowels in a given string
  89. Boyer Moore Algorithm | Good Suffix heuristic
  90. Rearrange a string in sorted order followed by the integer sum
  91. Check whether the sum of absolute difference of adjacent digits is Prime or not
  92. Lexicographically n-th permutation of a string
  93. Query for ancestor-descendant relationship in a tree
  94. Maximum length substring having all same characters after k changes
  95. Distinct adjacent elements in an array
  96. Range query for Largest Sum Contiguous Subarray
  97. Count of Numbers in Range where the number does not contain more than K non zero digits
  98. Get level of a node in binary tree | iterative approach
  99. Find top k (or most frequent) numbers in a stream
  100. Number of turns to reach from one node to other in binary tree
  101. Print the longest common substring
  102. Print all Subsequences of String which Start with Vowel and End with Consonant.
  103. Longest Common Substring in an Array of Strings
  104. Print all subsequences of a string
  105. Form the smallest number using at most one swap operation
  106. Sum and Product of Prime Frequencies of Characters in a String
  107. Generating distinct subsequences of a given string in lexicographic order
  108. Best meeting point in 2D binary array
  109. All possible binary numbers of length n with equal sum in both halves
  110. Index of kth set bit in a binary array with update queries
  111. C++ Program for Longest Increasing Subsequence
  112. Check if two unsorted arrays (with duplicates allowed) have same elements
  113. Count number of digits after decimal on dividing a number
  114. Check if there is a cycle with odd weight sum in an undirected graph
  115. Array range queries over range queries
  116. Find longest bitonic sequence such that increasing and decreasing parts are from two different arrays
  117. Lexicographically first alternate vowel and consonant string
  118. Number of closing brackets needed to complete a regular bracket sequence
  119. Longest Common Subsequence with at most k changes allowed
  120. Steps to make array empty by removing maximum and its right side
  121. Lexicographically largest subsequence such that every character occurs at least k times
  122. Generate permutations with only adjacent swaps allowed
  123. Cumulative frequency of count of each element in an unsorted array
  124. No of pairs (a[j] >= a[i]) with k numbers in range (a[i], a[j]) that are divisible by x
  125. Longest subsequence of the form 0*1*0* in a binary string
  126. Check if two expressions with brackets are same
  127. Longest Increasing subarray with one change allowed
  128. Largest increasing subsequence of consecutive integers
  129. Traveling Salesman Problem (TSP) Implementation
  130. Largest number with prime digits
  131. Dividing an array into two halves of same sum
  132. Closest greater element for every array element from another array
  133. Construct lexicographically smallest palindrome
  134. Length of longest strict bitonic subsequence
  135. Sum of first K even-length Palindrome numbers
  136. Count occurrences of a word in string
  137. Print n smallest elements from given array in their original order
  138. Number of ways to insert a character to increase the LCS by one
  139. Print number of words, vowels and frequency of each character
  140. Form the largest palindromic number using atmost two swaps
  141. Find if it is possible to reach the end through given transitions
  142. Number of terms in Geometric Series with given conditions
  143. Count of subsequences having maximum distinct elements
  144. Find the Kth smallest element in the sorted generated array
  145. Subsequence queries after removing substrings
  146. Find the starting indices of the substrings in string (S) which is made by concatenating all words from a list(L)
  147. Find a string in lexicographic order which is in between given two strings
  148. Minimum number of deletions to make a string palindrome | Set 2
  149. Reverse individual words
  150. Latin alphabet cipher
  151. Convert string X to an anagram of string Y with minimum replacements
  152. Find the Degree of a Particular vertex in a Graph
  153. Partitioning into two contiguous element subarrays with equal sums
  154. Find the minimum time after which one can exchange notes
  155. Connell Sequence
  156. Removing row or column wise duplicates from matrix of characters
  157. Queries for frequencies of characters in substrings
  158. Total numbers with no repeated digits in a range
  159. Count of numbers appearing in the given ranges at-least K times
  160. Print distinct sorted permutations with duplicates allowed in input
  161. Find minimum length sub-array which has given sub-sequence in it
  162. Lowest Common Ancestor in a Binary Tree | Set 3 (Using RMQ)
  163. Find k-th smallest element in given n ranges
  164. Print Bracket Number
  165. Dynamic Programming on Trees | Set-1
  166. Lemoine's Conjecture
  167. Find k numbers which are powers of 2 and have sum N | Set 1
  168. Append a digit in the end to make the number equal to the length of the remaining string
  169. Find one extra character in a string
  170. Number of subarrays having sum exactly equal to k
  171. Eulerian Path in undirected graph
  172. Array range queries for elements with frequency same as value
  173. Program to print reciprocal of letters
  174. Array range queries for searching an element
  175. Print all funny words in a string
  176. Check for balanced parentheses in an expression | O(1) space | O(N^2) time complexity
  177. Range and Update Query for Chessboard Pieces
  178. Find the node whose sum with X has minimum set bits
  179. Program to replace a word with asterisks in a sentence
  180. Minimum number of operations to convert a given sequence into a Geometric Progression
  181. Maximum average sum partition of an array
  182. Printing longest Increasing consecutive subsequence
  183. Number of shortest paths in an unweighted and directed graph
  184. Find all palindromic sub-strings of a given string | Set 2
  185. Palindrome by swapping only one character
  186. Minimum increment/decrement to make array non-Increasing
  187. Find sub-string with given power
  188. Segment Tree | Set 2 (Range Maximum Query with Node Update)
  189. Find if given vertical level of binary tree is sorted or not
  190. Convert Hexadecimal value String to ASCII value String
  191. Print reverse string after removing vowels
  192. Program to reverse a string (Iterative and Recursive)
  193. Range query for count of set bits
  194. Queries to find distance between two nodes of a Binary tree
  195. Reverse String according to the number of words
  196. Queries to find distance between two nodes of a Binary tree - O(logn) method
  197. Given two numbers as strings, find if one is a power of other
  198. Longest arithmetic progression with the given common difference
  199. Print all possible ways to convert one string into another string | Edit-Distance
  200. Smallest number in BST which is greater than or equal to N
  201. Check if array sum can be made K by three operations on it
  202. Check for balanced parenthesis without using stack
  203. Find the node whose xor with x gives maximum value
  204. Print all distinct circular strings of length M in lexicographical order
  205. Minimum operations required to make all the elements distinct in an array
  206. Iterative Segment Tree (Range Maximum Query with Node Update)
  207. Number of subsets with sum divisible by m
  208. Perform n steps to convert every digit of a number in the format [count][digit]
  209. Program to print last N lines | Set-2
  210. Square of large number represented as String
  211. Check if concatenation of two strings is balanced or not
  212. Sum of all even frequency elements in Matrix
  213. Sum of all maximum frequency elements in Matrix
  214. Detect cycle in an undirected graph using BFS
  215. Iterative Segment Tree (Range Minimum Query)
  216. Number of elements greater than K in the range L to R using Fenwick Tree (Offline queries)
  217. Longest substring with count of 1s more than 0s
  218. Smallest Greater Element on Right Side
  219. Print all the cycles in an undirected graph
  220. Print all the combinations of a string in lexicographical order
  221. First strictly greater element in a sorted array in Java
  222. Find total number of distinct years from a string
  223. Prim's Algorithm (Simple Implementation for Adjacency Matrix Representation)
  224. Program to print the initials of a name with the surname
  225. Lexicographically smallest and largest substring of size k
  226. Next smallest prime palindrome
  227. Product of lengths of all cycles in an undirected graph
  228. Printing all subsets of {1,2,3,...n} without using array or loop
  229. Minimum operation require to make first and last character same
  230. Generating all possible Subsequences using Recursion
  231. Queries on insertion of an element in a Bitonic Sequence
  232. Printing Matrix Chain Multiplication (A Space Optimized Solution)
  233. Queries to check if a number lies in N ranges of L-R
  234. Find a palindromic string B such that given String A is a subsequense of B
  235. Print the number of set bits in each node of a Binary Tree
  236. Program to check if all characters have even frequency
  237. Find the node whose xor with x gives minimum value
  238. Remove a given word from a String
  239. Check if the elements of stack are pairwise sorted
  240. Queries to check whether a given digit is present in the given Range
  241. Modify the string such that it contains all vowels at least once
  242. Count the number of pop operations on stack to get each element of the array
  243. Arrange a binary string to get maximum value within a range of indices
  244. Sum of all odd frequency elements in an array
  245. Find if an undirected graph contains an independent set of a given size
  246. Minimum Bitwise AND operations to make any two array elements equal
  247. Minimum operations required to transform a sequence of numbers to a sequence where a[i]=a[i+2]
  248. Sum of all minimum frequency elements in Matrix
  249. Numbers that are bitwise AND of at least one non-empty sub-array
  250. Count triplets in a sorted doubly linked list whose product is equal to a given value x
  251. Online Queries for GCD of array after divide operations
  252. Remove duplicates from unsorted array using Map data structure
  253. Remove elements that appear strictly less than k times
  254. String with frequency of characters in Lucas Sequence
  255. Number of ways to partition a string into two balanced subsequences
  256. Most frequent word in first String which is not present in second String
  257. Count elements such that there are exactly X elements with values greater than or equal to X
  258. Check whether frequency of characters in a string makes Fibonacci Sequence
  259. Shortest distance to every other character from given character
  260. Count pairs in an array such that frequency of one is at least value of other
  261. Sum and product of k smallest and k largest composite numbers in the array
  262. Find number from given list for which value of the function is closest to A
  263. Minimum number of elements to be replaced to make the given array a Fibonacci Sequence
  264. Check if frequency of character in one string is a factor or multiple of frequency of same character in other string
  265. Minimum swaps to group similar characters side by side?
  266. Maximum even length sub-string that is permutation of a palindrome
  267. Detect Cycle in a Directed Graph using BFS
  268. Closest greater or same value on left side for every element in array
  269. Find largest number smaller than N with same set of digits
  270. Find closest smaller value for every element in array
  271. Find closest greater value for every element in array
  272. Find the node whose absolute difference with X gives maximum value
  273. Number of sub-strings which are anagram of any sub-string of another string
  274. Ceiling of every element in same array
  275. Move all special char to the end of the String
  276. Range and Update Sum Queries with Factorial
  277. Minimum Distance Between Words of a String
  278. Count numbers in a range having GCD of powers of prime factors equal to 1
  279. Count of Numbers in Range where first digit is equal to last digit of the number
  280. Count of Numbers in a Range where digit d occurs exactly K times
  281. Distinct palindromic sub-strings of the given string using Dynamic Programming
  282. Count of Numbers in a Range divisible by m and having digit d in even positions
  283. Find the sums for which an array can be divided into sub-arrays of equal sum
  284. Replace all occurrences of a string with space
  285. Count pairs of parentheses sequences such that parentheses are balanced
  286. Convert given string so that it holds only distinct characters
  287. Check if a binary string has two consecutive occurrences of one everywhere
  288. Program to implement Inverse Interpolation using Lagrange Formula
  289. Acronym words
  290. Count of words that are present in all the given sentences
  291. Minimum number of stacks possible using boxes of given capacities
  292. Maximum length of the sub-array whose first and last elements are same
  293. Count Numbers in Range with difference between Sum of digits at even and odd positions as Prime
  294. Count all elements in the array which appears at least K times after their first occurrence
  295. Check if frequency of characters are in Recaman Series
  296. Greatest number less than equal to B that can be formed from the digits of A
  297. Find d to maximize the number of zeros in array c[] created as c[i] = d*a[i] + b[i]
  298. Remove first adjacent pairs of similar characters until possible
  299. First string from the given array whose reverse is also present in the same array
  300. Find the numbers of strings that can be formed after processing Q queries
  301. Construct Binary Tree from given Parent Array representation | Iterative Approach
  302. Count of pairs of strings which differ in exactly one position
  303. LCA in a tree using Binary Lifting Technique
  304. Find the number of different numbers in the array after applying the given operation q times
  305. Arrange given numbers to form the smallest number
  306. Number of ways of choosing K equal substrings of any length for every query
  307. Detect cycle in the graph using degrees of nodes of graph
  308. Print the first and last character of each word in a String
  309. Divide array into increasing and decreasing subsequence without changing the order
  310. Number of Positions to partition the string such that atleast m characters with same frequency are present in each substring
  311. Find the number of sub arrays in the permutation of first N natural numbers such that their median is M
  312. Count arrays of length K whose product of elements is same as that of given array
  313. Number of times the given string occurs in the array in the range [l, r]
  314. Check if a directed graph is connected or not
  315. Roots of the quadratic equation when a + b + c = 0 without using Shridharacharya formula
  316. Convert Directed Graph into a Tree
  317. Bellman Ford Algorithm (Simple Implementation)
  318. Find a number which give minimum sum when XOR with every number of array of integers
  319. Maximize the size of array by deleting exactly k sub-arrays to make array prime
  320. Find the node whose sum with X has maximum set bits
  321. Find the node whose absolute difference with X gives minimum value
  322. Find the time which is palindromic and comes after the given time
  323. Minimum number of pairs required to make two strings same
  324. Sort an alphanumeric string such that the positions of alphabets and numbers remain unchanged
  325. Reduce the array to a single integer with the given operation
  326. Queries to find the last non-repeating character in the sub-string of a given string
  327. Count the nodes of the given tree whose weighted string is a palindrome
  328. Maximum Sum Subsequence of length k
  329. Find max length odd parity substring
  330. Queries to check if string B exists as substring in string A
  331. Print all the nodes except the leftmost node in every level of the given binary tree
  332. Queries for number of distinct elements in a subarray | Set 2
  333. Queries to find the first non-repeating character in the sub-string of a string
  334. Count of integers in a range which have even number of odd digits and odd number of even digits
  335. Maximum number of nodes which can be reached from each node in a graph.
  336. Case-specific Sorting of Strings
  337. Count numbers in given range such that sum of even digits is greater than sum of odd digits
  338. Minimum operations required to make every element greater than or equal to K
  339. Flip minimum signs of array elements to get minimum sum of positive elements possible
  340. Encrypt the given string with the following operations
  341. Maximum XOR with given value in the path from root to given node in the tree
  342. Find the longest string that can be made up of other strings from the array
  343. Find a partition point in array to maximize its xor sum
  344. Find distinct characters in distinct substrings of a string
  345. Number of N length sequences whose product is M
  346. Number formed by the rightmost set bit in N
  347. Partition an array of non-negative integers into two subsets such that average of both the subsets is equal
  348. Check if all the elements can be made equal on dividing with X and Y
  349. Generate all possible strings such that char at index i is either str1[i] or str2[i]
  350. Distinct strings such that they contains given strings as sub-sequences
  351. Case-specific sorting of Strings in O(n) time and O(1) space
  352. Longest subsequence such that every element in the subsequence is formed by multiplying previous element with a prime
  353. Probability of distributing M items among X bags such that first bag contains N items
  354. Minimum Bitwise OR operations to make any two array elements equal
  355. Divide the array in K segments such that the sum of minimums is maximized
  356. Find array such that no subarray has xor zero or Y
  357. Maximum value after merging all elements in the array
  358. Map every character of one string to another such that all occurrences are mapped to the same character
  359. Alternate XOR operations on sorted array
  360. Removing a number from array without changing its arithmetic mean
  361. Number of balanced parenthesis substrings
  362. Check whether a large number represented as array is divisible by Y
  363. Check whether the triangle is valid or not if angles are given
  364. Remove minimum elements from the array such that 2*min becomes more than max
  365. Longest subsequence with at least one character appearing in every string
  366. Insert a Character in a Rotated String
  367. Find maximum and minimum element in binary tree without using recursion or stack or queue
  368. Gijswijt's Sequence
  369. Queries to print the character that occurs the maximum number of times in a given range
  370. Nambiar Number Generator
  371. Recursive program to replace all occurrences of pi with 3.14 in a given string
  372. Repeat substrings of the given String required number of times
  373. Concentric Hexagonal Numbers
  374. Find the diagonal of the Cube
  375. Find the number of cells in the table contains X
  376. Nearest greater number by interchanging the digits
  377. Lexicographically smallest string formed by appending a character from first K characters of a string | Set 2
  378. Lexicographical smallest alternate Array
  379. Round the given number to nearest multiple of 10 | Set-2
  380. Find number of triplets in array such that a[i]>a[j]>a[k] and i<j<k
  381. Count smaller elements on right side and greater elements on left side using Binary Index Tree
  382. Program to duplicate Vowels in String
  383. Shortest cycle in an undirected unweighted graph
  384. Check if string can be rearranged so that every Odd length Substring is Palindrome
  385. Find F(n) when F(i) and F(j) of a sequence are given
  386. Delete the last leaf node in a Binary Tree
  387. Check if a cycle of length 3 exists or not in a graph that satisfy a given condition
  388. Find if a degree sequence can form a simple graph | Havel-Hakimi Algorithm
  389. Count number of substrings of a string consisting of same characters
  390. Check if the bracket sequence can be balanced with at most one change in the position of a bracket
  391. Find the longest sub-string which is prefix, suffix and also present inside the string | Set 2
  392. Print characters having prime frequencies in order of occurrence
  393. Perform append, update, delete and range sum queries on the given array
  394. Absolute difference between the XOR of Non-Prime numbers and Prime numbers of an Array
  395. Find the maximum possible Binary Number from given string
  396. XOR of K largest prime and composite numbers from the given array
  397. XOR of K smallest prime and composite numbers from the given array
  398. Convert N to M with given operations using dynamic programming
  399. Find maximum count of duplicate nodes in a Binary Search Tree
  400. Generate Binary Strings of length N using Branch and Bound
  401. Length of the longest subsegment which is UpDown after inserting atmost one integer
  402. Minimum numbers with one's place as 9 to be added to get N
  403. Find distance of nodes from root in a tree for multiple queries
  404. Maximum height of the binary search tree created from the given array
  405. Count of triplets in an array that satisfy the given conditions
  406. Check if any K ranges overlap at any point
  407. Maximum circular subarray sum of size K
  408. Sum of subsets of all the subsets of an array | O(3^N)
  409. Longest subsequence with a given AND value
  410. Minimum number to be added to all digits of X to make X > Y
  411. Check whether the string S1 can be made equal to S2 with the given operation
  412. Minimum number of edges that need to be added to form a triangle
  413. Kth ancestor of a node in an N-ary tree using Binary Lifting Technique
  414. Count of numbers whose sum of increasing powers of digits is equal to the number itself