ziwenyd commited on
Commit
e3d74bb
1 Parent(s): c6a1e2c

Upload cpp_python_pairs.txt

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