ziwenyd commited on
Commit
c6a1e2c
1 Parent(s): 838488d

Upload function_names.txt

Browse files
Files changed (1) hide show
  1. function_names.txt +717 -0
function_names.txt ADDED
@@ -0,0 +1,717 @@
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
1
+ LCS_FORMED_CONSECUTIVE_SEGMENTS_LEAST_LENGTH_K
2
+ COUNT_CHARACTERS_STRING_DISTANCE_ENGLISH_ALPHABETS
3
+ RECURSIVE_PROGRAM_PRIME_NUMBER
4
+ COUNT_DISTINCT_OCCURRENCES_AS_A_SUBSEQUENCE
5
+ CHECK_WHETHER_TWO_STRINGS_ARE_ANAGRAM_OF_EACH_OTHER
6
+ COUNT_NUMBERS_CAN_CONSTRUCTED_USING_TWO_NUMBERS
7
+ SUM_PAIRWISE_PRODUCTS
8
+ COUNT_SET_BITS_IN_AN_INTEGER
9
+ LONGEST_PALINDROME_SUBSEQUENCE_SPACE
10
+ LONGEST_EVEN_LENGTH_SUBSTRING_SUM_FIRST_SECOND_HALF
11
+ DYCK_PATH
12
+ PRINT_A_CLOSEST_STRING_THAT_DOES_NOT_CONTAIN_ADJACENT_DUPLICATES
13
+ OVERLAPPING_SUM_TWO_ARRAY
14
+ MOBILE_NUMERIC_KEYPAD_PROBLEM
15
+ CHECK_VALID_SEQUENCE_DIVISIBLE_M_1
16
+ DIFFERENCE_BETWEEN_HIGHEST_AND_LEAST_FREQUENCIES_IN_AN_ARRAY_1
17
+ WAYS_TRANSFORMING_ONE_STRING_REMOVING_0_CHARACTERS
18
+ MARKOV_MATRIX
19
+ CHOCOLATE_DISTRIBUTION_PROBLEM
20
+ FIND_DIFFERENCE_BETWEEN_SUMS_OF_TWO_DIAGONALS_1
21
+ ROW_WISE_COMMON_ELEMENTS_TWO_DIAGONALS_SQUARE_MATRIX
22
+ FIND_SUBARRAY_WITH_GIVEN_SUM_1
23
+ HYPERCUBE_GRAPH
24
+ HEXAGONAL_NUMBER
25
+ LEXICOGRAPHICALLY_NEXT_STRING
26
+ CHECK_LARGE_NUMBER_DIVISIBLE_9_NOT
27
+ FIND_THE_LARGEST_SUBARRAY_WITH_0_SUM
28
+ SUM_BINOMIAL_COEFFICIENTS_1
29
+ NUMBER_SUBSEQUENCES_STRING_DIVISIBLE_N
30
+ ADD_TWO_NUMBERS_WITHOUT_USING_ARITHMETIC_OPERATORS
31
+ COUNT_OPERATIONS_MAKE_STRINGAB_FREE
32
+ SCHEDULE_JOBS_SERVER_GETS_EQUAL_LOAD
33
+ HOW_TO_CHECK_IF_A_GIVEN_ARRAY_REPRESENTS_A_BINARY_HEAP_1
34
+ NUMBER_DIGITS_REMOVED_MAKE_NUMBER_DIVISIBLE_3
35
+ MAXIMIZE_SUM_ARRII
36
+ CHECK_WHETHER_GIVEN_DEGREES_VERTICES_REPRESENT_GRAPH_TREE
37
+ MAXIMUM_POINTS_INTERSECTION_N_CIRCLES
38
+ SUBSEQUENCES_SIZE_THREE_ARRAY_WHOSE_SUM_DIVISIBLE_M
39
+ COUNT_NUMBER_OF_WAYS_TO_PARTITION_A_SET_INTO_K_SUBSETS_1
40
+ LEONARDO_NUMBER_1
41
+ FIND_MAXIMUM_HEIGHT_PYRAMID_FROM_THE_GIVEN_ARRAY_OF_OBJECTS
42
+ MAXIMUM_NUMBER_CHOCOLATES_DISTRIBUTED_EQUALLY_AMONG_K_STUDENTS
43
+ ELEMENTS_TO_BE_ADDED_SO_THAT_ALL_ELEMENTS_OF_A_RANGE_ARE_PRESENT_IN_ARRAY
44
+ FIND_THE_MAXIMUM_ELEMENT_IN_AN_ARRAY_WHICH_IS_FIRST_INCREASING_AND_THEN_DECREASING
45
+ MAXIMUM_LENGTH_SUBSEQUENCE_DIFFERENCE_ADJACENT_ELEMENTS_EITHER_0_1
46
+ CASSINIS_IDENTITY
47
+ PROGRAM_CALCULATE_VOLUME_ELLIPSOID
48
+ MAXIMUM_XOR_VALUE_MATRIX
49
+ CHECK_ARRAY_REPRESENTS_INORDER_BINARY_SEARCH_TREE_NOT
50
+ COUNT_SUBARRAYS_EQUAL_NUMBER_1S_0S_1
51
+ FIND_SUM_NODES_GIVEN_PERFECT_BINARY_TREE_1
52
+ PROGRAM_CIRCUMFERENCE_PARALLELOGRAM
53
+ CHECK_NUMBER_IS_PERFECT_SQUARE_USING_ADDITIONSUBTRACTION
54
+ SUM_FACTORS_NUMBER
55
+ CHECK_GIVEN_STRING_ROTATION_PALINDROME
56
+ TOTAL_NUMBER_OF_NON_DECREASING_NUMBERS_WITH_N_DIGITS_1
57
+ LEXICOGRAPHICALLY_MINIMUM_STRING_ROTATION
58
+ CHECK_NUMBER_POWER_K_USING_BASE_CHANGING_METHOD
59
+ MINIMUM_NUMBER_OF_JUMPS_TO_REACH_END_OF_A_GIVEN_ARRAY_1
60
+ SORT_EVEN_NUMBERS_ASCENDING_ORDER_SORT_ODD_NUMBERS_DESCENDING_ORDER_1
61
+ SEARCH_AN_ELEMENT_IN_AN_ARRAY_WHERE_DIFFERENCE_BETWEEN_ADJACENT_ELEMENTS_IS_1
62
+ SUM_SEQUENCE_2_22_222
63
+ MAXIMUM_PRODUCT_SUBARRAY_ADDED_NEGATIVE_PRODUCT_CASE
64
+ CHECK_IF_X_CAN_GIVE_CHANGE_TO_EVERY_PERSON_IN_THE_QUEUE
65
+ MINIMUM_LENGTH_SUBARRAY_SUM_GREATER_GIVEN_VALUE
66
+ NEXT_HIGHER_NUMBER_WITH_SAME_NUMBER_OF_SET_BITS
67
+ SEARCH_INSERT_AND_DELETE_IN_A_SORTED_ARRAY_1
68
+ CONVERT_STRICTLY_INCREASING_ARRAY_MINIMUM_CHANGES
69
+ C_PROGRAM_FACTORIAL_NUMBER_1
70
+ EQUILIBRIUM_INDEX_OF_AN_ARRAY_1
71
+ HOW_CAN_WE_SUM_THE_DIGITS_OF_A_GIVEN_NUMBER_IN_SINGLE_STATEMENT
72
+ MAXIMUM_DIFFERENCE_SUM_ELEMENTS_TWO_ROWS_MATRIX
73
+ ADD_1_TO_A_GIVEN_NUMBER_1
74
+ FIND_THE_NUMBER_OCCURRING_ODD_NUMBER_OF_TIMES
75
+ FIND_HARMONIC_MEAN_USING_ARITHMETIC_MEAN_GEOMETRIC_MEAN
76
+ COUNT_ARRAYS_CONSECUTIVE_ELEMENT_DIFFERENT_VALUES
77
+ SUM_TWO_LARGE_NUMBERS
78
+ COUNT_NUMBER_OF_SOLUTIONS_OF_X2_1_MOD_P_IN_GIVEN_RANGE
79
+ MAXIMUM_SUM_2_X_N_GRID_NO_TWO_ELEMENTS_ADJACENT
80
+ SUM_OF_ALL_ELEMENTS_UP_TO_NTH_ROW_IN_A_PASCALS_TRIANGLE_1
81
+ FUNCTION_COPY_STRING_ITERATIVE_RECURSIVE_1
82
+ PROGRAM_FOR_FACTORIAL_OF_A_NUMBER
83
+ COUNT_NUMBERS_THAT_DONT_CONTAIN_3
84
+ FIND_DISTINCT_SUBSET_SUBSEQUENCE_SUMS_ARRAY
85
+ FIND_INDEX_OF_AN_EXTRA_ELEMENT_PRESENT_IN_ONE_SORTED_ARRAY_1
86
+ PAIR_WITH_GIVEN_PRODUCT_SET_1_FIND_IF_ANY_PAIR_EXISTS_1
87
+ FIND_MINIMUM_DIFFERENCE_PAIR_1
88
+ FIND_MAXIMUM_PRODUCT_OF_A_TRIPLET_IN_ARRAY
89
+ COUNT_SET_BITS_IN_AN_INTEGER_1
90
+ COUNT_SUM_OF_DIGITS_IN_NUMBERS_FROM_1_TO_N
91
+ FIND_FIRST_NATURAL_NUMBER_WHOSE_FACTORIAL_DIVISIBLE_X
92
+ MAXIMUM_SUBSEQUENCE_SUM_SUCH_THAT_NO_THREE_ARE_CONSECUTIVE
93
+ K_TH_PRIME_FACTOR_GIVEN_NUMBER
94
+ MAXIMUM_SUM_PAIRS_SPECIFIC_DIFFERENCE_1
95
+ COUNT_PALINDROMIC_SUBSEQUENCE_GIVEN_STRING
96
+ SUM_MATRIX_ELEMENT_ABSOLUTE_DIFFERENCE_ROW_COLUMN_NUMBERS_2
97
+ CHECK_LARGE_NUMBER_DIVISIBLE_3_NOT
98
+ SORT_ARRAY_TWO_HALVES_SORTED
99
+ FIND_THE_MINIMUM_DISTANCE_BETWEEN_TWO_NUMBERS
100
+ WRITE_ONE_LINE_C_FUNCTION_TO_FIND_WHETHER_A_NO_IS_POWER_OF_TWO
101
+ MINIMUM_XOR_VALUE_PAIR
102
+ SUM_DIVISORS_1_N_1
103
+ PIZZA_CUT_PROBLEM_CIRCLE_DIVISION_LINES
104
+ MAXIMUM_TRIPLET_SUM_ARRAY
105
+ MINIMUM_SUM_TWO_NUMBERS_FORMED_DIGITS_ARRAY
106
+ LONGEST_PREFIX_ALSO_SUFFIX_1
107
+ SEARCHING_ARRAY_ADJACENT_DIFFER_K
108
+ COUNT_POSSIBLE_PATHS_TOP_LEFT_BOTTOM_RIGHT_NXM_MATRIX_1
109
+ MULTIPLY_TWO_NUMBERS_WITHOUT_USING_MULTIPLY_DIVISION_BITWISE_OPERATORS_AND_NO_LOOPS
110
+ FIND_NUMBER_PAIRS_ARRAY_XOR_0
111
+ FIND_PAIR_WITH_GREATEST_PRODUCT_IN_ARRAY
112
+ NUMBER_DIGITS_PRODUCT_TWO_NUMBERS_1
113
+ COUNT_WAYS_BUILD_STREET_GIVEN_CONSTRAINTS
114
+ PROGRAM_FIND_CIRCUMFERENCE_CIRCLE
115
+ NTH_NON_FIBONACCI_NUMBER
116
+ PROGRAM_TO_CHECK_IF_A_GIVEN_NUMBER_IS_LUCKY_ALL_DIGITS_ARE_DIFFERENT
117
+ AREA_OF_A_HEXAGON
118
+ REMOVE_ARRAY_END_ELEMENT_MAXIMIZE_SUM_PRODUCT
119
+ STEINS_ALGORITHM_FOR_FINDING_GCD
120
+ FIND_WHETHER_GIVEN_INTEGER_POWER_3_NOT
121
+ MAXIMIZE_ARRJ_ARRI_ARRL_ARRK_SUCH_THAT_I_J_K_L
122
+ COUNT_MINIMUM_NUMBER_SUBSETS_SUBSEQUENCES_CONSECUTIVE_NUMBERS
123
+ EQUILIBRIUM_INDEX_OF_AN_ARRAY
124
+ LONGEST_REPEATING_SUBSEQUENCE
125
+ FAST_MULTIPLICATION_METHOD_WITHOUT_USING_MULTIPLICATION_OPERATOR_RUSSIAN_PEASANTS_ALGORITHM
126
+ FIND_THE_NUMBER_OCCURRING_ODD_NUMBER_OF_TIMES_1
127
+ SMALLEST_POWER_OF_2_GREATER_THAN_OR_EQUAL_TO_N_2
128
+ FIND_LARGEST_D_IN_ARRAY_SUCH_THAT_A_B_C_D
129
+ N_TH_ROOT_NUMBER
130
+ REPLACE_CHARACTER_C1_C2_C2_C1_STRING_S
131
+ FIND_A_FIXED_POINT_IN_A_GIVEN_ARRAY
132
+ COUNT_STRINGS_CAN_FORMED_USING_B_C_GIVEN_CONSTRAINTS_1
133
+ CHECK_ARRAY_CONTAINS_CONTIGUOUS_INTEGERS_DUPLICATES_ALLOWED_1
134
+ NUMBER_OF_TRIANGLES_IN_A_PLANE_IF_NO_MORE_THAN_TWO_POINTS_ARE_COLLINEAR
135
+ FIND_SUM_EVEN_INDEX_BINOMIAL_COEFFICIENTS
136
+ DECODE_MEDIAN_STRING_ORIGINAL_STRING
137
+ LEXICOGRAPHICAL_MAXIMUM_SUBSTRING_STRING
138
+ FIND_LARGEST_PRIME_FACTOR_NUMBER
139
+ COUNT_EVEN_LENGTH_BINARY_SEQUENCES_WITH_SAME_SUM_OF_FIRST_AND_SECOND_HALF_BITS_1
140
+ COUNT_OF_PAIRS_SATISFYING_THE_GIVEN_CONDITION
141
+ FIND_REPEATED_CHARACTER_PRESENT_FIRST_STRING_1
142
+ WILDCARD_CHARACTER_MATCHING
143
+ SMALLEST_ELEMENT_REPEATED_EXACTLY_K_TIMES_NOT_LIMITED_SMALL_RANGE
144
+ COUNT_DERANGEMENTS_PERMUTATION_SUCH_THAT_NO_ELEMENT_APPEARS_IN_ITS_ORIGINAL_POSITION_1
145
+ COUNT_INVERSIONS_OF_SIZE_THREE_IN_A_GIVE_ARRAY
146
+ BREAKING_NUMBER_FIRST_PART_INTEGRAL_DIVISION_SECOND_POWER_10
147
+ DOUBLE_FACTORIAL_1
148
+ COUNT_NUMBER_WAYS_REACH_GIVEN_SCORE_GAME
149
+ COUNT_FREQUENCY_K_MATRIX_SIZE_N_MATRIXI_J_IJ
150
+ FIND_VALUE_OF_Y_MOD_2_RAISED_TO_POWER_X
151
+ WAYS_TO_WRITE_N_AS_SUM_OF_TWO_OR_MORE_POSITIVE_INTEGERS
152
+ MAXIMUM_REMOVAL_FROM_ARRAY_WHEN_REMOVAL_TIME_WAITING_TIME
153
+ MINIMUM_CHARACTERS_ADDED_FRONT_MAKE_STRING_PALINDROME
154
+ CHECK_STRING_CAN_OBTAINED_ROTATING_ANOTHER_STRING_2_PLACES
155
+ REQUIRED_MINIMUM_DIGITS_REMOVE_NUMBER_MAKE_PERFECT_SQUARE
156
+ MINIMUM_ROTATIONS_REQUIRED_GET_STRING
157
+ MAXIMUM_SUM_IARRI_AMONG_ROTATIONS_GIVEN_ARRAY_1
158
+ SQUARE_ROOT_OF_A_PERFECT_SQUARE_1
159
+ MINIMUM_DIFFERENCE_MAX_MIN_K_SIZE_SUBSETS
160
+ SORT_ARRAY_APPLYING_GIVEN_EQUATION
161
+ ANALYSIS_OF_ALGORITHMS_SET_2_ASYMPTOTIC_ANALYSIS
162
+ ARRAY_ELEMENT_MOVED_K_USING_SINGLE_MOVES
163
+ NUMBER_DIGITS_PRODUCT_TWO_NUMBERS
164
+ FLOOR_IN_A_SORTED_ARRAY_1
165
+ HOW_CAN_WE_SUM_THE_DIGITS_OF_A_GIVEN_NUMBER_IN_SINGLE_STATEMENT_1
166
+ BREAK_NUMBER_THREE_PARTS_1
167
+ WRITE_AN_EFFICIENT_METHOD_TO_CHECK_IF_A_NUMBER_IS_MULTIPLE_OF_3
168
+ BINARY_REPRESENTATION_OF_NEXT_NUMBER
169
+ CHECK_WHETHER_GIVEN_NUMBER_EVEN_ODD
170
+ ONE_LINE_FUNCTION_FOR_FACTORIAL_OF_A_NUMBER
171
+ UGLY_NUMBERS
172
+ UNIQUE_CELLS_BINARY_MATRIX
173
+ COUNT_POSSIBLE_DECODINGS_GIVEN_DIGIT_SEQUENCE_1
174
+ PERFECT_REVERSIBLE_STRING
175
+ FIND_WHETHER_A_GIVEN_NUMBER_IS_A_POWER_OF_4_OR_NOT_2
176
+ FIND_A_ROTATION_WITH_MAXIMUM_HAMMING_DISTANCE
177
+ STOOGE_SORT
178
+ COUNT_DIGITS_FACTORIAL_SET_1
179
+ PYTHON_PROGRAM_FIND_PERIMETER_CIRCUMFERENCE_SQUARE_RECTANGLE
180
+ SPACE_OPTIMIZED_SOLUTION_LCS
181
+ SUM_PAIRWISE_PRODUCTS_2
182
+ N_TH_NUMBER_WHOSE_SUM_OF_DIGITS_IS_TEN_1
183
+ MINIMUM_OPERATION_MAKE_ELEMENTS_EQUAL_ARRAY
184
+ SUM_LARGEST_PRIME_FACTOR_NUMBER_LESS_EQUAL_N
185
+ COUNT_PAIRS_TWO_SORTED_ARRAYS_WHOSE_SUM_EQUAL_GIVEN_VALUE_X_1
186
+ PERMUTE_TWO_ARRAYS_SUM_EVERY_PAIR_GREATER_EQUAL_K
187
+ SUM_TWO_LARGE_NUMBERS_1
188
+ BREAK_NUMBER_THREE_PARTS
189
+ BELL_NUMBERS_NUMBER_OF_WAYS_TO_PARTITION_A_SET
190
+ FIND_ONE_EXTRA_CHARACTER_STRING_1
191
+ MULTIPLY_LARGE_NUMBERS_REPRESENTED_AS_STRINGS
192
+ MAXIMUM_PRODUCT_SUBSET_ARRAY
193
+ SCHEDULE_ELEVATOR_TO_REDUCE_THE_TOTAL_TIME_TAKEN
194
+ SEARCH_AN_ELEMENT_IN_A_SORTED_AND_PIVOTED_ARRAY
195
+ DECIMAL_REPRESENTATION_GIVEN_BINARY_STRING_DIVISIBLE_10_NOT
196
+ FIND_DIFFERENCE_BETWEEN_SUMS_OF_TWO_DIAGONALS
197
+ NTH_MULTIPLE_NUMBER_FIBONACCI_SERIES
198
+ PROGRAM_CHECK_ARRAY_SORTED_NOT_ITERATIVE_RECURSIVE_1
199
+ LONGEST_SUBARRAY_SUM_DIVISIBLE_K
200
+ SUM_AREA_RECTANGLES_POSSIBLE_ARRAY
201
+ MAXIMUM_DISTANCE_TWO_OCCURRENCES_ELEMENT_ARRAY
202
+ NTH_PENTAGONAL_NUMBER
203
+ SMALLEST_POWER_OF_2_GREATER_THAN_OR_EQUAL_TO_N
204
+ K_TH_ELEMENT_TWO_SORTED_ARRAYS
205
+ FIND_POSITION_GIVEN_NUMBER_AMONG_NUMBERS_MADE_4_7
206
+ FIND_WHETHER_A_GIVEN_NUMBER_IS_A_POWER_OF_4_OR_NOT
207
+ QUICK_WAY_CHECK_CHARACTERS_STRING
208
+ FIND_ROTATION_COUNT_ROTATED_SORTED_ARRAY
209
+ SWAP_ALL_ODD_AND_EVEN_BITS
210
+ QUERIES_COUNTS_ARRAY_ELEMENTS_VALUES_GIVEN_RANGE
211
+ CALCULATE_ANGLE_HOUR_HAND_MINUTE_HAND
212
+ TRIANGULAR_MATCHSTICK_NUMBER
213
+ CHECK_REVERSING_SUB_ARRAY_MAKE_ARRAY_SORTED_1
214
+ C_PROGRAM_FIND_LARGEST_ELEMENT_ARRAY_1
215
+ PROGRAM_TO_FIND_REMAINDER_WITHOUT_USING_MODULO_OR_OPERATOR
216
+ LONGEST_INCREASING_SUBSEQUENCE_1
217
+ CONSTRUCT_LEXICOGRAPHICALLY_SMALLEST_PALINDROME
218
+ REARRANGE_ARRAY_MAXIMUM_MINIMUM_FORM_SET_2_O1_EXTRA_SPACE
219
+ HORNERS_METHOD_POLYNOMIAL_EVALUATION
220
+ PAIR_WITH_GIVEN_PRODUCT_SET_1_FIND_IF_ANY_PAIR_EXISTS
221
+ FIND_LAST_DIGIT_FACTORIAL_DIVIDES_FACTORIAL_B
222
+ SQUARE_PYRAMIDAL_NUMBER_SUM_SQUARES
223
+ FIND_MINIMUM_DIFFERENCE_PAIR
224
+ POSITION_OF_RIGHTMOST_SET_BIT
225
+ STACK_PERMUTATIONS_CHECK_IF_AN_ARRAY_IS_STACK_PERMUTATION_OF_OTHER
226
+ MAXIMUM_HEIGHT_OF_TRIANGULAR_ARRANGEMENT_OF_ARRAY_VALUES_1
227
+ EULERS_CRITERION_CHECK_IF_SQUARE_ROOT_UNDER_MODULO_P_EXISTS
228
+ CHECK_IF_A_GIVEN_ARRAY_CAN_REPRESENT_PREORDER_TRAVERSAL_OF_BINARY_SEARCH_TREE
229
+ WAYS_REMOVE_ONE_ELEMENT_BINARY_STRING_XOR_BECOMES_ZERO
230
+ LONGEST_SUBSEQUENCE_SUCH_THAT_DIFFERENCE_BETWEEN_ADJACENTS_IS_ONE
231
+ FIND_MINIMUM_ELEMENT_IN_A_SORTED_AND_ROTATED_ARRAY
232
+ MINIMUM_NUMBER_OF_SQUARES_WHOSE_SUM_EQUALS_TO_GIVEN_NUMBER_N_1
233
+ MINIMUM_COST_CONNECT_WEIGHTED_NODES_REPRESENTED_ARRAY
234
+ FIND_A_TRIPLET_THAT_SUM_TO_A_GIVEN_VALUE_2
235
+ MAXIMUM_PRODUCT_INCREASING_SUBSEQUENCE
236
+ FIND_NUMBER_PERFECT_SQUARES_TWO_GIVEN_NUMBERS
237
+ SUM_SERIES_0_6_0_06_0_006_0_0006_N_TERMS
238
+ MAXIMIZE_SUM_CONSECUTIVE_DIFFERENCES_CIRCULAR_ARRAY
239
+ FINDING_POWER_PRIME_NUMBER_P_N
240
+ DYNAMIC_PROGRAMMING_SET_8_MATRIX_CHAIN_MULTIPLICATION
241
+ NON_REPEATING_ELEMENT
242
+ PRIMALITY_TEST_SET_1_INTRODUCTION_AND_SCHOOL_METHOD_1
243
+ MAXIMUM_PRODUCT_OF_4_ADJACENT_ELEMENTS_IN_MATRIX
244
+ HOW_TO_AVOID_OVERFLOW_IN_MODULAR_MULTIPLICATION
245
+ MINIMUM_COST_TO_FILL_GIVEN_WEIGHT_IN_A_BAG
246
+ PROGRAM_CENSOR_WORD_ASTERISKS_SENTENCE
247
+ FIND_EXPRESSION_DUPLICATE_PARENTHESIS_NOT
248
+ PROGRAM_FIND_SLOPE_LINE
249
+ ZECKENDORFS_THEOREM_NON_NEIGHBOURING_FIBONACCI_REPRESENTATION
250
+ SUM_OF_ALL_ELEMENTS_UP_TO_NTH_ROW_IN_A_PASCALS_TRIANGLE
251
+ NUMBER_N_DIGITS_NON_DECREASING_INTEGERS
252
+ ADD_1_TO_A_GIVEN_NUMBER
253
+ SEARCH_INSERT_AND_DELETE_IN_AN_UNSORTED_ARRAY
254
+ MAKE_LARGEST_PALINDROME_CHANGING_K_DIGITS
255
+ FIND_THE_MISSING_NUMBER_2
256
+ REMOVE_BRACKETS_ALGEBRAIC_STRING_CONTAINING_OPERATORS
257
+ FINDING_POWER_PRIME_NUMBER_P_N_1
258
+ DICE_THROW_PROBLEM_1
259
+ FIND_REPEATING_ELEMENT_SORTED_ARRAY_SIZE_N
260
+ CHANGE_ARRAY_PERMUTATION_NUMBERS_1_N
261
+ DIAGONALLY_DOMINANT_MATRIX
262
+ SMALLEST_OF_THREE_INTEGERS_WITHOUT_COMPARISON_OPERATORS
263
+ SMALLEST_SUM_CONTIGUOUS_SUBARRAY
264
+ TRIANGULAR_NUMBERS_1
265
+ CONVERTING_ONE_STRING_USING_APPEND_DELETE_LAST_OPERATIONS
266
+ FIND_THREE_ELEMENT_FROM_DIFFERENT_THREE_ARRAYS_SUCH_THAT_THAT_A_B_C_K_1
267
+ HOW_TO_PRINT_MAXIMUM_NUMBER_OF_A_USING_GIVEN_FOUR_KEYS
268
+ COUNT_DISTINCT_NON_NEGATIVE_PAIRS_X_Y_SATISFY_INEQUALITY_XX_YY_N_2
269
+ HIGHWAY_BILLBOARD_PROBLEM
270
+ COUNT_OF_OCCURRENCES_OF_A_101_PATTERN_IN_A_STRING
271
+ CHECK_INTEGER_OVERFLOW_MULTIPLICATION
272
+ CHANGE_BITS_CAN_MADE_ONE_FLIP_1
273
+ CENTER_ELEMENT_OF_MATRIX_EQUALS_SUMS_OF_HALF_DIAGONALS
274
+ MINIMIZE_SUM_PRODUCT_TWO_ARRAYS_PERMUTATIONS_ALLOWED
275
+ AREA_CIRCUMSCRIBED_CIRCLE_SQUARE
276
+ MINIMUM_INCREMENT_K_OPERATIONS_MAKE_ELEMENTS_EQUAL
277
+ RECURSIVELY_BREAK_NUMBER_3_PARTS_GET_MAXIMUM_SUM
278
+ MAXIMUM_SUM_SUBARRAY_REMOVING_ONE_ELEMENT
279
+ NUMBER_IS_DIVISIBLE_BY_29_OR_NOT
280
+ MINIMUM_PRODUCT_SUBSET_ARRAY
281
+ PRIMALITY_TEST_SET_1_INTRODUCTION_AND_SCHOOL_METHOD
282
+ FIRST_UPPERCASE_LETTER_IN_A_STRING_ITERATIVE_AND_RECURSIVE
283
+ PROGRAM_COUNT_OCCURRENCE_GIVEN_CHARACTER_STRING
284
+ FIND_SUM_ODD_FACTORS_NUMBER
285
+ CHECK_LARGE_NUMBER_DIVISIBLE_13_NOT
286
+ LARGEST_SUBSEQUENCE_GCD_GREATER_1
287
+ PRINT_WORDS_STRING_REVERSE_ORDER
288
+ PROGRAM_DECIMAL_BINARY_CONVERSION_2
289
+ MAXIMUM_NUMBER_OF_SQUARES_THAT_CAN_BE_FIT_IN_A_RIGHT_ANGLE_ISOSCELES_TRIANGLE
290
+ K_TH_DIGIT_RAISED_POWER_B
291
+ ARRAY_RANGE_QUERIES_ELEMENTS_FREQUENCY_VALUE
292
+ FIND_SUBARRAY_WITH_GIVEN_SUM
293
+ MAXIMUM_SUM_IARRI_AMONG_ROTATIONS_GIVEN_ARRAY
294
+ PRODUCT_MAXIMUM_FIRST_ARRAY_MINIMUM_SECOND
295
+ PRINT_MAXIMUM_SHORTEST_DISTANCE
296
+ NUMBER_NON_NEGATIVE_INTEGRAL_SOLUTIONS_B_C_N_1
297
+ BASIC_AND_EXTENDED_EUCLIDEAN_ALGORITHMS_1
298
+ DYNAMIC_PROGRAMMING_SET_17_PALINDROME_PARTITIONING
299
+ COUNT_WORDS_APPEAR_EXACTLY_TWO_TIMES_ARRAY_WORDS
300
+ NEXT_POWER_OF_2_2
301
+ FIND_MAXIMUM_DOT_PRODUCT_TWO_ARRAYS_INSERTION_0S
302
+ SUBARRAYS_DISTINCT_ELEMENTS
303
+ PROGRAM_FOR_FACTORIAL_OF_A_NUMBER_2
304
+ SQUARE_ROOT_OF_AN_INTEGER_1
305
+ SUM_FAI_AJ_PAIRS_ARRAY_N_INTEGERS
306
+ DIVISIBILITY_9_USING_BITWISE_OPERATORS
307
+ LEXICOGRAPHICAL_CONCATENATION_SUBSTRINGS_STRING
308
+ WRITE_A_C_PROGRAM_TO_CALCULATE_POWXN
309
+ NUMBER_SUBSEQUENCES_FORM_AI_BJ_CK
310
+ LONGEST_COMMON_SUBSTRING
311
+ CEILING_IN_A_SORTED_ARRAY_1
312
+ MAXIMUM_EQULIBRIUM_SUM_ARRAY
313
+ COUNT_FIBONACCI_NUMBERS_GIVEN_RANGE_LOG_TIME
314
+ MINIMUM_LENGTH_SUBARRAY_SUM_GREATER_GIVEN_VALUE_1
315
+ DISTRIBUTING_ITEMS_PERSON_CANNOT_TAKE_TWO_ITEMS_TYPE
316
+ FIND_THE_FIRST_MISSING_NUMBER
317
+ SWAP_BITS_IN_A_GIVEN_NUMBER
318
+ MINIMUM_COST_CUT_BOARD_SQUARES
319
+ SUM_MANHATTAN_DISTANCES_PAIRS_POINTS
320
+ FIND_INDEX_GIVEN_FIBONACCI_NUMBER_CONSTANT_TIME_1
321
+ COUNT_ENTRIES_EQUAL_TO_X_IN_A_SPECIAL_MATRIX
322
+ LONGEST_CONSECUTIVE_SUBSEQUENCE
323
+ CALCULATING_FACTORIALS_USING_STIRLING_APPROXIMATION
324
+ SPLIT_N_MAXIMUM_COMPOSITE_NUMBERS
325
+ MAXIMUM_LENGTH_PREFIX_ONE_STRING_OCCURS_SUBSEQUENCE_ANOTHER
326
+ SMALLEST_DIFFERENCE_PAIR_VALUES_TWO_UNSORTED_ARRAYS
327
+ CHECK_WHETHER_GIVEN_NUMBER_EVEN_ODD_1
328
+ MAKING_ELEMENTS_OF_TWO_ARRAYS_SAME_WITH_MINIMUM_INCREMENTDECREMENT
329
+ PROGRAM_TO_FIND_REMAINDER_WITHOUT_USING_MODULO_OR_OPERATOR_2
330
+ MAXIMUM_TRIPLET_SUM_ARRAY_1
331
+ COUNT_INDEX_PAIRS_EQUAL_ELEMENTS_ARRAY
332
+ DISTRIBUTING_M_ITEMS_CIRCLE_SIZE_N_STARTING_K_TH_POSITION
333
+ TAIL_RECURSION
334
+ COMPUTE_MODULUS_DIVISION_BY_A_POWER_OF_2_NUMBER
335
+ MIDDLE_OF_THREE_USING_MINIMUM_COMPARISONS_2
336
+ MINIMUM_INSERTIONS_SORT_ARRAY
337
+ DYNAMIC_PROGRAMMING_SET_17_PALINDROME_PARTITIONING_1
338
+ FIND_INDEX_OF_AN_EXTRA_ELEMENT_PRESENT_IN_ONE_SORTED_ARRAY
339
+ FIND_MEDIAN_ROW_WISE_SORTED_MATRIX
340
+ FIND_REPETITIVE_ELEMENT_1_N_1_2
341
+ DECIMAL_BINARY_CONVERSION_WITHOUT_USING_ARITHMETIC_OPERATORS
342
+ CHANGE_BITS_CAN_MADE_ONE_FLIP
343
+ POSITION_OF_RIGHTMOST_SET_BIT_1
344
+ CHECK_LARGE_NUMBER_DIVISIBLE_4_NOT
345
+ NUMBER_SUBSTRINGS_STRING
346
+ FIND_THE_ELEMENT_BEFORE_WHICH_ALL_THE_ELEMENTS_ARE_SMALLER_THAN_IT_AND_AFTER_WHICH_ALL_ARE_GREATER_THAN_IT
347
+ MINIMIZE_THE_SUM_OF_DIGITS_OF_A_AND_B_SUCH_THAT_A_B_N
348
+ EULERIAN_NUMBER_1
349
+ MINIMUM_SWAPS_REQUIRED_BRING_ELEMENTS_LESS_EQUAL_K_TOGETHER
350
+ MINIMUM_NUMBER_SUBSETS_DISTINCT_ELEMENTS
351
+ ELEMENTS_TO_BE_ADDED_SO_THAT_ALL_ELEMENTS_OF_A_RANGE_ARE_PRESENT_IN_ARRAY_1
352
+ FIND_PERIMETER_CYLINDER
353
+ REMOVE_MINIMUM_ELEMENTS_EITHER_SIDE_2MIN_MAX
354
+ COUNT_OFDIFFERENT_WAYS_EXPRESS_N_SUM_1_3_4
355
+ SUM_BINOMIAL_COEFFICIENTS
356
+ FIBONACCI_MODULO_P
357
+ NTH_EVEN_LENGTH_PALINDROME
358
+ COUNT_TRAILING_ZEROES_FACTORIAL_NUMBER
359
+ NUMBER_OF_PAIRS_IN_AN_ARRAY_HAVING_SUM_EQUAL_TO_PRODUCT
360
+ GIVEN_LARGE_NUMBER_CHECK_SUBSEQUENCE_DIGITS_DIVISIBLE_8
361
+ TAIL_RECURSION_FIBONACCI
362
+ DETECT_IF_TWO_INTEGERS_HAVE_OPPOSITE_SIGNS
363
+ COUNT_DISTINCT_NON_NEGATIVE_PAIRS_X_Y_SATISFY_INEQUALITY_XX_YY_N_2_1
364
+ MAXIMUM_HEIGHT_OF_TRIANGULAR_ARRANGEMENT_OF_ARRAY_VALUES
365
+ COUNT_BINARY_STRINGS_K_TIMES_APPEARING_ADJACENT_TWO_SET_BITS
366
+ FORM_SMALLEST_NUMBER_USING_ONE_SWAP_OPERATION
367
+ COUNT_NUMBER_BINARY_STRINGS_WITHOUT_CONSECUTIVE_1S
368
+ DIVISIBILITY_BY_12_FOR_A_LARGE_NUMBER
369
+ CHECK_GIVEN_CIRCLE_LIES_COMPLETELY_INSIDE_RING_FORMED_TWO_CONCENTRIC_CIRCLES
370
+ LONGEST_COMMON_SUBSTRING_SPACE_OPTIMIZED_DP_SOLUTION
371
+ COMPUTE_AVERAGE_TWO_NUMBERS_WITHOUT_OVERFLOW_1
372
+ PROGRAM_AREA_SQUARE
373
+ MAXIMUM_SUM_PAIRS_SPECIFIC_DIFFERENCE
374
+ AREA_OF_THE_CIRCLE_THAT_HAS_A_SQUARE_AND_A_CIRCLE_INSCRIBED_IN_IT
375
+ MULTIPLY_AN_INTEGER_WITH_3_5
376
+ MAXIMUM_SUM_SUBSEQUENCE_LEAST_K_DISTANT_ELEMENTS
377
+ DYNAMIC_PROGRAMMING_SET_28_MINIMUM_INSERTIONS_TO_FORM_A_PALINDROME
378
+ SEARCH_ALMOST_SORTED_ARRAY
379
+ SUM_SERIES_555555_N_TERMS
380
+ SUM_SUBSETS_SET_FORMED_FIRST_N_NATURAL_NUMBERS
381
+ PROGRAM_TO_FIND_REMAINDER_WITHOUT_USING_MODULO_OR_OPERATOR_1
382
+ COMPOSITE_NUMBER
383
+ PROGRAM_PAGE_REPLACEMENT_ALGORITHMS_SET_2_FIFO
384
+ MAXIMUM_TRIPLET_SUM_ARRAY_2
385
+ PROGRAM_CALCULATE_AREA_OCTAGON
386
+ PROGRAM_CALCULATE_VOLUME_OCTAHEDRON
387
+ SEARCH_INSERT_AND_DELETE_IN_A_SORTED_ARRAY
388
+ MAXIMUM_NUMBER_SEGMENTS_LENGTHS_B_C
389
+ COUNT_NUMBER_OF_WAYS_TO_COVER_A_DISTANCE_1
390
+ MIDDLE_OF_THREE_USING_MINIMUM_COMPARISONS_1
391
+ MINIMUM_STEPS_TO_DELETE_A_STRING_AFTER_REPEATED_DELETION_OF_PALINDROME_SUBSTRINGS
392
+ DYNAMIC_PROGRAMMING_HIGH_EFFORT_VS_LOW_EFFORT_TASKS_PROBLEM
393
+ FIND_SUM_MODULO_K_FIRST_N_NATURAL_NUMBER_1
394
+ MINIMUM_PERIMETER_N_BLOCKS
395
+ TURN_OFF_THE_RIGHTMOST_SET_BIT
396
+ FIND_REPEATED_CHARACTER_PRESENT_FIRST_STRING
397
+ FIND_REPETITIVE_ELEMENT_1_N_1_1
398
+ FIND_THE_MAXIMUM_SUBARRAY_XOR_IN_A_GIVEN_ARRAY
399
+ STRING_CONTAINING_FIRST_LETTER_EVERY_WORD_GIVEN_STRING_SPACES
400
+ MAXIMUM_POSSIBLE_DIFFERENCE_TWO_SUBSETS_ARRAY
401
+ RECURSIVELY_BREAK_NUMBER_3_PARTS_GET_MAXIMUM_SUM_1
402
+ MINIMUM_COST_FOR_ACQUIRING_ALL_COINS_WITH_K_EXTRA_COINS_ALLOWED_WITH_EVERY_COIN
403
+ PADOVAN_SEQUENCE
404
+ CEILING_IN_A_SORTED_ARRAY
405
+ MINIMUM_SUM_SUBSEQUENCE_LEAST_ONE_EVERY_FOUR_CONSECUTIVE_ELEMENTS_PICKED_1
406
+ COUNT_PAIRS_TWO_SORTED_ARRAYS_WHOSE_SUM_EQUAL_GIVEN_VALUE_X
407
+ CHECK_IF_A_NUMBER_IS_JUMBLED_OR_NOT
408
+ EFFICIENTLY_FIND_FIRST_REPEATED_CHARACTER_STRING_WITHOUT_USING_ADDITIONAL_DATA_STRUCTURE_ONE_TRAVERSAL
409
+ LONGEST_REPEATED_SUBSEQUENCE_1
410
+ NUMBER_UNIQUE_RECTANGLES_FORMED_USING_N_UNIT_SQUARES
411
+ POSITION_ELEMENT_STABLE_SORT
412
+ NUMBER_SUBSTRINGS_DIVISIBLE_4_STRING_INTEGERS
413
+ SQUARE_ROOT_OF_A_PERFECT_SQUARE
414
+ EFFICIENT_WAY_TO_MULTIPLY_WITH_7
415
+ MAXIMUM_BINOMIAL_COEFFICIENT_TERM_VALUE
416
+ PROGRAM_TO_FIND_THE_VOLUME_OF_A_TRIANGULAR_PRISM
417
+ MINIMUM_TIME_TO_FINISH_TASKS_WITHOUT_SKIPPING_TWO_CONSECUTIVE
418
+ PROGRAM_FOR_SURFACE_AREA_OF_OCTAHEDRON
419
+ CHECK_OCCURRENCES_CHARACTER_APPEAR_TOGETHER
420
+ MINIMUM_DIFFERENCE_BETWEEN_GROUPS_OF_SIZE_TWO
421
+ PROGRAM_TO_CHECK_IF_A_MATRIX_IS_SYMMETRIC
422
+ FIND_MINIMUM_NUMBER_DIVIDED_MAKE_NUMBER_PERFECT_SQUARE
423
+ FIND_SUM_NON_REPEATING_DISTINCT_ELEMENTS_ARRAY
424
+ C_PROGRAM_FACTORIAL_NUMBER
425
+ FORM_MINIMUM_NUMBER_FROM_GIVEN_SEQUENCE_1
426
+ FIND_MAXIMUM_SUM_POSSIBLE_EQUAL_SUM_THREE_STACKS
427
+ FIND_SUM_MODULO_K_FIRST_N_NATURAL_NUMBER
428
+ MAXIMUM_NUMBER_CHARACTERS_TWO_CHARACTER_STRING
429
+ CHECK_ARRAY_MAJORITY_ELEMENT
430
+ COMPUTE_AVERAGE_TWO_NUMBERS_WITHOUT_OVERFLOW
431
+ COST_BALANCE_PARANTHESES
432
+ PROGRAM_FIND_SMALLEST_DIFFERENCE_ANGLES_TWO_PARTS_GIVEN_CIRCLE
433
+ WRITE_ONE_LINE_C_FUNCTION_TO_FIND_WHETHER_A_NO_IS_POWER_OF_TWO_1
434
+ HARDY_RAMANUJAN_THEOREM
435
+ GCD_ELEMENTS_GIVEN_RANGE
436
+ FIND_MINIMUM_SUM_FACTORS_NUMBER
437
+ PROBABILITY_THREE_RANDOMLY_CHOSEN_NUMBERS_AP
438
+ GOLD_MINE_PROBLEM
439
+ SUM_OF_ALL_PROPER_DIVISORS_OF_A_NATURAL_NUMBER
440
+ COUNTS_PATHS_POINT_REACH_ORIGIN_1
441
+ NEWMAN_CONWAY_SEQUENCE_1
442
+ COUNT_WAYS_DIVIDE_CIRCLE_USING_N_NON_INTERSECTING_CHORDS
443
+ FIND_SUM_UNIQUE_SUB_ARRAY_SUM_GIVEN_ARRAY
444
+ FIND_N_TH_ELEMENT_FROM_STERNS_DIATOMIC_SERIES
445
+ MAXIMUM_VALUE_CHOICE_EITHER_DIVIDING_CONSIDERING
446
+ NEXT_POWER_OF_2_1
447
+ COUNT_PAIRS_DIFFERENCE_EQUAL_K
448
+ MINIMUM_STEPS_MINIMIZE_N_PER_GIVEN_CONDITION
449
+ PROGRAM_FOR_FACTORIAL_OF_A_NUMBER_1
450
+ MAXIMUM_DIFFERENCE_BETWEEN_FREQUENCY_OF_TWO_ELEMENTS_SUCH_THAT_ELEMENT_HAVING_GREATER_FREQUENCY_IS_ALSO_GREATER
451
+ PYTHAGOREAN_QUADRUPLE
452
+ PROGRAM_CHECK_PLUS_PERFECT_NUMBER
453
+ MAXIMUM_SUBARRAY_SUM_ARRAY_CREATED_REPEATED_CONCATENATION
454
+ FIND_WHETHER_AN_ARRAY_IS_SUBSET_OF_ANOTHER_ARRAY_SET_1
455
+ NUMBER_SUBARRAYS_SUM_EXACTLY_EQUAL_K
456
+ FIND_PAIR_MAXIMUM_GCD_ARRAY
457
+ MAXIMUM_AREA_RECTANGLE_PICKING_FOUR_SIDES_ARRAY
458
+ INTEGER_POSITIVE_VALUE_POSITIVE_NEGATIVE_VALUE_ARRAY_1
459
+ N_TH_NUMBER_WHOSE_SUM_OF_DIGITS_IS_TEN
460
+ MINIMUM_COST_SORT_MATRIX_NUMBERS_0_N2_1
461
+ SUM_OF_ALL_SUBSTRINGS_OF_A_STRING_REPRESENTING_A_NUMBER
462
+ LOWER_CASE_UPPER_CASE_INTERESTING_FACT
463
+ NUMBER_TRIANGLES_N_MOVES
464
+ MAXIMUM_PROFIT_BY_BUYING_AND_SELLING_A_SHARE_AT_MOST_K_TIMES_1
465
+ COUNT_SUBARRAYS_TOTAL_DISTINCT_ELEMENTS_ORIGINAL_ARRAY
466
+ FIND_REPETITIVE_ELEMENT_1_N_1
467
+ SEQUENCES_GIVEN_LENGTH_EVERY_ELEMENT_EQUAL_TWICE_PREVIOUS
468
+ MAXIMUM_AREA_RECTANGLE_PICKING_FOUR_SIDES_ARRAY_1
469
+ MINIMUM_TIME_WRITE_CHARACTERS_USING_INSERT_DELETE_COPY_OPERATION
470
+ POSSIBLE_FORM_TRIANGLE_ARRAY_VALUES
471
+ GOOGLE_CASE_GIVEN_SENTENCE
472
+ PROGRAM_BINARY_DECIMAL_CONVERSION_1
473
+ MINIMUM_COST_MAKE_ARRAY_SIZE_1_REMOVING_LARGER_PAIRS
474
+ MULTIPLY_LARGE_INTEGERS_UNDER_LARGE_MODULO
475
+ NUMBER_DAYS_TANK_WILL_BECOME_EMPTY
476
+ PROGRAM_FOR_DEADLOCK_FREE_CONDITION_IN_OPERATING_SYSTEM
477
+ LONGEST_SUBARRAY_COUNT_1S_ONE_COUNT_0S
478
+ NEXT_POWER_OF_2
479
+ CALCULATE_MAXIMUM_VALUE_USING_SIGN_TWO_NUMBERS_STRING
480
+ PROGRAM_CHECK_ISBN
481
+ COUNT_PAIRS_WHOSE_PRODUCTS_EXIST_IN_ARRAY_1
482
+ COUNT_INVERSIONS_OF_SIZE_THREE_IN_A_GIVE_ARRAY_1
483
+ FIND_INDEX_0_REPLACED_1_GET_LONGEST_CONTINUOUS_SEQUENCE_1S_BINARY_ARRAY
484
+ LONGEST_INCREASING_ODD_EVEN_SUBSEQUENCE
485
+ BIN_PACKING_PROBLEM_MINIMIZE_NUMBER_OF_USED_BINS
486
+ PROGRAM_BINARY_DECIMAL_CONVERSION
487
+ COUNT_NATURAL_NUMBERS_WHOSE_PERMUTATION_GREATER_NUMBER
488
+ MINIMUM_ROTATIONS_UNLOCK_CIRCULAR_LOCK
489
+ FIND_THE_MISSING_NUMBER_1
490
+ LOWER_INSERTION_POINT
491
+ COUNT_NEGATIVE_NUMBERS_IN_A_COLUMN_WISE_ROW_WISE_SORTED_MATRIX_1
492
+ COUNT_SUBARRAYS_EQUAL_NUMBER_1S_0S
493
+ FIND_INDEX_GIVEN_FIBONACCI_NUMBER_CONSTANT_TIME
494
+ POSITIVE_ELEMENTS_EVEN_NEGATIVE_ODD_POSITIONS
495
+ NUMBER_OF_SUBSTRINGS_WITH_ODD_DECIMAL_VALUE_IN_A_BINARY_STRING
496
+ EVEN_FIBONACCI_NUMBERS_SUM
497
+ CHECK_ARRAY_CONTAINS_CONTIGUOUS_INTEGERS_DUPLICATES_ALLOWED
498
+ HOW_TO_BEGIN_WITH_COMPETITIVE_PROGRAMMING
499
+ COUNT_PAIRS_TWO_SORTED_ARRAYS_WHOSE_SUM_EQUAL_GIVEN_VALUE_X_2
500
+ CHECK_LINE_PASSES_ORIGIN
501
+ HOW_TO_TURN_OFF_A_PARTICULAR_BIT_IN_A_NUMBER
502
+ STRING_K_DISTINCT_CHARACTERS_NO_CHARACTERS_ADJACENT
503
+ NUMBER_WAYS_NODE_MAKE_LOOP_SIZE_K_UNDIRECTED_COMPLETE_CONNECTED_GRAPH_N_NODES
504
+ BINARY_SEARCH
505
+ DICE_THROW_PROBLEM
506
+ COUNT_NUMBER_OF_WAYS_TO_FILL_A_N_X_4_GRID_USING_1_X_4_TILES
507
+ K_TH_DISTINCT_OR_NON_REPEATING_ELEMENT_IN_AN_ARRAY
508
+ COUNT_SUBARRAYS_WITH_SAME_EVEN_AND_ODD_ELEMENTS
509
+ FIND_THE_MINIMUM_DISTANCE_BETWEEN_TWO_NUMBERS_1
510
+ SMALLEST_OF_THREE_INTEGERS_WITHOUT_COMPARISON_OPERATORS_1
511
+ LONGEST_EVEN_LENGTH_SUBSTRING_SUM_FIRST_SECOND_HALF_1
512
+ CHECK_GIVEN_MATRIX_SPARSE_NOT
513
+ COUNT_CHARACTERS_POSITION_ENGLISH_ALPHABETS
514
+ N_TH_TERM_SERIES_2_12_36_80_150
515
+ COUNT_STRINGS_ADJACENT_CHARACTERS_DIFFERENCE_ONE
516
+ DIVISIBILITY_BY_7
517
+ COUNT_OF_SUB_STRINGS_THAT_DO_NOT_CONTAIN_ALL_THE_CHARACTERS_FROM_THE_SET_A_B_C_AT_THE_SAME_TIME
518
+ MODULUS_TWO_FLOAT_DOUBLE_NUMBERS
519
+ FIND_THREE_ELEMENT_FROM_DIFFERENT_THREE_ARRAYS_SUCH_THAT_THAT_A_B_C_K
520
+ FIND_UNIT_DIGIT_X_RAISED_POWER_Y_1
521
+ MAXIMUM_NUMBER_2X2_SQUARES_CAN_FIT_INSIDE_RIGHT_ISOSCELES_TRIANGLE
522
+ PRIMALITY_TEST_SET_5USING_LUCAS_LEHMER_SERIES
523
+ MINIMUM_SUM_CHOOSING_MINIMUM_PAIRS_ARRAY
524
+ SEQUENCES_GIVEN_LENGTH_EVERY_ELEMENT_EQUAL_TWICE_PREVIOUS_1
525
+ MEDIAN_OF_TWO_SORTED_ARRAYS
526
+ STEINS_ALGORITHM_FOR_FINDING_GCD_1
527
+ COUNTING_PAIRS_PERSON_CAN_FORM_PAIR_ONE_1
528
+ GIVEN_A_SORTED_AND_ROTATED_ARRAY_FIND_IF_THERE_IS_A_PAIR_WITH_A_GIVEN_SUM
529
+ DYNAMIC_PROGRAMMING_SET_8_MATRIX_CHAIN_MULTIPLICATION_1
530
+ FIND_EQUAL_POINT_STRING_BRACKETS
531
+ CIRCLE_LATTICE_POINTS
532
+ LARGEST_SUBARRAY_WITH_EQUAL_NUMBER_OF_0S_AND_1S_1
533
+ MAXIMUM_AVERAGE_SUM_PARTITION_ARRAY
534
+ FRIENDS_PAIRING_PROBLEM_2
535
+ MINIMUM_OPERATIONS_MAKE_GCD_ARRAY_MULTIPLE_K
536
+ MINIMUM_PRODUCT_K_INTEGERS_ARRAY_POSITIVE_INTEGERS
537
+ COUNT_PALINDROME_SUB_STRINGS_STRING
538
+ MIDDLE_OF_THREE_USING_MINIMUM_COMPARISONS
539
+ SWAP_TWO_NIBBLES_BYTE
540
+ SUM_MATRIX_ELEMENT_ELEMENT_INTEGER_DIVISION_ROW_COLUMN_1
541
+ SUM_FIBONACCI_NUMBERS
542
+ LONGEST_COMMON_INCREASING_SUBSEQUENCE_LCS_LIS
543
+ COUNT_SUBSETS_DISTINCT_EVEN_NUMBERS
544
+ FIND_ROTATION_COUNT_ROTATED_SORTED_ARRAY_1
545
+ LENGTH_OF_THE_LONGEST_ARITHMATIC_PROGRESSION_IN_A_SORTED_ARRAY
546
+ FIND_UNIT_DIGIT_X_RAISED_POWER_Y
547
+ FIND_THE_ELEMENT_THAT_APPEARS_ONCE_2
548
+ NUMBER_RECTANGLES_NM_GRID
549
+ COIN_GAME_WINNER_EVERY_PLAYER_THREE_CHOICES
550
+ NUMBER_VISIBLE_BOXES_PUTTING_ONE_INSIDE_ANOTHER
551
+ SUM_K_TH_GROUP_ODD_POSITIVE_NUMBERS_1
552
+ NON_REPEATING_ELEMENT_1
553
+ TILING_WITH_DOMINOES
554
+ BASIC_AND_EXTENDED_EUCLIDEAN_ALGORITHMS
555
+ FIND_MAXIMUM_AVERAGE_SUBARRAY_OF_K_LENGTH_1
556
+ COUNT_BINARY_DIGIT_NUMBERS_SMALLER_N
557
+ LENGTH_LONGEST_STRICT_BITONIC_SUBSEQUENCE
558
+ FIND_A_TRIPLET_THAT_SUM_TO_A_GIVEN_VALUE
559
+ PRIME_NUMBERS
560
+ SUM_SERIES_12_32_52_2N_12_1
561
+ FIND_MAXIMUM_PRODUCT_OF_A_TRIPLET_IN_ARRAY_1
562
+ PANGRAM_CHECKING
563
+ HEIGHT_COMPLETE_BINARY_TREE_HEAP_N_NODES
564
+ HOW_CAN_WE_SUM_THE_DIGITS_OF_A_GIVEN_NUMBER_IN_SINGLE_STATEMENT_2
565
+ POSSIBLE_TO_MAKE_A_DIVISIBLE_BY_3_NUMBER_USING_ALL_DIGITS_IN_AN_ARRAY
566
+ FIND_NUMBER_TIMES_STRING_OCCURS_GIVEN_STRING_1
567
+ CHECK_DIVISIBILITY_LARGE_NUMBER_999
568
+ K_TH_DISTINCT_OR_NON_REPEATING_ELEMENT_IN_AN_ARRAY_1
569
+ CHECK_LARGE_NUMBER_DIVISIBLE_6_NOT
570
+ CHECK_REVERSING_SUB_ARRAY_MAKE_ARRAY_SORTED
571
+ REMAINDER_7_LARGE_NUMBERS
572
+ FRIENDS_PAIRING_PROBLEM
573
+ CHECK_CHARACTERS_GIVEN_STRING_CAN_REARRANGED_FORM_PALINDROME_1
574
+ FIND_WHETHER_A_GIVEN_NUMBER_IS_A_POWER_OF_4_OR_NOT_1
575
+ COUNT_POSSIBLE_WAYS_TO_CONSTRUCT_BUILDINGS
576
+ SUM_PAIRWISE_PRODUCTS_1
577
+ REMOVE_MINIMUM_NUMBER_ELEMENTS_NO_COMMON_ELEMENT_EXIST_ARRAY
578
+ N_TH_NUMBER_WHOSE_SUM_OF_DIGITS_IS_TEN_2
579
+ FIND_MAXIMUM_AVERAGE_SUBARRAY_OF_K_LENGTH
580
+ NUMBER_ORDERED_PAIRS_AI_AJ_0
581
+ CHECK_WHETHER_LARGE_NUMBER_DIVISIBLE_7
582
+ NUMBER_SUBSEQUENCES_AB_STRING_REPEATED_K_TIMES
583
+ MAXIMUM_SUM_BITONIC_SUBARRAY
584
+ MAXIMUM_GAMES_PLAYED_WINNER
585
+ EFFICIENT_SEARCH_IN_AN_ARRAY_WHERE_DIFFERENCE_BETWEEN_ADJACENT_IS_1
586
+ COUNT_SET_BITS_IN_AN_INTEGER_3
587
+ COMPUTE_N_UNDER_MODULO_P
588
+ MINIMUM_SUM_PRODUCT_TWO_ARRAYS
589
+ COUNT_FACTORIAL_NUMBERS_IN_A_GIVEN_RANGE
590
+ FIND_THE_ELEMENT_THAT_APPEARS_ONCE
591
+ PAINTING_FENCE_ALGORITHM
592
+ COUNT_POSSIBLE_PATHS_TOP_LEFT_BOTTOM_RIGHT_NXM_MATRIX_2
593
+ FIND_A_FIXED_POINT_IN_A_GIVEN_ARRAY_1
594
+ SUM_MATRIX_ELEMENT_ELEMENT_INTEGER_DIVISION_ROW_COLUMN
595
+ DOUBLE_FACTORIAL
596
+ COUNT_NUMBER_WAYS_TILE_FLOOR_SIZE_N_X_M_USING_1_X_M_SIZE_TILES
597
+ PROGRAM_PRINT_IDENTITY_MATRIX_1
598
+ DYNAMIC_PROGRAMMING_SET_3_LONGEST_INCREASING_SUBSEQUENCE_1
599
+ DYNAMIC_PROGRAMMING_SET_37_BOOLEAN_PARENTHESIZATION_PROBLEM
600
+ PROGRAM_TO_FIND_THE_AREA_OF_PENTAGON
601
+ MAXIMUM_CONSECUTIVE_NUMBERS_PRESENT_ARRAY
602
+ LARGEST_SUM_CONTIGUOUS_SUBARRAY_2
603
+ MINIMUM_SUM_TWO_NUMBERS_FORMED_DIGITS_ARRAY_2
604
+ MODULAR_EXPONENTIATION_POWER_IN_MODULAR_ARITHMETIC
605
+ WRITE_A_C_PROGRAM_TO_FIND_THE_PARITY_OF_AN_UNSIGNED_INTEGER
606
+ CHECK_LARGE_NUMBER_DIVISIBLE_11_NOT
607
+ SMALLEST_POWER_OF_2_GREATER_THAN_OR_EQUAL_TO_N_1
608
+ K_TH_MISSING_ELEMENT_INCREASING_SEQUENCE_NOT_PRESENT_GIVEN_SEQUENCE
609
+ FIND_THE_NUMBER_OCCURRING_ODD_NUMBER_OF_TIMES_2
610
+ SUM_MATRIX_ELEMENT_ABSOLUTE_DIFFERENCE_ROW_COLUMN_NUMBERS
611
+ WRITE_YOU_OWN_POWER_WITHOUT_USING_MULTIPLICATION_AND_DIVISION
612
+ FIND_WHETHER_AN_ARRAY_IS_SUBSET_OF_ANOTHER_ARRAY_SET_1_1
613
+ SORT_EVEN_PLACED_ELEMENTS_INCREASING_ODD_PLACED_DECREASING_ORDER
614
+ CHECK_IF_A_NUMBER_IS_POWER_OF_ANOTHER_NUMBER_1
615
+ POLICEMEN_CATCH_THIEVES
616
+ DYNAMIC_PROGRAMMING_SET_36_CUT_A_ROPE_TO_MAXIMIZE_PRODUCT_1
617
+ MAXIMUM_CONSECUTIVE_REPEATING_CHARACTER_STRING
618
+ COUNT_NEGATIVE_NUMBERS_IN_A_COLUMN_WISE_ROW_WISE_SORTED_MATRIX
619
+ MAXIMIZE_VOLUME_CUBOID_GIVEN_SUM_SIDES_1
620
+ NUMBER_OF_BINARY_TREES_FOR_GIVEN_PREORDER_SEQUENCE_LENGTH
621
+ GIVEN_P_AND_N_FIND_THE_LARGEST_X_SUCH_THAT_PX_DIVIDES_N_2
622
+ CHECK_WHETHER_ARITHMETIC_PROGRESSION_CAN_FORMED_GIVEN_ARRAY
623
+ COUNT_PAIRS_WHOSE_PRODUCTS_EXIST_IN_ARRAY
624
+ MAXIMUM_CONSECUTIVE_REPEATING_CHARACTER_STRING_1
625
+ C_PROGRAM_CONCATENATE_STRING_GIVEN_NUMBER_TIMES
626
+ PRODUCT_MAXIMUM_FIRST_ARRAY_MINIMUM_SECOND_1
627
+ COUNT_NUMBER_OF_OCCURRENCES_OR_FREQUENCY_IN_A_SORTED_ARRAY
628
+ FIRST_ELEMENT_OCCURRING_K_TIMES_ARRAY
629
+ SPLIT_ARRAY_ADD_FIRST_PART_END
630
+ K_TH_LARGEST_SUM_CONTIGUOUS_SUBARRAY
631
+ TEMPLE_OFFERINGS
632
+ COUNT_1S_SORTED_BINARY_ARRAY
633
+ MINIMUM_NUMBER_OF_JUMPS_TO_REACH_END_OF_A_GIVEN_ARRAY_2
634
+ MINIMUM_SUM_SUBSEQUENCE_LEAST_ONE_EVERY_FOUR_CONSECUTIVE_ELEMENTS_PICKED
635
+ PROGRAM_CHECK_ARRAY_SORTED_NOT_ITERATIVE_RECURSIVE
636
+ PRODUCT_NODES_K_TH_LEVEL_TREE_REPRESENTED_STRING
637
+ SIZE_SUBARRAY_MAXIMUM_SUM
638
+ RECURSIVE_C_PROGRAM_LINEARLY_SEARCH_ELEMENT_GIVEN_ARRAY
639
+ CHECK_POSSIBLE_SORT_ARRAY_CONDITIONAL_SWAPPING_ADJACENT_ALLOWED
640
+ C_PROGRAM_FACTORIAL_NUMBER_2
641
+ SUM_SERIES_23_45_67_89_UPTO_N_TERMS
642
+ COUNT_NUMBER_PAIRS_N_B_N_GCD_B_B
643
+ CALCULATE_VOLUME_DODECAHEDRON
644
+ SORT_ARRAY_CONTAIN_1_N_VALUES
645
+ PROGRAM_CHECK_INPUT_INTEGER_STRING
646
+ MINIMUM_XOR_VALUE_PAIR_1
647
+ SUM_K_TH_GROUP_ODD_POSITIVE_NUMBERS
648
+ FIND_SMALLEST_VALUE_REPRESENTED_SUM_SUBSET_GIVEN_ARRAY
649
+ EFFICIENT_WAY_CHECK_WHETHER_N_TH_FIBONACCI_NUMBER_MULTIPLE_10
650
+ DYNAMIC_PROGRAMMING_SET_14_MAXIMUM_SUM_INCREASING_SUBSEQUENCE
651
+ SUM_NODES_K_TH_LEVEL_TREE_REPRESENTED_STRING
652
+ PROGRAM_OCTAL_DECIMAL_CONVERSION
653
+ REARRANGE_ARRAY_MAXIMUM_MINIMUM_FORM_SET_2_O1_EXTRA_SPACE_1
654
+ CHECK_IF_STRING_REMAINS_PALINDROME_AFTER_REMOVING_GIVEN_NUMBER_OF_CHARACTERS
655
+ COUNT_POSSIBLE_PATHS_TOP_LEFT_BOTTOM_RIGHT_NXM_MATRIX_3
656
+ NUMBER_INDEXES_EQUAL_ELEMENTS_GIVEN_RANGE
657
+ PROGRAM_FIND_REMAINDER_LARGE_NUMBER_DIVIDED_11
658
+ COUNT_SET_BITS_IN_AN_INTEGER_2
659
+ TRIANGULAR_NUMBERS
660
+ ROUND_THE_GIVEN_NUMBER_TO_NEAREST_MULTIPLE_OF_10
661
+ SUM_FACTORS_NUMBER_1
662
+ COUNT_ROTATIONS_DIVISIBLE_8
663
+ SUM_MATRIX_ELEMENT_ABSOLUTE_DIFFERENCE_ROW_COLUMN_NUMBERS_1
664
+ NUMBER_JUMP_REQUIRED_GIVEN_LENGTH_REACH_POINT_FORM_D_0_ORIGIN_2D_PLANE
665
+ CHECK_IF_A_NUMBER_IS_POWER_OF_ANOTHER_NUMBER
666
+ MINIMUM_FLIP_REQUIRED_MAKE_BINARY_MATRIX_SYMMETRIC_1
667
+ SUM_SERIES_12_32_52_2N_12
668
+ SWAP_TWO_NUMBERS_WITHOUT_USING_TEMPORARY_VARIABLE
669
+ CHECK_IF_ALL_THE_ELEMENTS_CAN_BE_MADE_OF_SAME_PARITY_BY_INVERTING_ADJACENT_ELEMENTS
670
+ CHECK_WHETHER_TRIANGLE_VALID_NOT_SIDES_GIVEN
671
+ TOTAL_NUMBER_OF_NON_DECREASING_NUMBERS_WITH_N_DIGITS
672
+ MAXIMUM_PROFIT_BY_BUYING_AND_SELLING_A_SHARE_AT_MOST_TWICE
673
+ MAXIMUM_POSSIBLE_SUM_WINDOW_ARRAY_ELEMENTS_WINDOW_ARRAY_UNIQUE
674
+ MAXIMUM_WEIGHT_PATH_ENDING_ELEMENT_LAST_ROW_MATRIX
675
+ HOW_TO_CHECK_IF_A_GIVEN_ARRAY_REPRESENTS_A_BINARY_HEAP
676
+ COMPUTE_NCR_P_SET_1_INTRODUCTION_AND_DYNAMIC_PROGRAMMING_SOLUTION
677
+ SQUARE_ROOT_OF_AN_INTEGER
678
+ LONGEST_SUBSEQUENCE_DIFFERENCE_ADJACENTS_ONE_SET_2
679
+ MAXIMIZE_VOLUME_CUBOID_GIVEN_SUM_SIDES
680
+ PROGRAM_PRINT_SUM_GIVEN_NTH_TERM_1
681
+ REARRANGE_POSITIVE_AND_NEGATIVE_NUMBERS_PUBLISH
682
+ PARTITION_INTO_TWO_SUBARRAYS_OF_LENGTHS_K_AND_N_K_SUCH_THAT_THE_DIFFERENCE_OF_SUMS_IS_MAXIMUM
683
+ GIVEN_A_SORTED_AND_ROTATED_ARRAY_FIND_IF_THERE_IS_A_PAIR_WITH_A_GIVEN_SUM_1
684
+ PROGRAM_DISTANCE_TWO_POINTS_EARTH
685
+ COUNT_TOTAL_SET_BITS_IN_ALL_NUMBERS_FROM_1_TO_N
686
+ CHECK_GIVEN_SENTENCE_GIVEN_SET_SIMPLE_GRAMMER_RULES
687
+ CHECK_EXIST_TWO_ELEMENTS_ARRAY_WHOSE_SUM_EQUAL_SUM_REST_ARRAY
688
+ CHECK_POSSIBLE_TRANSFORM_ONE_STRING_ANOTHER
689
+ FIND_SUM_EVEN_FACTORS_NUMBER
690
+ CALCULATE_AREA_TETRAHEDRON
691
+ DYNAMIC_PROGRAMMING_SET_13_CUTTING_A_ROD
692
+ SQUARED_TRIANGULAR_NUMBER_SUM_CUBES
693
+ FREQUENT_ELEMENT_ARRAY
694
+ FIND_SUM_EVEN_INDEX_BINOMIAL_COEFFICIENTS_1
695
+ PYTHON_PROGRAM_FIND_PERIMETER_CIRCUMFERENCE_SQUARE_RECTANGLE_1
696
+ LONGEST_REPEATING_AND_NON_OVERLAPPING_SUBSTRING
697
+ NUMBER_N_DIGIT_STEPPING_NUMBERS
698
+ PROGRAM_FIND_STRING_START_END_GEEKS
699
+ FIND_NUMBER_ENDLESS_POINTS
700
+ CHECK_STRING_FOLLOWS_ANBN_PATTERN_NOT
701
+ MAXIMUM_SUBARRAY_SUM_USING_PREFIX_SUM
702
+ COUNT_INDEX_PAIRS_EQUAL_ELEMENTS_ARRAY_1
703
+ HOW_TO_COMPUTE_MOD_OF_A_BIG_NUMBER
704
+ LARGEST_SUBARRAY_WITH_EQUAL_NUMBER_OF_0S_AND_1S
705
+ COUNT_PAIRS_DIFFERENCE_EQUAL_K_1
706
+ COUNT_ROTATIONS_DIVISIBLE_4
707
+ DISTRIBUTING_ITEMS_PERSON_CANNOT_TAKE_TWO_ITEMS_TYPE_1
708
+ MINIMUM_NUMBER_SUBSETS_DISTINCT_ELEMENTS_1
709
+ COUNT_SORTED_ROWS_MATRIX
710
+ COUNT_SUBSTRINGS_WITH_SAME_FIRST_AND_LAST_CHARACTERS
711
+ DIFFERENCE_BETWEEN_HIGHEST_AND_LEAST_FREQUENCIES_IN_AN_ARRAY
712
+ CHECK_WHETHER_NUMBER_DUCK_NUMBER_NOT
713
+ COUNT_SINGLE_NODE_ISOLATED_SUB_GRAPHS_DISCONNECTED_GRAPH
714
+ AREA_SQUARE_CIRCUMSCRIBED_CIRCLE
715
+ NUMBER_NON_NEGATIVE_INTEGRAL_SOLUTIONS_B_C_N
716
+ CHECK_TWO_GIVEN_CIRCLES_TOUCH_INTERSECT
717
+ MINIMUM_NUMBER_PLATFORMS_REQUIRED_RAILWAYBUS_STATION