ziwenyd commited on
Commit
76deff1
1 Parent(s): e3d74bb

Upload cpp_java_pairs.txt

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