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

Upload python_java_pairs.txt

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