├── .gitignore ├── README.md ├── neural_code_sum ├── LICENSE ├── README.md ├── c2nl.egg-info │ ├── PKG-INFO │ ├── SOURCES.txt │ ├── dependency_links.txt │ ├── requires.txt │ └── top_level.txt ├── c2nl │ ├── __init__.py │ ├── config.py │ ├── decoders │ │ ├── __init__.py │ │ ├── decoder.py │ │ ├── rnn_decoder.py │ │ ├── state.py │ │ └── transformer.py │ ├── encoders │ │ ├── __init__.py │ │ ├── encoder.py │ │ ├── rnn_encoder.py │ │ └── transformer.py │ ├── eval │ │ ├── __init__.py │ │ ├── bleu │ │ │ ├── __init__.py │ │ │ ├── bleu.py │ │ │ ├── bleu_scorer.py │ │ │ ├── google_bleu.py │ │ │ └── nltk_bleu.py │ │ ├── meteor │ │ │ ├── __init__.py │ │ │ ├── data │ │ │ │ └── paraphrase-en.gz │ │ │ ├── meteor-1.5.jar │ │ │ └── meteor.py │ │ └── rouge │ │ │ ├── __init__.py │ │ │ └── rouge.py │ ├── inputters │ │ ├── __init__.py │ │ ├── constants.py │ │ ├── dataset.py │ │ ├── timer.py │ │ ├── utils.py │ │ ├── vector.py │ │ └── vocabulary.py │ ├── models │ │ ├── __init__.py │ │ ├── seq2seq.py │ │ └── transformer.py │ ├── modules │ │ ├── __init__.py │ │ ├── char_embedding.py │ │ ├── copy_generator.py │ │ ├── embeddings.py │ │ ├── global_attention.py │ │ ├── highway.py │ │ ├── multi_head_attn.py │ │ ├── position_ffn.py │ │ └── util_class.py │ ├── objects │ │ ├── __init__.py │ │ ├── code.py │ │ └── summary.py │ ├── tokenizers │ │ ├── __init__.py │ │ ├── code_tokenizer.py │ │ ├── simple_tokenizer.py │ │ └── tokenizer.py │ ├── translator │ │ ├── __init__.py │ │ ├── beam.py │ │ ├── penalties.py │ │ ├── translation.py │ │ └── translator.py │ └── utils │ │ ├── __init__.py │ │ ├── copy_utils.py │ │ ├── logging.py │ │ └── misc.py ├── data │ ├── README.md │ ├── java │ │ ├── get_data.sh │ │ ├── get_stat.py │ │ └── sample.code │ └── python │ │ ├── dev.zip │ │ ├── get_data.sh │ │ ├── get_stat.py │ │ ├── sample.code │ │ ├── test.zip │ │ └── train.zip ├── main │ ├── __init__.py │ ├── logger.py │ ├── model.py │ ├── test.py │ └── train.py ├── parse_python3.py ├── requirements.txt └── setup.py ├── notebooks ├── EDA_Python150k.ipynb ├── bpe.ipynb ├── parse_data.ipynb └── parse_python3.py ├── python150k ├── README.md ├── ast_conversion.py ├── parse_python3.py ├── prepare_data.py ├── preprocess.py └── processor_ast.py ├── requirements.txt ├── scripts └── run-yapf.sh ├── transcoder ├── README.md ├── data │ ├── .gitignore │ └── README.md └── transcoder │ ├── CODE_OF_CONDUCT.md │ ├── CONTRIBUTING.md │ ├── LICENSE │ ├── README.md │ ├── XLM │ ├── install-tools.sh │ ├── preprocess.py │ ├── src │ │ ├── __init__.py │ │ ├── __pycache__ │ │ │ ├── __init__.cpython-37.pyc │ │ │ ├── logger.cpython-37.pyc │ │ │ └── utils.cpython-37.pyc │ │ ├── data │ │ │ ├── __init__.py │ │ │ ├── __pycache__ │ │ │ │ ├── __init__.cpython-37.pyc │ │ │ │ └── dictionary.cpython-37.pyc │ │ │ ├── dataset.py │ │ │ ├── dictionary.py │ │ │ └── loader.py │ │ ├── evaluation │ │ │ ├── __init__.py │ │ │ └── evaluator.py │ │ ├── logger.py │ │ ├── model │ │ │ ├── __init__.py │ │ │ ├── __pycache__ │ │ │ │ ├── __init__.cpython-37.pyc │ │ │ │ ├── pretrain.cpython-37.pyc │ │ │ │ └── transformer.cpython-37.pyc │ │ │ ├── embedder.py │ │ │ ├── pretrain.py │ │ │ └── transformer.py │ │ ├── optim.py │ │ ├── slurm.py │ │ ├── trainer.py │ │ └── utils.py │ ├── tools │ │ ├── .sc_api.sh.swp │ │ └── README.md │ └── train.py │ ├── data │ ├── BPE_with_comments_codes │ ├── bpe.cpp-java-python.with_comments │ │ └── vocab │ ├── evaluation │ │ └── geeks_for_geeks_successful_test_scripts │ │ │ ├── cpp │ │ │ ├── ADD_1_TO_A_GIVEN_NUMBER.cpp │ │ │ ├── ADD_1_TO_A_GIVEN_NUMBER_1.cpp │ │ │ ├── ADD_TWO_NUMBERS_WITHOUT_USING_ARITHMETIC_OPERATORS.cpp │ │ │ ├── ANALYSIS_OF_ALGORITHMS_SET_2_ASYMPTOTIC_ANALYSIS.cpp │ │ │ ├── AREA_OF_A_HEXAGON.cpp │ │ │ ├── AREA_OF_THE_CIRCLE_THAT_HAS_A_SQUARE_AND_A_CIRCLE_INSCRIBED_IN_IT.cpp │ │ │ ├── AREA_SQUARE_CIRCUMSCRIBED_CIRCLE.cpp │ │ │ ├── ARRAY_ELEMENT_MOVED_K_USING_SINGLE_MOVES.cpp │ │ │ ├── ARRAY_RANGE_QUERIES_ELEMENTS_FREQUENCY_VALUE.cpp │ │ │ ├── BASIC_AND_EXTENDED_EUCLIDEAN_ALGORITHMS.cpp │ │ │ ├── BELL_NUMBERS_NUMBER_OF_WAYS_TO_PARTITION_A_SET.cpp │ │ │ ├── BINARY_SEARCH.cpp │ │ │ ├── BIN_PACKING_PROBLEM_MINIMIZE_NUMBER_OF_USED_BINS.cpp │ │ │ ├── BIRTHDAY_PARADOX.cpp │ │ │ ├── BREAKING_NUMBER_FIRST_PART_INTEGRAL_DIVISION_SECOND_POWER_10.cpp │ │ │ ├── CAESAR_CIPHER.cpp │ │ │ ├── CALCULATE_ANGLE_HOUR_HAND_MINUTE_HAND.cpp │ │ │ ├── CALCULATE_AREA_TETRAHEDRON.cpp │ │ │ ├── CALCULATE_MAXIMUM_VALUE_USING_SIGN_TWO_NUMBERS_STRING.cpp │ │ │ ├── CALCULATE_SUM_OF_ALL_NUMBERS_PRESENT_IN_A_STRING.cpp │ │ │ ├── CALCULATE_VOLUME_DODECAHEDRON.cpp │ │ │ ├── CALCULATING_FACTORIALS_USING_STIRLING_APPROXIMATION.cpp │ │ │ ├── CASSINIS_IDENTITY.cpp │ │ │ ├── CEILING_IN_A_SORTED_ARRAY.cpp │ │ │ ├── CEILING_IN_A_SORTED_ARRAY_1.cpp │ │ │ ├── CHANGE_ARRAY_PERMUTATION_NUMBERS_1_N.cpp │ │ │ ├── CHANGE_BITS_CAN_MADE_ONE_FLIP.cpp │ │ │ ├── CHANGE_BITS_CAN_MADE_ONE_FLIP_1.cpp │ │ │ ├── CHECK_ARRAY_CONTAINS_CONTIGUOUS_INTEGERS_DUPLICATES_ALLOWED.cpp │ │ │ ├── CHECK_ARRAY_CONTAINS_CONTIGUOUS_INTEGERS_DUPLICATES_ALLOWED_1.cpp │ │ │ ├── CHECK_ARRAY_MAJORITY_ELEMENT.cpp │ │ │ ├── CHECK_ARRAY_REPRESENTS_INORDER_BINARY_SEARCH_TREE_NOT.cpp │ │ │ ├── CHECK_CHARACTERS_GIVEN_STRING_CAN_REARRANGED_FORM_PALINDROME_1.cpp │ │ │ ├── CHECK_DIVISIBILITY_BINARY_STRING_2K.cpp │ │ │ ├── CHECK_DIVISIBILITY_LARGE_NUMBER_999.cpp │ │ │ ├── CHECK_EXIST_TWO_ELEMENTS_ARRAY_WHOSE_SUM_EQUAL_SUM_REST_ARRAY.cpp │ │ │ ├── CHECK_GIVEN_CIRCLE_LIES_COMPLETELY_INSIDE_RING_FORMED_TWO_CONCENTRIC_CIRCLES.cpp │ │ │ ├── CHECK_GIVEN_SENTENCE_GIVEN_SET_SIMPLE_GRAMMER_RULES.cpp │ │ │ ├── CHECK_GIVEN_STRING_CAN_SPLIT_FOUR_DISTINCT_STRINGS.cpp │ │ │ ├── CHECK_GIVEN_STRING_ROTATION_PALINDROME.cpp │ │ │ ├── CHECK_IF_ALL_THE_ELEMENTS_CAN_BE_MADE_OF_SAME_PARITY_BY_INVERTING_ADJACENT_ELEMENTS.cpp │ │ │ ├── CHECK_IF_A_GIVEN_ARRAY_CAN_REPRESENT_PREORDER_TRAVERSAL_OF_BINARY_SEARCH_TREE.cpp │ │ │ ├── CHECK_IF_A_NUMBER_IS_JUMBLED_OR_NOT.cpp │ │ │ ├── CHECK_IF_A_NUMBER_IS_POWER_OF_ANOTHER_NUMBER.cpp │ │ │ ├── CHECK_IF_A_NUMBER_IS_POWER_OF_ANOTHER_NUMBER_1.cpp │ │ │ ├── CHECK_IF_STRING_REMAINS_PALINDROME_AFTER_REMOVING_GIVEN_NUMBER_OF_CHARACTERS.cpp │ │ │ ├── CHECK_IF_X_CAN_GIVE_CHANGE_TO_EVERY_PERSON_IN_THE_QUEUE.cpp │ │ │ ├── CHECK_INTEGER_OVERFLOW_MULTIPLICATION.cpp │ │ │ ├── CHECK_LARGE_NUMBER_DIVISIBLE_11_NOT.cpp │ │ │ ├── CHECK_LARGE_NUMBER_DIVISIBLE_13_NOT.cpp │ │ │ ├── CHECK_LARGE_NUMBER_DIVISIBLE_3_NOT.cpp │ │ │ ├── CHECK_LARGE_NUMBER_DIVISIBLE_4_NOT.cpp │ │ │ ├── CHECK_LARGE_NUMBER_DIVISIBLE_6_NOT.cpp │ │ │ ├── CHECK_LARGE_NUMBER_DIVISIBLE_9_NOT.cpp │ │ │ ├── CHECK_LINE_PASSES_ORIGIN.cpp │ │ │ ├── CHECK_NUMBER_IS_PERFECT_SQUARE_USING_ADDITIONSUBTRACTION.cpp │ │ │ ├── CHECK_NUMBER_POWER_K_USING_BASE_CHANGING_METHOD.cpp │ │ │ ├── CHECK_OCCURRENCES_CHARACTER_APPEAR_TOGETHER.cpp │ │ │ ├── CHECK_POSSIBLE_SORT_ARRAY_CONDITIONAL_SWAPPING_ADJACENT_ALLOWED.cpp │ │ │ ├── CHECK_POSSIBLE_TRANSFORM_ONE_STRING_ANOTHER.cpp │ │ │ ├── CHECK_REVERSING_SUB_ARRAY_MAKE_ARRAY_SORTED.cpp │ │ │ ├── CHECK_REVERSING_SUB_ARRAY_MAKE_ARRAY_SORTED_1.cpp │ │ │ ├── CHECK_STRING_CAN_OBTAINED_ROTATING_ANOTHER_STRING_2_PLACES.cpp │ │ │ ├── CHECK_STRING_FOLLOWS_ANBN_PATTERN_NOT.cpp │ │ │ ├── CHECK_TWO_GIVEN_CIRCLES_TOUCH_INTERSECT.cpp │ │ │ ├── CHECK_WHETHER_ARITHMETIC_PROGRESSION_CAN_FORMED_GIVEN_ARRAY.cpp │ │ │ ├── CHECK_WHETHER_GIVEN_DEGREES_VERTICES_REPRESENT_GRAPH_TREE.cpp │ │ │ ├── CHECK_WHETHER_GIVEN_NUMBER_EVEN_ODD.cpp │ │ │ ├── CHECK_WHETHER_GIVEN_NUMBER_EVEN_ODD_1.cpp │ │ │ ├── CHECK_WHETHER_TRIANGLE_VALID_NOT_SIDES_GIVEN.cpp │ │ │ ├── CHOCOLATE_DISTRIBUTION_PROBLEM.cpp │ │ │ ├── CIRCLE_LATTICE_POINTS.cpp │ │ │ ├── COIN_GAME_WINNER_EVERY_PLAYER_THREE_CHOICES.cpp │ │ │ ├── COMPOSITE_NUMBER.cpp │ │ │ ├── COMPUTE_AVERAGE_TWO_NUMBERS_WITHOUT_OVERFLOW.cpp │ │ │ ├── COMPUTE_AVERAGE_TWO_NUMBERS_WITHOUT_OVERFLOW_1.cpp │ │ │ ├── COMPUTE_MODULUS_DIVISION_BY_A_POWER_OF_2_NUMBER.cpp │ │ │ ├── COMPUTE_NCR_P_SET_1_INTRODUCTION_AND_DYNAMIC_PROGRAMMING_SOLUTION.cpp │ │ │ ├── COMPUTE_N_UNDER_MODULO_P.cpp │ │ │ ├── CONVERTING_ONE_STRING_USING_APPEND_DELETE_LAST_OPERATIONS.cpp │ │ │ ├── CONVERT_DECIMAL_FRACTION_BINARY_NUMBER.cpp │ │ │ ├── CONVERT_STRICTLY_INCREASING_ARRAY_MINIMUM_CHANGES.cpp │ │ │ ├── COST_BALANCE_PARANTHESES.cpp │ │ │ ├── COUNTING_PAIRS_PERSON_CAN_FORM_PAIR_ONE_1.cpp │ │ │ ├── COUNTS_PATHS_POINT_REACH_ORIGIN_1.cpp │ │ │ ├── COUNT_BINARY_DIGIT_NUMBERS_SMALLER_N.cpp │ │ │ ├── COUNT_CHARACTERS_POSITION_ENGLISH_ALPHABETS.cpp │ │ │ ├── COUNT_CHARACTERS_STRING_DISTANCE_ENGLISH_ALPHABETS.cpp │ │ │ ├── COUNT_DERANGEMENTS_PERMUTATION_SUCH_THAT_NO_ELEMENT_APPEARS_IN_ITS_ORIGINAL_POSITION_1.cpp │ │ │ ├── COUNT_DIGITS_FACTORIAL_SET_1.cpp │ │ │ ├── COUNT_DIGITS_FACTORIAL_SET_2.cpp │ │ │ ├── COUNT_DISTINCT_NON_NEGATIVE_PAIRS_X_Y_SATISFY_INEQUALITY_XX_YY_N_2.cpp │ │ │ ├── COUNT_DISTINCT_NON_NEGATIVE_PAIRS_X_Y_SATISFY_INEQUALITY_XX_YY_N_2_1.cpp │ │ │ ├── COUNT_DISTINCT_OCCURRENCES_AS_A_SUBSEQUENCE.cpp │ │ │ ├── COUNT_EVEN_LENGTH_BINARY_SEQUENCES_WITH_SAME_SUM_OF_FIRST_AND_SECOND_HALF_BITS_1.cpp │ │ │ ├── COUNT_FACTORIAL_NUMBERS_IN_A_GIVEN_RANGE.cpp │ │ │ ├── COUNT_FIBONACCI_NUMBERS_GIVEN_RANGE_LOG_TIME.cpp │ │ │ ├── COUNT_FREQUENCY_K_MATRIX_SIZE_N_MATRIXI_J_IJ.cpp │ │ │ ├── COUNT_INDEX_PAIRS_EQUAL_ELEMENTS_ARRAY.cpp │ │ │ ├── COUNT_INDEX_PAIRS_EQUAL_ELEMENTS_ARRAY_1.cpp │ │ │ ├── COUNT_INVERSIONS_OF_SIZE_THREE_IN_A_GIVE_ARRAY.cpp │ │ │ ├── COUNT_INVERSIONS_OF_SIZE_THREE_IN_A_GIVE_ARRAY_1.cpp │ │ │ ├── COUNT_MINIMUM_NUMBER_SUBSETS_SUBSEQUENCES_CONSECUTIVE_NUMBERS.cpp │ │ │ ├── COUNT_NATURAL_NUMBERS_WHOSE_PERMUTATION_GREATER_NUMBER.cpp │ │ │ ├── COUNT_NUMBERS_CAN_CONSTRUCTED_USING_TWO_NUMBERS.cpp │ │ │ ├── COUNT_NUMBERS_THAT_DONT_CONTAIN_3.cpp │ │ │ ├── COUNT_NUMBER_BINARY_STRINGS_WITHOUT_CONSECUTIVE_1S.cpp │ │ │ ├── COUNT_NUMBER_INCREASING_SUBSEQUENCES_SIZE_K.cpp │ │ │ ├── COUNT_NUMBER_OF_OCCURRENCES_OR_FREQUENCY_IN_A_SORTED_ARRAY.cpp │ │ │ ├── COUNT_NUMBER_OF_WAYS_TO_COVER_A_DISTANCE_1.cpp │ │ │ ├── COUNT_NUMBER_OF_WAYS_TO_FILL_A_N_X_4_GRID_USING_1_X_4_TILES.cpp │ │ │ ├── COUNT_NUMBER_PAIRS_N_B_N_GCD_B_B.cpp │ │ │ ├── COUNT_NUMBER_WAYS_REACH_GIVEN_SCORE_GAME.cpp │ │ │ ├── COUNT_NUMBER_WAYS_TILE_FLOOR_SIZE_N_X_M_USING_1_X_M_SIZE_TILES.cpp │ │ │ ├── COUNT_OBTUSE_ANGLES_CIRCLE_K_EQUIDISTANT_POINTS_2_GIVEN_POINTS.cpp │ │ │ ├── COUNT_OFDIFFERENT_WAYS_EXPRESS_N_SUM_1_3_4.cpp │ │ │ ├── COUNT_OF_OCCURRENCES_OF_A_101_PATTERN_IN_A_STRING.cpp │ │ │ ├── COUNT_OF_PAIRS_SATISFYING_THE_GIVEN_CONDITION.cpp │ │ │ ├── COUNT_OF_SUB_STRINGS_THAT_DO_NOT_CONTAIN_ALL_THE_CHARACTERS_FROM_THE_SET_A_B_C_AT_THE_SAME_TIME.cpp │ │ │ ├── COUNT_PAIRS_DIFFERENCE_EQUAL_K.cpp │ │ │ ├── COUNT_PAIRS_DIFFERENCE_EQUAL_K_1.cpp │ │ │ ├── COUNT_PAIRS_TWO_SORTED_ARRAYS_WHOSE_SUM_EQUAL_GIVEN_VALUE_X.cpp │ │ │ ├── COUNT_PAIRS_TWO_SORTED_ARRAYS_WHOSE_SUM_EQUAL_GIVEN_VALUE_X_1.cpp │ │ │ ├── COUNT_PAIRS_TWO_SORTED_ARRAYS_WHOSE_SUM_EQUAL_GIVEN_VALUE_X_2.cpp │ │ │ ├── COUNT_PAIRS_WHOSE_PRODUCTS_EXIST_IN_ARRAY.cpp │ │ │ ├── COUNT_PAIRS_WHOSE_PRODUCTS_EXIST_IN_ARRAY_1.cpp │ │ │ ├── COUNT_PALINDROME_SUB_STRINGS_STRING.cpp │ │ │ ├── COUNT_PALINDROMIC_SUBSEQUENCE_GIVEN_STRING.cpp │ │ │ ├── COUNT_POSSIBLE_GROUPS_SIZE_2_3_SUM_MULTIPLE_3.cpp │ │ │ ├── COUNT_POSSIBLE_PATHS_TOP_LEFT_BOTTOM_RIGHT_NXM_MATRIX_1.cpp │ │ │ ├── COUNT_POSSIBLE_PATHS_TOP_LEFT_BOTTOM_RIGHT_NXM_MATRIX_2.cpp │ │ │ ├── COUNT_POSSIBLE_PATHS_TOP_LEFT_BOTTOM_RIGHT_NXM_MATRIX_3.cpp │ │ │ ├── COUNT_POSSIBLE_WAYS_TO_CONSTRUCT_BUILDINGS.cpp │ │ │ ├── COUNT_ROTATIONS_DIVISIBLE_4.cpp │ │ │ ├── COUNT_ROTATIONS_DIVISIBLE_8.cpp │ │ │ ├── COUNT_SET_BITS_IN_AN_INTEGER.cpp │ │ │ ├── COUNT_SET_BITS_IN_AN_INTEGER_1.cpp │ │ │ ├── COUNT_SET_BITS_IN_AN_INTEGER_3.cpp │ │ │ ├── COUNT_STRINGS_ADJACENT_CHARACTERS_DIFFERENCE_ONE.cpp │ │ │ ├── COUNT_STRINGS_CAN_FORMED_USING_B_C_GIVEN_CONSTRAINTS_1.cpp │ │ │ ├── COUNT_STRINGS_WITH_CONSECUTIVE_1S.cpp │ │ │ ├── COUNT_SUBARRAYS_EQUAL_NUMBER_1S_0S.cpp │ │ │ ├── COUNT_SUBARRAYS_EQUAL_NUMBER_1S_0S_1.cpp │ │ │ ├── COUNT_SUBARRAYS_TOTAL_DISTINCT_ELEMENTS_ORIGINAL_ARRAY.cpp │ │ │ ├── COUNT_SUBARRAYS_WITH_SAME_EVEN_AND_ODD_ELEMENTS.cpp │ │ │ ├── COUNT_SUBSETS_DISTINCT_EVEN_NUMBERS.cpp │ │ │ ├── COUNT_SUBSTRINGS_WITH_SAME_FIRST_AND_LAST_CHARACTERS.cpp │ │ │ ├── COUNT_SUM_OF_DIGITS_IN_NUMBERS_FROM_1_TO_N.cpp │ │ │ ├── COUNT_TOTAL_SET_BITS_IN_ALL_NUMBERS_FROM_1_TO_N.cpp │ │ │ ├── COUNT_TRAILING_ZEROES_FACTORIAL_NUMBER.cpp │ │ │ ├── COUNT_WAYS_BUILD_STREET_GIVEN_CONSTRAINTS.cpp │ │ │ ├── COUNT_WAYS_DIVIDE_CIRCLE_USING_N_NON_INTERSECTING_CHORDS.cpp │ │ │ ├── COUNT_WORDS_APPEAR_EXACTLY_TWO_TIMES_ARRAY_WORDS.cpp │ │ │ ├── COUNT_WORDS_WHOSE_TH_LETTER_EITHER_1_TH_TH_I1_TH_LETTER_GIVEN_WORD.cpp │ │ │ ├── C_PROGRAM_CONCATENATE_STRING_GIVEN_NUMBER_TIMES.cpp │ │ │ ├── C_PROGRAM_FACTORIAL_NUMBER.cpp │ │ │ ├── C_PROGRAM_FACTORIAL_NUMBER_1.cpp │ │ │ ├── C_PROGRAM_FACTORIAL_NUMBER_2.cpp │ │ │ ├── C_PROGRAM_FIND_LARGEST_ELEMENT_ARRAY_1.cpp │ │ │ ├── DECIMAL_BINARY_CONVERSION_WITHOUT_USING_ARITHMETIC_OPERATORS.cpp │ │ │ ├── DECIMAL_REPRESENTATION_GIVEN_BINARY_STRING_DIVISIBLE_10_NOT.cpp │ │ │ ├── DECODE_MEDIAN_STRING_ORIGINAL_STRING.cpp │ │ │ ├── DECODE_STRING_RECURSIVELY_ENCODED_COUNT_FOLLOWED_SUBSTRING.cpp │ │ │ ├── DELANNOY_NUMBER_1.cpp │ │ │ ├── DETECT_IF_TWO_INTEGERS_HAVE_OPPOSITE_SIGNS.cpp │ │ │ ├── DICE_THROW_PROBLEM.cpp │ │ │ ├── DICE_THROW_PROBLEM_1.cpp │ │ │ ├── DIFFERENCE_BETWEEN_HIGHEST_AND_LEAST_FREQUENCIES_IN_AN_ARRAY.cpp │ │ │ ├── DIFFERENCE_BETWEEN_HIGHEST_AND_LEAST_FREQUENCIES_IN_AN_ARRAY_1.cpp │ │ │ ├── DIFFERENCE_MAXIMUM_SUM_MINIMUM_SUM_N_M_ELEMENTSIN_REVIEW.cpp │ │ │ ├── DIFFERENT_WAYS_SUM_N_USING_NUMBERS_GREATER_EQUAL_M.cpp │ │ │ ├── DISCRETE_LOGARITHM_FIND_INTEGER_K_AK_CONGRUENT_MODULO_B.cpp │ │ │ ├── DISTRIBUTING_ITEMS_PERSON_CANNOT_TAKE_TWO_ITEMS_TYPE.cpp │ │ │ ├── DISTRIBUTING_ITEMS_PERSON_CANNOT_TAKE_TWO_ITEMS_TYPE_1.cpp │ │ │ ├── DISTRIBUTING_M_ITEMS_CIRCLE_SIZE_N_STARTING_K_TH_POSITION.cpp │ │ │ ├── DIVIDE_LARGE_NUMBER_REPRESENTED_STRING.cpp │ │ │ ├── DIVISIBILITY_9_USING_BITWISE_OPERATORS.cpp │ │ │ ├── DIVISIBILITY_BY_12_FOR_A_LARGE_NUMBER.cpp │ │ │ ├── DIVISIBILITY_BY_7.cpp │ │ │ ├── DOUBLE_FACTORIAL.cpp │ │ │ ├── DOUBLE_FACTORIAL_1.cpp │ │ │ ├── DYCK_PATH.cpp │ │ │ ├── DYNAMIC_PROGRAMMING_HIGH_EFFORT_VS_LOW_EFFORT_TASKS_PROBLEM.cpp │ │ │ ├── DYNAMIC_PROGRAMMING_SET_10_0_1_KNAPSACK_PROBLEM.cpp │ │ │ ├── DYNAMIC_PROGRAMMING_SET_11_EGG_DROPPING_PUZZLE_1.cpp │ │ │ ├── DYNAMIC_PROGRAMMING_SET_13_CUTTING_A_ROD.cpp │ │ │ ├── DYNAMIC_PROGRAMMING_SET_14_MAXIMUM_SUM_INCREASING_SUBSEQUENCE.cpp │ │ │ ├── DYNAMIC_PROGRAMMING_SET_15_LONGEST_BITONIC_SUBSEQUENCE.cpp │ │ │ ├── DYNAMIC_PROGRAMMING_SET_28_MINIMUM_INSERTIONS_TO_FORM_A_PALINDROME.cpp │ │ │ ├── DYNAMIC_PROGRAMMING_SET_36_CUT_A_ROPE_TO_MAXIMIZE_PRODUCT_1.cpp │ │ │ ├── DYNAMIC_PROGRAMMING_SET_37_BOOLEAN_PARENTHESIZATION_PROBLEM.cpp │ │ │ ├── DYNAMIC_PROGRAMMING_SET_3_LONGEST_INCREASING_SUBSEQUENCE_1.cpp │ │ │ ├── DYNAMIC_PROGRAMMING_SET_8_MATRIX_CHAIN_MULTIPLICATION.cpp │ │ │ ├── DYNAMIC_PROGRAMMING_SET_8_MATRIX_CHAIN_MULTIPLICATION_1.cpp │ │ │ ├── DYNAMIC_PROGRAMMING_SUBSET_SUM_PROBLEM_1.cpp │ │ │ ├── EFFICIENTLY_FIND_FIRST_REPEATED_CHARACTER_STRING_WITHOUT_USING_ADDITIONAL_DATA_STRUCTURE_ONE_TRAVERSAL.cpp │ │ │ ├── EFFICIENT_SEARCH_IN_AN_ARRAY_WHERE_DIFFERENCE_BETWEEN_ADJACENT_IS_1.cpp │ │ │ ├── EFFICIENT_WAY_CHECK_WHETHER_N_TH_FIBONACCI_NUMBER_MULTIPLE_10.cpp │ │ │ ├── EFFICIENT_WAY_TO_MULTIPLY_WITH_7.cpp │ │ │ ├── ELEMENTS_TO_BE_ADDED_SO_THAT_ALL_ELEMENTS_OF_A_RANGE_ARE_PRESENT_IN_ARRAY.cpp │ │ │ ├── EQUILIBRIUM_INDEX_OF_AN_ARRAY.cpp │ │ │ ├── EQUILIBRIUM_INDEX_OF_AN_ARRAY_1.cpp │ │ │ ├── EULERIAN_NUMBER_1.cpp │ │ │ ├── EULERS_CRITERION_CHECK_IF_SQUARE_ROOT_UNDER_MODULO_P_EXISTS.cpp │ │ │ ├── EVEN_FIBONACCI_NUMBERS_SUM.cpp │ │ │ ├── FAST_MULTIPLICATION_METHOD_WITHOUT_USING_MULTIPLICATION_OPERATOR_RUSSIAN_PEASANTS_ALGORITHM.cpp │ │ │ ├── FIBONACCI_MODULO_P.cpp │ │ │ ├── FINDING_POWER_PRIME_NUMBER_P_N.cpp │ │ │ ├── FINDING_POWER_PRIME_NUMBER_P_N_1.cpp │ │ │ ├── FIND_A_FIXED_POINT_IN_A_GIVEN_ARRAY.cpp │ │ │ ├── FIND_A_FIXED_POINT_IN_A_GIVEN_ARRAY_1.cpp │ │ │ ├── FIND_A_ROTATION_WITH_MAXIMUM_HAMMING_DISTANCE.cpp │ │ │ ├── FIND_A_TRIPLET_THAT_SUM_TO_A_GIVEN_VALUE.cpp │ │ │ ├── FIND_A_TRIPLET_THAT_SUM_TO_A_GIVEN_VALUE_1.cpp │ │ │ ├── FIND_A_TRIPLET_THAT_SUM_TO_A_GIVEN_VALUE_2.cpp │ │ │ ├── FIND_BITONIC_POINT_GIVEN_BITONIC_SEQUENCE.cpp │ │ │ ├── FIND_EQUAL_POINT_STRING_BRACKETS.cpp │ │ │ ├── FIND_EXPRESSION_DUPLICATE_PARENTHESIS_NOT.cpp │ │ │ ├── FIND_FIRST_NATURAL_NUMBER_WHOSE_FACTORIAL_DIVISIBLE_X.cpp │ │ │ ├── FIND_HARMONIC_MEAN_USING_ARITHMETIC_MEAN_GEOMETRIC_MEAN.cpp │ │ │ ├── FIND_INDEX_GIVEN_FIBONACCI_NUMBER_CONSTANT_TIME.cpp │ │ │ ├── FIND_INDEX_GIVEN_FIBONACCI_NUMBER_CONSTANT_TIME_1.cpp │ │ │ ├── FIND_INDEX_OF_AN_EXTRA_ELEMENT_PRESENT_IN_ONE_SORTED_ARRAY.cpp │ │ │ ├── FIND_INDEX_OF_AN_EXTRA_ELEMENT_PRESENT_IN_ONE_SORTED_ARRAY_1.cpp │ │ │ ├── FIND_LARGEST_D_IN_ARRAY_SUCH_THAT_A_B_C_D.cpp │ │ │ ├── FIND_LARGEST_D_IN_ARRAY_SUCH_THAT_A_B_C_D_1.cpp │ │ │ ├── FIND_LARGEST_PRIME_FACTOR_NUMBER.cpp │ │ │ ├── FIND_LAST_DIGIT_FACTORIAL_DIVIDES_FACTORIAL_B.cpp │ │ │ ├── FIND_MAXIMUM_AVERAGE_SUBARRAY_OF_K_LENGTH.cpp │ │ │ ├── FIND_MAXIMUM_AVERAGE_SUBARRAY_OF_K_LENGTH_1.cpp │ │ │ ├── FIND_MAXIMUM_DOT_PRODUCT_TWO_ARRAYS_INSERTION_0S.cpp │ │ │ ├── FIND_MAXIMUM_HEIGHT_PYRAMID_FROM_THE_GIVEN_ARRAY_OF_OBJECTS.cpp │ │ │ ├── FIND_MAXIMUM_PRODUCT_OF_A_TRIPLET_IN_ARRAY.cpp │ │ │ ├── FIND_MAXIMUM_PRODUCT_OF_A_TRIPLET_IN_ARRAY_1.cpp │ │ │ ├── FIND_MAXIMUM_SUM_POSSIBLE_EQUAL_SUM_THREE_STACKS.cpp │ │ │ ├── FIND_MINIMUM_DIFFERENCE_PAIR.cpp │ │ │ ├── FIND_MINIMUM_DIFFERENCE_PAIR_1.cpp │ │ │ ├── FIND_MINIMUM_ELEMENT_IN_A_SORTED_AND_ROTATED_ARRAY.cpp │ │ │ ├── FIND_MINIMUM_NUMBER_DIVIDED_MAKE_NUMBER_PERFECT_SQUARE.cpp │ │ │ ├── FIND_MINIMUM_NUMBER_OF_COINS_THAT_MAKE_A_CHANGE_1.cpp │ │ │ ├── FIND_MINIMUM_RADIUS_ATLEAST_K_POINT_LIE_INSIDE_CIRCLE.cpp │ │ │ ├── FIND_MINIMUM_SUM_FACTORS_NUMBER.cpp │ │ │ ├── FIND_NUMBER_PAIRS_ARRAY_XOR_0.cpp │ │ │ ├── FIND_NUMBER_PERFECT_SQUARES_TWO_GIVEN_NUMBERS.cpp │ │ │ ├── FIND_NUMBER_TIMES_STRING_OCCURS_GIVEN_STRING_1.cpp │ │ │ ├── FIND_N_TH_ELEMENT_FROM_STERNS_DIATOMIC_SERIES.cpp │ │ │ ├── FIND_ONE_EXTRA_CHARACTER_STRING_1.cpp │ │ │ ├── FIND_PAIR_MAXIMUM_GCD_ARRAY.cpp │ │ │ ├── FIND_PAIR_MAXIMUM_GCD_ARRAY_1.cpp │ │ │ ├── FIND_PAIR_WITH_GREATEST_PRODUCT_IN_ARRAY.cpp │ │ │ ├── FIND_PATTERNS_101_GIVEN_STRING.cpp │ │ │ ├── FIND_PERIMETER_CYLINDER.cpp │ │ │ ├── FIND_POSITION_GIVEN_NUMBER_AMONG_NUMBERS_MADE_4_7.cpp │ │ │ ├── FIND_RECTANGLE_BINARY_MATRIX_CORNERS_1.cpp │ │ │ ├── FIND_RECTANGLE_BINARY_MATRIX_CORNERS_1_1.cpp │ │ │ ├── FIND_REPEATING_ELEMENT_SORTED_ARRAY_SIZE_N.cpp │ │ │ ├── FIND_REPETITIVE_ELEMENT_1_N_1.cpp │ │ │ ├── FIND_REPETITIVE_ELEMENT_1_N_1_1.cpp │ │ │ ├── FIND_REPETITIVE_ELEMENT_1_N_1_2.cpp │ │ │ ├── FIND_ROTATION_COUNT_ROTATED_SORTED_ARRAY.cpp │ │ │ ├── FIND_ROTATION_COUNT_ROTATED_SORTED_ARRAY_1.cpp │ │ │ ├── FIND_SMALLEST_VALUE_REPRESENTED_SUM_SUBSET_GIVEN_ARRAY.cpp │ │ │ ├── FIND_SUBARRAY_WITH_GIVEN_SUM.cpp │ │ │ ├── FIND_SUBARRAY_WITH_GIVEN_SUM_1.cpp │ │ │ ├── FIND_SUM_EVEN_FACTORS_NUMBER.cpp │ │ │ ├── FIND_SUM_EVEN_INDEX_BINOMIAL_COEFFICIENTS.cpp │ │ │ ├── FIND_SUM_EVEN_INDEX_BINOMIAL_COEFFICIENTS_1.cpp │ │ │ ├── FIND_SUM_MODULO_K_FIRST_N_NATURAL_NUMBER.cpp │ │ │ ├── FIND_SUM_MODULO_K_FIRST_N_NATURAL_NUMBER_1.cpp │ │ │ ├── FIND_SUM_NON_REPEATING_DISTINCT_ELEMENTS_ARRAY.cpp │ │ │ ├── FIND_SUM_ODD_FACTORS_NUMBER.cpp │ │ │ ├── FIND_SUM_UNIQUE_SUB_ARRAY_SUM_GIVEN_ARRAY.cpp │ │ │ ├── FIND_THE_ELEMENT_BEFORE_WHICH_ALL_THE_ELEMENTS_ARE_SMALLER_THAN_IT_AND_AFTER_WHICH_ALL_ARE_GREATER_THAN_IT.cpp │ │ │ ├── FIND_THE_ELEMENT_THAT_APPEARS_ONCE.cpp │ │ │ ├── FIND_THE_ELEMENT_THAT_APPEARS_ONCE_2.cpp │ │ │ ├── FIND_THE_FIRST_MISSING_NUMBER.cpp │ │ │ ├── FIND_THE_LARGEST_SUBARRAY_WITH_0_SUM.cpp │ │ │ ├── FIND_THE_MAXIMUM_ELEMENT_IN_AN_ARRAY_WHICH_IS_FIRST_INCREASING_AND_THEN_DECREASING.cpp │ │ │ ├── FIND_THE_MAXIMUM_SUBARRAY_XOR_IN_A_GIVEN_ARRAY.cpp │ │ │ ├── FIND_THE_MINIMUM_DISTANCE_BETWEEN_TWO_NUMBERS.cpp │ │ │ ├── FIND_THE_MINIMUM_DISTANCE_BETWEEN_TWO_NUMBERS_1.cpp │ │ │ ├── FIND_THE_MISSING_NUMBER_1.cpp │ │ │ ├── FIND_THE_MISSING_NUMBER_2.cpp │ │ │ ├── FIND_THE_NUMBER_OCCURRING_ODD_NUMBER_OF_TIMES.cpp │ │ │ ├── FIND_THE_NUMBER_OCCURRING_ODD_NUMBER_OF_TIMES_1.cpp │ │ │ ├── FIND_THE_NUMBER_OCCURRING_ODD_NUMBER_OF_TIMES_2.cpp │ │ │ ├── FIND_THREE_ELEMENT_FROM_DIFFERENT_THREE_ARRAYS_SUCH_THAT_THAT_A_B_C_K.cpp │ │ │ ├── FIND_THREE_ELEMENT_FROM_DIFFERENT_THREE_ARRAYS_SUCH_THAT_THAT_A_B_C_K_1.cpp │ │ │ ├── FIND_UNIT_DIGIT_X_RAISED_POWER_Y.cpp │ │ │ ├── FIND_UNIT_DIGIT_X_RAISED_POWER_Y_1.cpp │ │ │ ├── FIND_VALUE_OF_Y_MOD_2_RAISED_TO_POWER_X.cpp │ │ │ ├── FIND_WHETHER_AN_ARRAY_IS_SUBSET_OF_ANOTHER_ARRAY_SET_1.cpp │ │ │ ├── FIND_WHETHER_AN_ARRAY_IS_SUBSET_OF_ANOTHER_ARRAY_SET_1_1.cpp │ │ │ ├── FIND_WHETHER_A_GIVEN_NUMBER_IS_A_POWER_OF_4_OR_NOT_1.cpp │ │ │ ├── FIND_WHETHER_A_GIVEN_NUMBER_IS_A_POWER_OF_4_OR_NOT_2.cpp │ │ │ ├── FIND_WHETHER_GIVEN_INTEGER_POWER_3_NOT.cpp │ │ │ ├── FIRST_ELEMENT_OCCURRING_K_TIMES_ARRAY.cpp │ │ │ ├── FIRST_UPPERCASE_LETTER_IN_A_STRING_ITERATIVE_AND_RECURSIVE.cpp │ │ │ ├── FIRST_UPPERCASE_LETTER_IN_A_STRING_ITERATIVE_AND_RECURSIVE_1.cpp │ │ │ ├── FLOOR_IN_A_SORTED_ARRAY.cpp │ │ │ ├── FLOOR_IN_A_SORTED_ARRAY_1.cpp │ │ │ ├── FORM_MINIMUM_NUMBER_FROM_GIVEN_SEQUENCE_1.cpp │ │ │ ├── FORM_SMALLEST_NUMBER_USING_ONE_SWAP_OPERATION.cpp │ │ │ ├── FREQUENT_ELEMENT_ARRAY.cpp │ │ │ ├── FREQUENT_ELEMENT_ARRAY_1.cpp │ │ │ ├── FRIENDS_PAIRING_PROBLEM.cpp │ │ │ ├── FRIENDS_PAIRING_PROBLEM_2.cpp │ │ │ ├── FUNCTION_COPY_STRING_ITERATIVE_RECURSIVE_1.cpp │ │ │ ├── GCD_ELEMENTS_GIVEN_RANGE.cpp │ │ │ ├── GIVEN_A_SORTED_AND_ROTATED_ARRAY_FIND_IF_THERE_IS_A_PAIR_WITH_A_GIVEN_SUM.cpp │ │ │ ├── GIVEN_A_SORTED_AND_ROTATED_ARRAY_FIND_IF_THERE_IS_A_PAIR_WITH_A_GIVEN_SUM_1.cpp │ │ │ ├── GIVEN_LARGE_NUMBER_CHECK_SUBSEQUENCE_DIGITS_DIVISIBLE_8_1.cpp │ │ │ ├── GIVEN_TWO_STRINGS_FIND_FIRST_STRING_SUBSEQUENCE_SECOND.cpp │ │ │ ├── GIVEN_TWO_STRINGS_FIND_FIRST_STRING_SUBSEQUENCE_SECOND_1.cpp │ │ │ ├── GOOGLE_CASE_GIVEN_SENTENCE.cpp │ │ │ ├── HARDY_RAMANUJAN_THEOREM.cpp │ │ │ ├── HEIGHT_COMPLETE_BINARY_TREE_HEAP_N_NODES.cpp │ │ │ ├── HEXAGONAL_NUMBER.cpp │ │ │ ├── HIGHWAY_BILLBOARD_PROBLEM.cpp │ │ │ ├── HORNERS_METHOD_POLYNOMIAL_EVALUATION.cpp │ │ │ ├── HOW_TO_BEGIN_WITH_COMPETITIVE_PROGRAMMING.cpp │ │ │ ├── HOW_TO_CHECK_IF_A_GIVEN_ARRAY_REPRESENTS_A_BINARY_HEAP.cpp │ │ │ ├── HOW_TO_CHECK_IF_A_GIVEN_ARRAY_REPRESENTS_A_BINARY_HEAP_1.cpp │ │ │ ├── HOW_TO_COMPUTE_MOD_OF_A_BIG_NUMBER.cpp │ │ │ ├── HOW_TO_PRINT_MAXIMUM_NUMBER_OF_A_USING_GIVEN_FOUR_KEYS.cpp │ │ │ ├── HOW_TO_TURN_OFF_A_PARTICULAR_BIT_IN_A_NUMBER.cpp │ │ │ ├── HYPERCUBE_GRAPH.cpp │ │ │ ├── INTEGER_POSITIVE_VALUE_POSITIVE_NEGATIVE_VALUE_ARRAY.cpp │ │ │ ├── INTEGER_POSITIVE_VALUE_POSITIVE_NEGATIVE_VALUE_ARRAY_1.cpp │ │ │ ├── K_NUMBERS_DIFFERENCE_MAXIMUM_MINIMUM_K_NUMBER_MINIMIZED.cpp │ │ │ ├── K_TH_DIGIT_RAISED_POWER_B.cpp │ │ │ ├── K_TH_DISTINCT_OR_NON_REPEATING_ELEMENT_IN_AN_ARRAY.cpp │ │ │ ├── K_TH_DISTINCT_OR_NON_REPEATING_ELEMENT_IN_AN_ARRAY_1.cpp │ │ │ ├── K_TH_ELEMENT_TWO_SORTED_ARRAYS.cpp │ │ │ ├── K_TH_LARGEST_SUM_CONTIGUOUS_SUBARRAY.cpp │ │ │ ├── K_TH_PRIME_FACTOR_GIVEN_NUMBER.cpp │ │ │ ├── LARGEST_SUBARRAY_WITH_EQUAL_NUMBER_OF_0S_AND_1S.cpp │ │ │ ├── LARGEST_SUBARRAY_WITH_EQUAL_NUMBER_OF_0S_AND_1S_1.cpp │ │ │ ├── LARGEST_SUBSEQUENCE_GCD_GREATER_1.cpp │ │ │ ├── LARGEST_SUM_CONTIGUOUS_SUBARRAY_2.cpp │ │ │ ├── LCS_FORMED_CONSECUTIVE_SEGMENTS_LEAST_LENGTH_K.cpp │ │ │ ├── LENGTH_LONGEST_BALANCED_SUBSEQUENCE.cpp │ │ │ ├── LENGTH_LONGEST_BALANCED_SUBSEQUENCE_1.cpp │ │ │ ├── LENGTH_LONGEST_STRICT_BITONIC_SUBSEQUENCE.cpp │ │ │ ├── LENGTH_LONGEST_SUB_STRING_CAN_MAKE_REMOVED.cpp │ │ │ ├── LENGTH_OF_THE_LONGEST_ARITHMATIC_PROGRESSION_IN_A_SORTED_ARRAY.cpp │ │ │ ├── LEONARDO_NUMBER_1.cpp │ │ │ ├── LEXICOGRAPHICALLY_MINIMUM_STRING_ROTATION.cpp │ │ │ ├── LEXICOGRAPHICALLY_NEXT_STRING.cpp │ │ │ ├── LEXICOGRAPHICAL_CONCATENATION_SUBSTRINGS_STRING.cpp │ │ │ ├── LEXICOGRAPHICAL_MAXIMUM_SUBSTRING_STRING.cpp │ │ │ ├── LONGEST_COMMON_INCREASING_SUBSEQUENCE_LCS_LIS.cpp │ │ │ ├── LONGEST_COMMON_SUBSTRING_SPACE_OPTIMIZED_DP_SOLUTION.cpp │ │ │ ├── LONGEST_CONSECUTIVE_SUBSEQUENCE.cpp │ │ │ ├── LONGEST_INCREASING_ODD_EVEN_SUBSEQUENCE.cpp │ │ │ ├── LONGEST_INCREASING_SUBSEQUENCE_1.cpp │ │ │ ├── LONGEST_PALINDROME_SUBSEQUENCE_SPACE.cpp │ │ │ ├── LONGEST_PREFIX_ALSO_SUFFIX_1.cpp │ │ │ ├── LONGEST_REPEATED_SUBSEQUENCE_1.cpp │ │ │ ├── LONGEST_REPEATING_AND_NON_OVERLAPPING_SUBSTRING.cpp │ │ │ ├── LONGEST_REPEATING_SUBSEQUENCE.cpp │ │ │ ├── LONGEST_SUBARRAY_COUNT_1S_ONE_COUNT_0S.cpp │ │ │ ├── LONGEST_SUBARRAY_SUM_DIVISIBLE_K.cpp │ │ │ ├── LONGEST_SUBSEQUENCE_DIFFERENCE_ADJACENTS_ONE_SET_2.cpp │ │ │ ├── LONGEST_SUBSEQUENCE_SUCH_THAT_DIFFERENCE_BETWEEN_ADJACENTS_IS_ONE.cpp │ │ │ ├── LOWER_INSERTION_POINT.cpp │ │ │ ├── MAKE_LARGEST_PALINDROME_CHANGING_K_DIGITS.cpp │ │ │ ├── MAKING_ELEMENTS_OF_TWO_ARRAYS_SAME_WITH_MINIMUM_INCREMENTDECREMENT.cpp │ │ │ ├── MAXIMIZE_ARRAY_ELEMENTS_UPTO_GIVEN_NUMBER.cpp │ │ │ ├── MAXIMIZE_SUM_ARRII.cpp │ │ │ ├── MAXIMIZE_SUM_CONSECUTIVE_DIFFERENCES_CIRCULAR_ARRAY.cpp │ │ │ ├── MAXIMIZE_VOLUME_CUBOID_GIVEN_SUM_SIDES.cpp │ │ │ ├── MAXIMIZE_VOLUME_CUBOID_GIVEN_SUM_SIDES_1.cpp │ │ │ ├── MAXIMUM_AREA_RECTANGLE_PICKING_FOUR_SIDES_ARRAY.cpp │ │ │ ├── MAXIMUM_AREA_RECTANGLE_PICKING_FOUR_SIDES_ARRAY_1.cpp │ │ │ ├── MAXIMUM_AVERAGE_SUM_PARTITION_ARRAY.cpp │ │ │ ├── MAXIMUM_BINOMIAL_COEFFICIENT_TERM_VALUE.cpp │ │ │ ├── MAXIMUM_CONSECUTIVE_NUMBERS_PRESENT_ARRAY.cpp │ │ │ ├── MAXIMUM_CONSECUTIVE_REPEATING_CHARACTER_STRING.cpp │ │ │ ├── MAXIMUM_CONSECUTIVE_REPEATING_CHARACTER_STRING_1.cpp │ │ │ ├── MAXIMUM_DIFFERENCE_BETWEEN_FREQUENCY_OF_TWO_ELEMENTS_SUCH_THAT_ELEMENT_HAVING_GREATER_FREQUENCY_IS_ALSO_GREATER.cpp │ │ │ ├── MAXIMUM_DISTANCE_TWO_OCCURRENCES_ELEMENT_ARRAY.cpp │ │ │ ├── MAXIMUM_EQULIBRIUM_SUM_ARRAY.cpp │ │ │ ├── MAXIMUM_GAMES_PLAYED_WINNER.cpp │ │ │ ├── MAXIMUM_HEIGHT_OF_TRIANGULAR_ARRANGEMENT_OF_ARRAY_VALUES.cpp │ │ │ ├── MAXIMUM_HEIGHT_OF_TRIANGULAR_ARRANGEMENT_OF_ARRAY_VALUES_1.cpp │ │ │ ├── MAXIMUM_LENGTH_PREFIX_ONE_STRING_OCCURS_SUBSEQUENCE_ANOTHER.cpp │ │ │ ├── MAXIMUM_LENGTH_SUBSEQUENCE_DIFFERENCE_ADJACENT_ELEMENTS_EITHER_0_1.cpp │ │ │ ├── MAXIMUM_NUMBER_2X2_SQUARES_CAN_FIT_INSIDE_RIGHT_ISOSCELES_TRIANGLE.cpp │ │ │ ├── MAXIMUM_NUMBER_CHARACTERS_TWO_CHARACTER_STRING.cpp │ │ │ ├── MAXIMUM_NUMBER_CHOCOLATES_DISTRIBUTED_EQUALLY_AMONG_K_STUDENTS.cpp │ │ │ ├── MAXIMUM_NUMBER_OF_SQUARES_THAT_CAN_BE_FIT_IN_A_RIGHT_ANGLE_ISOSCELES_TRIANGLE.cpp │ │ │ ├── MAXIMUM_NUMBER_SEGMENTS_LENGTHS_B_C.cpp │ │ │ ├── MAXIMUM_POINTS_INTERSECTION_N_CIRCLES.cpp │ │ │ ├── MAXIMUM_POSSIBLE_DIFFERENCE_TWO_SUBSETS_ARRAY.cpp │ │ │ ├── MAXIMUM_POSSIBLE_DIFFERENCE_TWO_SUBSETS_ARRAY_1.cpp │ │ │ ├── MAXIMUM_POSSIBLE_SUM_WINDOW_ARRAY_ELEMENTS_WINDOW_ARRAY_UNIQUE.cpp │ │ │ ├── MAXIMUM_PRODUCT_SUBARRAY_ADDED_NEGATIVE_PRODUCT_CASE.cpp │ │ │ ├── MAXIMUM_PRODUCT_SUBSET_ARRAY.cpp │ │ │ ├── MAXIMUM_PROFIT_BY_BUYING_AND_SELLING_A_SHARE_AT_MOST_K_TIMES.cpp │ │ │ ├── MAXIMUM_PROFIT_BY_BUYING_AND_SELLING_A_SHARE_AT_MOST_K_TIMES_1.cpp │ │ │ ├── MAXIMUM_PROFIT_BY_BUYING_AND_SELLING_A_SHARE_AT_MOST_TWICE.cpp │ │ │ ├── MAXIMUM_REMOVAL_FROM_ARRAY_WHEN_REMOVAL_TIME_WAITING_TIME.cpp │ │ │ ├── MAXIMUM_SEGMENT_VALUE_PUTTING_K_BREAKPOINTS_NUMBER.cpp │ │ │ ├── MAXIMUM_SUBARRAY_SUM_ARRAY_CREATED_REPEATED_CONCATENATION.cpp │ │ │ ├── MAXIMUM_SUBARRAY_SUM_USING_PREFIX_SUM.cpp │ │ │ ├── MAXIMUM_SUBSEQUENCE_SUM_SUCH_THAT_NO_THREE_ARE_CONSECUTIVE.cpp │ │ │ ├── MAXIMUM_SUM_ABSOLUTE_DIFFERENCE_ARRAY.cpp │ │ │ ├── MAXIMUM_SUM_ALTERNATING_SUBSEQUENCE_SUM.cpp │ │ │ ├── MAXIMUM_SUM_BITONIC_SUBARRAY.cpp │ │ │ ├── MAXIMUM_SUM_IARRI_AMONG_ROTATIONS_GIVEN_ARRAY.cpp │ │ │ ├── MAXIMUM_SUM_IARRI_AMONG_ROTATIONS_GIVEN_ARRAY_1.cpp │ │ │ ├── MAXIMUM_SUM_PAIRS_SPECIFIC_DIFFERENCE.cpp │ │ │ ├── MAXIMUM_SUM_PAIRS_SPECIFIC_DIFFERENCE_1.cpp │ │ │ ├── MAXIMUM_SUM_SUBARRAY_REMOVING_ONE_ELEMENT.cpp │ │ │ ├── MAXIMUM_SUM_SUBSEQUENCE_LEAST_K_DISTANT_ELEMENTS.cpp │ │ │ ├── MAXIMUM_TRIPLET_SUM_ARRAY.cpp │ │ │ ├── MAXIMUM_TRIPLET_SUM_ARRAY_1.cpp │ │ │ ├── MAXIMUM_TRIPLET_SUM_ARRAY_2.cpp │ │ │ ├── MAXIMUM_VALUE_CHOICE_EITHER_DIVIDING_CONSIDERING.cpp │ │ │ ├── MEDIAN_OF_TWO_SORTED_ARRAYS.cpp │ │ │ ├── MIDDLE_OF_THREE_USING_MINIMUM_COMPARISONS.cpp │ │ │ ├── MIDDLE_OF_THREE_USING_MINIMUM_COMPARISONS_1.cpp │ │ │ ├── MIDDLE_OF_THREE_USING_MINIMUM_COMPARISONS_2.cpp │ │ │ ├── MINIMAL_OPERATIONS_MAKE_NUMBER_MAGICAL.cpp │ │ │ ├── MINIMIZE_SUM_PRODUCT_TWO_ARRAYS_PERMUTATIONS_ALLOWED.cpp │ │ │ ├── MINIMIZE_THE_MAXIMUM_DIFFERENCE_BETWEEN_THE_HEIGHTS.cpp │ │ │ ├── MINIMIZE_THE_SUM_OF_DIGITS_OF_A_AND_B_SUCH_THAT_A_B_N.cpp │ │ │ ├── MINIMUM_CHARACTERS_ADDED_FRONT_MAKE_STRING_PALINDROME.cpp │ │ │ ├── MINIMUM_COST_CONNECT_WEIGHTED_NODES_REPRESENTED_ARRAY.cpp │ │ │ ├── MINIMUM_COST_CUT_BOARD_SQUARES.cpp │ │ │ ├── MINIMUM_COST_FOR_ACQUIRING_ALL_COINS_WITH_K_EXTRA_COINS_ALLOWED_WITH_EVERY_COIN.cpp │ │ │ ├── MINIMUM_COST_MAKE_ARRAY_SIZE_1_REMOVING_LARGER_PAIRS.cpp │ │ │ ├── MINIMUM_DIFFERENCE_MAX_MIN_K_SIZE_SUBSETS.cpp │ │ │ ├── MINIMUM_INCREMENT_K_OPERATIONS_MAKE_ELEMENTS_EQUAL.cpp │ │ │ ├── MINIMUM_INSERTIONS_SORT_ARRAY.cpp │ │ │ ├── MINIMUM_INSERTIONS_TO_FORM_A_PALINDROME_WITH_PERMUTATIONS_ALLOWED.cpp │ │ │ ├── MINIMUM_LENGTH_SUBARRAY_SUM_GREATER_GIVEN_VALUE.cpp │ │ │ ├── MINIMUM_LENGTH_SUBARRAY_SUM_GREATER_GIVEN_VALUE_1.cpp │ │ │ ├── MINIMUM_NUMBER_OF_BRACKET_REVERSALS_NEEDED_TO_MAKE_AN_EXPRESSION_BALANCED.cpp │ │ │ ├── MINIMUM_NUMBER_OF_JUMPS_TO_REACH_END_OF_A_GIVEN_ARRAY_1.cpp │ │ │ ├── MINIMUM_NUMBER_OF_JUMPS_TO_REACH_END_OF_A_GIVEN_ARRAY_2.cpp │ │ │ ├── MINIMUM_NUMBER_OF_SQUARES_WHOSE_SUM_EQUALS_TO_GIVEN_NUMBER_N_1.cpp │ │ │ ├── MINIMUM_NUMBER_PLATFORMS_REQUIRED_RAILWAYBUS_STATION.cpp │ │ │ ├── MINIMUM_NUMBER_SUBSETS_DISTINCT_ELEMENTS.cpp │ │ │ ├── MINIMUM_NUMBER_SUBSETS_DISTINCT_ELEMENTS_1.cpp │ │ │ ├── MINIMUM_OPERATIONS_MAKE_GCD_ARRAY_MULTIPLE_K.cpp │ │ │ ├── MINIMUM_OPERATION_MAKE_ELEMENTS_EQUAL_ARRAY.cpp │ │ │ ├── MINIMUM_PERIMETER_N_BLOCKS.cpp │ │ │ ├── MINIMUM_PRODUCT_K_INTEGERS_ARRAY_POSITIVE_INTEGERS.cpp │ │ │ ├── MINIMUM_PRODUCT_SUBSET_ARRAY.cpp │ │ │ ├── MINIMUM_ROOMS_FOR_M_EVENTS_OF_N_BATCHES_WITH_GIVEN_SCHEDULE.cpp │ │ │ ├── MINIMUM_ROTATIONS_REQUIRED_GET_STRING.cpp │ │ │ ├── MINIMUM_ROTATIONS_UNLOCK_CIRCULAR_LOCK.cpp │ │ │ ├── MINIMUM_STEPS_MINIMIZE_N_PER_GIVEN_CONDITION.cpp │ │ │ ├── MINIMUM_STEPS_TO_DELETE_A_STRING_AFTER_REPEATED_DELETION_OF_PALINDROME_SUBSTRINGS.cpp │ │ │ ├── MINIMUM_SUM_CHOOSING_MINIMUM_PAIRS_ARRAY.cpp │ │ │ ├── MINIMUM_SUM_PRODUCT_TWO_ARRAYS.cpp │ │ │ ├── MINIMUM_SUM_SUBSEQUENCE_LEAST_ONE_EVERY_FOUR_CONSECUTIVE_ELEMENTS_PICKED.cpp │ │ │ ├── MINIMUM_SUM_SUBSEQUENCE_LEAST_ONE_EVERY_FOUR_CONSECUTIVE_ELEMENTS_PICKED_1.cpp │ │ │ ├── MINIMUM_SUM_TWO_NUMBERS_FORMED_DIGITS_ARRAY.cpp │ │ │ ├── MINIMUM_SUM_TWO_NUMBERS_FORMED_DIGITS_ARRAY_2.cpp │ │ │ ├── MINIMUM_TIME_TO_FINISH_TASKS_WITHOUT_SKIPPING_TWO_CONSECUTIVE.cpp │ │ │ ├── MINIMUM_TIME_WRITE_CHARACTERS_USING_INSERT_DELETE_COPY_OPERATION.cpp │ │ │ ├── MINIMUM_XOR_VALUE_PAIR.cpp │ │ │ ├── MINIMUM_XOR_VALUE_PAIR_1.cpp │ │ │ ├── MIN_FLIPS_OF_CONTINUOUS_CHARACTERS_TO_MAKE_ALL_CHARACTERS_SAME_IN_A_STRING.cpp │ │ │ ├── MIRROR_CHARACTERS_STRING.cpp │ │ │ ├── MODULAR_EXPONENTIATION_POWER_IN_MODULAR_ARITHMETIC.cpp │ │ │ ├── MODULUS_TWO_FLOAT_DOUBLE_NUMBERS.cpp │ │ │ ├── MULTIPLY_AN_INTEGER_WITH_3_5.cpp │ │ │ ├── MULTIPLY_LARGE_INTEGERS_UNDER_LARGE_MODULO.cpp │ │ │ ├── MULTIPLY_LARGE_NUMBERS_REPRESENTED_AS_STRINGS.cpp │ │ │ ├── NEWMAN_CONWAY_SEQUENCE_1.cpp │ │ │ ├── NEXT_POWER_OF_2.cpp │ │ │ ├── NEXT_POWER_OF_2_1.cpp │ │ │ ├── NEXT_POWER_OF_2_2.cpp │ │ │ ├── NON_REPEATING_ELEMENT.cpp │ │ │ ├── NON_REPEATING_ELEMENT_1.cpp │ │ │ ├── NTH_EVEN_LENGTH_PALINDROME.cpp │ │ │ ├── NTH_NON_FIBONACCI_NUMBER.cpp │ │ │ ├── NTH_PENTAGONAL_NUMBER.cpp │ │ │ ├── NUMBER_DAYS_TANK_WILL_BECOME_EMPTY.cpp │ │ │ ├── NUMBER_DIGITS_PRODUCT_TWO_NUMBERS.cpp │ │ │ ├── NUMBER_DIGITS_PRODUCT_TWO_NUMBERS_1.cpp │ │ │ ├── NUMBER_DIGITS_REMOVED_MAKE_NUMBER_DIVISIBLE_3.cpp │ │ │ ├── NUMBER_INDEXES_EQUAL_ELEMENTS_GIVEN_RANGE.cpp │ │ │ ├── NUMBER_IS_DIVISIBLE_BY_29_OR_NOT.cpp │ │ │ ├── NUMBER_JUMP_REQUIRED_GIVEN_LENGTH_REACH_POINT_FORM_D_0_ORIGIN_2D_PLANE.cpp │ │ │ ├── NUMBER_NON_NEGATIVE_INTEGRAL_SOLUTIONS_B_C_N.cpp │ │ │ ├── NUMBER_NON_NEGATIVE_INTEGRAL_SOLUTIONS_B_C_N_1.cpp │ │ │ ├── NUMBER_N_DIGITS_NON_DECREASING_INTEGERS.cpp │ │ │ ├── NUMBER_N_DIGIT_STEPPING_NUMBERS.cpp │ │ │ ├── NUMBER_OF_BINARY_TREES_FOR_GIVEN_PREORDER_SEQUENCE_LENGTH.cpp │ │ │ ├── NUMBER_OF_PAIRS_IN_AN_ARRAY_HAVING_SUM_EQUAL_TO_PRODUCT.cpp │ │ │ ├── NUMBER_OF_SUBSTRINGS_WITH_ODD_DECIMAL_VALUE_IN_A_BINARY_STRING.cpp │ │ │ ├── NUMBER_OF_TRIANGLES_IN_A_PLANE_IF_NO_MORE_THAN_TWO_POINTS_ARE_COLLINEAR.cpp │ │ │ ├── NUMBER_ORDERED_PAIRS_AI_AJ_0.cpp │ │ │ ├── NUMBER_RECTANGLES_NM_GRID.cpp │ │ │ ├── NUMBER_SUBARRAYS_SUM_EXACTLY_EQUAL_K.cpp │ │ │ ├── NUMBER_SUBSEQUENCES_AB_STRING_REPEATED_K_TIMES.cpp │ │ │ ├── NUMBER_SUBSEQUENCES_FORM_AI_BJ_CK.cpp │ │ │ ├── NUMBER_SUBSEQUENCES_STRING_DIVISIBLE_N.cpp │ │ │ ├── NUMBER_SUBSTRINGS_DIVISIBLE_4_STRING_INTEGERS.cpp │ │ │ ├── NUMBER_SUBSTRINGS_STRING.cpp │ │ │ ├── NUMBER_TRIANGLES_N_MOVES.cpp │ │ │ ├── NUMBER_TRIANGLES_N_MOVES_1.cpp │ │ │ ├── NUMBER_UNIQUE_RECTANGLES_FORMED_USING_N_UNIT_SQUARES.cpp │ │ │ ├── NUMBER_VISIBLE_BOXES_PUTTING_ONE_INSIDE_ANOTHER.cpp │ │ │ ├── NUMBER_WAYS_NODE_MAKE_LOOP_SIZE_K_UNDIRECTED_COMPLETE_CONNECTED_GRAPH_N_NODES.cpp │ │ │ ├── NUMBER_WHICH_HAS_THE_MAXIMUM_NUMBER_OF_DISTINCT_PRIME_FACTORS_IN_RANGE_M_TO_N.cpp │ │ │ ├── N_TH_NUMBER_WHOSE_SUM_OF_DIGITS_IS_TEN.cpp │ │ │ ├── N_TH_NUMBER_WHOSE_SUM_OF_DIGITS_IS_TEN_1.cpp │ │ │ ├── N_TH_NUMBER_WHOSE_SUM_OF_DIGITS_IS_TEN_2.cpp │ │ │ ├── N_TH_TERM_SERIES_2_12_36_80_150.cpp │ │ │ ├── ONE_LINE_FUNCTION_FOR_FACTORIAL_OF_A_NUMBER.cpp │ │ │ ├── OVERLAPPING_SUM_TWO_ARRAY.cpp │ │ │ ├── PADOVAN_SEQUENCE.cpp │ │ │ ├── PAINTING_FENCE_ALGORITHM.cpp │ │ │ ├── PAIR_WITH_GIVEN_PRODUCT_SET_1_FIND_IF_ANY_PAIR_EXISTS.cpp │ │ │ ├── PAIR_WITH_GIVEN_PRODUCT_SET_1_FIND_IF_ANY_PAIR_EXISTS_1.cpp │ │ │ ├── PANGRAM_CHECKING.cpp │ │ │ ├── PAPER_CUT_MINIMUM_NUMBER_SQUARES.cpp │ │ │ ├── PARTITION_INTO_TWO_SUBARRAYS_OF_LENGTHS_K_AND_N_K_SUCH_THAT_THE_DIFFERENCE_OF_SUMS_IS_MAXIMUM.cpp │ │ │ ├── PERFECT_REVERSIBLE_STRING.cpp │ │ │ ├── PERMUTE_TWO_ARRAYS_SUM_EVERY_PAIR_GREATER_EQUAL_K.cpp │ │ │ ├── PIZZA_CUT_PROBLEM_CIRCLE_DIVISION_LINES.cpp │ │ │ ├── POLICEMEN_CATCH_THIEVES.cpp │ │ │ ├── POSITION_ELEMENT_STABLE_SORT.cpp │ │ │ ├── POSITION_OF_RIGHTMOST_SET_BIT_1.cpp │ │ │ ├── POSITIVE_ELEMENTS_EVEN_NEGATIVE_ODD_POSITIONS.cpp │ │ │ ├── POSSIBLE_FORM_TRIANGLE_ARRAY_VALUES.cpp │ │ │ ├── POSSIBLE_TO_MAKE_A_DIVISIBLE_BY_3_NUMBER_USING_ALL_DIGITS_IN_AN_ARRAY.cpp │ │ │ ├── PRIMALITY_TEST_SET_1_INTRODUCTION_AND_SCHOOL_METHOD.cpp │ │ │ ├── PRIMALITY_TEST_SET_1_INTRODUCTION_AND_SCHOOL_METHOD_1.cpp │ │ │ ├── PRIMALITY_TEST_SET_5USING_LUCAS_LEHMER_SERIES.cpp │ │ │ ├── PRIME_NUMBERS.cpp │ │ │ ├── PRINT_A_CLOSEST_STRING_THAT_DOES_NOT_CONTAIN_ADJACENT_DUPLICATES.cpp │ │ │ ├── PRINT_MAXIMUM_SHORTEST_DISTANCE.cpp │ │ │ ├── PRINT_SHORTEST_COMMON_SUPERSEQUENCE.cpp │ │ │ ├── PRINT_WORDS_STRING_REVERSE_ORDER.cpp │ │ │ ├── PROBABILITY_THREE_RANDOMLY_CHOSEN_NUMBERS_AP.cpp │ │ │ ├── PRODUCT_MAXIMUM_FIRST_ARRAY_MINIMUM_SECOND.cpp │ │ │ ├── PRODUCT_MAXIMUM_FIRST_ARRAY_MINIMUM_SECOND_1.cpp │ │ │ ├── PRODUCT_NODES_K_TH_LEVEL_TREE_REPRESENTED_STRING.cpp │ │ │ ├── PROGRAMMING_PUZZLE_ASSIGN_VALUE_WITHOUT_CONTROL_STATEMENT.cpp │ │ │ ├── PROGRAM_AREA_SQUARE.cpp │ │ │ ├── PROGRAM_BINARY_DECIMAL_CONVERSION.cpp │ │ │ ├── PROGRAM_BINARY_DECIMAL_CONVERSION_1.cpp │ │ │ ├── PROGRAM_CALCULATE_AREA_OCTAGON.cpp │ │ │ ├── PROGRAM_CALCULATE_VOLUME_ELLIPSOID.cpp │ │ │ ├── PROGRAM_CALCULATE_VOLUME_OCTAHEDRON.cpp │ │ │ ├── PROGRAM_CHECK_ARRAY_SORTED_NOT_ITERATIVE_RECURSIVE.cpp │ │ │ ├── PROGRAM_CHECK_ARRAY_SORTED_NOT_ITERATIVE_RECURSIVE_1.cpp │ │ │ ├── PROGRAM_CHECK_INPUT_INTEGER_STRING.cpp │ │ │ ├── PROGRAM_CHECK_ISBN.cpp │ │ │ ├── PROGRAM_CHECK_PLUS_PERFECT_NUMBER.cpp │ │ │ ├── PROGRAM_CIRCUMFERENCE_PARALLELOGRAM.cpp │ │ │ ├── PROGRAM_COUNT_OCCURRENCE_GIVEN_CHARACTER_STRING.cpp │ │ │ ├── PROGRAM_FIND_REMAINDER_LARGE_NUMBER_DIVIDED_11.cpp │ │ │ ├── PROGRAM_FIND_SLOPE_LINE.cpp │ │ │ ├── PROGRAM_FIND_SMALLEST_DIFFERENCE_ANGLES_TWO_PARTS_GIVEN_CIRCLE.cpp │ │ │ ├── PROGRAM_FIND_STRING_START_END_GEEKS.cpp │ │ │ ├── PROGRAM_FOR_DEADLOCK_FREE_CONDITION_IN_OPERATING_SYSTEM.cpp │ │ │ ├── PROGRAM_FOR_FACTORIAL_OF_A_NUMBER.cpp │ │ │ ├── PROGRAM_FOR_FACTORIAL_OF_A_NUMBER_1.cpp │ │ │ ├── PROGRAM_FOR_FACTORIAL_OF_A_NUMBER_2.cpp │ │ │ ├── PROGRAM_FOR_SURFACE_AREA_OF_OCTAHEDRON.cpp │ │ │ ├── PROGRAM_OCTAL_DECIMAL_CONVERSION.cpp │ │ │ ├── PROGRAM_PAGE_REPLACEMENT_ALGORITHMS_SET_2_FIFO.cpp │ │ │ ├── PROGRAM_PRINT_SUM_GIVEN_NTH_TERM.cpp │ │ │ ├── PROGRAM_PRINT_SUM_GIVEN_NTH_TERM_1.cpp │ │ │ ├── PROGRAM_TO_CHECK_IF_A_GIVEN_NUMBER_IS_LUCKY_ALL_DIGITS_ARE_DIFFERENT.cpp │ │ │ ├── PROGRAM_TO_FIND_REMAINDER_WITHOUT_USING_MODULO_OR_OPERATOR.cpp │ │ │ ├── PROGRAM_TO_FIND_REMAINDER_WITHOUT_USING_MODULO_OR_OPERATOR_1.cpp │ │ │ ├── PROGRAM_TO_FIND_REMAINDER_WITHOUT_USING_MODULO_OR_OPERATOR_2.cpp │ │ │ ├── PROGRAM_TO_FIND_THE_AREA_OF_PENTAGON.cpp │ │ │ ├── PROGRAM_TO_FIND_THE_VOLUME_OF_A_TRIANGULAR_PRISM.cpp │ │ │ ├── PYTHAGOREAN_QUADRUPLE.cpp │ │ │ ├── PYTHON_PROGRAM_FIND_PERIMETER_CIRCUMFERENCE_SQUARE_RECTANGLE.cpp │ │ │ ├── PYTHON_PROGRAM_FIND_PERIMETER_CIRCUMFERENCE_SQUARE_RECTANGLE_1.cpp │ │ │ ├── QUERIES_COUNTS_ARRAY_ELEMENTS_VALUES_GIVEN_RANGE.cpp │ │ │ ├── QUICK_WAY_CHECK_CHARACTERS_STRING.cpp │ │ │ ├── REARRANGE_ARRAY_MAXIMUM_MINIMUM_FORM_SET_2_O1_EXTRA_SPACE.cpp │ │ │ ├── REARRANGE_ARRAY_MAXIMUM_MINIMUM_FORM_SET_2_O1_EXTRA_SPACE_1.cpp │ │ │ ├── RECURSIVELY_BREAK_NUMBER_3_PARTS_GET_MAXIMUM_SUM.cpp │ │ │ ├── RECURSIVELY_BREAK_NUMBER_3_PARTS_GET_MAXIMUM_SUM_1.cpp │ │ │ ├── RECURSIVE_C_PROGRAM_LINEARLY_SEARCH_ELEMENT_GIVEN_ARRAY.cpp │ │ │ ├── RECURSIVE_PROGRAM_PRIME_NUMBER.cpp │ │ │ ├── REMAINDER_7_LARGE_NUMBERS.cpp │ │ │ ├── REMOVE_MINIMUM_ELEMENTS_EITHER_SIDE_2MIN_MAX.cpp │ │ │ ├── REMOVE_MINIMUM_NUMBER_ELEMENTS_NO_COMMON_ELEMENT_EXIST_ARRAY.cpp │ │ │ ├── REPLACE_CHARACTER_C1_C2_C2_C1_STRING_S.cpp │ │ │ ├── REQUIRED_MINIMUM_DIGITS_REMOVE_NUMBER_MAKE_PERFECT_SQUARE.cpp │ │ │ ├── ROUND_THE_GIVEN_NUMBER_TO_NEAREST_MULTIPLE_OF_10.cpp │ │ │ ├── SCHEDULE_ELEVATOR_TO_REDUCE_THE_TOTAL_TIME_TAKEN.cpp │ │ │ ├── SCHEDULE_JOBS_SERVER_GETS_EQUAL_LOAD.cpp │ │ │ ├── SEARCHING_ARRAY_ADJACENT_DIFFER_K.cpp │ │ │ ├── SEARCH_ALMOST_SORTED_ARRAY.cpp │ │ │ ├── SEARCH_AN_ELEMENT_IN_AN_ARRAY_WHERE_DIFFERENCE_BETWEEN_ADJACENT_ELEMENTS_IS_1.cpp │ │ │ ├── SEARCH_AN_ELEMENT_IN_A_SORTED_AND_PIVOTED_ARRAY.cpp │ │ │ ├── SEARCH_INSERT_AND_DELETE_IN_AN_UNSORTED_ARRAY.cpp │ │ │ ├── SEARCH_INSERT_AND_DELETE_IN_A_SORTED_ARRAY.cpp │ │ │ ├── SEARCH_INSERT_AND_DELETE_IN_A_SORTED_ARRAY_1.cpp │ │ │ ├── SEQUENCES_GIVEN_LENGTH_EVERY_ELEMENT_EQUAL_TWICE_PREVIOUS.cpp │ │ │ ├── SEQUENCES_GIVEN_LENGTH_EVERY_ELEMENT_EQUAL_TWICE_PREVIOUS_1.cpp │ │ │ ├── SIZE_SUBARRAY_MAXIMUM_SUM.cpp │ │ │ ├── SMALLEST_DIFFERENCE_PAIR_VALUES_TWO_UNSORTED_ARRAYS.cpp │ │ │ ├── SMALLEST_ELEMENT_REPEATED_EXACTLY_K_TIMES_NOT_LIMITED_SMALL_RANGE.cpp │ │ │ ├── SMALLEST_OF_THREE_INTEGERS_WITHOUT_COMPARISON_OPERATORS.cpp │ │ │ ├── SMALLEST_OF_THREE_INTEGERS_WITHOUT_COMPARISON_OPERATORS_1.cpp │ │ │ ├── SMALLEST_POWER_OF_2_GREATER_THAN_OR_EQUAL_TO_N.cpp │ │ │ ├── SMALLEST_POWER_OF_2_GREATER_THAN_OR_EQUAL_TO_N_1.cpp │ │ │ ├── SMALLEST_POWER_OF_2_GREATER_THAN_OR_EQUAL_TO_N_2.cpp │ │ │ ├── SMALLEST_SUBSET_SUM_GREATER_ELEMENTS.cpp │ │ │ ├── SMALLEST_SUM_CONTIGUOUS_SUBARRAY.cpp │ │ │ ├── SORT_ARRAY_APPLYING_GIVEN_EQUATION.cpp │ │ │ ├── SORT_ARRAY_CONTAIN_1_N_VALUES.cpp │ │ │ ├── SORT_ARRAY_TWO_HALVES_SORTED.cpp │ │ │ ├── SORT_EVEN_NUMBERS_ASCENDING_ORDER_SORT_ODD_NUMBERS_DESCENDING_ORDER_1.cpp │ │ │ ├── SORT_EVEN_PLACED_ELEMENTS_INCREASING_ODD_PLACED_DECREASING_ORDER.cpp │ │ │ ├── SPACE_OPTIMIZED_DP_SOLUTION_0_1_KNAPSACK_PROBLEM.cpp │ │ │ ├── SPACE_OPTIMIZED_DP_SOLUTION_0_1_KNAPSACK_PROBLEM_1.cpp │ │ │ ├── SPACE_OPTIMIZED_SOLUTION_LCS.cpp │ │ │ ├── SPLIT_ARRAY_ADD_FIRST_PART_END.cpp │ │ │ ├── SPLIT_N_MAXIMUM_COMPOSITE_NUMBERS.cpp │ │ │ ├── SQUARED_TRIANGULAR_NUMBER_SUM_CUBES.cpp │ │ │ ├── SQUARE_PYRAMIDAL_NUMBER_SUM_SQUARES.cpp │ │ │ ├── SQUARE_ROOT_OF_AN_INTEGER.cpp │ │ │ ├── SQUARE_ROOT_OF_AN_INTEGER_1.cpp │ │ │ ├── STACK_PERMUTATIONS_CHECK_IF_AN_ARRAY_IS_STACK_PERMUTATION_OF_OTHER.cpp │ │ │ ├── STEINS_ALGORITHM_FOR_FINDING_GCD_1.cpp │ │ │ ├── STOOGE_SORT.cpp │ │ │ ├── STRING_CONTAINING_FIRST_LETTER_EVERY_WORD_GIVEN_STRING_SPACES.cpp │ │ │ ├── STRING_K_DISTINCT_CHARACTERS_NO_CHARACTERS_ADJACENT.cpp │ │ │ ├── SUBARRAYS_DISTINCT_ELEMENTS.cpp │ │ │ ├── SUBSEQUENCES_SIZE_THREE_ARRAY_WHOSE_SUM_DIVISIBLE_M.cpp │ │ │ ├── SUBSEQUENCES_SIZE_THREE_ARRAY_WHOSE_SUM_DIVISIBLE_M_1.cpp │ │ │ ├── SUBSET_SUM_DIVISIBLE_M.cpp │ │ │ ├── SUBSET_SUM_PROBLEM_OSUM_SPACE.cpp │ │ │ ├── SUM_AREA_RECTANGLES_POSSIBLE_ARRAY.cpp │ │ │ ├── SUM_BINOMIAL_COEFFICIENTS.cpp │ │ │ ├── SUM_BINOMIAL_COEFFICIENTS_1.cpp │ │ │ ├── SUM_DIVISORS_1_N_1.cpp │ │ │ ├── SUM_FACTORS_NUMBER.cpp │ │ │ ├── SUM_FACTORS_NUMBER_1.cpp │ │ │ ├── SUM_FAI_AJ_PAIRS_ARRAY_N_INTEGERS.cpp │ │ │ ├── SUM_FIBONACCI_NUMBERS.cpp │ │ │ ├── SUM_K_TH_GROUP_ODD_POSITIVE_NUMBERS.cpp │ │ │ ├── SUM_K_TH_GROUP_ODD_POSITIVE_NUMBERS_1.cpp │ │ │ ├── SUM_LARGEST_PRIME_FACTOR_NUMBER_LESS_EQUAL_N.cpp │ │ │ ├── SUM_MANHATTAN_DISTANCES_PAIRS_POINTS.cpp │ │ │ ├── SUM_MATRIX_ELEMENT_ABSOLUTE_DIFFERENCE_ROW_COLUMN_NUMBERS.cpp │ │ │ ├── SUM_MATRIX_ELEMENT_ABSOLUTE_DIFFERENCE_ROW_COLUMN_NUMBERS_1.cpp │ │ │ ├── SUM_MATRIX_ELEMENT_ABSOLUTE_DIFFERENCE_ROW_COLUMN_NUMBERS_2.cpp │ │ │ ├── SUM_MATRIX_ELEMENT_ELEMENT_INTEGER_DIVISION_ROW_COLUMN.cpp │ │ │ ├── SUM_MATRIX_ELEMENT_ELEMENT_INTEGER_DIVISION_ROW_COLUMN_1.cpp │ │ │ ├── SUM_NODES_K_TH_LEVEL_TREE_REPRESENTED_STRING.cpp │ │ │ ├── SUM_OF_ALL_ELEMENTS_UP_TO_NTH_ROW_IN_A_PASCALS_TRIANGLE.cpp │ │ │ ├── SUM_OF_ALL_ELEMENTS_UP_TO_NTH_ROW_IN_A_PASCALS_TRIANGLE_1.cpp │ │ │ ├── SUM_OF_ALL_PROPER_DIVISORS_OF_A_NATURAL_NUMBER.cpp │ │ │ ├── SUM_PAIRWISE_PRODUCTS.cpp │ │ │ ├── SUM_PAIRWISE_PRODUCTS_1.cpp │ │ │ ├── SUM_PAIRWISE_PRODUCTS_2.cpp │ │ │ ├── SUM_SERIES_0_6_0_06_0_006_0_0006_N_TERMS.cpp │ │ │ ├── SUM_SERIES_12_32_52_2N_12.cpp │ │ │ ├── SUM_SERIES_12_32_52_2N_12_1.cpp │ │ │ ├── SUM_SERIES_23_45_67_89_UPTO_N_TERMS.cpp │ │ │ ├── SUM_SERIES_555555_N_TERMS.cpp │ │ │ ├── SUM_SERIES_ALTERNATE_SIGNED_SQUARES_AP.cpp │ │ │ ├── SUM_SERIES_ALTERNATE_SIGNED_SQUARES_AP_1.cpp │ │ │ ├── SUM_SQUARES_BINOMIAL_COEFFICIENTS.cpp │ │ │ ├── SUM_SUBSETS_SET_FORMED_FIRST_N_NATURAL_NUMBERS.cpp │ │ │ ├── SUM_TWO_LARGE_NUMBERS.cpp │ │ │ ├── SUM_TWO_LARGE_NUMBERS_1.cpp │ │ │ ├── SWAP_ALL_ODD_AND_EVEN_BITS.cpp │ │ │ ├── SWAP_BITS_IN_A_GIVEN_NUMBER.cpp │ │ │ ├── SWAP_TWO_NIBBLES_BYTE.cpp │ │ │ ├── TAIL_RECURSION.cpp │ │ │ ├── TAIL_RECURSION_FIBONACCI.cpp │ │ │ ├── TEMPLE_OFFERINGS.cpp │ │ │ ├── TILING_WITH_DOMINOES.cpp │ │ │ ├── TOTAL_NUMBER_OF_NON_DECREASING_NUMBERS_WITH_N_DIGITS.cpp │ │ │ ├── TOTAL_NUMBER_OF_NON_DECREASING_NUMBERS_WITH_N_DIGITS_1.cpp │ │ │ ├── TRIANGULAR_MATCHSTICK_NUMBER.cpp │ │ │ ├── TRIANGULAR_NUMBERS.cpp │ │ │ ├── TRIANGULAR_NUMBERS_1.cpp │ │ │ ├── TURN_OFF_THE_RIGHTMOST_SET_BIT.cpp │ │ │ ├── UGLY_NUMBERS.cpp │ │ │ ├── UNBOUNDED_KNAPSACK_REPETITION_ITEMS_ALLOWED.cpp │ │ │ ├── WAYS_REMOVE_ONE_ELEMENT_BINARY_STRING_XOR_BECOMES_ZERO.cpp │ │ │ ├── WAYS_TO_WRITE_N_AS_SUM_OF_TWO_OR_MORE_POSITIVE_INTEGERS.cpp │ │ │ ├── WAYS_TRANSFORMING_ONE_STRING_REMOVING_0_CHARACTERS.cpp │ │ │ ├── WRITE_AN_EFFICIENT_METHOD_TO_CHECK_IF_A_NUMBER_IS_MULTIPLE_OF_3.cpp │ │ │ ├── WRITE_A_C_PROGRAM_TO_FIND_THE_PARITY_OF_AN_UNSIGNED_INTEGER.cpp │ │ │ ├── WRITE_ONE_LINE_C_FUNCTION_TO_FIND_WHETHER_A_NO_IS_POWER_OF_TWO.cpp │ │ │ ├── WRITE_YOU_OWN_POWER_WITHOUT_USING_MULTIPLICATION_AND_DIVISION.cpp │ │ │ └── ZECKENDORFS_THEOREM_NON_NEIGHBOURING_FIBONACCI_REPRESENTATION.cpp │ │ │ ├── java │ │ │ ├── ADD_1_TO_A_GIVEN_NUMBER.java │ │ │ ├── ADD_1_TO_A_GIVEN_NUMBER_1.java │ │ │ ├── ADD_TWO_NUMBERS_WITHOUT_USING_ARITHMETIC_OPERATORS.java │ │ │ ├── ANALYSIS_OF_ALGORITHMS_SET_2_ASYMPTOTIC_ANALYSIS.java │ │ │ ├── AREA_CIRCUMSCRIBED_CIRCLE_SQUARE.java │ │ │ ├── AREA_OF_A_HEXAGON.java │ │ │ ├── AREA_OF_THE_CIRCLE_THAT_HAS_A_SQUARE_AND_A_CIRCLE_INSCRIBED_IN_IT.java │ │ │ ├── AREA_SQUARE_CIRCUMSCRIBED_CIRCLE.java │ │ │ ├── ARRAY_ELEMENT_MOVED_K_USING_SINGLE_MOVES.java │ │ │ ├── ARRAY_RANGE_QUERIES_ELEMENTS_FREQUENCY_VALUE.java │ │ │ ├── BASIC_AND_EXTENDED_EUCLIDEAN_ALGORITHMS.java │ │ │ ├── BASIC_AND_EXTENDED_EUCLIDEAN_ALGORITHMS_1.java │ │ │ ├── BELL_NUMBERS_NUMBER_OF_WAYS_TO_PARTITION_A_SET.java │ │ │ ├── BINARY_REPRESENTATION_OF_NEXT_NUMBER.java │ │ │ ├── BINARY_SEARCH.java │ │ │ ├── BIN_PACKING_PROBLEM_MINIMIZE_NUMBER_OF_USED_BINS.java │ │ │ ├── BREAKING_NUMBER_FIRST_PART_INTEGRAL_DIVISION_SECOND_POWER_10.java │ │ │ ├── BREAK_NUMBER_THREE_PARTS.java │ │ │ ├── BREAK_NUMBER_THREE_PARTS_1.java │ │ │ ├── CALCULATE_ANGLE_HOUR_HAND_MINUTE_HAND.java │ │ │ ├── CALCULATE_AREA_TETRAHEDRON.java │ │ │ ├── CALCULATE_MAXIMUM_VALUE_USING_SIGN_TWO_NUMBERS_STRING.java │ │ │ ├── CALCULATE_VOLUME_DODECAHEDRON.java │ │ │ ├── CALCULATING_FACTORIALS_USING_STIRLING_APPROXIMATION.java │ │ │ ├── CASSINIS_IDENTITY.java │ │ │ ├── CEILING_IN_A_SORTED_ARRAY.java │ │ │ ├── CEILING_IN_A_SORTED_ARRAY_1.java │ │ │ ├── CENTER_ELEMENT_OF_MATRIX_EQUALS_SUMS_OF_HALF_DIAGONALS.java │ │ │ ├── CHANGE_ARRAY_PERMUTATION_NUMBERS_1_N.java │ │ │ ├── CHANGE_BITS_CAN_MADE_ONE_FLIP.java │ │ │ ├── CHANGE_BITS_CAN_MADE_ONE_FLIP_1.java │ │ │ ├── CHECK_ARRAY_CONTAINS_CONTIGUOUS_INTEGERS_DUPLICATES_ALLOWED.java │ │ │ ├── CHECK_ARRAY_CONTAINS_CONTIGUOUS_INTEGERS_DUPLICATES_ALLOWED_1.java │ │ │ ├── CHECK_ARRAY_MAJORITY_ELEMENT.java │ │ │ ├── CHECK_ARRAY_REPRESENTS_INORDER_BINARY_SEARCH_TREE_NOT.java │ │ │ ├── CHECK_CHARACTERS_GIVEN_STRING_CAN_REARRANGED_FORM_PALINDROME_1.java │ │ │ ├── CHECK_DIVISIBILITY_LARGE_NUMBER_999.java │ │ │ ├── CHECK_EXIST_TWO_ELEMENTS_ARRAY_WHOSE_SUM_EQUAL_SUM_REST_ARRAY.java │ │ │ ├── CHECK_GIVEN_CIRCLE_LIES_COMPLETELY_INSIDE_RING_FORMED_TWO_CONCENTRIC_CIRCLES.java │ │ │ ├── CHECK_GIVEN_MATRIX_SPARSE_NOT.java │ │ │ ├── CHECK_GIVEN_SENTENCE_GIVEN_SET_SIMPLE_GRAMMER_RULES.java │ │ │ ├── CHECK_GIVEN_STRING_ROTATION_PALINDROME.java │ │ │ ├── CHECK_IF_ALL_THE_ELEMENTS_CAN_BE_MADE_OF_SAME_PARITY_BY_INVERTING_ADJACENT_ELEMENTS.java │ │ │ ├── CHECK_IF_A_GIVEN_ARRAY_CAN_REPRESENT_PREORDER_TRAVERSAL_OF_BINARY_SEARCH_TREE.java │ │ │ ├── CHECK_IF_A_NUMBER_IS_JUMBLED_OR_NOT.java │ │ │ ├── CHECK_IF_A_NUMBER_IS_POWER_OF_ANOTHER_NUMBER.java │ │ │ ├── CHECK_IF_A_NUMBER_IS_POWER_OF_ANOTHER_NUMBER_1.java │ │ │ ├── CHECK_IF_STRING_REMAINS_PALINDROME_AFTER_REMOVING_GIVEN_NUMBER_OF_CHARACTERS.java │ │ │ ├── CHECK_IF_X_CAN_GIVE_CHANGE_TO_EVERY_PERSON_IN_THE_QUEUE.java │ │ │ ├── CHECK_INTEGER_OVERFLOW_MULTIPLICATION.java │ │ │ ├── CHECK_LARGE_NUMBER_DIVISIBLE_11_NOT.java │ │ │ ├── CHECK_LARGE_NUMBER_DIVISIBLE_13_NOT.java │ │ │ ├── CHECK_LARGE_NUMBER_DIVISIBLE_3_NOT.java │ │ │ ├── CHECK_LARGE_NUMBER_DIVISIBLE_4_NOT.java │ │ │ ├── CHECK_LARGE_NUMBER_DIVISIBLE_6_NOT.java │ │ │ ├── CHECK_LARGE_NUMBER_DIVISIBLE_9_NOT.java │ │ │ ├── CHECK_LINE_PASSES_ORIGIN.java │ │ │ ├── CHECK_NUMBER_IS_PERFECT_SQUARE_USING_ADDITIONSUBTRACTION.java │ │ │ ├── CHECK_NUMBER_POWER_K_USING_BASE_CHANGING_METHOD.java │ │ │ ├── CHECK_OCCURRENCES_CHARACTER_APPEAR_TOGETHER.java │ │ │ ├── CHECK_POSSIBLE_SORT_ARRAY_CONDITIONAL_SWAPPING_ADJACENT_ALLOWED.java │ │ │ ├── CHECK_POSSIBLE_TRANSFORM_ONE_STRING_ANOTHER.java │ │ │ ├── CHECK_REVERSING_SUB_ARRAY_MAKE_ARRAY_SORTED.java │ │ │ ├── CHECK_REVERSING_SUB_ARRAY_MAKE_ARRAY_SORTED_1.java │ │ │ ├── CHECK_STRING_CAN_OBTAINED_ROTATING_ANOTHER_STRING_2_PLACES.java │ │ │ ├── CHECK_STRING_FOLLOWS_ANBN_PATTERN_NOT.java │ │ │ ├── CHECK_TWO_GIVEN_CIRCLES_TOUCH_INTERSECT.java │ │ │ ├── CHECK_VALID_SEQUENCE_DIVISIBLE_M_1.java │ │ │ ├── CHECK_WHETHER_ARITHMETIC_PROGRESSION_CAN_FORMED_GIVEN_ARRAY.java │ │ │ ├── CHECK_WHETHER_GIVEN_DEGREES_VERTICES_REPRESENT_GRAPH_TREE.java │ │ │ ├── CHECK_WHETHER_GIVEN_NUMBER_EVEN_ODD.java │ │ │ ├── CHECK_WHETHER_GIVEN_NUMBER_EVEN_ODD_1.java │ │ │ ├── CHECK_WHETHER_LARGE_NUMBER_DIVISIBLE_7.java │ │ │ ├── CHECK_WHETHER_NUMBER_DUCK_NUMBER_NOT.java │ │ │ ├── CHECK_WHETHER_TRIANGLE_VALID_NOT_SIDES_GIVEN.java │ │ │ ├── CHECK_WHETHER_TWO_STRINGS_ARE_ANAGRAM_OF_EACH_OTHER.java │ │ │ ├── CHOCOLATE_DISTRIBUTION_PROBLEM.java │ │ │ ├── CIRCLE_LATTICE_POINTS.java │ │ │ ├── COIN_GAME_WINNER_EVERY_PLAYER_THREE_CHOICES.java │ │ │ ├── COMPOSITE_NUMBER.java │ │ │ ├── COMPUTE_AVERAGE_TWO_NUMBERS_WITHOUT_OVERFLOW.java │ │ │ ├── COMPUTE_AVERAGE_TWO_NUMBERS_WITHOUT_OVERFLOW_1.java │ │ │ ├── COMPUTE_MODULUS_DIVISION_BY_A_POWER_OF_2_NUMBER.java │ │ │ ├── COMPUTE_NCR_P_SET_1_INTRODUCTION_AND_DYNAMIC_PROGRAMMING_SOLUTION.java │ │ │ ├── COMPUTE_N_UNDER_MODULO_P.java │ │ │ ├── CONSTRUCT_LEXICOGRAPHICALLY_SMALLEST_PALINDROME.java │ │ │ ├── CONVERTING_ONE_STRING_USING_APPEND_DELETE_LAST_OPERATIONS.java │ │ │ ├── CONVERT_STRICTLY_INCREASING_ARRAY_MINIMUM_CHANGES.java │ │ │ ├── COST_BALANCE_PARANTHESES.java │ │ │ ├── COUNTING_PAIRS_PERSON_CAN_FORM_PAIR_ONE_1.java │ │ │ ├── COUNTS_PATHS_POINT_REACH_ORIGIN_1.java │ │ │ ├── COUNT_1S_SORTED_BINARY_ARRAY.java │ │ │ ├── COUNT_ARRAYS_CONSECUTIVE_ELEMENT_DIFFERENT_VALUES.java │ │ │ ├── COUNT_BINARY_DIGIT_NUMBERS_SMALLER_N.java │ │ │ ├── COUNT_BINARY_STRINGS_K_TIMES_APPEARING_ADJACENT_TWO_SET_BITS.java │ │ │ ├── COUNT_CHARACTERS_POSITION_ENGLISH_ALPHABETS.java │ │ │ ├── COUNT_CHARACTERS_STRING_DISTANCE_ENGLISH_ALPHABETS.java │ │ │ ├── COUNT_DERANGEMENTS_PERMUTATION_SUCH_THAT_NO_ELEMENT_APPEARS_IN_ITS_ORIGINAL_POSITION_1.java │ │ │ ├── COUNT_DIGITS_FACTORIAL_SET_1.java │ │ │ ├── COUNT_DISTINCT_NON_NEGATIVE_PAIRS_X_Y_SATISFY_INEQUALITY_XX_YY_N_2.java │ │ │ ├── COUNT_DISTINCT_NON_NEGATIVE_PAIRS_X_Y_SATISFY_INEQUALITY_XX_YY_N_2_1.java │ │ │ ├── COUNT_DISTINCT_OCCURRENCES_AS_A_SUBSEQUENCE.java │ │ │ ├── COUNT_ENTRIES_EQUAL_TO_X_IN_A_SPECIAL_MATRIX.java │ │ │ ├── COUNT_EVEN_LENGTH_BINARY_SEQUENCES_WITH_SAME_SUM_OF_FIRST_AND_SECOND_HALF_BITS_1.java │ │ │ ├── COUNT_FACTORIAL_NUMBERS_IN_A_GIVEN_RANGE.java │ │ │ ├── COUNT_FIBONACCI_NUMBERS_GIVEN_RANGE_LOG_TIME.java │ │ │ ├── COUNT_FREQUENCY_K_MATRIX_SIZE_N_MATRIXI_J_IJ.java │ │ │ ├── COUNT_INDEX_PAIRS_EQUAL_ELEMENTS_ARRAY.java │ │ │ ├── COUNT_INDEX_PAIRS_EQUAL_ELEMENTS_ARRAY_1.java │ │ │ ├── COUNT_INVERSIONS_OF_SIZE_THREE_IN_A_GIVE_ARRAY.java │ │ │ ├── COUNT_INVERSIONS_OF_SIZE_THREE_IN_A_GIVE_ARRAY_1.java │ │ │ ├── COUNT_MINIMUM_NUMBER_SUBSETS_SUBSEQUENCES_CONSECUTIVE_NUMBERS.java │ │ │ ├── COUNT_NATURAL_NUMBERS_WHOSE_PERMUTATION_GREATER_NUMBER.java │ │ │ ├── COUNT_NEGATIVE_NUMBERS_IN_A_COLUMN_WISE_ROW_WISE_SORTED_MATRIX.java │ │ │ ├── COUNT_NEGATIVE_NUMBERS_IN_A_COLUMN_WISE_ROW_WISE_SORTED_MATRIX_1.java │ │ │ ├── COUNT_NUMBERS_CAN_CONSTRUCTED_USING_TWO_NUMBERS.java │ │ │ ├── COUNT_NUMBERS_THAT_DONT_CONTAIN_3.java │ │ │ ├── COUNT_NUMBER_BINARY_STRINGS_WITHOUT_CONSECUTIVE_1S.java │ │ │ ├── COUNT_NUMBER_OF_OCCURRENCES_OR_FREQUENCY_IN_A_SORTED_ARRAY.java │ │ │ ├── COUNT_NUMBER_OF_SOLUTIONS_OF_X2_1_MOD_P_IN_GIVEN_RANGE.java │ │ │ ├── COUNT_NUMBER_OF_WAYS_TO_COVER_A_DISTANCE_1.java │ │ │ ├── COUNT_NUMBER_OF_WAYS_TO_FILL_A_N_X_4_GRID_USING_1_X_4_TILES.java │ │ │ ├── COUNT_NUMBER_OF_WAYS_TO_PARTITION_A_SET_INTO_K_SUBSETS_1.java │ │ │ ├── COUNT_NUMBER_PAIRS_N_B_N_GCD_B_B.java │ │ │ ├── COUNT_NUMBER_WAYS_REACH_GIVEN_SCORE_GAME.java │ │ │ ├── COUNT_NUMBER_WAYS_TILE_FLOOR_SIZE_N_X_M_USING_1_X_M_SIZE_TILES.java │ │ │ ├── COUNT_OFDIFFERENT_WAYS_EXPRESS_N_SUM_1_3_4.java │ │ │ ├── COUNT_OF_OCCURRENCES_OF_A_101_PATTERN_IN_A_STRING.java │ │ │ ├── COUNT_OF_PAIRS_SATISFYING_THE_GIVEN_CONDITION.java │ │ │ ├── COUNT_OF_SUB_STRINGS_THAT_DO_NOT_CONTAIN_ALL_THE_CHARACTERS_FROM_THE_SET_A_B_C_AT_THE_SAME_TIME.java │ │ │ ├── COUNT_OPERATIONS_MAKE_STRINGAB_FREE.java │ │ │ ├── COUNT_PAIRS_DIFFERENCE_EQUAL_K.java │ │ │ ├── COUNT_PAIRS_DIFFERENCE_EQUAL_K_1.java │ │ │ ├── COUNT_PAIRS_TWO_SORTED_ARRAYS_WHOSE_SUM_EQUAL_GIVEN_VALUE_X.java │ │ │ ├── COUNT_PAIRS_TWO_SORTED_ARRAYS_WHOSE_SUM_EQUAL_GIVEN_VALUE_X_1.java │ │ │ ├── COUNT_PAIRS_TWO_SORTED_ARRAYS_WHOSE_SUM_EQUAL_GIVEN_VALUE_X_2.java │ │ │ ├── COUNT_PAIRS_WHOSE_PRODUCTS_EXIST_IN_ARRAY.java │ │ │ ├── COUNT_PAIRS_WHOSE_PRODUCTS_EXIST_IN_ARRAY_1.java │ │ │ ├── COUNT_PALINDROME_SUB_STRINGS_STRING.java │ │ │ ├── COUNT_PALINDROMIC_SUBSEQUENCE_GIVEN_STRING.java │ │ │ ├── COUNT_POSSIBLE_DECODINGS_GIVEN_DIGIT_SEQUENCE_1.java │ │ │ ├── COUNT_POSSIBLE_PATHS_TOP_LEFT_BOTTOM_RIGHT_NXM_MATRIX_1.java │ │ │ ├── COUNT_POSSIBLE_PATHS_TOP_LEFT_BOTTOM_RIGHT_NXM_MATRIX_2.java │ │ │ ├── COUNT_POSSIBLE_PATHS_TOP_LEFT_BOTTOM_RIGHT_NXM_MATRIX_3.java │ │ │ ├── COUNT_POSSIBLE_WAYS_TO_CONSTRUCT_BUILDINGS.java │ │ │ ├── COUNT_ROTATIONS_DIVISIBLE_4.java │ │ │ ├── COUNT_ROTATIONS_DIVISIBLE_8.java │ │ │ ├── COUNT_SET_BITS_IN_AN_INTEGER.java │ │ │ ├── COUNT_SET_BITS_IN_AN_INTEGER_1.java │ │ │ ├── COUNT_SET_BITS_IN_AN_INTEGER_2.java │ │ │ ├── COUNT_SET_BITS_IN_AN_INTEGER_3.java │ │ │ ├── COUNT_SINGLE_NODE_ISOLATED_SUB_GRAPHS_DISCONNECTED_GRAPH.java │ │ │ ├── COUNT_SORTED_ROWS_MATRIX.java │ │ │ ├── COUNT_STRINGS_ADJACENT_CHARACTERS_DIFFERENCE_ONE.java │ │ │ ├── COUNT_STRINGS_CAN_FORMED_USING_B_C_GIVEN_CONSTRAINTS_1.java │ │ │ ├── COUNT_SUBARRAYS_EQUAL_NUMBER_1S_0S.java │ │ │ ├── COUNT_SUBARRAYS_EQUAL_NUMBER_1S_0S_1.java │ │ │ ├── COUNT_SUBARRAYS_TOTAL_DISTINCT_ELEMENTS_ORIGINAL_ARRAY.java │ │ │ ├── COUNT_SUBARRAYS_WITH_SAME_EVEN_AND_ODD_ELEMENTS.java │ │ │ ├── COUNT_SUBSETS_DISTINCT_EVEN_NUMBERS.java │ │ │ ├── COUNT_SUBSTRINGS_WITH_SAME_FIRST_AND_LAST_CHARACTERS.java │ │ │ ├── COUNT_SUM_OF_DIGITS_IN_NUMBERS_FROM_1_TO_N.java │ │ │ ├── COUNT_TOTAL_SET_BITS_IN_ALL_NUMBERS_FROM_1_TO_N.java │ │ │ ├── COUNT_TRAILING_ZEROES_FACTORIAL_NUMBER.java │ │ │ ├── COUNT_WAYS_BUILD_STREET_GIVEN_CONSTRAINTS.java │ │ │ ├── COUNT_WAYS_DIVIDE_CIRCLE_USING_N_NON_INTERSECTING_CHORDS.java │ │ │ ├── COUNT_WORDS_APPEAR_EXACTLY_TWO_TIMES_ARRAY_WORDS.java │ │ │ ├── C_PROGRAM_CONCATENATE_STRING_GIVEN_NUMBER_TIMES.java │ │ │ ├── C_PROGRAM_FACTORIAL_NUMBER.java │ │ │ ├── C_PROGRAM_FACTORIAL_NUMBER_1.java │ │ │ ├── C_PROGRAM_FACTORIAL_NUMBER_2.java │ │ │ ├── C_PROGRAM_FIND_LARGEST_ELEMENT_ARRAY_1.java │ │ │ ├── DECIMAL_BINARY_CONVERSION_WITHOUT_USING_ARITHMETIC_OPERATORS.java │ │ │ ├── DECIMAL_REPRESENTATION_GIVEN_BINARY_STRING_DIVISIBLE_10_NOT.java │ │ │ ├── DECODE_MEDIAN_STRING_ORIGINAL_STRING.java │ │ │ ├── DETECT_IF_TWO_INTEGERS_HAVE_OPPOSITE_SIGNS.java │ │ │ ├── DIAGONALLY_DOMINANT_MATRIX.java │ │ │ ├── DICE_THROW_PROBLEM.java │ │ │ ├── DICE_THROW_PROBLEM_1.java │ │ │ ├── DIFFERENCE_BETWEEN_HIGHEST_AND_LEAST_FREQUENCIES_IN_AN_ARRAY.java │ │ │ ├── DIFFERENCE_BETWEEN_HIGHEST_AND_LEAST_FREQUENCIES_IN_AN_ARRAY_1.java │ │ │ ├── DISTRIBUTING_ITEMS_PERSON_CANNOT_TAKE_TWO_ITEMS_TYPE.java │ │ │ ├── DISTRIBUTING_ITEMS_PERSON_CANNOT_TAKE_TWO_ITEMS_TYPE_1.java │ │ │ ├── DISTRIBUTING_M_ITEMS_CIRCLE_SIZE_N_STARTING_K_TH_POSITION.java │ │ │ ├── DIVISIBILITY_9_USING_BITWISE_OPERATORS.java │ │ │ ├── DIVISIBILITY_BY_12_FOR_A_LARGE_NUMBER.java │ │ │ ├── DIVISIBILITY_BY_7.java │ │ │ ├── DOUBLE_FACTORIAL.java │ │ │ ├── DOUBLE_FACTORIAL_1.java │ │ │ ├── DYCK_PATH.java │ │ │ ├── DYNAMIC_PROGRAMMING_HIGH_EFFORT_VS_LOW_EFFORT_TASKS_PROBLEM.java │ │ │ ├── DYNAMIC_PROGRAMMING_SET_13_CUTTING_A_ROD.java │ │ │ ├── DYNAMIC_PROGRAMMING_SET_14_MAXIMUM_SUM_INCREASING_SUBSEQUENCE.java │ │ │ ├── DYNAMIC_PROGRAMMING_SET_17_PALINDROME_PARTITIONING.java │ │ │ ├── DYNAMIC_PROGRAMMING_SET_17_PALINDROME_PARTITIONING_1.java │ │ │ ├── DYNAMIC_PROGRAMMING_SET_28_MINIMUM_INSERTIONS_TO_FORM_A_PALINDROME.java │ │ │ ├── DYNAMIC_PROGRAMMING_SET_36_CUT_A_ROPE_TO_MAXIMIZE_PRODUCT_1.java │ │ │ ├── DYNAMIC_PROGRAMMING_SET_37_BOOLEAN_PARENTHESIZATION_PROBLEM.java │ │ │ ├── DYNAMIC_PROGRAMMING_SET_3_LONGEST_INCREASING_SUBSEQUENCE_1.java │ │ │ ├── DYNAMIC_PROGRAMMING_SET_8_MATRIX_CHAIN_MULTIPLICATION.java │ │ │ ├── DYNAMIC_PROGRAMMING_SET_8_MATRIX_CHAIN_MULTIPLICATION_1.java │ │ │ ├── EFFICIENTLY_FIND_FIRST_REPEATED_CHARACTER_STRING_WITHOUT_USING_ADDITIONAL_DATA_STRUCTURE_ONE_TRAVERSAL.java │ │ │ ├── EFFICIENT_SEARCH_IN_AN_ARRAY_WHERE_DIFFERENCE_BETWEEN_ADJACENT_IS_1.java │ │ │ ├── EFFICIENT_WAY_CHECK_WHETHER_N_TH_FIBONACCI_NUMBER_MULTIPLE_10.java │ │ │ ├── EFFICIENT_WAY_TO_MULTIPLY_WITH_7.java │ │ │ ├── ELEMENTS_TO_BE_ADDED_SO_THAT_ALL_ELEMENTS_OF_A_RANGE_ARE_PRESENT_IN_ARRAY.java │ │ │ ├── ELEMENTS_TO_BE_ADDED_SO_THAT_ALL_ELEMENTS_OF_A_RANGE_ARE_PRESENT_IN_ARRAY_1.java │ │ │ ├── EQUILIBRIUM_INDEX_OF_AN_ARRAY.java │ │ │ ├── EQUILIBRIUM_INDEX_OF_AN_ARRAY_1.java │ │ │ ├── EULERIAN_NUMBER_1.java │ │ │ ├── EULERS_CRITERION_CHECK_IF_SQUARE_ROOT_UNDER_MODULO_P_EXISTS.java │ │ │ ├── EVEN_FIBONACCI_NUMBERS_SUM.java │ │ │ ├── FAST_MULTIPLICATION_METHOD_WITHOUT_USING_MULTIPLICATION_OPERATOR_RUSSIAN_PEASANTS_ALGORITHM.java │ │ │ ├── FIBONACCI_MODULO_P.java │ │ │ ├── FINDING_POWER_PRIME_NUMBER_P_N.java │ │ │ ├── FINDING_POWER_PRIME_NUMBER_P_N_1.java │ │ │ ├── FIND_A_FIXED_POINT_IN_A_GIVEN_ARRAY.java │ │ │ ├── FIND_A_FIXED_POINT_IN_A_GIVEN_ARRAY_1.java │ │ │ ├── FIND_A_ROTATION_WITH_MAXIMUM_HAMMING_DISTANCE.java │ │ │ ├── FIND_A_TRIPLET_THAT_SUM_TO_A_GIVEN_VALUE.java │ │ │ ├── FIND_A_TRIPLET_THAT_SUM_TO_A_GIVEN_VALUE_2.java │ │ │ ├── FIND_DIFFERENCE_BETWEEN_SUMS_OF_TWO_DIAGONALS.java │ │ │ ├── FIND_DIFFERENCE_BETWEEN_SUMS_OF_TWO_DIAGONALS_1.java │ │ │ ├── FIND_DISTINCT_SUBSET_SUBSEQUENCE_SUMS_ARRAY.java │ │ │ ├── FIND_EQUAL_POINT_STRING_BRACKETS.java │ │ │ ├── FIND_EXPRESSION_DUPLICATE_PARENTHESIS_NOT.java │ │ │ ├── FIND_FIRST_NATURAL_NUMBER_WHOSE_FACTORIAL_DIVISIBLE_X.java │ │ │ ├── FIND_HARMONIC_MEAN_USING_ARITHMETIC_MEAN_GEOMETRIC_MEAN.java │ │ │ ├── FIND_INDEX_0_REPLACED_1_GET_LONGEST_CONTINUOUS_SEQUENCE_1S_BINARY_ARRAY.java │ │ │ ├── FIND_INDEX_GIVEN_FIBONACCI_NUMBER_CONSTANT_TIME.java │ │ │ ├── FIND_INDEX_GIVEN_FIBONACCI_NUMBER_CONSTANT_TIME_1.java │ │ │ ├── FIND_INDEX_OF_AN_EXTRA_ELEMENT_PRESENT_IN_ONE_SORTED_ARRAY.java │ │ │ ├── FIND_INDEX_OF_AN_EXTRA_ELEMENT_PRESENT_IN_ONE_SORTED_ARRAY_1.java │ │ │ ├── FIND_LARGEST_D_IN_ARRAY_SUCH_THAT_A_B_C_D.java │ │ │ ├── FIND_LARGEST_PRIME_FACTOR_NUMBER.java │ │ │ ├── FIND_LAST_DIGIT_FACTORIAL_DIVIDES_FACTORIAL_B.java │ │ │ ├── FIND_MAXIMUM_AVERAGE_SUBARRAY_OF_K_LENGTH.java │ │ │ ├── FIND_MAXIMUM_AVERAGE_SUBARRAY_OF_K_LENGTH_1.java │ │ │ ├── FIND_MAXIMUM_DOT_PRODUCT_TWO_ARRAYS_INSERTION_0S.java │ │ │ ├── FIND_MAXIMUM_HEIGHT_PYRAMID_FROM_THE_GIVEN_ARRAY_OF_OBJECTS.java │ │ │ ├── FIND_MAXIMUM_PRODUCT_OF_A_TRIPLET_IN_ARRAY.java │ │ │ ├── FIND_MAXIMUM_PRODUCT_OF_A_TRIPLET_IN_ARRAY_1.java │ │ │ ├── FIND_MAXIMUM_SUM_POSSIBLE_EQUAL_SUM_THREE_STACKS.java │ │ │ ├── FIND_MEDIAN_ROW_WISE_SORTED_MATRIX.java │ │ │ ├── FIND_MINIMUM_DIFFERENCE_PAIR.java │ │ │ ├── FIND_MINIMUM_DIFFERENCE_PAIR_1.java │ │ │ ├── FIND_MINIMUM_ELEMENT_IN_A_SORTED_AND_ROTATED_ARRAY.java │ │ │ ├── FIND_MINIMUM_NUMBER_DIVIDED_MAKE_NUMBER_PERFECT_SQUARE.java │ │ │ ├── FIND_MINIMUM_SUM_FACTORS_NUMBER.java │ │ │ ├── FIND_NUMBER_ENDLESS_POINTS.java │ │ │ ├── FIND_NUMBER_PAIRS_ARRAY_XOR_0.java │ │ │ ├── FIND_NUMBER_PERFECT_SQUARES_TWO_GIVEN_NUMBERS.java │ │ │ ├── FIND_NUMBER_TIMES_STRING_OCCURS_GIVEN_STRING_1.java │ │ │ ├── FIND_N_TH_ELEMENT_FROM_STERNS_DIATOMIC_SERIES.java │ │ │ ├── FIND_ONE_EXTRA_CHARACTER_STRING_1.java │ │ │ ├── FIND_PAIR_MAXIMUM_GCD_ARRAY.java │ │ │ ├── FIND_PAIR_WITH_GREATEST_PRODUCT_IN_ARRAY.java │ │ │ ├── FIND_PERIMETER_CYLINDER.java │ │ │ ├── FIND_POSITION_GIVEN_NUMBER_AMONG_NUMBERS_MADE_4_7.java │ │ │ ├── FIND_REPEATED_CHARACTER_PRESENT_FIRST_STRING.java │ │ │ ├── FIND_REPEATED_CHARACTER_PRESENT_FIRST_STRING_1.java │ │ │ ├── FIND_REPEATING_ELEMENT_SORTED_ARRAY_SIZE_N.java │ │ │ ├── FIND_REPETITIVE_ELEMENT_1_N_1.java │ │ │ ├── FIND_REPETITIVE_ELEMENT_1_N_1_1.java │ │ │ ├── FIND_REPETITIVE_ELEMENT_1_N_1_2.java │ │ │ ├── FIND_ROTATION_COUNT_ROTATED_SORTED_ARRAY.java │ │ │ ├── FIND_ROTATION_COUNT_ROTATED_SORTED_ARRAY_1.java │ │ │ ├── FIND_SMALLEST_VALUE_REPRESENTED_SUM_SUBSET_GIVEN_ARRAY.java │ │ │ ├── FIND_SUBARRAY_WITH_GIVEN_SUM.java │ │ │ ├── FIND_SUBARRAY_WITH_GIVEN_SUM_1.java │ │ │ ├── FIND_SUM_EVEN_FACTORS_NUMBER.java │ │ │ ├── FIND_SUM_EVEN_INDEX_BINOMIAL_COEFFICIENTS.java │ │ │ ├── FIND_SUM_EVEN_INDEX_BINOMIAL_COEFFICIENTS_1.java │ │ │ ├── FIND_SUM_MODULO_K_FIRST_N_NATURAL_NUMBER.java │ │ │ ├── FIND_SUM_MODULO_K_FIRST_N_NATURAL_NUMBER_1.java │ │ │ ├── FIND_SUM_NODES_GIVEN_PERFECT_BINARY_TREE_1.java │ │ │ ├── FIND_SUM_NON_REPEATING_DISTINCT_ELEMENTS_ARRAY.java │ │ │ ├── FIND_SUM_ODD_FACTORS_NUMBER.java │ │ │ ├── FIND_SUM_UNIQUE_SUB_ARRAY_SUM_GIVEN_ARRAY.java │ │ │ ├── FIND_THE_ELEMENT_BEFORE_WHICH_ALL_THE_ELEMENTS_ARE_SMALLER_THAN_IT_AND_AFTER_WHICH_ALL_ARE_GREATER_THAN_IT.java │ │ │ ├── FIND_THE_ELEMENT_THAT_APPEARS_ONCE.java │ │ │ ├── FIND_THE_ELEMENT_THAT_APPEARS_ONCE_2.java │ │ │ ├── FIND_THE_FIRST_MISSING_NUMBER.java │ │ │ ├── FIND_THE_LARGEST_SUBARRAY_WITH_0_SUM.java │ │ │ ├── FIND_THE_MAXIMUM_ELEMENT_IN_AN_ARRAY_WHICH_IS_FIRST_INCREASING_AND_THEN_DECREASING.java │ │ │ ├── FIND_THE_MAXIMUM_SUBARRAY_XOR_IN_A_GIVEN_ARRAY.java │ │ │ ├── FIND_THE_MINIMUM_DISTANCE_BETWEEN_TWO_NUMBERS.java │ │ │ ├── FIND_THE_MINIMUM_DISTANCE_BETWEEN_TWO_NUMBERS_1.java │ │ │ ├── FIND_THE_MISSING_NUMBER_1.java │ │ │ ├── FIND_THE_MISSING_NUMBER_2.java │ │ │ ├── FIND_THE_NUMBER_OCCURRING_ODD_NUMBER_OF_TIMES.java │ │ │ ├── FIND_THE_NUMBER_OCCURRING_ODD_NUMBER_OF_TIMES_1.java │ │ │ ├── FIND_THE_NUMBER_OCCURRING_ODD_NUMBER_OF_TIMES_2.java │ │ │ ├── FIND_THREE_ELEMENT_FROM_DIFFERENT_THREE_ARRAYS_SUCH_THAT_THAT_A_B_C_K.java │ │ │ ├── FIND_THREE_ELEMENT_FROM_DIFFERENT_THREE_ARRAYS_SUCH_THAT_THAT_A_B_C_K_1.java │ │ │ ├── FIND_UNIT_DIGIT_X_RAISED_POWER_Y.java │ │ │ ├── FIND_UNIT_DIGIT_X_RAISED_POWER_Y_1.java │ │ │ ├── FIND_VALUE_OF_Y_MOD_2_RAISED_TO_POWER_X.java │ │ │ ├── FIND_WHETHER_AN_ARRAY_IS_SUBSET_OF_ANOTHER_ARRAY_SET_1.java │ │ │ ├── FIND_WHETHER_AN_ARRAY_IS_SUBSET_OF_ANOTHER_ARRAY_SET_1_1.java │ │ │ ├── FIND_WHETHER_A_GIVEN_NUMBER_IS_A_POWER_OF_4_OR_NOT.java │ │ │ ├── FIND_WHETHER_A_GIVEN_NUMBER_IS_A_POWER_OF_4_OR_NOT_1.java │ │ │ ├── FIND_WHETHER_A_GIVEN_NUMBER_IS_A_POWER_OF_4_OR_NOT_2.java │ │ │ ├── FIND_WHETHER_GIVEN_INTEGER_POWER_3_NOT.java │ │ │ ├── FIRST_ELEMENT_OCCURRING_K_TIMES_ARRAY.java │ │ │ ├── FIRST_UPPERCASE_LETTER_IN_A_STRING_ITERATIVE_AND_RECURSIVE.java │ │ │ ├── FLOOR_IN_A_SORTED_ARRAY_1.java │ │ │ ├── FORM_MINIMUM_NUMBER_FROM_GIVEN_SEQUENCE_1.java │ │ │ ├── FORM_SMALLEST_NUMBER_USING_ONE_SWAP_OPERATION.java │ │ │ ├── FREQUENT_ELEMENT_ARRAY.java │ │ │ ├── FRIENDS_PAIRING_PROBLEM.java │ │ │ ├── FRIENDS_PAIRING_PROBLEM_2.java │ │ │ ├── FUNCTION_COPY_STRING_ITERATIVE_RECURSIVE_1.java │ │ │ ├── GCD_ELEMENTS_GIVEN_RANGE.java │ │ │ ├── GIVEN_A_SORTED_AND_ROTATED_ARRAY_FIND_IF_THERE_IS_A_PAIR_WITH_A_GIVEN_SUM.java │ │ │ ├── GIVEN_A_SORTED_AND_ROTATED_ARRAY_FIND_IF_THERE_IS_A_PAIR_WITH_A_GIVEN_SUM_1.java │ │ │ ├── GIVEN_LARGE_NUMBER_CHECK_SUBSEQUENCE_DIGITS_DIVISIBLE_8.java │ │ │ ├── GIVEN_P_AND_N_FIND_THE_LARGEST_X_SUCH_THAT_PX_DIVIDES_N_2.java │ │ │ ├── GOLD_MINE_PROBLEM.java │ │ │ ├── GOOGLE_CASE_GIVEN_SENTENCE.java │ │ │ ├── HARDY_RAMANUJAN_THEOREM.java │ │ │ ├── HEIGHT_COMPLETE_BINARY_TREE_HEAP_N_NODES.java │ │ │ ├── HEXAGONAL_NUMBER.java │ │ │ ├── HIGHWAY_BILLBOARD_PROBLEM.java │ │ │ ├── HORNERS_METHOD_POLYNOMIAL_EVALUATION.java │ │ │ ├── HOW_CAN_WE_SUM_THE_DIGITS_OF_A_GIVEN_NUMBER_IN_SINGLE_STATEMENT.java │ │ │ ├── HOW_CAN_WE_SUM_THE_DIGITS_OF_A_GIVEN_NUMBER_IN_SINGLE_STATEMENT_1.java │ │ │ ├── HOW_CAN_WE_SUM_THE_DIGITS_OF_A_GIVEN_NUMBER_IN_SINGLE_STATEMENT_2.java │ │ │ ├── HOW_TO_AVOID_OVERFLOW_IN_MODULAR_MULTIPLICATION.java │ │ │ ├── HOW_TO_BEGIN_WITH_COMPETITIVE_PROGRAMMING.java │ │ │ ├── HOW_TO_CHECK_IF_A_GIVEN_ARRAY_REPRESENTS_A_BINARY_HEAP.java │ │ │ ├── HOW_TO_CHECK_IF_A_GIVEN_ARRAY_REPRESENTS_A_BINARY_HEAP_1.java │ │ │ ├── HOW_TO_COMPUTE_MOD_OF_A_BIG_NUMBER.java │ │ │ ├── HOW_TO_PRINT_MAXIMUM_NUMBER_OF_A_USING_GIVEN_FOUR_KEYS.java │ │ │ ├── HOW_TO_TURN_OFF_A_PARTICULAR_BIT_IN_A_NUMBER.java │ │ │ ├── HYPERCUBE_GRAPH.java │ │ │ ├── INTEGER_POSITIVE_VALUE_POSITIVE_NEGATIVE_VALUE_ARRAY_1.java │ │ │ ├── K_TH_DIGIT_RAISED_POWER_B.java │ │ │ ├── K_TH_DISTINCT_OR_NON_REPEATING_ELEMENT_IN_AN_ARRAY.java │ │ │ ├── K_TH_DISTINCT_OR_NON_REPEATING_ELEMENT_IN_AN_ARRAY_1.java │ │ │ ├── K_TH_ELEMENT_TWO_SORTED_ARRAYS.java │ │ │ ├── K_TH_LARGEST_SUM_CONTIGUOUS_SUBARRAY.java │ │ │ ├── K_TH_MISSING_ELEMENT_INCREASING_SEQUENCE_NOT_PRESENT_GIVEN_SEQUENCE.java │ │ │ ├── K_TH_PRIME_FACTOR_GIVEN_NUMBER.java │ │ │ ├── LARGEST_SUBARRAY_WITH_EQUAL_NUMBER_OF_0S_AND_1S.java │ │ │ ├── LARGEST_SUBARRAY_WITH_EQUAL_NUMBER_OF_0S_AND_1S_1.java │ │ │ ├── LARGEST_SUBSEQUENCE_GCD_GREATER_1.java │ │ │ ├── LARGEST_SUM_CONTIGUOUS_SUBARRAY_2.java │ │ │ ├── LCS_FORMED_CONSECUTIVE_SEGMENTS_LEAST_LENGTH_K.java │ │ │ ├── LENGTH_LONGEST_STRICT_BITONIC_SUBSEQUENCE.java │ │ │ ├── LENGTH_OF_THE_LONGEST_ARITHMATIC_PROGRESSION_IN_A_SORTED_ARRAY.java │ │ │ ├── LEONARDO_NUMBER_1.java │ │ │ ├── LEXICOGRAPHICALLY_MINIMUM_STRING_ROTATION.java │ │ │ ├── LEXICOGRAPHICALLY_NEXT_STRING.java │ │ │ ├── LEXICOGRAPHICAL_CONCATENATION_SUBSTRINGS_STRING.java │ │ │ ├── LEXICOGRAPHICAL_MAXIMUM_SUBSTRING_STRING.java │ │ │ ├── LONGEST_COMMON_INCREASING_SUBSEQUENCE_LCS_LIS.java │ │ │ ├── LONGEST_COMMON_SUBSTRING.java │ │ │ ├── LONGEST_COMMON_SUBSTRING_SPACE_OPTIMIZED_DP_SOLUTION.java │ │ │ ├── LONGEST_CONSECUTIVE_SUBSEQUENCE.java │ │ │ ├── LONGEST_EVEN_LENGTH_SUBSTRING_SUM_FIRST_SECOND_HALF.java │ │ │ ├── LONGEST_EVEN_LENGTH_SUBSTRING_SUM_FIRST_SECOND_HALF_1.java │ │ │ ├── LONGEST_INCREASING_ODD_EVEN_SUBSEQUENCE.java │ │ │ ├── LONGEST_INCREASING_SUBSEQUENCE_1.java │ │ │ ├── LONGEST_PALINDROME_SUBSEQUENCE_SPACE.java │ │ │ ├── LONGEST_PREFIX_ALSO_SUFFIX_1.java │ │ │ ├── LONGEST_REPEATED_SUBSEQUENCE_1.java │ │ │ ├── LONGEST_REPEATING_AND_NON_OVERLAPPING_SUBSTRING.java │ │ │ ├── LONGEST_REPEATING_SUBSEQUENCE.java │ │ │ ├── LONGEST_SUBARRAY_COUNT_1S_ONE_COUNT_0S.java │ │ │ ├── LONGEST_SUBARRAY_SUM_DIVISIBLE_K.java │ │ │ ├── LONGEST_SUBSEQUENCE_DIFFERENCE_ADJACENTS_ONE_SET_2.java │ │ │ ├── LONGEST_SUBSEQUENCE_SUCH_THAT_DIFFERENCE_BETWEEN_ADJACENTS_IS_ONE.java │ │ │ ├── LOWER_CASE_UPPER_CASE_INTERESTING_FACT.java │ │ │ ├── LOWER_INSERTION_POINT.java │ │ │ ├── MAKE_LARGEST_PALINDROME_CHANGING_K_DIGITS.java │ │ │ ├── MAKING_ELEMENTS_OF_TWO_ARRAYS_SAME_WITH_MINIMUM_INCREMENTDECREMENT.java │ │ │ ├── MARKOV_MATRIX.java │ │ │ ├── MAXIMIZE_ARRJ_ARRI_ARRL_ARRK_SUCH_THAT_I_J_K_L.java │ │ │ ├── MAXIMIZE_SUM_ARRII.java │ │ │ ├── MAXIMIZE_SUM_CONSECUTIVE_DIFFERENCES_CIRCULAR_ARRAY.java │ │ │ ├── MAXIMIZE_VOLUME_CUBOID_GIVEN_SUM_SIDES.java │ │ │ ├── MAXIMIZE_VOLUME_CUBOID_GIVEN_SUM_SIDES_1.java │ │ │ ├── MAXIMUM_AREA_RECTANGLE_PICKING_FOUR_SIDES_ARRAY.java │ │ │ ├── MAXIMUM_AREA_RECTANGLE_PICKING_FOUR_SIDES_ARRAY_1.java │ │ │ ├── MAXIMUM_AVERAGE_SUM_PARTITION_ARRAY.java │ │ │ ├── MAXIMUM_BINOMIAL_COEFFICIENT_TERM_VALUE.java │ │ │ ├── MAXIMUM_CONSECUTIVE_NUMBERS_PRESENT_ARRAY.java │ │ │ ├── MAXIMUM_CONSECUTIVE_REPEATING_CHARACTER_STRING.java │ │ │ ├── MAXIMUM_CONSECUTIVE_REPEATING_CHARACTER_STRING_1.java │ │ │ ├── MAXIMUM_DIFFERENCE_BETWEEN_FREQUENCY_OF_TWO_ELEMENTS_SUCH_THAT_ELEMENT_HAVING_GREATER_FREQUENCY_IS_ALSO_GREATER.java │ │ │ ├── MAXIMUM_DIFFERENCE_SUM_ELEMENTS_TWO_ROWS_MATRIX.java │ │ │ ├── MAXIMUM_DISTANCE_TWO_OCCURRENCES_ELEMENT_ARRAY.java │ │ │ ├── MAXIMUM_EQULIBRIUM_SUM_ARRAY.java │ │ │ ├── MAXIMUM_GAMES_PLAYED_WINNER.java │ │ │ ├── MAXIMUM_HEIGHT_OF_TRIANGULAR_ARRANGEMENT_OF_ARRAY_VALUES.java │ │ │ ├── MAXIMUM_HEIGHT_OF_TRIANGULAR_ARRANGEMENT_OF_ARRAY_VALUES_1.java │ │ │ ├── MAXIMUM_LENGTH_PREFIX_ONE_STRING_OCCURS_SUBSEQUENCE_ANOTHER.java │ │ │ ├── MAXIMUM_LENGTH_SUBSEQUENCE_DIFFERENCE_ADJACENT_ELEMENTS_EITHER_0_1.java │ │ │ ├── MAXIMUM_NUMBER_2X2_SQUARES_CAN_FIT_INSIDE_RIGHT_ISOSCELES_TRIANGLE.java │ │ │ ├── MAXIMUM_NUMBER_CHARACTERS_TWO_CHARACTER_STRING.java │ │ │ ├── MAXIMUM_NUMBER_CHOCOLATES_DISTRIBUTED_EQUALLY_AMONG_K_STUDENTS.java │ │ │ ├── MAXIMUM_NUMBER_OF_SQUARES_THAT_CAN_BE_FIT_IN_A_RIGHT_ANGLE_ISOSCELES_TRIANGLE.java │ │ │ ├── MAXIMUM_NUMBER_SEGMENTS_LENGTHS_B_C.java │ │ │ ├── MAXIMUM_POINTS_INTERSECTION_N_CIRCLES.java │ │ │ ├── MAXIMUM_POSSIBLE_DIFFERENCE_TWO_SUBSETS_ARRAY.java │ │ │ ├── MAXIMUM_POSSIBLE_SUM_WINDOW_ARRAY_ELEMENTS_WINDOW_ARRAY_UNIQUE.java │ │ │ ├── MAXIMUM_PRODUCT_INCREASING_SUBSEQUENCE.java │ │ │ ├── MAXIMUM_PRODUCT_OF_4_ADJACENT_ELEMENTS_IN_MATRIX.java │ │ │ ├── MAXIMUM_PRODUCT_SUBARRAY_ADDED_NEGATIVE_PRODUCT_CASE.java │ │ │ ├── MAXIMUM_PRODUCT_SUBSET_ARRAY.java │ │ │ ├── MAXIMUM_PROFIT_BY_BUYING_AND_SELLING_A_SHARE_AT_MOST_K_TIMES_1.java │ │ │ ├── MAXIMUM_PROFIT_BY_BUYING_AND_SELLING_A_SHARE_AT_MOST_TWICE.java │ │ │ ├── MAXIMUM_REMOVAL_FROM_ARRAY_WHEN_REMOVAL_TIME_WAITING_TIME.java │ │ │ ├── MAXIMUM_SUBARRAY_SUM_ARRAY_CREATED_REPEATED_CONCATENATION.java │ │ │ ├── MAXIMUM_SUBARRAY_SUM_USING_PREFIX_SUM.java │ │ │ ├── MAXIMUM_SUBSEQUENCE_SUM_SUCH_THAT_NO_THREE_ARE_CONSECUTIVE.java │ │ │ ├── MAXIMUM_SUM_2_X_N_GRID_NO_TWO_ELEMENTS_ADJACENT.java │ │ │ ├── MAXIMUM_SUM_BITONIC_SUBARRAY.java │ │ │ ├── MAXIMUM_SUM_IARRI_AMONG_ROTATIONS_GIVEN_ARRAY.java │ │ │ ├── MAXIMUM_SUM_IARRI_AMONG_ROTATIONS_GIVEN_ARRAY_1.java │ │ │ ├── MAXIMUM_SUM_PAIRS_SPECIFIC_DIFFERENCE.java │ │ │ ├── MAXIMUM_SUM_PAIRS_SPECIFIC_DIFFERENCE_1.java │ │ │ ├── MAXIMUM_SUM_SUBARRAY_REMOVING_ONE_ELEMENT.java │ │ │ ├── MAXIMUM_SUM_SUBSEQUENCE_LEAST_K_DISTANT_ELEMENTS.java │ │ │ ├── MAXIMUM_TRIPLET_SUM_ARRAY.java │ │ │ ├── MAXIMUM_TRIPLET_SUM_ARRAY_1.java │ │ │ ├── MAXIMUM_TRIPLET_SUM_ARRAY_2.java │ │ │ ├── MAXIMUM_VALUE_CHOICE_EITHER_DIVIDING_CONSIDERING.java │ │ │ ├── MAXIMUM_WEIGHT_PATH_ENDING_ELEMENT_LAST_ROW_MATRIX.java │ │ │ ├── MAXIMUM_XOR_VALUE_MATRIX.java │ │ │ ├── MEDIAN_OF_TWO_SORTED_ARRAYS.java │ │ │ ├── MIDDLE_OF_THREE_USING_MINIMUM_COMPARISONS.java │ │ │ ├── MIDDLE_OF_THREE_USING_MINIMUM_COMPARISONS_1.java │ │ │ ├── MIDDLE_OF_THREE_USING_MINIMUM_COMPARISONS_2.java │ │ │ ├── MINIMIZE_SUM_PRODUCT_TWO_ARRAYS_PERMUTATIONS_ALLOWED.java │ │ │ ├── MINIMIZE_THE_SUM_OF_DIGITS_OF_A_AND_B_SUCH_THAT_A_B_N.java │ │ │ ├── MINIMUM_CHARACTERS_ADDED_FRONT_MAKE_STRING_PALINDROME.java │ │ │ ├── MINIMUM_COST_CONNECT_WEIGHTED_NODES_REPRESENTED_ARRAY.java │ │ │ ├── MINIMUM_COST_CUT_BOARD_SQUARES.java │ │ │ ├── MINIMUM_COST_FOR_ACQUIRING_ALL_COINS_WITH_K_EXTRA_COINS_ALLOWED_WITH_EVERY_COIN.java │ │ │ ├── MINIMUM_COST_MAKE_ARRAY_SIZE_1_REMOVING_LARGER_PAIRS.java │ │ │ ├── MINIMUM_COST_SORT_MATRIX_NUMBERS_0_N2_1.java │ │ │ ├── MINIMUM_COST_TO_FILL_GIVEN_WEIGHT_IN_A_BAG.java │ │ │ ├── MINIMUM_DIFFERENCE_BETWEEN_GROUPS_OF_SIZE_TWO.java │ │ │ ├── MINIMUM_DIFFERENCE_MAX_MIN_K_SIZE_SUBSETS.java │ │ │ ├── MINIMUM_FLIP_REQUIRED_MAKE_BINARY_MATRIX_SYMMETRIC_1.java │ │ │ ├── MINIMUM_INCREMENT_K_OPERATIONS_MAKE_ELEMENTS_EQUAL.java │ │ │ ├── MINIMUM_INSERTIONS_SORT_ARRAY.java │ │ │ ├── MINIMUM_LENGTH_SUBARRAY_SUM_GREATER_GIVEN_VALUE.java │ │ │ ├── MINIMUM_LENGTH_SUBARRAY_SUM_GREATER_GIVEN_VALUE_1.java │ │ │ ├── MINIMUM_NUMBER_OF_JUMPS_TO_REACH_END_OF_A_GIVEN_ARRAY_1.java │ │ │ ├── MINIMUM_NUMBER_OF_JUMPS_TO_REACH_END_OF_A_GIVEN_ARRAY_2.java │ │ │ ├── MINIMUM_NUMBER_OF_SQUARES_WHOSE_SUM_EQUALS_TO_GIVEN_NUMBER_N_1.java │ │ │ ├── MINIMUM_NUMBER_PLATFORMS_REQUIRED_RAILWAYBUS_STATION.java │ │ │ ├── MINIMUM_NUMBER_SUBSETS_DISTINCT_ELEMENTS.java │ │ │ ├── MINIMUM_NUMBER_SUBSETS_DISTINCT_ELEMENTS_1.java │ │ │ ├── MINIMUM_OPERATIONS_MAKE_GCD_ARRAY_MULTIPLE_K.java │ │ │ ├── MINIMUM_OPERATION_MAKE_ELEMENTS_EQUAL_ARRAY.java │ │ │ ├── MINIMUM_PERIMETER_N_BLOCKS.java │ │ │ ├── MINIMUM_PRODUCT_K_INTEGERS_ARRAY_POSITIVE_INTEGERS.java │ │ │ ├── MINIMUM_PRODUCT_SUBSET_ARRAY.java │ │ │ ├── MINIMUM_ROTATIONS_REQUIRED_GET_STRING.java │ │ │ ├── MINIMUM_ROTATIONS_UNLOCK_CIRCULAR_LOCK.java │ │ │ ├── MINIMUM_STEPS_MINIMIZE_N_PER_GIVEN_CONDITION.java │ │ │ ├── MINIMUM_STEPS_TO_DELETE_A_STRING_AFTER_REPEATED_DELETION_OF_PALINDROME_SUBSTRINGS.java │ │ │ ├── MINIMUM_SUM_CHOOSING_MINIMUM_PAIRS_ARRAY.java │ │ │ ├── MINIMUM_SUM_PRODUCT_TWO_ARRAYS.java │ │ │ ├── MINIMUM_SUM_SUBSEQUENCE_LEAST_ONE_EVERY_FOUR_CONSECUTIVE_ELEMENTS_PICKED.java │ │ │ ├── MINIMUM_SUM_SUBSEQUENCE_LEAST_ONE_EVERY_FOUR_CONSECUTIVE_ELEMENTS_PICKED_1.java │ │ │ ├── MINIMUM_SUM_TWO_NUMBERS_FORMED_DIGITS_ARRAY.java │ │ │ ├── MINIMUM_SUM_TWO_NUMBERS_FORMED_DIGITS_ARRAY_2.java │ │ │ ├── MINIMUM_SWAPS_REQUIRED_BRING_ELEMENTS_LESS_EQUAL_K_TOGETHER.java │ │ │ ├── MINIMUM_TIME_TO_FINISH_TASKS_WITHOUT_SKIPPING_TWO_CONSECUTIVE.java │ │ │ ├── MINIMUM_TIME_WRITE_CHARACTERS_USING_INSERT_DELETE_COPY_OPERATION.java │ │ │ ├── MINIMUM_XOR_VALUE_PAIR.java │ │ │ ├── MINIMUM_XOR_VALUE_PAIR_1.java │ │ │ ├── MOBILE_NUMERIC_KEYPAD_PROBLEM.java │ │ │ ├── MODULAR_EXPONENTIATION_POWER_IN_MODULAR_ARITHMETIC.java │ │ │ ├── MODULUS_TWO_FLOAT_DOUBLE_NUMBERS.java │ │ │ ├── MULTIPLY_AN_INTEGER_WITH_3_5.java │ │ │ ├── MULTIPLY_LARGE_INTEGERS_UNDER_LARGE_MODULO.java │ │ │ ├── MULTIPLY_LARGE_NUMBERS_REPRESENTED_AS_STRINGS.java │ │ │ ├── MULTIPLY_TWO_NUMBERS_WITHOUT_USING_MULTIPLY_DIVISION_BITWISE_OPERATORS_AND_NO_LOOPS.java │ │ │ ├── NEWMAN_CONWAY_SEQUENCE_1.java │ │ │ ├── NEXT_HIGHER_NUMBER_WITH_SAME_NUMBER_OF_SET_BITS.java │ │ │ ├── NEXT_POWER_OF_2.java │ │ │ ├── NEXT_POWER_OF_2_1.java │ │ │ ├── NEXT_POWER_OF_2_2.java │ │ │ ├── NON_REPEATING_ELEMENT.java │ │ │ ├── NON_REPEATING_ELEMENT_1.java │ │ │ ├── NTH_EVEN_LENGTH_PALINDROME.java │ │ │ ├── NTH_MULTIPLE_NUMBER_FIBONACCI_SERIES.java │ │ │ ├── NTH_NON_FIBONACCI_NUMBER.java │ │ │ ├── NTH_PENTAGONAL_NUMBER.java │ │ │ ├── NUMBER_DAYS_TANK_WILL_BECOME_EMPTY.java │ │ │ ├── NUMBER_DIGITS_PRODUCT_TWO_NUMBERS.java │ │ │ ├── NUMBER_DIGITS_PRODUCT_TWO_NUMBERS_1.java │ │ │ ├── NUMBER_DIGITS_REMOVED_MAKE_NUMBER_DIVISIBLE_3.java │ │ │ ├── NUMBER_INDEXES_EQUAL_ELEMENTS_GIVEN_RANGE.java │ │ │ ├── NUMBER_IS_DIVISIBLE_BY_29_OR_NOT.java │ │ │ ├── NUMBER_JUMP_REQUIRED_GIVEN_LENGTH_REACH_POINT_FORM_D_0_ORIGIN_2D_PLANE.java │ │ │ ├── NUMBER_NON_NEGATIVE_INTEGRAL_SOLUTIONS_B_C_N.java │ │ │ ├── NUMBER_NON_NEGATIVE_INTEGRAL_SOLUTIONS_B_C_N_1.java │ │ │ ├── NUMBER_N_DIGITS_NON_DECREASING_INTEGERS.java │ │ │ ├── NUMBER_N_DIGIT_STEPPING_NUMBERS.java │ │ │ ├── NUMBER_OF_BINARY_TREES_FOR_GIVEN_PREORDER_SEQUENCE_LENGTH.java │ │ │ ├── NUMBER_OF_PAIRS_IN_AN_ARRAY_HAVING_SUM_EQUAL_TO_PRODUCT.java │ │ │ ├── NUMBER_OF_SUBSTRINGS_WITH_ODD_DECIMAL_VALUE_IN_A_BINARY_STRING.java │ │ │ ├── NUMBER_OF_TRIANGLES_IN_A_PLANE_IF_NO_MORE_THAN_TWO_POINTS_ARE_COLLINEAR.java │ │ │ ├── NUMBER_ORDERED_PAIRS_AI_AJ_0.java │ │ │ ├── NUMBER_RECTANGLES_NM_GRID.java │ │ │ ├── NUMBER_SUBARRAYS_SUM_EXACTLY_EQUAL_K.java │ │ │ ├── NUMBER_SUBSEQUENCES_AB_STRING_REPEATED_K_TIMES.java │ │ │ ├── NUMBER_SUBSEQUENCES_FORM_AI_BJ_CK.java │ │ │ ├── NUMBER_SUBSEQUENCES_STRING_DIVISIBLE_N.java │ │ │ ├── NUMBER_SUBSTRINGS_DIVISIBLE_4_STRING_INTEGERS.java │ │ │ ├── NUMBER_SUBSTRINGS_STRING.java │ │ │ ├── NUMBER_TRIANGLES_N_MOVES.java │ │ │ ├── NUMBER_UNIQUE_RECTANGLES_FORMED_USING_N_UNIT_SQUARES.java │ │ │ ├── NUMBER_VISIBLE_BOXES_PUTTING_ONE_INSIDE_ANOTHER.java │ │ │ ├── NUMBER_WAYS_NODE_MAKE_LOOP_SIZE_K_UNDIRECTED_COMPLETE_CONNECTED_GRAPH_N_NODES.java │ │ │ ├── N_TH_NUMBER_WHOSE_SUM_OF_DIGITS_IS_TEN.java │ │ │ ├── N_TH_NUMBER_WHOSE_SUM_OF_DIGITS_IS_TEN_1.java │ │ │ ├── N_TH_NUMBER_WHOSE_SUM_OF_DIGITS_IS_TEN_2.java │ │ │ ├── N_TH_ROOT_NUMBER.java │ │ │ ├── N_TH_TERM_SERIES_2_12_36_80_150.java │ │ │ ├── ONE_LINE_FUNCTION_FOR_FACTORIAL_OF_A_NUMBER.java │ │ │ ├── OVERLAPPING_SUM_TWO_ARRAY.java │ │ │ ├── PADOVAN_SEQUENCE.java │ │ │ ├── PAINTING_FENCE_ALGORITHM.java │ │ │ ├── PAIR_WITH_GIVEN_PRODUCT_SET_1_FIND_IF_ANY_PAIR_EXISTS.java │ │ │ ├── PAIR_WITH_GIVEN_PRODUCT_SET_1_FIND_IF_ANY_PAIR_EXISTS_1.java │ │ │ ├── PANGRAM_CHECKING.java │ │ │ ├── PARTITION_INTO_TWO_SUBARRAYS_OF_LENGTHS_K_AND_N_K_SUCH_THAT_THE_DIFFERENCE_OF_SUMS_IS_MAXIMUM.java │ │ │ ├── PERFECT_REVERSIBLE_STRING.java │ │ │ ├── PERMUTE_TWO_ARRAYS_SUM_EVERY_PAIR_GREATER_EQUAL_K.java │ │ │ ├── PIZZA_CUT_PROBLEM_CIRCLE_DIVISION_LINES.java │ │ │ ├── POLICEMEN_CATCH_THIEVES.java │ │ │ ├── POSITION_ELEMENT_STABLE_SORT.java │ │ │ ├── POSITION_OF_RIGHTMOST_SET_BIT.java │ │ │ ├── POSITION_OF_RIGHTMOST_SET_BIT_1.java │ │ │ ├── POSITIVE_ELEMENTS_EVEN_NEGATIVE_ODD_POSITIONS.java │ │ │ ├── POSSIBLE_FORM_TRIANGLE_ARRAY_VALUES.java │ │ │ ├── POSSIBLE_TO_MAKE_A_DIVISIBLE_BY_3_NUMBER_USING_ALL_DIGITS_IN_AN_ARRAY.java │ │ │ ├── PRIMALITY_TEST_SET_1_INTRODUCTION_AND_SCHOOL_METHOD.java │ │ │ ├── PRIMALITY_TEST_SET_1_INTRODUCTION_AND_SCHOOL_METHOD_1.java │ │ │ ├── PRIMALITY_TEST_SET_5USING_LUCAS_LEHMER_SERIES.java │ │ │ ├── PRIME_NUMBERS.java │ │ │ ├── PRINT_A_CLOSEST_STRING_THAT_DOES_NOT_CONTAIN_ADJACENT_DUPLICATES.java │ │ │ ├── PRINT_MAXIMUM_SHORTEST_DISTANCE.java │ │ │ ├── PRINT_WORDS_STRING_REVERSE_ORDER.java │ │ │ ├── PROBABILITY_THREE_RANDOMLY_CHOSEN_NUMBERS_AP.java │ │ │ ├── PRODUCT_MAXIMUM_FIRST_ARRAY_MINIMUM_SECOND.java │ │ │ ├── PRODUCT_MAXIMUM_FIRST_ARRAY_MINIMUM_SECOND_1.java │ │ │ ├── PRODUCT_NODES_K_TH_LEVEL_TREE_REPRESENTED_STRING.java │ │ │ ├── PROGRAM_AREA_SQUARE.java │ │ │ ├── PROGRAM_BINARY_DECIMAL_CONVERSION.java │ │ │ ├── PROGRAM_BINARY_DECIMAL_CONVERSION_1.java │ │ │ ├── PROGRAM_CALCULATE_AREA_OCTAGON.java │ │ │ ├── PROGRAM_CALCULATE_VOLUME_ELLIPSOID.java │ │ │ ├── PROGRAM_CALCULATE_VOLUME_OCTAHEDRON.java │ │ │ ├── PROGRAM_CENSOR_WORD_ASTERISKS_SENTENCE.java │ │ │ ├── PROGRAM_CHECK_ARRAY_SORTED_NOT_ITERATIVE_RECURSIVE.java │ │ │ ├── PROGRAM_CHECK_ARRAY_SORTED_NOT_ITERATIVE_RECURSIVE_1.java │ │ │ ├── PROGRAM_CHECK_INPUT_INTEGER_STRING.java │ │ │ ├── PROGRAM_CHECK_ISBN.java │ │ │ ├── PROGRAM_CHECK_PLUS_PERFECT_NUMBER.java │ │ │ ├── PROGRAM_CIRCUMFERENCE_PARALLELOGRAM.java │ │ │ ├── PROGRAM_COUNT_OCCURRENCE_GIVEN_CHARACTER_STRING.java │ │ │ ├── PROGRAM_DECIMAL_BINARY_CONVERSION_2.java │ │ │ ├── PROGRAM_DISTANCE_TWO_POINTS_EARTH.java │ │ │ ├── PROGRAM_FIND_CIRCUMFERENCE_CIRCLE.java │ │ │ ├── PROGRAM_FIND_REMAINDER_LARGE_NUMBER_DIVIDED_11.java │ │ │ ├── PROGRAM_FIND_SLOPE_LINE.java │ │ │ ├── PROGRAM_FIND_SMALLEST_DIFFERENCE_ANGLES_TWO_PARTS_GIVEN_CIRCLE.java │ │ │ ├── PROGRAM_FIND_STRING_START_END_GEEKS.java │ │ │ ├── PROGRAM_FOR_DEADLOCK_FREE_CONDITION_IN_OPERATING_SYSTEM.java │ │ │ ├── PROGRAM_FOR_FACTORIAL_OF_A_NUMBER.java │ │ │ ├── PROGRAM_FOR_FACTORIAL_OF_A_NUMBER_1.java │ │ │ ├── PROGRAM_FOR_FACTORIAL_OF_A_NUMBER_2.java │ │ │ ├── PROGRAM_FOR_SURFACE_AREA_OF_OCTAHEDRON.java │ │ │ ├── PROGRAM_OCTAL_DECIMAL_CONVERSION.java │ │ │ ├── PROGRAM_PAGE_REPLACEMENT_ALGORITHMS_SET_2_FIFO.java │ │ │ ├── PROGRAM_PRINT_IDENTITY_MATRIX_1.java │ │ │ ├── PROGRAM_PRINT_SUM_GIVEN_NTH_TERM_1.java │ │ │ ├── PROGRAM_TO_CHECK_IF_A_GIVEN_NUMBER_IS_LUCKY_ALL_DIGITS_ARE_DIFFERENT.java │ │ │ ├── PROGRAM_TO_CHECK_IF_A_MATRIX_IS_SYMMETRIC.java │ │ │ ├── PROGRAM_TO_FIND_REMAINDER_WITHOUT_USING_MODULO_OR_OPERATOR.java │ │ │ ├── PROGRAM_TO_FIND_REMAINDER_WITHOUT_USING_MODULO_OR_OPERATOR_1.java │ │ │ ├── PROGRAM_TO_FIND_REMAINDER_WITHOUT_USING_MODULO_OR_OPERATOR_2.java │ │ │ ├── PROGRAM_TO_FIND_THE_AREA_OF_PENTAGON.java │ │ │ ├── PROGRAM_TO_FIND_THE_VOLUME_OF_A_TRIANGULAR_PRISM.java │ │ │ ├── PYTHAGOREAN_QUADRUPLE.java │ │ │ ├── PYTHON_PROGRAM_FIND_PERIMETER_CIRCUMFERENCE_SQUARE_RECTANGLE.java │ │ │ ├── PYTHON_PROGRAM_FIND_PERIMETER_CIRCUMFERENCE_SQUARE_RECTANGLE_1.java │ │ │ ├── QUERIES_COUNTS_ARRAY_ELEMENTS_VALUES_GIVEN_RANGE.java │ │ │ ├── QUICK_WAY_CHECK_CHARACTERS_STRING.java │ │ │ ├── REARRANGE_ARRAY_MAXIMUM_MINIMUM_FORM_SET_2_O1_EXTRA_SPACE.java │ │ │ ├── REARRANGE_ARRAY_MAXIMUM_MINIMUM_FORM_SET_2_O1_EXTRA_SPACE_1.java │ │ │ ├── REARRANGE_POSITIVE_AND_NEGATIVE_NUMBERS_PUBLISH.java │ │ │ ├── RECURSIVELY_BREAK_NUMBER_3_PARTS_GET_MAXIMUM_SUM.java │ │ │ ├── RECURSIVELY_BREAK_NUMBER_3_PARTS_GET_MAXIMUM_SUM_1.java │ │ │ ├── RECURSIVE_C_PROGRAM_LINEARLY_SEARCH_ELEMENT_GIVEN_ARRAY.java │ │ │ ├── RECURSIVE_PROGRAM_PRIME_NUMBER.java │ │ │ ├── REMAINDER_7_LARGE_NUMBERS.java │ │ │ ├── REMOVE_ARRAY_END_ELEMENT_MAXIMIZE_SUM_PRODUCT.java │ │ │ ├── REMOVE_BRACKETS_ALGEBRAIC_STRING_CONTAINING_OPERATORS.java │ │ │ ├── REMOVE_MINIMUM_ELEMENTS_EITHER_SIDE_2MIN_MAX.java │ │ │ ├── REMOVE_MINIMUM_NUMBER_ELEMENTS_NO_COMMON_ELEMENT_EXIST_ARRAY.java │ │ │ ├── REPLACE_CHARACTER_C1_C2_C2_C1_STRING_S.java │ │ │ ├── REQUIRED_MINIMUM_DIGITS_REMOVE_NUMBER_MAKE_PERFECT_SQUARE.java │ │ │ ├── ROUND_THE_GIVEN_NUMBER_TO_NEAREST_MULTIPLE_OF_10.java │ │ │ ├── ROW_WISE_COMMON_ELEMENTS_TWO_DIAGONALS_SQUARE_MATRIX.java │ │ │ ├── SCHEDULE_ELEVATOR_TO_REDUCE_THE_TOTAL_TIME_TAKEN.java │ │ │ ├── SCHEDULE_JOBS_SERVER_GETS_EQUAL_LOAD.java │ │ │ ├── SEARCHING_ARRAY_ADJACENT_DIFFER_K.java │ │ │ ├── SEARCH_ALMOST_SORTED_ARRAY.java │ │ │ ├── SEARCH_AN_ELEMENT_IN_AN_ARRAY_WHERE_DIFFERENCE_BETWEEN_ADJACENT_ELEMENTS_IS_1.java │ │ │ ├── SEARCH_AN_ELEMENT_IN_A_SORTED_AND_PIVOTED_ARRAY.java │ │ │ ├── SEARCH_INSERT_AND_DELETE_IN_AN_UNSORTED_ARRAY.java │ │ │ ├── SEARCH_INSERT_AND_DELETE_IN_A_SORTED_ARRAY.java │ │ │ ├── SEARCH_INSERT_AND_DELETE_IN_A_SORTED_ARRAY_1.java │ │ │ ├── SEQUENCES_GIVEN_LENGTH_EVERY_ELEMENT_EQUAL_TWICE_PREVIOUS.java │ │ │ ├── SEQUENCES_GIVEN_LENGTH_EVERY_ELEMENT_EQUAL_TWICE_PREVIOUS_1.java │ │ │ ├── SIZE_SUBARRAY_MAXIMUM_SUM.java │ │ │ ├── SMALLEST_DIFFERENCE_PAIR_VALUES_TWO_UNSORTED_ARRAYS.java │ │ │ ├── SMALLEST_ELEMENT_REPEATED_EXACTLY_K_TIMES_NOT_LIMITED_SMALL_RANGE.java │ │ │ ├── SMALLEST_OF_THREE_INTEGERS_WITHOUT_COMPARISON_OPERATORS.java │ │ │ ├── SMALLEST_OF_THREE_INTEGERS_WITHOUT_COMPARISON_OPERATORS_1.java │ │ │ ├── SMALLEST_POWER_OF_2_GREATER_THAN_OR_EQUAL_TO_N.java │ │ │ ├── SMALLEST_POWER_OF_2_GREATER_THAN_OR_EQUAL_TO_N_1.java │ │ │ ├── SMALLEST_POWER_OF_2_GREATER_THAN_OR_EQUAL_TO_N_2.java │ │ │ ├── SMALLEST_SUM_CONTIGUOUS_SUBARRAY.java │ │ │ ├── SORT_ARRAY_APPLYING_GIVEN_EQUATION.java │ │ │ ├── SORT_ARRAY_CONTAIN_1_N_VALUES.java │ │ │ ├── SORT_ARRAY_TWO_HALVES_SORTED.java │ │ │ ├── SORT_EVEN_NUMBERS_ASCENDING_ORDER_SORT_ODD_NUMBERS_DESCENDING_ORDER_1.java │ │ │ ├── SORT_EVEN_PLACED_ELEMENTS_INCREASING_ODD_PLACED_DECREASING_ORDER.java │ │ │ ├── SPACE_OPTIMIZED_SOLUTION_LCS.java │ │ │ ├── SPLIT_ARRAY_ADD_FIRST_PART_END.java │ │ │ ├── SPLIT_N_MAXIMUM_COMPOSITE_NUMBERS.java │ │ │ ├── SQUARED_TRIANGULAR_NUMBER_SUM_CUBES.java │ │ │ ├── SQUARE_PYRAMIDAL_NUMBER_SUM_SQUARES.java │ │ │ ├── SQUARE_ROOT_OF_AN_INTEGER.java │ │ │ ├── SQUARE_ROOT_OF_AN_INTEGER_1.java │ │ │ ├── SQUARE_ROOT_OF_A_PERFECT_SQUARE.java │ │ │ ├── SQUARE_ROOT_OF_A_PERFECT_SQUARE_1.java │ │ │ ├── STACK_PERMUTATIONS_CHECK_IF_AN_ARRAY_IS_STACK_PERMUTATION_OF_OTHER.java │ │ │ ├── STEINS_ALGORITHM_FOR_FINDING_GCD.java │ │ │ ├── STEINS_ALGORITHM_FOR_FINDING_GCD_1.java │ │ │ ├── STOOGE_SORT.java │ │ │ ├── STRING_CONTAINING_FIRST_LETTER_EVERY_WORD_GIVEN_STRING_SPACES.java │ │ │ ├── STRING_K_DISTINCT_CHARACTERS_NO_CHARACTERS_ADJACENT.java │ │ │ ├── SUBARRAYS_DISTINCT_ELEMENTS.java │ │ │ ├── SUBSEQUENCES_SIZE_THREE_ARRAY_WHOSE_SUM_DIVISIBLE_M.java │ │ │ ├── SUM_AREA_RECTANGLES_POSSIBLE_ARRAY.java │ │ │ ├── SUM_BINOMIAL_COEFFICIENTS.java │ │ │ ├── SUM_BINOMIAL_COEFFICIENTS_1.java │ │ │ ├── SUM_DIVISORS_1_N_1.java │ │ │ ├── SUM_FACTORS_NUMBER.java │ │ │ ├── SUM_FACTORS_NUMBER_1.java │ │ │ ├── SUM_FAI_AJ_PAIRS_ARRAY_N_INTEGERS.java │ │ │ ├── SUM_FIBONACCI_NUMBERS.java │ │ │ ├── SUM_K_TH_GROUP_ODD_POSITIVE_NUMBERS.java │ │ │ ├── SUM_K_TH_GROUP_ODD_POSITIVE_NUMBERS_1.java │ │ │ ├── SUM_LARGEST_PRIME_FACTOR_NUMBER_LESS_EQUAL_N.java │ │ │ ├── SUM_MANHATTAN_DISTANCES_PAIRS_POINTS.java │ │ │ ├── SUM_MATRIX_ELEMENT_ABSOLUTE_DIFFERENCE_ROW_COLUMN_NUMBERS.java │ │ │ ├── SUM_MATRIX_ELEMENT_ABSOLUTE_DIFFERENCE_ROW_COLUMN_NUMBERS_1.java │ │ │ ├── SUM_MATRIX_ELEMENT_ABSOLUTE_DIFFERENCE_ROW_COLUMN_NUMBERS_2.java │ │ │ ├── SUM_MATRIX_ELEMENT_ELEMENT_INTEGER_DIVISION_ROW_COLUMN.java │ │ │ ├── SUM_MATRIX_ELEMENT_ELEMENT_INTEGER_DIVISION_ROW_COLUMN_1.java │ │ │ ├── SUM_NODES_K_TH_LEVEL_TREE_REPRESENTED_STRING.java │ │ │ ├── SUM_OF_ALL_ELEMENTS_UP_TO_NTH_ROW_IN_A_PASCALS_TRIANGLE.java │ │ │ ├── SUM_OF_ALL_ELEMENTS_UP_TO_NTH_ROW_IN_A_PASCALS_TRIANGLE_1.java │ │ │ ├── SUM_OF_ALL_PROPER_DIVISORS_OF_A_NATURAL_NUMBER.java │ │ │ ├── SUM_OF_ALL_SUBSTRINGS_OF_A_STRING_REPRESENTING_A_NUMBER.java │ │ │ ├── SUM_PAIRWISE_PRODUCTS.java │ │ │ ├── SUM_PAIRWISE_PRODUCTS_1.java │ │ │ ├── SUM_PAIRWISE_PRODUCTS_2.java │ │ │ ├── SUM_SEQUENCE_2_22_222.java │ │ │ ├── SUM_SERIES_0_6_0_06_0_006_0_0006_N_TERMS.java │ │ │ ├── SUM_SERIES_12_32_52_2N_12.java │ │ │ ├── SUM_SERIES_12_32_52_2N_12_1.java │ │ │ ├── SUM_SERIES_23_45_67_89_UPTO_N_TERMS.java │ │ │ ├── SUM_SERIES_555555_N_TERMS.java │ │ │ ├── SUM_SUBSETS_SET_FORMED_FIRST_N_NATURAL_NUMBERS.java │ │ │ ├── SUM_TWO_LARGE_NUMBERS.java │ │ │ ├── SUM_TWO_LARGE_NUMBERS_1.java │ │ │ ├── SWAP_ALL_ODD_AND_EVEN_BITS.java │ │ │ ├── SWAP_BITS_IN_A_GIVEN_NUMBER.java │ │ │ ├── SWAP_TWO_NIBBLES_BYTE.java │ │ │ ├── SWAP_TWO_NUMBERS_WITHOUT_USING_TEMPORARY_VARIABLE.java │ │ │ ├── TAIL_RECURSION.java │ │ │ ├── TAIL_RECURSION_FIBONACCI.java │ │ │ ├── TEMPLE_OFFERINGS.java │ │ │ ├── TILING_WITH_DOMINOES.java │ │ │ ├── TOTAL_NUMBER_OF_NON_DECREASING_NUMBERS_WITH_N_DIGITS.java │ │ │ ├── TOTAL_NUMBER_OF_NON_DECREASING_NUMBERS_WITH_N_DIGITS_1.java │ │ │ ├── TRIANGULAR_MATCHSTICK_NUMBER.java │ │ │ ├── TRIANGULAR_NUMBERS.java │ │ │ ├── TRIANGULAR_NUMBERS_1.java │ │ │ ├── TURN_OFF_THE_RIGHTMOST_SET_BIT.java │ │ │ ├── UGLY_NUMBERS.java │ │ │ ├── UNIQUE_CELLS_BINARY_MATRIX.java │ │ │ ├── WAYS_REMOVE_ONE_ELEMENT_BINARY_STRING_XOR_BECOMES_ZERO.java │ │ │ ├── WAYS_TO_WRITE_N_AS_SUM_OF_TWO_OR_MORE_POSITIVE_INTEGERS.java │ │ │ ├── WAYS_TRANSFORMING_ONE_STRING_REMOVING_0_CHARACTERS.java │ │ │ ├── WILDCARD_CHARACTER_MATCHING.java │ │ │ ├── WRITE_AN_EFFICIENT_METHOD_TO_CHECK_IF_A_NUMBER_IS_MULTIPLE_OF_3.java │ │ │ ├── WRITE_A_C_PROGRAM_TO_CALCULATE_POWXN.java │ │ │ ├── WRITE_A_C_PROGRAM_TO_FIND_THE_PARITY_OF_AN_UNSIGNED_INTEGER.java │ │ │ ├── WRITE_ONE_LINE_C_FUNCTION_TO_FIND_WHETHER_A_NO_IS_POWER_OF_TWO.java │ │ │ ├── WRITE_ONE_LINE_C_FUNCTION_TO_FIND_WHETHER_A_NO_IS_POWER_OF_TWO_1.java │ │ │ ├── WRITE_YOU_OWN_POWER_WITHOUT_USING_MULTIPLICATION_AND_DIVISION.java │ │ │ └── ZECKENDORFS_THEOREM_NON_NEIGHBOURING_FIBONACCI_REPRESENTATION.java │ │ │ └── python │ │ │ ├── ADD_1_TO_A_GIVEN_NUMBER.py │ │ │ ├── ADD_1_TO_A_GIVEN_NUMBER_1.py │ │ │ ├── ADD_TWO_NUMBERS_WITHOUT_USING_ARITHMETIC_OPERATORS.py │ │ │ ├── ALTERNATIVE_SORTING.py │ │ │ ├── ANALYSIS_OF_ALGORITHMS_SET_2_ASYMPTOTIC_ANALYSIS.py │ │ │ ├── AREA_OF_A_HEXAGON.py │ │ │ ├── AREA_OF_THE_CIRCLE_THAT_HAS_A_SQUARE_AND_A_CIRCLE_INSCRIBED_IN_IT.py │ │ │ ├── AREA_SQUARE_CIRCUMSCRIBED_CIRCLE.py │ │ │ ├── ARRAY_ELEMENT_MOVED_K_USING_SINGLE_MOVES.py │ │ │ ├── ARRAY_RANGE_QUERIES_ELEMENTS_FREQUENCY_VALUE.py │ │ │ ├── BASIC_AND_EXTENDED_EUCLIDEAN_ALGORITHMS.py │ │ │ ├── BASIC_AND_EXTENDED_EUCLIDEAN_ALGORITHMS_1.py │ │ │ ├── BELL_NUMBERS_NUMBER_OF_WAYS_TO_PARTITION_A_SET.py │ │ │ ├── BINARY_REPRESENTATION_OF_NEXT_NUMBER.py │ │ │ ├── BINARY_SEARCH.py │ │ │ ├── BREAKING_NUMBER_FIRST_PART_INTEGRAL_DIVISION_SECOND_POWER_10.py │ │ │ ├── BREAK_NUMBER_THREE_PARTS.py │ │ │ ├── BREAK_NUMBER_THREE_PARTS_1.py │ │ │ ├── CAESAR_CIPHER.py │ │ │ ├── CALCULATE_ANGLE_HOUR_HAND_MINUTE_HAND.py │ │ │ ├── CALCULATE_AREA_TETRAHEDRON.py │ │ │ ├── CALCULATE_MAXIMUM_VALUE_USING_SIGN_TWO_NUMBERS_STRING.py │ │ │ ├── CALCULATE_VOLUME_DODECAHEDRON.py │ │ │ ├── CASSINIS_IDENTITY.py │ │ │ ├── CEILING_IN_A_SORTED_ARRAY.py │ │ │ ├── CEILING_IN_A_SORTED_ARRAY_1.py │ │ │ ├── CENTER_ELEMENT_OF_MATRIX_EQUALS_SUMS_OF_HALF_DIAGONALS.py │ │ │ ├── CHANGE_ARRAY_PERMUTATION_NUMBERS_1_N.py │ │ │ ├── CHANGE_BITS_CAN_MADE_ONE_FLIP.py │ │ │ ├── CHECK_ARRAY_CONTAINS_CONTIGUOUS_INTEGERS_DUPLICATES_ALLOWED.py │ │ │ ├── CHECK_ARRAY_REPRESENTS_INORDER_BINARY_SEARCH_TREE_NOT.py │ │ │ ├── CHECK_EXIST_TWO_ELEMENTS_ARRAY_WHOSE_SUM_EQUAL_SUM_REST_ARRAY.py │ │ │ ├── CHECK_GIVEN_CIRCLE_LIES_COMPLETELY_INSIDE_RING_FORMED_TWO_CONCENTRIC_CIRCLES.py │ │ │ ├── CHECK_GIVEN_MATRIX_SPARSE_NOT.py │ │ │ ├── CHECK_GIVEN_SENTENCE_GIVEN_SET_SIMPLE_GRAMMER_RULES.py │ │ │ ├── CHECK_GIVEN_STRING_CAN_SPLIT_FOUR_DISTINCT_STRINGS.py │ │ │ ├── CHECK_GIVEN_STRING_ROTATION_PALINDROME.py │ │ │ ├── CHECK_IF_ALL_THE_ELEMENTS_CAN_BE_MADE_OF_SAME_PARITY_BY_INVERTING_ADJACENT_ELEMENTS.py │ │ │ ├── CHECK_IF_ARRAY_ELEMENTS_ARE_CONSECUTIVE.py │ │ │ ├── CHECK_IF_A_NUMBER_IS_JUMBLED_OR_NOT.py │ │ │ ├── CHECK_IF_A_NUMBER_IS_POWER_OF_ANOTHER_NUMBER.py │ │ │ ├── CHECK_IF_A_NUMBER_IS_POWER_OF_ANOTHER_NUMBER_1.py │ │ │ ├── CHECK_IF_STRING_REMAINS_PALINDROME_AFTER_REMOVING_GIVEN_NUMBER_OF_CHARACTERS.py │ │ │ ├── CHECK_IF_X_CAN_GIVE_CHANGE_TO_EVERY_PERSON_IN_THE_QUEUE.py │ │ │ ├── CHECK_INTEGER_OVERFLOW_MULTIPLICATION.py │ │ │ ├── CHECK_LARGE_NUMBER_DIVISIBLE_13_NOT.py │ │ │ ├── CHECK_LINE_PASSES_ORIGIN.py │ │ │ ├── CHECK_NUMBER_IS_PERFECT_SQUARE_USING_ADDITIONSUBTRACTION.py │ │ │ ├── CHECK_NUMBER_POWER_K_USING_BASE_CHANGING_METHOD.py │ │ │ ├── CHECK_OCCURRENCES_CHARACTER_APPEAR_TOGETHER.py │ │ │ ├── CHECK_POSSIBLE_SORT_ARRAY_CONDITIONAL_SWAPPING_ADJACENT_ALLOWED.py │ │ │ ├── CHECK_POSSIBLE_TRANSFORM_ONE_STRING_ANOTHER.py │ │ │ ├── CHECK_REVERSING_SUB_ARRAY_MAKE_ARRAY_SORTED.py │ │ │ ├── CHECK_REVERSING_SUB_ARRAY_MAKE_ARRAY_SORTED_1.py │ │ │ ├── CHECK_STRING_CAN_OBTAINED_ROTATING_ANOTHER_STRING_2_PLACES.py │ │ │ ├── CHECK_STRING_FOLLOWS_ANBN_PATTERN_NOT.py │ │ │ ├── CHECK_SUMS_TH_ROW_TH_COLUMN_MATRIX.py │ │ │ ├── CHECK_TWO_GIVEN_CIRCLES_TOUCH_INTERSECT.py │ │ │ ├── CHECK_VALID_SEQUENCE_DIVISIBLE_M.py │ │ │ ├── CHECK_VALID_SEQUENCE_DIVISIBLE_M_1.py │ │ │ ├── CHECK_WHETHER_ARITHMETIC_PROGRESSION_CAN_FORMED_GIVEN_ARRAY.py │ │ │ ├── CHECK_WHETHER_GIVEN_DEGREES_VERTICES_REPRESENT_GRAPH_TREE.py │ │ │ ├── CHECK_WHETHER_GIVEN_NUMBER_EVEN_ODD.py │ │ │ ├── CHECK_WHETHER_GIVEN_NUMBER_EVEN_ODD_1.py │ │ │ ├── CHECK_WHETHER_NUMBER_DUCK_NUMBER_NOT.py │ │ │ ├── CHECK_WHETHER_TRIANGLE_VALID_NOT_SIDES_GIVEN.py │ │ │ ├── CHECK_WHETHER_TWO_STRINGS_ARE_ANAGRAM_OF_EACH_OTHER.py │ │ │ ├── CHOCOLATE_DISTRIBUTION_PROBLEM.py │ │ │ ├── CIRCLE_LATTICE_POINTS.py │ │ │ ├── CIRCULAR_MATRIX_CONSTRUCT_A_MATRIX_WITH_NUMBERS_1_TO_MN_IN_SPIRAL_WAY.py │ │ │ ├── COIN_GAME_WINNER_EVERY_PLAYER_THREE_CHOICES.py │ │ │ ├── COMPOSITE_NUMBER.py │ │ │ ├── COMPUTE_AVERAGE_TWO_NUMBERS_WITHOUT_OVERFLOW.py │ │ │ ├── COMPUTE_AVERAGE_TWO_NUMBERS_WITHOUT_OVERFLOW_1.py │ │ │ ├── COMPUTE_MODULUS_DIVISION_BY_A_POWER_OF_2_NUMBER.py │ │ │ ├── COMPUTE_NCR_P_SET_1_INTRODUCTION_AND_DYNAMIC_PROGRAMMING_SOLUTION.py │ │ │ ├── COMPUTE_N_UNDER_MODULO_P.py │ │ │ ├── CONSTRUCT_LEXICOGRAPHICALLY_SMALLEST_PALINDROME.py │ │ │ ├── CONVERTING_ONE_STRING_USING_APPEND_DELETE_LAST_OPERATIONS.py │ │ │ ├── CONVERT_STRICTLY_INCREASING_ARRAY_MINIMUM_CHANGES.py │ │ │ ├── COST_BALANCE_PARANTHESES.py │ │ │ ├── COUNT_ARRAYS_CONSECUTIVE_ELEMENT_DIFFERENT_VALUES.py │ │ │ ├── COUNT_BALANCED_BINARY_TREES_HEIGHT_H.py │ │ │ ├── COUNT_BINARY_STRINGS_K_TIMES_APPEARING_ADJACENT_TWO_SET_BITS.py │ │ │ ├── COUNT_CHARACTERS_POSITION_ENGLISH_ALPHABETS.py │ │ │ ├── COUNT_CHARACTERS_STRING_DISTANCE_ENGLISH_ALPHABETS.py │ │ │ ├── COUNT_DERANGEMENTS_PERMUTATION_SUCH_THAT_NO_ELEMENT_APPEARS_IN_ITS_ORIGINAL_POSITION_1.py │ │ │ ├── COUNT_DIGITS_FACTORIAL_SET_1.py │ │ │ ├── COUNT_DIGITS_FACTORIAL_SET_2.py │ │ │ ├── COUNT_DISTINCT_NON_NEGATIVE_PAIRS_X_Y_SATISFY_INEQUALITY_XX_YY_N_2.py │ │ │ ├── COUNT_DISTINCT_NON_NEGATIVE_PAIRS_X_Y_SATISFY_INEQUALITY_XX_YY_N_2_1.py │ │ │ ├── COUNT_DISTINCT_OCCURRENCES_AS_A_SUBSEQUENCE.py │ │ │ ├── COUNT_ENTRIES_EQUAL_TO_X_IN_A_SPECIAL_MATRIX.py │ │ │ ├── COUNT_EVEN_LENGTH_BINARY_SEQUENCES_WITH_SAME_SUM_OF_FIRST_AND_SECOND_HALF_BITS_1.py │ │ │ ├── COUNT_FACTORIAL_NUMBERS_IN_A_GIVEN_RANGE.py │ │ │ ├── COUNT_FIBONACCI_NUMBERS_GIVEN_RANGE_LOG_TIME.py │ │ │ ├── COUNT_FREQUENCY_K_MATRIX_SIZE_N_MATRIXI_J_IJ.py │ │ │ ├── COUNT_INDEX_PAIRS_EQUAL_ELEMENTS_ARRAY.py │ │ │ ├── COUNT_INDEX_PAIRS_EQUAL_ELEMENTS_ARRAY_1.py │ │ │ ├── COUNT_INVERSIONS_OF_SIZE_THREE_IN_A_GIVE_ARRAY_1.py │ │ │ ├── COUNT_MINIMUM_NUMBER_SUBSETS_SUBSEQUENCES_CONSECUTIVE_NUMBERS.py │ │ │ ├── COUNT_NATURAL_NUMBERS_WHOSE_PERMUTATION_GREATER_NUMBER.py │ │ │ ├── COUNT_NEGATIVE_NUMBERS_IN_A_COLUMN_WISE_ROW_WISE_SORTED_MATRIX.py │ │ │ ├── COUNT_NEGATIVE_NUMBERS_IN_A_COLUMN_WISE_ROW_WISE_SORTED_MATRIX_1.py │ │ │ ├── COUNT_NUMBERS_CAN_CONSTRUCTED_USING_TWO_NUMBERS.py │ │ │ ├── COUNT_NUMBERS_THAT_DONT_CONTAIN_3.py │ │ │ ├── COUNT_NUMBER_BINARY_STRINGS_WITHOUT_CONSECUTIVE_1S.py │ │ │ ├── COUNT_NUMBER_OF_OCCURRENCES_OR_FREQUENCY_IN_A_SORTED_ARRAY.py │ │ │ ├── COUNT_NUMBER_OF_SOLUTIONS_OF_X2_1_MOD_P_IN_GIVEN_RANGE.py │ │ │ ├── COUNT_NUMBER_OF_STRINGS_MADE_OF_R_G_AND_B_USING_GIVEN_COMBINATION.py │ │ │ ├── COUNT_NUMBER_OF_WAYS_TO_COVER_A_DISTANCE_1.py │ │ │ ├── COUNT_NUMBER_OF_WAYS_TO_FILL_A_N_X_4_GRID_USING_1_X_4_TILES.py │ │ │ ├── COUNT_NUMBER_OF_WAYS_TO_PARTITION_A_SET_INTO_K_SUBSETS_1.py │ │ │ ├── COUNT_NUMBER_PAIRS_N_B_N_GCD_B_B.py │ │ │ ├── COUNT_NUMBER_WAYS_REACH_GIVEN_SCORE_GAME.py │ │ │ ├── COUNT_NUMBER_WAYS_TILE_FLOOR_SIZE_N_X_M_USING_1_X_M_SIZE_TILES.py │ │ │ ├── COUNT_OBTUSE_ANGLES_CIRCLE_K_EQUIDISTANT_POINTS_2_GIVEN_POINTS.py │ │ │ ├── COUNT_OFDIFFERENT_WAYS_EXPRESS_N_SUM_1_3_4.py │ │ │ ├── COUNT_OF_OCCURRENCES_OF_A_101_PATTERN_IN_A_STRING.py │ │ │ ├── COUNT_OF_PAIRS_SATISFYING_THE_GIVEN_CONDITION.py │ │ │ ├── COUNT_OPERATIONS_MAKE_STRINGAB_FREE.py │ │ │ ├── COUNT_PAIRS_DIFFERENCE_EQUAL_K.py │ │ │ ├── COUNT_PAIRS_DIFFERENCE_EQUAL_K_1.py │ │ │ ├── COUNT_PAIRS_TWO_SORTED_ARRAYS_WHOSE_SUM_EQUAL_GIVEN_VALUE_X.py │ │ │ ├── COUNT_PAIRS_TWO_SORTED_ARRAYS_WHOSE_SUM_EQUAL_GIVEN_VALUE_X_1.py │ │ │ ├── COUNT_PAIRS_TWO_SORTED_ARRAYS_WHOSE_SUM_EQUAL_GIVEN_VALUE_X_2.py │ │ │ ├── COUNT_PAIRS_WHOSE_PRODUCTS_EXIST_IN_ARRAY.py │ │ │ ├── COUNT_PAIRS_WHOSE_PRODUCTS_EXIST_IN_ARRAY_1.py │ │ │ ├── COUNT_PALINDROME_SUB_STRINGS_STRING.py │ │ │ ├── COUNT_PALINDROMIC_SUBSEQUENCE_GIVEN_STRING.py │ │ │ ├── COUNT_POSSIBLE_DECODINGS_GIVEN_DIGIT_SEQUENCE_1.py │ │ │ ├── COUNT_POSSIBLE_GROUPS_SIZE_2_3_SUM_MULTIPLE_3.py │ │ │ ├── COUNT_POSSIBLE_PATHS_TOP_LEFT_BOTTOM_RIGHT_NXM_MATRIX_2.py │ │ │ ├── COUNT_POSSIBLE_WAYS_TO_CONSTRUCT_BUILDINGS.py │ │ │ ├── COUNT_SET_BITS_IN_AN_INTEGER.py │ │ │ ├── COUNT_SET_BITS_IN_AN_INTEGER_1.py │ │ │ ├── COUNT_SET_BITS_IN_AN_INTEGER_2.py │ │ │ ├── COUNT_SET_BITS_IN_AN_INTEGER_3.py │ │ │ ├── COUNT_SORTED_ROWS_MATRIX.py │ │ │ ├── COUNT_STRINGS_ADJACENT_CHARACTERS_DIFFERENCE_ONE.py │ │ │ ├── COUNT_STRINGS_CAN_FORMED_USING_B_C_GIVEN_CONSTRAINTS_1.py │ │ │ ├── COUNT_STRINGS_WITH_CONSECUTIVE_1S.py │ │ │ ├── COUNT_SUBARRAYS_EQUAL_NUMBER_1S_0S.py │ │ │ ├── COUNT_SUBARRAYS_EQUAL_NUMBER_1S_0S_1.py │ │ │ ├── COUNT_SUBARRAYS_TOTAL_DISTINCT_ELEMENTS_ORIGINAL_ARRAY.py │ │ │ ├── COUNT_SUBARRAYS_WITH_SAME_EVEN_AND_ODD_ELEMENTS.py │ │ │ ├── COUNT_SUBSTRINGS_WITH_SAME_FIRST_AND_LAST_CHARACTERS.py │ │ │ ├── COUNT_SUM_OF_DIGITS_IN_NUMBERS_FROM_1_TO_N.py │ │ │ ├── COUNT_TOTAL_SET_BITS_IN_ALL_NUMBERS_FROM_1_TO_N.py │ │ │ ├── COUNT_TRAILING_ZEROES_FACTORIAL_NUMBER.py │ │ │ ├── COUNT_WAYS_BUILD_STREET_GIVEN_CONSTRAINTS.py │ │ │ ├── COUNT_WAYS_DIVIDE_CIRCLE_USING_N_NON_INTERSECTING_CHORDS.py │ │ │ ├── COUNT_WORDS_APPEAR_EXACTLY_TWO_TIMES_ARRAY_WORDS.py │ │ │ ├── C_PROGRAM_CONCATENATE_STRING_GIVEN_NUMBER_TIMES.py │ │ │ ├── C_PROGRAM_FACTORIAL_NUMBER.py │ │ │ ├── C_PROGRAM_FACTORIAL_NUMBER_1.py │ │ │ ├── C_PROGRAM_FACTORIAL_NUMBER_2.py │ │ │ ├── C_PROGRAM_FIND_AREA_CIRCLE.py │ │ │ ├── C_PROGRAM_FIND_LARGEST_ELEMENT_ARRAY_1.py │ │ │ ├── C_PROGRAM_FIND_SECOND_FREQUENT_CHARACTER.py │ │ │ ├── DECIMAL_BINARY_CONVERSION_WITHOUT_USING_ARITHMETIC_OPERATORS.py │ │ │ ├── DECIMAL_REPRESENTATION_GIVEN_BINARY_STRING_DIVISIBLE_10_NOT.py │ │ │ ├── DECODE_MEDIAN_STRING_ORIGINAL_STRING.py │ │ │ ├── DETECT_IF_TWO_INTEGERS_HAVE_OPPOSITE_SIGNS.py │ │ │ ├── DIAGONALLY_DOMINANT_MATRIX.py │ │ │ ├── DICE_THROW_PROBLEM.py │ │ │ ├── DICE_THROW_PROBLEM_1.py │ │ │ ├── DIFFERENCE_BETWEEN_HIGHEST_AND_LEAST_FREQUENCIES_IN_AN_ARRAY.py │ │ │ ├── DIFFERENCE_MAXIMUM_SUM_MINIMUM_SUM_N_M_ELEMENTSIN_REVIEW.py │ │ │ ├── DISTRIBUTING_ITEMS_PERSON_CANNOT_TAKE_TWO_ITEMS_TYPE.py │ │ │ ├── DISTRIBUTING_M_ITEMS_CIRCLE_SIZE_N_STARTING_K_TH_POSITION.py │ │ │ ├── DIVISIBILITY_9_USING_BITWISE_OPERATORS.py │ │ │ ├── DIVISIBILITY_BY_7.py │ │ │ ├── DOUBLE_FACTORIAL.py │ │ │ ├── DOUBLE_FACTORIAL_1.py │ │ │ ├── DYCK_PATH.py │ │ │ ├── DYNAMIC_PROGRAMMING_HIGH_EFFORT_VS_LOW_EFFORT_TASKS_PROBLEM.py │ │ │ ├── DYNAMIC_PROGRAMMING_SET_12_LONGEST_PALINDROMIC_SUBSEQUENCE.py │ │ │ ├── DYNAMIC_PROGRAMMING_SET_14_MAXIMUM_SUM_INCREASING_SUBSEQUENCE.py │ │ │ ├── DYNAMIC_PROGRAMMING_SET_17_PALINDROME_PARTITIONING.py │ │ │ ├── DYNAMIC_PROGRAMMING_SET_17_PALINDROME_PARTITIONING_1.py │ │ │ ├── DYNAMIC_PROGRAMMING_SET_28_MINIMUM_INSERTIONS_TO_FORM_A_PALINDROME.py │ │ │ ├── DYNAMIC_PROGRAMMING_SET_36_CUT_A_ROPE_TO_MAXIMIZE_PRODUCT_1.py │ │ │ ├── DYNAMIC_PROGRAMMING_SET_37_BOOLEAN_PARENTHESIZATION_PROBLEM.py │ │ │ ├── EFFICIENTLY_COMPUTE_SUMS_OF_DIAGONALS_OF_A_MATRIX.py │ │ │ ├── EFFICIENTLY_COMPUTE_SUMS_OF_DIAGONALS_OF_A_MATRIX_1.py │ │ │ ├── EFFICIENT_SEARCH_IN_AN_ARRAY_WHERE_DIFFERENCE_BETWEEN_ADJACENT_IS_1.py │ │ │ ├── EFFICIENT_WAY_CHECK_WHETHER_N_TH_FIBONACCI_NUMBER_MULTIPLE_10.py │ │ │ ├── EFFICIENT_WAY_TO_MULTIPLY_WITH_7.py │ │ │ ├── ELEMENTS_TO_BE_ADDED_SO_THAT_ALL_ELEMENTS_OF_A_RANGE_ARE_PRESENT_IN_ARRAY.py │ │ │ ├── ELEMENTS_TO_BE_ADDED_SO_THAT_ALL_ELEMENTS_OF_A_RANGE_ARE_PRESENT_IN_ARRAY_1.py │ │ │ ├── EULERIAN_NUMBER_1.py │ │ │ ├── EULERS_CRITERION_CHECK_IF_SQUARE_ROOT_UNDER_MODULO_P_EXISTS.py │ │ │ ├── EVEN_FIBONACCI_NUMBERS_SUM.py │ │ │ ├── FAST_MULTIPLICATION_METHOD_WITHOUT_USING_MULTIPLICATION_OPERATOR_RUSSIAN_PEASANTS_ALGORITHM.py │ │ │ ├── FIBONACCI_MODULO_P.py │ │ │ ├── FINDING_POWER_PRIME_NUMBER_P_N.py │ │ │ ├── FINDING_POWER_PRIME_NUMBER_P_N_1.py │ │ │ ├── FIND_A_FIXED_POINT_IN_A_GIVEN_ARRAY.py │ │ │ ├── FIND_A_ROTATION_WITH_MAXIMUM_HAMMING_DISTANCE.py │ │ │ ├── FIND_A_TRIPLET_THAT_SUM_TO_A_GIVEN_VALUE.py │ │ │ ├── FIND_A_TRIPLET_THAT_SUM_TO_A_GIVEN_VALUE_1.py │ │ │ ├── FIND_A_TRIPLET_THAT_SUM_TO_A_GIVEN_VALUE_2.py │ │ │ ├── FIND_DIFFERENCE_BETWEEN_SUMS_OF_TWO_DIAGONALS.py │ │ │ ├── FIND_DIFFERENCE_BETWEEN_SUMS_OF_TWO_DIAGONALS_1.py │ │ │ ├── FIND_EQUAL_POINT_STRING_BRACKETS.py │ │ │ ├── FIND_EXPRESSION_DUPLICATE_PARENTHESIS_NOT.py │ │ │ ├── FIND_FIRST_NATURAL_NUMBER_WHOSE_FACTORIAL_DIVISIBLE_X.py │ │ │ ├── FIND_FREQUENCY_EVEN_ODD_NUMBERS_MATRIX.py │ │ │ ├── FIND_HARMONIC_MEAN_USING_ARITHMETIC_MEAN_GEOMETRIC_MEAN.py │ │ │ ├── FIND_INDEX_0_REPLACED_1_GET_LONGEST_CONTINUOUS_SEQUENCE_1S_BINARY_ARRAY.py │ │ │ ├── FIND_INDEX_GIVEN_FIBONACCI_NUMBER_CONSTANT_TIME.py │ │ │ ├── FIND_INDEX_GIVEN_FIBONACCI_NUMBER_CONSTANT_TIME_1.py │ │ │ ├── FIND_INDEX_OF_AN_EXTRA_ELEMENT_PRESENT_IN_ONE_SORTED_ARRAY.py │ │ │ ├── FIND_INDEX_OF_AN_EXTRA_ELEMENT_PRESENT_IN_ONE_SORTED_ARRAY_1.py │ │ │ ├── FIND_LARGEST_D_IN_ARRAY_SUCH_THAT_A_B_C_D.py │ │ │ ├── FIND_LARGEST_D_IN_ARRAY_SUCH_THAT_A_B_C_D_1.py │ │ │ ├── FIND_LARGEST_PRIME_FACTOR_NUMBER.py │ │ │ ├── FIND_LAST_DIGIT_FACTORIAL_DIVIDES_FACTORIAL_B.py │ │ │ ├── FIND_MAXIMUM_AVERAGE_SUBARRAY_OF_K_LENGTH.py │ │ │ ├── FIND_MAXIMUM_AVERAGE_SUBARRAY_OF_K_LENGTH_1.py │ │ │ ├── FIND_MAXIMUM_DOT_PRODUCT_TWO_ARRAYS_INSERTION_0S.py │ │ │ ├── FIND_MAXIMUM_HEIGHT_PYRAMID_FROM_THE_GIVEN_ARRAY_OF_OBJECTS.py │ │ │ ├── FIND_MAXIMUM_PRODUCT_OF_A_TRIPLET_IN_ARRAY.py │ │ │ ├── FIND_MAXIMUM_PRODUCT_OF_A_TRIPLET_IN_ARRAY_1.py │ │ │ ├── FIND_MAXIMUM_SUM_POSSIBLE_EQUAL_SUM_THREE_STACKS.py │ │ │ ├── FIND_MINIMUM_DIFFERENCE_PAIR.py │ │ │ ├── FIND_MINIMUM_DIFFERENCE_PAIR_1.py │ │ │ ├── FIND_MINIMUM_ELEMENT_IN_A_SORTED_AND_ROTATED_ARRAY.py │ │ │ ├── FIND_MINIMUM_NUMBER_DIVIDED_MAKE_NUMBER_PERFECT_SQUARE.py │ │ │ ├── FIND_MINIMUM_SUM_FACTORS_NUMBER.py │ │ │ ├── FIND_MIRROR_IMAGE_POINT_2_D_PLANE.py │ │ │ ├── FIND_NUMBER_TIMES_STRING_OCCURS_GIVEN_STRING_1.py │ │ │ ├── FIND_NUMBER_TRANSFORMATION_MAKE_TWO_MATRIX_EQUAL.py │ │ │ ├── FIND_N_TH_ELEMENT_FROM_STERNS_DIATOMIC_SERIES.py │ │ │ ├── FIND_ONE_EXTRA_CHARACTER_STRING_1.py │ │ │ ├── FIND_PAIRS_GIVEN_SUM_ELEMENTS_PAIR_DIFFERENT_ROWS.py │ │ │ ├── FIND_PAIR_WITH_GREATEST_PRODUCT_IN_ARRAY.py │ │ │ ├── FIND_PERIMETER_CYLINDER.py │ │ │ ├── FIND_PERMUTED_ROWS_GIVEN_ROW_MATRIX.py │ │ │ ├── FIND_POSITION_GIVEN_NUMBER_AMONG_NUMBERS_MADE_4_7.py │ │ │ ├── FIND_POWER_POWER_MOD_PRIME.py │ │ │ ├── FIND_REPEATED_CHARACTER_PRESENT_FIRST_STRING.py │ │ │ ├── FIND_REPETITIVE_ELEMENT_1_N_1.py │ │ │ ├── FIND_REPETITIVE_ELEMENT_1_N_1_2.py │ │ │ ├── FIND_ROTATION_COUNT_ROTATED_SORTED_ARRAY_1.py │ │ │ ├── FIND_SMALLEST_VALUE_REPRESENTED_SUM_SUBSET_GIVEN_ARRAY.py │ │ │ ├── FIND_SUBARRAY_WITH_GIVEN_SUM.py │ │ │ ├── FIND_SUBARRAY_WITH_GIVEN_SUM_1.py │ │ │ ├── FIND_SUM_EVEN_FACTORS_NUMBER.py │ │ │ ├── FIND_SUM_EVEN_INDEX_BINOMIAL_COEFFICIENTS.py │ │ │ ├── FIND_SUM_EVEN_INDEX_BINOMIAL_COEFFICIENTS_1.py │ │ │ ├── FIND_SUM_MODULO_K_FIRST_N_NATURAL_NUMBER.py │ │ │ ├── FIND_SUM_MODULO_K_FIRST_N_NATURAL_NUMBER_1.py │ │ │ ├── FIND_SUM_NODES_GIVEN_PERFECT_BINARY_TREE_1.py │ │ │ ├── FIND_SUM_NON_REPEATING_DISTINCT_ELEMENTS_ARRAY.py │ │ │ ├── FIND_SUM_ODD_FACTORS_NUMBER.py │ │ │ ├── FIND_SUM_UNIQUE_SUB_ARRAY_SUM_GIVEN_ARRAY.py │ │ │ ├── FIND_THE_ELEMENT_BEFORE_WHICH_ALL_THE_ELEMENTS_ARE_SMALLER_THAN_IT_AND_AFTER_WHICH_ALL_ARE_GREATER_THAN_IT.py │ │ │ ├── FIND_THE_ELEMENT_THAT_APPEARS_ONCE.py │ │ │ ├── FIND_THE_FIRST_MISSING_NUMBER.py │ │ │ ├── FIND_THE_MAXIMUM_ELEMENT_IN_AN_ARRAY_WHICH_IS_FIRST_INCREASING_AND_THEN_DECREASING.py │ │ │ ├── FIND_THE_MAXIMUM_SUBARRAY_XOR_IN_A_GIVEN_ARRAY.py │ │ │ ├── FIND_THE_MINIMUM_DISTANCE_BETWEEN_TWO_NUMBERS.py │ │ │ ├── FIND_THE_MINIMUM_DISTANCE_BETWEEN_TWO_NUMBERS_1.py │ │ │ ├── FIND_THE_MISSING_NUMBER_1.py │ │ │ ├── FIND_THE_MISSING_NUMBER_2.py │ │ │ ├── FIND_THE_NUMBER_OCCURRING_ODD_NUMBER_OF_TIMES.py │ │ │ ├── FIND_THE_NUMBER_OCCURRING_ODD_NUMBER_OF_TIMES_1.py │ │ │ ├── FIND_THREE_ELEMENT_FROM_DIFFERENT_THREE_ARRAYS_SUCH_THAT_THAT_A_B_C_K.py │ │ │ ├── FIND_THREE_ELEMENT_FROM_DIFFERENT_THREE_ARRAYS_SUCH_THAT_THAT_A_B_C_K_1.py │ │ │ ├── FIND_TRIPLETS_ARRAY_WHOSE_SUM_EQUAL_ZERO.py │ │ │ ├── FIND_TRIPLETS_ARRAY_WHOSE_SUM_EQUAL_ZERO_1.py │ │ │ ├── FIND_TRIPLETS_ARRAY_WHOSE_SUM_EQUAL_ZERO_2.py │ │ │ ├── FIND_UNIT_DIGIT_X_RAISED_POWER_Y.py │ │ │ ├── FIND_UNIT_DIGIT_X_RAISED_POWER_Y_1.py │ │ │ ├── FIND_VALUE_OF_Y_MOD_2_RAISED_TO_POWER_X.py │ │ │ ├── FIND_WHETHER_AN_ARRAY_IS_SUBSET_OF_ANOTHER_ARRAY_SET_1.py │ │ │ ├── FIND_WHETHER_AN_ARRAY_IS_SUBSET_OF_ANOTHER_ARRAY_SET_1_1.py │ │ │ ├── FIND_WHETHER_A_GIVEN_NUMBER_IS_A_POWER_OF_4_OR_NOT.py │ │ │ ├── FIND_WHETHER_A_GIVEN_NUMBER_IS_A_POWER_OF_4_OR_NOT_1.py │ │ │ ├── FIND_WHETHER_A_GIVEN_NUMBER_IS_A_POWER_OF_4_OR_NOT_2.py │ │ │ ├── FIND_WHETHER_GIVEN_INTEGER_POWER_3_NOT.py │ │ │ ├── FIRST_ELEMENT_OCCURRING_K_TIMES_ARRAY.py │ │ │ ├── FIRST_UPPERCASE_LETTER_IN_A_STRING_ITERATIVE_AND_RECURSIVE.py │ │ │ ├── FLOOR_IN_A_SORTED_ARRAY_1.py │ │ │ ├── FORM_MINIMUM_NUMBER_FROM_GIVEN_SEQUENCE_1.py │ │ │ ├── FORM_SMALLEST_NUMBER_USING_ONE_SWAP_OPERATION.py │ │ │ ├── FREQUENT_ELEMENT_ARRAY.py │ │ │ ├── FREQUENT_ELEMENT_ARRAY_1.py │ │ │ ├── FRIENDS_PAIRING_PROBLEM.py │ │ │ ├── FRIENDS_PAIRING_PROBLEM_2.py │ │ │ ├── FUNCTION_COPY_STRING_ITERATIVE_RECURSIVE_1.py │ │ │ ├── GCD_ELEMENTS_GIVEN_RANGE.py │ │ │ ├── GCD_FACTORIALS_TWO_NUMBERS.py │ │ │ ├── GIVEN_1S_2S_3S_KS_PRINT_ZIG_ZAG_WAY.py │ │ │ ├── GIVEN_A_SORTED_AND_ROTATED_ARRAY_FIND_IF_THERE_IS_A_PAIR_WITH_A_GIVEN_SUM.py │ │ │ ├── GIVEN_A_SORTED_AND_ROTATED_ARRAY_FIND_IF_THERE_IS_A_PAIR_WITH_A_GIVEN_SUM_1.py │ │ │ ├── GIVEN_LARGE_NUMBER_CHECK_SUBSEQUENCE_DIGITS_DIVISIBLE_8.py │ │ │ ├── GIVEN_NUMBER_STRING_FIND_NUMBER_CONTIGUOUS_SUBSEQUENCES_RECURSIVELY_ADD_9_SET_2.py │ │ │ ├── GNOME_SORT_A_STUPID_ONE.py │ │ │ ├── GOLD_MINE_PROBLEM.py │ │ │ ├── GOOGLE_CASE_GIVEN_SENTENCE.py │ │ │ ├── HARDY_RAMANUJAN_THEOREM.py │ │ │ ├── HEIGHT_COMPLETE_BINARY_TREE_HEAP_N_NODES.py │ │ │ ├── HEXAGONAL_NUMBER.py │ │ │ ├── HIGHWAY_BILLBOARD_PROBLEM.py │ │ │ ├── HORNERS_METHOD_POLYNOMIAL_EVALUATION.py │ │ │ ├── HOW_CAN_WE_SUM_THE_DIGITS_OF_A_GIVEN_NUMBER_IN_SINGLE_STATEMENT.py │ │ │ ├── HOW_CAN_WE_SUM_THE_DIGITS_OF_A_GIVEN_NUMBER_IN_SINGLE_STATEMENT_1.py │ │ │ ├── HOW_CAN_WE_SUM_THE_DIGITS_OF_A_GIVEN_NUMBER_IN_SINGLE_STATEMENT_2.py │ │ │ ├── HOW_TO_AVOID_OVERFLOW_IN_MODULAR_MULTIPLICATION.py │ │ │ ├── HOW_TO_CHECK_IF_A_GIVEN_ARRAY_REPRESENTS_A_BINARY_HEAP.py │ │ │ ├── HOW_TO_CHECK_IF_A_GIVEN_ARRAY_REPRESENTS_A_BINARY_HEAP_1.py │ │ │ ├── HOW_TO_PRINT_MAXIMUM_NUMBER_OF_A_USING_GIVEN_FOUR_KEYS.py │ │ │ ├── HOW_TO_TURN_OFF_A_PARTICULAR_BIT_IN_A_NUMBER.py │ │ │ ├── HYPERCUBE_GRAPH.py │ │ │ ├── INTEGER_POSITIVE_VALUE_POSITIVE_NEGATIVE_VALUE_ARRAY.py │ │ │ ├── INTEGER_POSITIVE_VALUE_POSITIVE_NEGATIVE_VALUE_ARRAY_1.py │ │ │ ├── K_MAXIMUM_SUMS_NON_OVERLAPPING_CONTIGUOUS_SUB_ARRAYS.py │ │ │ ├── K_NUMBERS_DIFFERENCE_MAXIMUM_MINIMUM_K_NUMBER_MINIMIZED.py │ │ │ ├── K_SMALLEST_ELEMENTS_ORDER_USING_O1_EXTRA_SPACE.py │ │ │ ├── K_TH_DIGIT_RAISED_POWER_B.py │ │ │ ├── K_TH_DISTINCT_OR_NON_REPEATING_ELEMENT_IN_AN_ARRAY.py │ │ │ ├── K_TH_DISTINCT_OR_NON_REPEATING_ELEMENT_IN_AN_ARRAY_1.py │ │ │ ├── K_TH_ELEMENT_TWO_SORTED_ARRAYS.py │ │ │ ├── K_TH_LARGEST_SUM_CONTIGUOUS_SUBARRAY.py │ │ │ ├── K_TH_MISSING_ELEMENT_INCREASING_SEQUENCE_NOT_PRESENT_GIVEN_SEQUENCE.py │ │ │ ├── K_TH_PRIME_FACTOR_GIVEN_NUMBER.py │ │ │ ├── LARGEST_SUBARRAY_WITH_EQUAL_NUMBER_OF_0S_AND_1S.py │ │ │ ├── LARGEST_SUBARRAY_WITH_EQUAL_NUMBER_OF_0S_AND_1S_1.py │ │ │ ├── LARGEST_SUBSEQUENCE_GCD_GREATER_1.py │ │ │ ├── LARGEST_SUM_CONTIGUOUS_SUBARRAY_2.py │ │ │ ├── LCS_FORMED_CONSECUTIVE_SEGMENTS_LEAST_LENGTH_K.py │ │ │ ├── LENGTH_LONGEST_STRICT_BITONIC_SUBSEQUENCE.py │ │ │ ├── LENGTH_LONGEST_SUB_STRING_CAN_MAKE_REMOVED.py │ │ │ ├── LENGTH_OF_THE_LONGEST_ARITHMATIC_PROGRESSION_IN_A_SORTED_ARRAY.py │ │ │ ├── LEONARDO_NUMBER_1.py │ │ │ ├── LEXICOGRAPHICALLY_LARGEST_SUBSEQUENCE_EVERY_CHARACTER_OCCURS_LEAST_K_TIMES.py │ │ │ ├── LEXICOGRAPHICALLY_MINIMUM_STRING_ROTATION.py │ │ │ ├── LEXICOGRAPHICALLY_NEXT_STRING.py │ │ │ ├── LEXICOGRAPHICALLY_PREVIOUS_PERMUTATION_IN_C.py │ │ │ ├── LEXICOGRAPHICALLY_SMALLEST_ARRAY_K_CONSECUTIVE_SWAPS.py │ │ │ ├── LEXICOGRAPHICAL_CONCATENATION_SUBSTRINGS_STRING.py │ │ │ ├── LEXICOGRAPHICAL_MAXIMUM_SUBSTRING_STRING.py │ │ │ ├── LONGEST_COMMON_INCREASING_SUBSEQUENCE_LCS_LIS.py │ │ │ ├── LONGEST_COMMON_SUBSEQUENCE_WITH_AT_MOST_K_CHANGES_ALLOWED.py │ │ │ ├── LONGEST_COMMON_SUBSTRING.py │ │ │ ├── LONGEST_INCREASING_ODD_EVEN_SUBSEQUENCE.py │ │ │ ├── LONGEST_PALINDROME_SUBSEQUENCE_SPACE.py │ │ │ ├── LONGEST_PREFIX_ALSO_SUFFIX_1.py │ │ │ ├── LONGEST_REPEATED_SUBSEQUENCE_1.py │ │ │ ├── LONGEST_REPEATING_AND_NON_OVERLAPPING_SUBSTRING.py │ │ │ ├── LONGEST_REPEATING_SUBSEQUENCE.py │ │ │ ├── LONGEST_SUBARRAY_COUNT_1S_ONE_COUNT_0S.py │ │ │ ├── LONGEST_SUBSEQUENCE_SUCH_THAT_DIFFERENCE_BETWEEN_ADJACENTS_IS_ONE.py │ │ │ ├── LOWER_INSERTION_POINT.py │ │ │ ├── MAGICAL_INDICES_ARRAY.py │ │ │ ├── MAKING_ELEMENTS_OF_TWO_ARRAYS_SAME_WITH_MINIMUM_INCREMENTDECREMENT.py │ │ │ ├── MARKOV_MATRIX.py │ │ │ ├── MAXIMIZE_SUM_ARRII.py │ │ │ ├── MAXIMIZE_SUM_CONSECUTIVE_DIFFERENCES_CIRCULAR_ARRAY.py │ │ │ ├── MAXIMIZE_VOLUME_CUBOID_GIVEN_SUM_SIDES.py │ │ │ ├── MAXIMIZE_VOLUME_CUBOID_GIVEN_SUM_SIDES_1.py │ │ │ ├── MAXIMUM_AREA_RECTANGLE_PICKING_FOUR_SIDES_ARRAY.py │ │ │ ├── MAXIMUM_AREA_RECTANGLE_PICKING_FOUR_SIDES_ARRAY_1.py │ │ │ ├── MAXIMUM_AVERAGE_SUM_PARTITION_ARRAY.py │ │ │ ├── MAXIMUM_BINOMIAL_COEFFICIENT_TERM_VALUE.py │ │ │ ├── MAXIMUM_CONSECUTIVE_NUMBERS_PRESENT_ARRAY.py │ │ │ ├── MAXIMUM_CONSECUTIVE_REPEATING_CHARACTER_STRING.py │ │ │ ├── MAXIMUM_CONSECUTIVE_REPEATING_CHARACTER_STRING_1.py │ │ │ ├── MAXIMUM_DIFFERENCE_SUM_ELEMENTS_TWO_ROWS_MATRIX.py │ │ │ ├── MAXIMUM_DISTANCE_TWO_OCCURRENCES_ELEMENT_ARRAY.py │ │ │ ├── MAXIMUM_EQULIBRIUM_SUM_ARRAY.py │ │ │ ├── MAXIMUM_GAMES_PLAYED_WINNER.py │ │ │ ├── MAXIMUM_HEIGHT_OF_TRIANGULAR_ARRANGEMENT_OF_ARRAY_VALUES.py │ │ │ ├── MAXIMUM_HEIGHT_OF_TRIANGULAR_ARRANGEMENT_OF_ARRAY_VALUES_1.py │ │ │ ├── MAXIMUM_LENGTH_PREFIX_ONE_STRING_OCCURS_SUBSEQUENCE_ANOTHER.py │ │ │ ├── MAXIMUM_LENGTH_SUBSEQUENCE_DIFFERENCE_ADJACENT_ELEMENTS_EITHER_0_1.py │ │ │ ├── MAXIMUM_NUMBER_2X2_SQUARES_CAN_FIT_INSIDE_RIGHT_ISOSCELES_TRIANGLE.py │ │ │ ├── MAXIMUM_NUMBER_CHARACTERS_TWO_CHARACTER_STRING.py │ │ │ ├── MAXIMUM_NUMBER_CHOCOLATES_DISTRIBUTED_EQUALLY_AMONG_K_STUDENTS.py │ │ │ ├── MAXIMUM_NUMBER_OF_SQUARES_THAT_CAN_BE_FIT_IN_A_RIGHT_ANGLE_ISOSCELES_TRIANGLE.py │ │ │ ├── MAXIMUM_NUMBER_SEGMENTS_LENGTHS_B_C.py │ │ │ ├── MAXIMUM_POINTS_INTERSECTION_N_CIRCLES.py │ │ │ ├── MAXIMUM_POSSIBLE_DIFFERENCE_TWO_SUBSETS_ARRAY.py │ │ │ ├── MAXIMUM_POSSIBLE_SUM_WINDOW_ARRAY_ELEMENTS_WINDOW_ARRAY_UNIQUE.py │ │ │ ├── MAXIMUM_PRODUCT_INCREASING_SUBSEQUENCE.py │ │ │ ├── MAXIMUM_PRODUCT_OF_4_ADJACENT_ELEMENTS_IN_MATRIX.py │ │ │ ├── MAXIMUM_PRODUCT_SUBARRAY_ADDED_NEGATIVE_PRODUCT_CASE.py │ │ │ ├── MAXIMUM_PRODUCT_SUBSET_ARRAY.py │ │ │ ├── MAXIMUM_PROFIT_BY_BUYING_AND_SELLING_A_SHARE_AT_MOST_K_TIMES_1.py │ │ │ ├── MAXIMUM_PROFIT_BY_BUYING_AND_SELLING_A_SHARE_AT_MOST_TWICE.py │ │ │ ├── MAXIMUM_REMOVAL_FROM_ARRAY_WHEN_REMOVAL_TIME_WAITING_TIME.py │ │ │ ├── MAXIMUM_SUBARRAY_SUM_ARRAY_CREATED_REPEATED_CONCATENATION.py │ │ │ ├── MAXIMUM_SUBARRAY_SUM_USING_PREFIX_SUM.py │ │ │ ├── MAXIMUM_SUBSEQUENCE_SUM_SUCH_THAT_NO_THREE_ARE_CONSECUTIVE.py │ │ │ ├── MAXIMUM_SUM_2_X_N_GRID_NO_TWO_ELEMENTS_ADJACENT.py │ │ │ ├── MAXIMUM_SUM_ALTERNATING_SUBSEQUENCE_SUM.py │ │ │ ├── MAXIMUM_SUM_BITONIC_SUBARRAY.py │ │ │ ├── MAXIMUM_SUM_IARRI_AMONG_ROTATIONS_GIVEN_ARRAY.py │ │ │ ├── MAXIMUM_SUM_IARRI_AMONG_ROTATIONS_GIVEN_ARRAY_1.py │ │ │ ├── MAXIMUM_SUM_PAIRS_SPECIFIC_DIFFERENCE.py │ │ │ ├── MAXIMUM_SUM_PAIRS_SPECIFIC_DIFFERENCE_1.py │ │ │ ├── MAXIMUM_SUM_SUBARRAY_REMOVING_ONE_ELEMENT.py │ │ │ ├── MAXIMUM_SUM_SUBSEQUENCE_LEAST_K_DISTANT_ELEMENTS.py │ │ │ ├── MAXIMUM_TRIPLET_SUM_ARRAY.py │ │ │ ├── MAXIMUM_TRIPLET_SUM_ARRAY_1.py │ │ │ ├── MAXIMUM_TRIPLET_SUM_ARRAY_2.py │ │ │ ├── MAXIMUM_VALUE_CHOICE_EITHER_DIVIDING_CONSIDERING.py │ │ │ ├── MAXIMUM_WEIGHT_PATH_ENDING_ELEMENT_LAST_ROW_MATRIX.py │ │ │ ├── MAXIMUM_XOR_VALUE_MATRIX.py │ │ │ ├── MEDIAN_OF_TWO_SORTED_ARRAYS.py │ │ │ ├── MIDDLE_OF_THREE_USING_MINIMUM_COMPARISONS.py │ │ │ ├── MIDDLE_OF_THREE_USING_MINIMUM_COMPARISONS_1.py │ │ │ ├── MIDDLE_OF_THREE_USING_MINIMUM_COMPARISONS_2.py │ │ │ ├── MINIMIZE_SUM_PRODUCT_TWO_ARRAYS_PERMUTATIONS_ALLOWED.py │ │ │ ├── MINIMIZE_THE_MAXIMUM_DIFFERENCE_BETWEEN_THE_HEIGHTS.py │ │ │ ├── MINIMIZE_THE_SUM_OF_DIGITS_OF_A_AND_B_SUCH_THAT_A_B_N.py │ │ │ ├── MINIMUM_CHARACTERS_ADDED_FRONT_MAKE_STRING_PALINDROME.py │ │ │ ├── MINIMUM_COST_CONNECT_WEIGHTED_NODES_REPRESENTED_ARRAY.py │ │ │ ├── MINIMUM_COST_CUT_BOARD_SQUARES.py │ │ │ ├── MINIMUM_COST_FOR_ACQUIRING_ALL_COINS_WITH_K_EXTRA_COINS_ALLOWED_WITH_EVERY_COIN.py │ │ │ ├── MINIMUM_COST_MAKE_ARRAY_SIZE_1_REMOVING_LARGER_PAIRS.py │ │ │ ├── MINIMUM_COST_MAKE_LONGEST_COMMON_SUBSEQUENCE_LENGTH_K.py │ │ │ ├── MINIMUM_COST_SORT_MATRIX_NUMBERS_0_N2_1.py │ │ │ ├── MINIMUM_DIFFERENCE_BETWEEN_GROUPS_OF_SIZE_TWO.py │ │ │ ├── MINIMUM_DIFFERENCE_MAX_MIN_K_SIZE_SUBSETS.py │ │ │ ├── MINIMUM_FLIP_REQUIRED_MAKE_BINARY_MATRIX_SYMMETRIC.py │ │ │ ├── MINIMUM_FLIP_REQUIRED_MAKE_BINARY_MATRIX_SYMMETRIC_1.py │ │ │ ├── MINIMUM_HEIGHT_TRIANGLE_GIVEN_BASE_AREA.py │ │ │ ├── MINIMUM_INCREMENT_K_OPERATIONS_MAKE_ELEMENTS_EQUAL.py │ │ │ ├── MINIMUM_INSERTIONS_SORT_ARRAY.py │ │ │ ├── MINIMUM_LENGTH_SUBARRAY_SUM_GREATER_GIVEN_VALUE.py │ │ │ ├── MINIMUM_LENGTH_SUBARRAY_SUM_GREATER_GIVEN_VALUE_1.py │ │ │ ├── MINIMUM_NUMBER_OF_BRACKET_REVERSALS_NEEDED_TO_MAKE_AN_EXPRESSION_BALANCED.py │ │ │ ├── MINIMUM_NUMBER_OF_JUMPS_TO_REACH_END_OF_A_GIVEN_ARRAY_1.py │ │ │ ├── MINIMUM_NUMBER_OF_JUMPS_TO_REACH_END_OF_A_GIVEN_ARRAY_2.py │ │ │ ├── MINIMUM_NUMBER_PLATFORMS_REQUIRED_RAILWAYBUS_STATION.py │ │ │ ├── MINIMUM_NUMBER_SUBSETS_DISTINCT_ELEMENTS.py │ │ │ ├── MINIMUM_OPERATIONS_MAKE_GCD_ARRAY_MULTIPLE_K.py │ │ │ ├── MINIMUM_PERIMETER_N_BLOCKS.py │ │ │ ├── MINIMUM_PRODUCT_SUBSET_ARRAY.py │ │ │ ├── MINIMUM_ROTATIONS_REQUIRED_GET_STRING.py │ │ │ ├── MINIMUM_ROTATIONS_UNLOCK_CIRCULAR_LOCK.py │ │ │ ├── MINIMUM_STEPS_MINIMIZE_N_PER_GIVEN_CONDITION.py │ │ │ ├── MINIMUM_STEPS_TO_DELETE_A_STRING_AFTER_REPEATED_DELETION_OF_PALINDROME_SUBSTRINGS.py │ │ │ ├── MINIMUM_SUM_SQUARES_CHARACTERS_COUNTS_GIVEN_STRING_REMOVING_K_CHARACTERS.py │ │ │ ├── MINIMUM_SUM_SUBSEQUENCE_LEAST_ONE_EVERY_FOUR_CONSECUTIVE_ELEMENTS_PICKED.py │ │ │ ├── MINIMUM_SUM_SUBSEQUENCE_LEAST_ONE_EVERY_FOUR_CONSECUTIVE_ELEMENTS_PICKED_1.py │ │ │ ├── MINIMUM_SUM_TWO_NUMBERS_FORMED_DIGITS_ARRAY.py │ │ │ ├── MINIMUM_SUM_TWO_NUMBERS_FORMED_DIGITS_ARRAY_2.py │ │ │ ├── MINIMUM_SWAPS_REQUIRED_BRING_ELEMENTS_LESS_EQUAL_K_TOGETHER.py │ │ │ ├── MINIMUM_TIME_TO_FINISH_TASKS_WITHOUT_SKIPPING_TWO_CONSECUTIVE.py │ │ │ ├── MINIMUM_TIME_WRITE_CHARACTERS_USING_INSERT_DELETE_COPY_OPERATION.py │ │ │ ├── MINIMUM_XOR_VALUE_PAIR.py │ │ │ ├── MINIMUM_XOR_VALUE_PAIR_1.py │ │ │ ├── MOBILE_NUMERIC_KEYPAD_PROBLEM.py │ │ │ ├── MODULAR_EXPONENTIATION_POWER_IN_MODULAR_ARITHMETIC.py │ │ │ ├── MODULUS_TWO_FLOAT_DOUBLE_NUMBERS.py │ │ │ ├── MOVE_VE_ELEMENTS_END_ORDER_EXTRA_SPACE_ALLOWED.py │ │ │ ├── MOVE_ZEROES_END_ARRAY.py │ │ │ ├── MULTIPLY_AN_INTEGER_WITH_3_5.py │ │ │ ├── MULTIPLY_LARGE_INTEGERS_UNDER_LARGE_MODULO.py │ │ │ ├── MULTIPLY_LARGE_NUMBERS_REPRESENTED_AS_STRINGS.py │ │ │ ├── MULTIPLY_TWO_NUMBERS_WITHOUT_USING_MULTIPLY_DIVISION_BITWISE_OPERATORS_AND_NO_LOOPS.py │ │ │ ├── NEXT_HIGHER_NUMBER_WITH_SAME_NUMBER_OF_SET_BITS.py │ │ │ ├── NEXT_POWER_OF_2.py │ │ │ ├── NEXT_POWER_OF_2_1.py │ │ │ ├── NEXT_POWER_OF_2_2.py │ │ │ ├── NON_REPEATING_ELEMENT.py │ │ │ ├── NTH_EVEN_LENGTH_PALINDROME.py │ │ │ ├── NTH_MULTIPLE_NUMBER_FIBONACCI_SERIES.py │ │ │ ├── NTH_NON_FIBONACCI_NUMBER.py │ │ │ ├── NTH_PENTAGONAL_NUMBER.py │ │ │ ├── NUMBER_DAYS_TANK_WILL_BECOME_EMPTY.py │ │ │ ├── NUMBER_DIGITS_PRODUCT_TWO_NUMBERS.py │ │ │ ├── NUMBER_DIGITS_PRODUCT_TWO_NUMBERS_1.py │ │ │ ├── NUMBER_INDEXES_EQUAL_ELEMENTS_GIVEN_RANGE.py │ │ │ ├── NUMBER_IS_DIVISIBLE_BY_29_OR_NOT.py │ │ │ ├── NUMBER_JUMP_REQUIRED_GIVEN_LENGTH_REACH_POINT_FORM_D_0_ORIGIN_2D_PLANE.py │ │ │ ├── NUMBER_NON_NEGATIVE_INTEGRAL_SOLUTIONS_B_C_N.py │ │ │ ├── NUMBER_NON_NEGATIVE_INTEGRAL_SOLUTIONS_B_C_N_1.py │ │ │ ├── NUMBER_N_DIGIT_STEPPING_NUMBERS.py │ │ │ ├── NUMBER_OF_BINARY_TREES_FOR_GIVEN_PREORDER_SEQUENCE_LENGTH.py │ │ │ ├── NUMBER_OF_PAIRS_IN_AN_ARRAY_HAVING_SUM_EQUAL_TO_PRODUCT.py │ │ │ ├── NUMBER_OF_SUBSTRINGS_WITH_ODD_DECIMAL_VALUE_IN_A_BINARY_STRING.py │ │ │ ├── NUMBER_OF_TRIANGLES_IN_A_PLANE_IF_NO_MORE_THAN_TWO_POINTS_ARE_COLLINEAR.py │ │ │ ├── NUMBER_ORDERED_PAIRS_AI_AJ_0.py │ │ │ ├── NUMBER_RECTANGLES_NM_GRID.py │ │ │ ├── NUMBER_SUBSEQUENCES_AB_STRING_REPEATED_K_TIMES.py │ │ │ ├── NUMBER_SUBSEQUENCES_FORM_AI_BJ_CK.py │ │ │ ├── NUMBER_SUBSTRINGS_DIVISIBLE_4_STRING_INTEGERS.py │ │ │ ├── NUMBER_SUBSTRINGS_STRING.py │ │ │ ├── NUMBER_TRIANGLES_N_MOVES.py │ │ │ ├── NUMBER_TRIANGLES_N_MOVES_1.py │ │ │ ├── NUMBER_UNIQUE_RECTANGLES_FORMED_USING_N_UNIT_SQUARES.py │ │ │ ├── NUMBER_VISIBLE_BOXES_PUTTING_ONE_INSIDE_ANOTHER.py │ │ │ ├── NUMBER_WAYS_NODE_MAKE_LOOP_SIZE_K_UNDIRECTED_COMPLETE_CONNECTED_GRAPH_N_NODES.py │ │ │ ├── N_TH_NUMBER_WHOSE_SUM_OF_DIGITS_IS_TEN.py │ │ │ ├── N_TH_NUMBER_WHOSE_SUM_OF_DIGITS_IS_TEN_1.py │ │ │ ├── N_TH_NUMBER_WHOSE_SUM_OF_DIGITS_IS_TEN_2.py │ │ │ ├── N_TH_TERM_SERIES_2_12_36_80_150.py │ │ │ ├── ODD_EVEN_SORT_BRICK_SORT.py │ │ │ ├── ONE_LINE_FUNCTION_FOR_FACTORIAL_OF_A_NUMBER.py │ │ │ ├── PADOVAN_SEQUENCE.py │ │ │ ├── PAINTING_FENCE_ALGORITHM.py │ │ │ ├── PAIR_WITH_GIVEN_PRODUCT_SET_1_FIND_IF_ANY_PAIR_EXISTS.py │ │ │ ├── PAIR_WITH_GIVEN_PRODUCT_SET_1_FIND_IF_ANY_PAIR_EXISTS_1.py │ │ │ ├── PAPER_CUT_MINIMUM_NUMBER_SQUARES.py │ │ │ ├── PATH_MAXIMUM_AVERAGE_VALUE.py │ │ │ ├── PERFECT_REVERSIBLE_STRING.py │ │ │ ├── PERMUTE_TWO_ARRAYS_SUM_EVERY_PAIR_GREATER_EQUAL_K.py │ │ │ ├── PIZZA_CUT_PROBLEM_CIRCLE_DIVISION_LINES.py │ │ │ ├── POINT_CLIPPING_ALGORITHM_COMPUTER_GRAPHICS.py │ │ │ ├── POLICEMEN_CATCH_THIEVES.py │ │ │ ├── POSITION_ELEMENT_STABLE_SORT.py │ │ │ ├── POSITION_OF_RIGHTMOST_SET_BIT.py │ │ │ ├── POSITION_OF_RIGHTMOST_SET_BIT_1.py │ │ │ ├── POSITIVE_ELEMENTS_EVEN_NEGATIVE_ODD_POSITIONS.py │ │ │ ├── POSSIBLE_FORM_TRIANGLE_ARRAY_VALUES.py │ │ │ ├── POSSIBLE_TO_MAKE_A_DIVISIBLE_BY_3_NUMBER_USING_ALL_DIGITS_IN_AN_ARRAY.py │ │ │ ├── PRIMALITY_TEST_SET_1_INTRODUCTION_AND_SCHOOL_METHOD.py │ │ │ ├── PRIMALITY_TEST_SET_1_INTRODUCTION_AND_SCHOOL_METHOD_1.py │ │ │ ├── PRIMALITY_TEST_SET_5USING_LUCAS_LEHMER_SERIES.py │ │ │ ├── PRIME_NUMBERS.py │ │ │ ├── PRINT_GIVEN_MATRIX_COUNTER_CLOCK_WISE_SPIRAL_FORM.py │ │ │ ├── PRINT_MATRIX_ANTISPIRAL_FORM.py │ │ │ ├── PRINT_MATRIX_SPIRAL_FORM_STARTING_POINT.py │ │ │ ├── PRINT_MAXIMUM_SHORTEST_DISTANCE.py │ │ │ ├── PRINT_WORDS_STRING_REVERSE_ORDER.py │ │ │ ├── PROBABILITY_THREE_RANDOMLY_CHOSEN_NUMBERS_AP.py │ │ │ ├── PRODUCT_NODES_K_TH_LEVEL_TREE_REPRESENTED_STRING.py │ │ │ ├── PROGRAM_AREA_SQUARE.py │ │ │ ├── PROGRAM_BEST_FIT_ALGORITHM_MEMORY_MANAGEMENT.py │ │ │ ├── PROGRAM_BINARY_DECIMAL_CONVERSION.py │ │ │ ├── PROGRAM_BINARY_DECIMAL_CONVERSION_1.py │ │ │ ├── PROGRAM_CALCULATE_AREA_OCTAGON.py │ │ │ ├── PROGRAM_CALCULATE_VOLUME_ELLIPSOID.py │ │ │ ├── PROGRAM_CALCULATE_VOLUME_OCTAHEDRON.py │ │ │ ├── PROGRAM_CENSOR_WORD_ASTERISKS_SENTENCE.py │ │ │ ├── PROGRAM_CHECK_ARRAY_SORTED_NOT_ITERATIVE_RECURSIVE_1.py │ │ │ ├── PROGRAM_CHECK_INPUT_INTEGER_STRING.py │ │ │ ├── PROGRAM_CHECK_PLUS_PERFECT_NUMBER.py │ │ │ ├── PROGRAM_CIRCUMFERENCE_PARALLELOGRAM.py │ │ │ ├── PROGRAM_COUNT_OCCURRENCE_GIVEN_CHARACTER_STRING.py │ │ │ ├── PROGRAM_DECIMAL_BINARY_CONVERSION_2.py │ │ │ ├── PROGRAM_FIND_SLOPE_LINE.py │ │ │ ├── PROGRAM_FIND_SMALLEST_DIFFERENCE_ANGLES_TWO_PARTS_GIVEN_CIRCLE.py │ │ │ ├── PROGRAM_FIND_STRING_START_END_GEEKS.py │ │ │ ├── PROGRAM_FOR_DEADLOCK_FREE_CONDITION_IN_OPERATING_SYSTEM.py │ │ │ ├── PROGRAM_FOR_FACTORIAL_OF_A_NUMBER.py │ │ │ ├── PROGRAM_FOR_FACTORIAL_OF_A_NUMBER_1.py │ │ │ ├── PROGRAM_FOR_FACTORIAL_OF_A_NUMBER_2.py │ │ │ ├── PROGRAM_FOR_SURFACE_AREA_OF_OCTAHEDRON.py │ │ │ ├── PROGRAM_OCTAL_DECIMAL_CONVERSION.py │ │ │ ├── PROGRAM_PAGE_REPLACEMENT_ALGORITHMS_SET_2_FIFO.py │ │ │ ├── PROGRAM_PRINT_IDENTITY_MATRIX_1.py │ │ │ ├── PROGRAM_PRINT_SUM_GIVEN_NTH_TERM.py │ │ │ ├── PROGRAM_PRINT_SUM_GIVEN_NTH_TERM_1.py │ │ │ ├── PROGRAM_REVERSE_STRING_ITERATIVE_RECURSIVE.py │ │ │ ├── PROGRAM_TO_CHECK_IF_A_GIVEN_NUMBER_IS_LUCKY_ALL_DIGITS_ARE_DIFFERENT.py │ │ │ ├── PROGRAM_TO_CHECK_IF_A_MATRIX_IS_SYMMETRIC.py │ │ │ ├── PROGRAM_TO_FIND_REMAINDER_WITHOUT_USING_MODULO_OR_OPERATOR.py │ │ │ ├── PROGRAM_TO_FIND_REMAINDER_WITHOUT_USING_MODULO_OR_OPERATOR_1.py │ │ │ ├── PROGRAM_TO_FIND_REMAINDER_WITHOUT_USING_MODULO_OR_OPERATOR_2.py │ │ │ ├── PROGRAM_TO_FIND_THE_AREA_OF_PENTAGON.py │ │ │ ├── PROGRAM_TO_FIND_THE_VOLUME_OF_A_TRIANGULAR_PRISM.py │ │ │ ├── PROGRAM_WORST_FIT_ALGORITHM_MEMORY_MANAGEMENT.py │ │ │ ├── PYTHAGOREAN_QUADRUPLE.py │ │ │ ├── PYTHON_PROGRAM_FIND_PERIMETER_CIRCUMFERENCE_SQUARE_RECTANGLE.py │ │ │ ├── PYTHON_PROGRAM_FIND_PERIMETER_CIRCUMFERENCE_SQUARE_RECTANGLE_1.py │ │ │ ├── QUERIES_COUNTS_ARRAY_ELEMENTS_VALUES_GIVEN_RANGE.py │ │ │ ├── QUICK_WAY_CHECK_CHARACTERS_STRING.py │ │ │ ├── REARRANGE_ARRAY_MAXIMUM_MINIMUM_FORM.py │ │ │ ├── REARRANGE_ARRAY_MAXIMUM_MINIMUM_FORM_SET_2_O1_EXTRA_SPACE.py │ │ │ ├── REARRANGE_ARRAY_MAXIMUM_MINIMUM_FORM_SET_2_O1_EXTRA_SPACE_1.py │ │ │ ├── REARRANGE_POSITIVE_AND_NEGATIVE_NUMBERS_PUBLISH.py │ │ │ ├── RECURSIVELY_BREAK_NUMBER_3_PARTS_GET_MAXIMUM_SUM.py │ │ │ ├── RECURSIVELY_BREAK_NUMBER_3_PARTS_GET_MAXIMUM_SUM_1.py │ │ │ ├── RECURSIVE_C_PROGRAM_LINEARLY_SEARCH_ELEMENT_GIVEN_ARRAY.py │ │ │ ├── RECURSIVE_INSERTION_SORT.py │ │ │ ├── REMAINDER_7_LARGE_NUMBERS.py │ │ │ ├── REMOVE_ARRAY_END_ELEMENT_MAXIMIZE_SUM_PRODUCT.py │ │ │ ├── REMOVE_BRACKETS_ALGEBRAIC_STRING_CONTAINING_OPERATORS.py │ │ │ ├── REMOVE_CONSECUTIVE_DUPLICATES_STRING.py │ │ │ ├── REMOVE_MINIMUM_ELEMENTS_EITHER_SIDE_2MIN_MAX.py │ │ │ ├── REMOVE_MINIMUM_NUMBER_ELEMENTS_NO_COMMON_ELEMENT_EXIST_ARRAY.py │ │ │ ├── REPLACE_CHARACTER_C1_C2_C2_C1_STRING_S.py │ │ │ ├── REPLACE_OCCURRENCES_STRING_AB_C_WITHOUT_USING_EXTRA_SPACE.py │ │ │ ├── ROUND_THE_GIVEN_NUMBER_TO_NEAREST_MULTIPLE_OF_10.py │ │ │ ├── ROW_WISE_COMMON_ELEMENTS_TWO_DIAGONALS_SQUARE_MATRIX.py │ │ │ ├── SCHEDULE_JOBS_SERVER_GETS_EQUAL_LOAD.py │ │ │ ├── SEARCHING_ARRAY_ADJACENT_DIFFER_K.py │ │ │ ├── SEARCH_ALMOST_SORTED_ARRAY.py │ │ │ ├── SEARCH_AN_ELEMENT_IN_AN_ARRAY_WHERE_DIFFERENCE_BETWEEN_ADJACENT_ELEMENTS_IS_1.py │ │ │ ├── SEARCH_AN_ELEMENT_IN_A_SORTED_AND_PIVOTED_ARRAY.py │ │ │ ├── SEARCH_INSERT_AND_DELETE_IN_AN_UNSORTED_ARRAY.py │ │ │ ├── SEARCH_INSERT_AND_DELETE_IN_A_SORTED_ARRAY.py │ │ │ ├── SEARCH_INSERT_AND_DELETE_IN_A_SORTED_ARRAY_1.py │ │ │ ├── SEARCH_IN_ROW_WISE_AND_COLUMN_WISE_SORTED_MATRIX.py │ │ │ ├── SEGREGATE_EVEN_ODD_NUMBERS_SET_3.py │ │ │ ├── SELECT_A_RANDOM_NUMBER_FROM_STREAM_WITH_O1_SPACE.py │ │ │ ├── SEQUENCES_GIVEN_LENGTH_EVERY_ELEMENT_EQUAL_TWICE_PREVIOUS.py │ │ │ ├── SEQUENCES_GIVEN_LENGTH_EVERY_ELEMENT_EQUAL_TWICE_PREVIOUS_1.py │ │ │ ├── SHUFFLE_A_GIVEN_ARRAY.py │ │ │ ├── SMALLEST_DIFFERENCE_PAIR_VALUES_TWO_UNSORTED_ARRAYS.py │ │ │ ├── SMALLEST_OF_THREE_INTEGERS_WITHOUT_COMPARISON_OPERATORS.py │ │ │ ├── SMALLEST_OF_THREE_INTEGERS_WITHOUT_COMPARISON_OPERATORS_1.py │ │ │ ├── SMALLEST_POWER_OF_2_GREATER_THAN_OR_EQUAL_TO_N.py │ │ │ ├── SMALLEST_POWER_OF_2_GREATER_THAN_OR_EQUAL_TO_N_1.py │ │ │ ├── SMALLEST_POWER_OF_2_GREATER_THAN_OR_EQUAL_TO_N_2.py │ │ │ ├── SMALLEST_SUM_CONTIGUOUS_SUBARRAY.py │ │ │ ├── SORT_AN_ARRAY_OF_0S_1S_AND_2S.py │ │ │ ├── SORT_ARRAY_APPLYING_GIVEN_EQUATION.py │ │ │ ├── SORT_ARRAY_CONTAIN_1_N_VALUES.py │ │ │ ├── SORT_ARRAY_TWO_HALVES_SORTED.py │ │ │ ├── SORT_ARRAY_WAVE_FORM_2.py │ │ │ ├── SORT_ARRAY_WAVE_FORM_2_1.py │ │ │ ├── SORT_EVEN_NUMBERS_ASCENDING_ORDER_SORT_ODD_NUMBERS_DESCENDING_ORDER_1.py │ │ │ ├── SORT_EVEN_PLACED_ELEMENTS_INCREASING_ODD_PLACED_DECREASING_ORDER.py │ │ │ ├── SPACE_OPTIMIZED_SOLUTION_LCS.py │ │ │ ├── SPLIT_ARRAY_ADD_FIRST_PART_END.py │ │ │ ├── SPLIT_N_MAXIMUM_COMPOSITE_NUMBERS.py │ │ │ ├── SQUARED_TRIANGULAR_NUMBER_SUM_CUBES.py │ │ │ ├── SQUARES_OF_MATRIX_DIAGONAL_ELEMENTS.py │ │ │ ├── SQUARE_PYRAMIDAL_NUMBER_SUM_SQUARES.py │ │ │ ├── SQUARE_ROOT_OF_AN_INTEGER.py │ │ │ ├── SQUARE_ROOT_OF_AN_INTEGER_1.py │ │ │ ├── SQUARE_ROOT_OF_A_PERFECT_SQUARE.py │ │ │ ├── STACK_PERMUTATIONS_CHECK_IF_AN_ARRAY_IS_STACK_PERMUTATION_OF_OTHER.py │ │ │ ├── STACK_SET_3_REVERSE_STRING_USING_STACK.py │ │ │ ├── STEINS_ALGORITHM_FOR_FINDING_GCD.py │ │ │ ├── STEINS_ALGORITHM_FOR_FINDING_GCD_1.py │ │ │ ├── STOOGE_SORT.py │ │ │ ├── STRING_CONTAINING_FIRST_LETTER_EVERY_WORD_GIVEN_STRING_SPACES.py │ │ │ ├── STRING_K_DISTINCT_CHARACTERS_NO_CHARACTERS_ADJACENT.py │ │ │ ├── SUBARRAYS_DISTINCT_ELEMENTS.py │ │ │ ├── SUBSEQUENCES_SIZE_THREE_ARRAY_WHOSE_SUM_DIVISIBLE_M.py │ │ │ ├── SUBSEQUENCES_SIZE_THREE_ARRAY_WHOSE_SUM_DIVISIBLE_M_1.py │ │ │ ├── SUBSET_SUM_DIVISIBLE_M.py │ │ │ ├── SUM_BINOMIAL_COEFFICIENTS.py │ │ │ ├── SUM_BINOMIAL_COEFFICIENTS_1.py │ │ │ ├── SUM_DIVISORS_1_N_1.py │ │ │ ├── SUM_FACTORS_NUMBER.py │ │ │ ├── SUM_FAI_AJ_PAIRS_ARRAY_N_INTEGERS.py │ │ │ ├── SUM_FIBONACCI_NUMBERS.py │ │ │ ├── SUM_K_TH_GROUP_ODD_POSITIVE_NUMBERS.py │ │ │ ├── SUM_K_TH_GROUP_ODD_POSITIVE_NUMBERS_1.py │ │ │ ├── SUM_LARGEST_PRIME_FACTOR_NUMBER_LESS_EQUAL_N.py │ │ │ ├── SUM_MANHATTAN_DISTANCES_PAIRS_POINTS.py │ │ │ ├── SUM_MATRIX_ELEMENT_ABSOLUTE_DIFFERENCE_ROW_COLUMN_NUMBERS.py │ │ │ ├── SUM_MATRIX_ELEMENT_ABSOLUTE_DIFFERENCE_ROW_COLUMN_NUMBERS_1.py │ │ │ ├── SUM_MATRIX_ELEMENT_ABSOLUTE_DIFFERENCE_ROW_COLUMN_NUMBERS_2.py │ │ │ ├── SUM_MATRIX_ELEMENT_ELEMENT_INTEGER_DIVISION_ROW_COLUMN.py │ │ │ ├── SUM_MATRIX_ELEMENT_ELEMENT_INTEGER_DIVISION_ROW_COLUMN_1.py │ │ │ ├── SUM_MIDDLE_ROW_COLUMN_MATRIX.py │ │ │ ├── SUM_NODES_K_TH_LEVEL_TREE_REPRESENTED_STRING.py │ │ │ ├── SUM_OF_ALL_ELEMENTS_UP_TO_NTH_ROW_IN_A_PASCALS_TRIANGLE.py │ │ │ ├── SUM_OF_ALL_ELEMENTS_UP_TO_NTH_ROW_IN_A_PASCALS_TRIANGLE_1.py │ │ │ ├── SUM_OF_ALL_PROPER_DIVISORS_OF_A_NATURAL_NUMBER.py │ │ │ ├── SUM_PAIRWISE_PRODUCTS.py │ │ │ ├── SUM_PAIRWISE_PRODUCTS_1.py │ │ │ ├── SUM_PAIRWISE_PRODUCTS_2.py │ │ │ ├── SUM_SEQUENCE_2_22_222.py │ │ │ ├── SUM_SERIES_0_6_0_06_0_006_0_0006_N_TERMS.py │ │ │ ├── SUM_SERIES_12_32_52_2N_12.py │ │ │ ├── SUM_SERIES_12_32_52_2N_12_1.py │ │ │ ├── SUM_SERIES_23_45_67_89_UPTO_N_TERMS.py │ │ │ ├── SUM_SERIES_555555_N_TERMS.py │ │ │ ├── SUM_SQUARES_BINOMIAL_COEFFICIENTS.py │ │ │ ├── SUM_SUBSETS_SET_FORMED_FIRST_N_NATURAL_NUMBERS.py │ │ │ ├── SUM_TWO_LARGE_NUMBERS.py │ │ │ ├── SWAP_ALL_ODD_AND_EVEN_BITS.py │ │ │ ├── SWAP_BITS_IN_A_GIVEN_NUMBER.py │ │ │ ├── SWAP_TWO_NIBBLES_BYTE.py │ │ │ ├── SWAP_TWO_NUMBERS_WITHOUT_USING_TEMPORARY_VARIABLE.py │ │ │ ├── TAIL_RECURSION.py │ │ │ ├── TAIL_RECURSION_FIBONACCI.py │ │ │ ├── TEMPLE_OFFERINGS.py │ │ │ ├── THIRD_LARGEST_ELEMENT_ARRAY_DISTINCT_ELEMENTS.py │ │ │ ├── THIRD_LARGEST_ELEMENT_ARRAY_DISTINCT_ELEMENTS_1.py │ │ │ ├── TILING_WITH_DOMINOES.py │ │ │ ├── TOTAL_NUMBER_OF_NON_DECREASING_NUMBERS_WITH_N_DIGITS.py │ │ │ ├── TOTAL_NUMBER_OF_NON_DECREASING_NUMBERS_WITH_N_DIGITS_1.py │ │ │ ├── TRIANGULAR_MATCHSTICK_NUMBER.py │ │ │ ├── TRIANGULAR_NUMBERS.py │ │ │ ├── TRIANGULAR_NUMBERS_1.py │ │ │ ├── TURN_OFF_THE_RIGHTMOST_SET_BIT.py │ │ │ ├── UGLY_NUMBERS.py │ │ │ ├── UNIQUE_CELLS_BINARY_MATRIX.py │ │ │ ├── WAYS_REMOVE_ONE_ELEMENT_BINARY_STRING_XOR_BECOMES_ZERO.py │ │ │ ├── WAYS_TRANSFORMING_ONE_STRING_REMOVING_0_CHARACTERS.py │ │ │ ├── WILDCARD_CHARACTER_MATCHING.py │ │ │ ├── WRITE_AN_EFFICIENT_METHOD_TO_CHECK_IF_A_NUMBER_IS_MULTIPLE_OF_3.py │ │ │ ├── WRITE_A_C_PROGRAM_TO_CALCULATE_POWXN.py │ │ │ ├── WRITE_A_C_PROGRAM_TO_CALCULATE_POWXN_1.py │ │ │ ├── WRITE_A_C_PROGRAM_TO_FIND_THE_PARITY_OF_AN_UNSIGNED_INTEGER.py │ │ │ ├── WRITE_ONE_LINE_C_FUNCTION_TO_FIND_WHETHER_A_NO_IS_POWER_OF_TWO.py │ │ │ ├── WRITE_ONE_LINE_C_FUNCTION_TO_FIND_WHETHER_A_NO_IS_POWER_OF_TWO_1.py │ │ │ ├── WRITE_YOU_OWN_POWER_WITHOUT_USING_MULTIPLICATION_AND_DIVISION.py │ │ │ └── ZECKENDORFS_THEOREM_NON_NEIGHBOURING_FIBONACCI_REPRESENTATION.py │ └── test_dataset │ │ ├── cpp │ │ ├── cpp.000.json.gz │ │ └── cpp.001.json.gz │ │ ├── java │ │ ├── java.000.json.gz │ │ └── java.001.json.gz │ │ └── python │ │ ├── python.000.json.gz │ │ └── python.001.json.gz │ ├── input_code.cpp │ ├── preprocessing │ ├── __init__.py │ ├── __pycache__ │ │ └── __init__.cpython-37.pyc │ ├── detokenize.py │ ├── preprocess.py │ ├── src │ │ ├── __init__.py │ │ ├── __pycache__ │ │ │ ├── __init__.cpython-37.pyc │ │ │ ├── code_tokenizer.cpython-37.pyc │ │ │ ├── javalang_tokenizer.cpython-37.pyc │ │ │ └── timeout.cpython-37.pyc │ │ ├── code_tokenizer.py │ │ ├── dataset.py │ │ ├── javalang_tokenizer.py │ │ ├── test_tokenize_cpp.py │ │ ├── test_tokenize_java.py │ │ ├── test_tokenize_python.py │ │ ├── timeout.py │ │ └── utils.py │ └── test_preprocess.py │ ├── sc_run_translate.sh │ └── translate.py └── tree_transformer ├── .gitignore ├── heatmap ├── __init__.py ├── heatmap_utils.py └── sequence_scorer.py ├── parse_nmt.py ├── preprocess_code_nstack2seq_merge.py ├── preprocess_nstack2seq_merge.py ├── runs ├── get_last_checkpoint.py ├── infer_code_model.sh ├── infer_model.sh ├── run_code_nstack_nmt.sh ├── run_code_nstack_nmt_infer.sh ├── run_nstack_nmt.sh ├── sc_code_infer.sh ├── sc_code_train.sh ├── train_classification.py ├── train_code_fairseq.sh ├── train_fairseq.sh ├── treetfm_train.py ├── tt_code_infer.sh └── tt_code_train.sh ├── scripts ├── __init__.py ├── average_checkpoints.py ├── build_sym_alignment.py ├── compound_split_bleu.sh ├── convert_dictionary.lua ├── convert_imdb.py ├── convert_model.lua ├── read_binarized.py └── sacrebleu_pregen.sh └── src ├── __init__.py ├── binarization.py ├── bpe ├── __init__.py └── bpe_utils.py ├── criterions ├── __init__.py ├── classification_cross_entropy.py └── masked_lm_loss.py ├── data ├── __init__.py ├── dptree2seq_dataset.py ├── dptree2seq_sep_dataset.py ├── dptree_dictionary.py ├── dptree_index_dataset.py ├── dptree_mono_class_dataset.py ├── dptree_sep_mono_class_dataset.py ├── monolingual_classification_dataset.py ├── nstack2seq_dataset.py ├── nstack_merge_monoclass_dataset.py ├── nstack_mono_class_dataset.py ├── task_utils.py └── transforms │ ├── __init__.py │ ├── gpt2_bpe.py │ ├── moses_tokenizer.py │ ├── nltk_tokenizer.py │ ├── sentencepiece_bpe.py │ ├── space_tokenizer.py │ └── subword_nmt_bpe.py ├── dptree ├── __init__.py ├── nstack_process.py ├── tree_builder.py └── tree_process.py ├── dptree2seq_generator.py ├── dptree_tokenizer.py ├── heatmap ├── __init__.py ├── heatmap_utils.py └── sequence_scorer.py ├── models ├── __init__.py ├── dptree2seg_transformer.py ├── nstack_archs.py └── nstack_transformer.py ├── modules ├── __init__.py ├── default_dy_conv.py ├── default_multihead_attention.py ├── dptree_individual_multihead_attention.py ├── dptree_multihead_attention.py ├── dptree_onseq_multihead_attention.py ├── dptree_sep_multihead_attention.py ├── dptree_transformer_layer.py ├── embeddings.py ├── nstack_merge_tree_attention.py ├── nstack_transformer_layers.py ├── nstack_tree_attention.py └── nstack_tree_attention_eff.py ├── nstack2seq_generator.py ├── nstack_tokenizer.py ├── optim ├── __init__.py └── lr_scheduler │ ├── __init__.py │ └── flex_inv_sqrt_schedule.py ├── tasks ├── __init__.py ├── dptree2seq_sep_translation.py ├── dptree2seq_translation.py ├── dptree_classification.py ├── dptree_sep_classification.py ├── fairseq_classification.py ├── nstack2seq_translation.py ├── nstack_classification.py └── nstack_from_dptree_classification.py ├── trainers └── __init__.py └── utils.py /.gitignore: -------------------------------------------------------------------------------- 1 | python150k/*tar* 2 | python150k/*txt 3 | python150k/data/ 4 | python150k/data/* 5 | .vscode 6 | .vscode/* 7 | transcoder/model_cpp_python.pth 8 | python150k/sc* 9 | tree_transformer_info/* 10 | raw_code_data/* 11 | code_data_fairseq/* 12 | tree_transformer/__pycache__ 13 | train_tree_transformer/* 14 | notebooks/.ipynb_checkpoints 15 | notebooks/__pycache__ 16 | notebooks/new_files 17 | python150k/process_data_nadya.py 18 | 19 | 20 | # Test data 21 | python150k/examples/ 22 | python150k/examples/* 23 | notebooks/0xcite/fingerping/ 24 | notebooks/0xcite/fingerping/* 25 | notebooks/varmisuse_example.ipynb 26 | -------------------------------------------------------------------------------- /README.md: -------------------------------------------------------------------------------- 1 | # Source Code Summarization 2 | 3 | Currently observed approaches: 4 | 5 | | Method | Source | Paper | 6 | | :---: | :---: | :---: | 7 | | Neural Code Sum | [repo](https://github.com/wasiahmad/NeuralCodeSum) | [arxiv](https://arxiv.org/abs/2005.00653) | 8 | | Tree Transformer | [repo](https://github.com/nxphi47/tree_transformer) | [openreview](https://openreview.net/forum?id=HJxK5pEYvr) | 9 | | TransCoder | [repo](https://github.com/facebookresearch/TransCoder) | [arxiv](https://arxiv.org/abs/2006.03511) | 10 | 11 | Environment setup: 12 | ``` 13 | conda create -n scs python=3.7 14 | conda activate scs 15 | pip install -r requirements.txt 16 | ``` 17 | Install linter with: 18 | ``` 19 | pip install flake8 20 | ``` 21 | To run formatter execute from the source folder: 22 | ``` 23 | bash scripts/yapf.sh 24 | ``` 25 | -------------------------------------------------------------------------------- /neural_code_sum/c2nl.egg-info/dependency_links.txt: -------------------------------------------------------------------------------- 1 | 2 | -------------------------------------------------------------------------------- /neural_code_sum/c2nl.egg-info/requires.txt: -------------------------------------------------------------------------------- 1 | numpy 2 | tqdm 3 | nltk 4 | prettytable 5 | torch>=1.3.0 6 | -------------------------------------------------------------------------------- /neural_code_sum/c2nl.egg-info/top_level.txt: -------------------------------------------------------------------------------- 1 | c2nl 2 | main 3 | -------------------------------------------------------------------------------- /neural_code_sum/c2nl/__init__.py: -------------------------------------------------------------------------------- 1 | __author__ = 'wasi' 2 | -------------------------------------------------------------------------------- /neural_code_sum/c2nl/decoders/__init__.py: -------------------------------------------------------------------------------- 1 | __author__ = 'wasi' 2 | 3 | from .decoder import * 4 | from .rnn_decoder import * 5 | from .state import * 6 | from .transformer import * 7 | -------------------------------------------------------------------------------- /neural_code_sum/c2nl/encoders/__init__.py: -------------------------------------------------------------------------------- 1 | __author__ = 'wasi' 2 | 3 | from .encoder import * 4 | from .rnn_encoder import * 5 | from .transformer import * 6 | -------------------------------------------------------------------------------- /neural_code_sum/c2nl/eval/__init__.py: -------------------------------------------------------------------------------- 1 | __author__ = 'wasi' 2 | 3 | from . import bleu 4 | from . import rouge 5 | from . import meteor 6 | -------------------------------------------------------------------------------- /neural_code_sum/c2nl/eval/bleu/__init__.py: -------------------------------------------------------------------------------- 1 | __author__ = 'wasi' 2 | 3 | from .bleu import * 4 | from .bleu_scorer import * 5 | from .nltk_bleu import * 6 | from .google_bleu import * 7 | -------------------------------------------------------------------------------- /neural_code_sum/c2nl/eval/meteor/__init__.py: -------------------------------------------------------------------------------- 1 | __author__ = 'wasi' 2 | 3 | from .meteor import * 4 | -------------------------------------------------------------------------------- /neural_code_sum/c2nl/eval/meteor/data/paraphrase-en.gz: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/martysai/source-code-summarization/bea10372904f2e66850925f7a3cfda3aabc5ce62/neural_code_sum/c2nl/eval/meteor/data/paraphrase-en.gz -------------------------------------------------------------------------------- /neural_code_sum/c2nl/eval/meteor/meteor-1.5.jar: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/martysai/source-code-summarization/bea10372904f2e66850925f7a3cfda3aabc5ce62/neural_code_sum/c2nl/eval/meteor/meteor-1.5.jar -------------------------------------------------------------------------------- /neural_code_sum/c2nl/eval/rouge/__init__.py: -------------------------------------------------------------------------------- 1 | __author__ = 'wasi' 2 | 3 | from .rouge import * 4 | -------------------------------------------------------------------------------- /neural_code_sum/c2nl/inputters/__init__.py: -------------------------------------------------------------------------------- 1 | __author__ = 'wasi' 2 | 3 | from .dataset import * 4 | from .vector import * 5 | from .utils import * 6 | from .constants import * 7 | from .vocabulary import * 8 | -------------------------------------------------------------------------------- /neural_code_sum/c2nl/inputters/constants.py: -------------------------------------------------------------------------------- 1 | PAD = 1 2 | UNK = 0 3 | BOS = 2 4 | EOS = 3 5 | 6 | PAD_WORD = '' 7 | UNK_WORD = '' 8 | BOS_WORD = '' 9 | EOS_WORD = '' 10 | 11 | TOKEN_TYPE_MAP = { 12 | # Java 13 | '': 0, 14 | '': 1, 15 | 'other': 2, 16 | 'var': 3, 17 | 'method': 4, 18 | # Python 19 | 's': 5, 20 | 'None': 6, 21 | 'value': 7, 22 | 'asname': 8, 23 | 'n': 9, 24 | 'level': 10, 25 | 'is_async': 11, 26 | 'arg': 12, 27 | 'attr': 13, 28 | 'id': 14, 29 | 'name': 15, 30 | 'module': 16 31 | } 32 | 33 | AST_TYPE_MAP = { 34 | '': 0, 35 | 'N': 1, 36 | 'T': 2 37 | } 38 | 39 | DATA_LANG_MAP = { 40 | 'java': 'java', 41 | 'python': 'python' 42 | } 43 | 44 | LANG_ID_MAP = { 45 | 'java': 0, 46 | 'python': 1, 47 | 'c#': 2 48 | } 49 | -------------------------------------------------------------------------------- /neural_code_sum/c2nl/models/__init__.py: -------------------------------------------------------------------------------- 1 | __author__ = 'wasi' 2 | 3 | from .seq2seq import * 4 | from .transformer import * 5 | -------------------------------------------------------------------------------- /neural_code_sum/c2nl/modules/__init__.py: -------------------------------------------------------------------------------- 1 | __author__ = 'wasi' 2 | 3 | from .char_embedding import * 4 | from .copy_generator import * 5 | from .embeddings import * 6 | from .global_attention import * 7 | from .highway import * 8 | from .multi_head_attn import * 9 | from .position_ffn import * 10 | from .util_class import * 11 | -------------------------------------------------------------------------------- /neural_code_sum/c2nl/objects/__init__.py: -------------------------------------------------------------------------------- 1 | __author__ = 'wasi' 2 | 3 | from .summary import * 4 | from .code import * 5 | -------------------------------------------------------------------------------- /neural_code_sum/c2nl/tokenizers/__init__.py: -------------------------------------------------------------------------------- 1 | __author__ = 'wasi' 2 | 3 | from .tokenizer import * 4 | from .code_tokenizer import * 5 | from .simple_tokenizer import * 6 | -------------------------------------------------------------------------------- /neural_code_sum/c2nl/translator/__init__.py: -------------------------------------------------------------------------------- 1 | __author__ = 'wasi' 2 | 3 | from .beam import * 4 | from .penalties import * 5 | from .translator import * 6 | from .translation import * 7 | -------------------------------------------------------------------------------- /neural_code_sum/c2nl/utils/__init__.py: -------------------------------------------------------------------------------- 1 | __author__ = 'wasi' 2 | 3 | from .logging import * 4 | from .misc import * 5 | -------------------------------------------------------------------------------- /neural_code_sum/c2nl/utils/logging.py: -------------------------------------------------------------------------------- 1 | # -*- coding: utf-8 -*- 2 | from __future__ import absolute_import 3 | 4 | import logging 5 | 6 | logger = logging.getLogger() 7 | 8 | 9 | def init_logger(log_file=None): 10 | log_format = logging.Formatter("[%(asctime)s %(levelname)s] %(message)s") 11 | logger = logging.getLogger() 12 | logger.setLevel(logging.INFO) 13 | 14 | if log_file and log_file != '': 15 | file_handler = logging.FileHandler(log_file) 16 | file_handler.setFormatter(log_format) 17 | logger.addHandler(file_handler) 18 | 19 | console_handler = logging.StreamHandler() 20 | console_handler.setFormatter(log_format) 21 | logger.addHandler(console_handler) 22 | 23 | return logger 24 | -------------------------------------------------------------------------------- /neural_code_sum/data/java/get_data.sh: -------------------------------------------------------------------------------- 1 | #!/usr/bin/env bash 2 | 3 | echo "Downloading TL-CodeSum dataset" 4 | FILE=java.zip 5 | if [[ -f "$FILE" ]]; then 6 | echo "$FILE exists, skipping download" 7 | else 8 | # https://drive.google.com/open?id=13o4MiELiQoomlly2TCTpbtGee_HdQZxl 9 | fileid="13o4MiELiQoomlly2TCTpbtGee_HdQZxl" 10 | curl -c ./cookie -s -L "https://drive.google.com/uc?export=download&id=${fileid}" > /dev/null 11 | curl -Lb ./cookie "https://drive.google.com/uc?export=download&confirm=`awk '/download/ {print $NF}' ./cookie`&id=${fileid}" -o ${FILE} 12 | rm ./cookie 13 | unzip ${FILE} && rm ${FILE} 14 | fi 15 | 16 | echo "Aggregating statistics of the dataset" 17 | python get_stat.py 18 | -------------------------------------------------------------------------------- /neural_code_sum/data/python/dev.zip: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/martysai/source-code-summarization/bea10372904f2e66850925f7a3cfda3aabc5ce62/neural_code_sum/data/python/dev.zip -------------------------------------------------------------------------------- /neural_code_sum/data/python/get_data.sh: -------------------------------------------------------------------------------- 1 | #!/usr/bin/env bash 2 | 3 | echo "Downloading python-method dataset" 4 | FILE=python.zip 5 | if [[ -f "$FILE" ]]; then 6 | echo "$FILE exists, skipping download" 7 | else 8 | # https://drive.google.com/open?id=1XPE1txk9VI0aOT_TdqbAeI58Q8puKVl2 9 | fileid="1XPE1txk9VI0aOT_TdqbAeI58Q8puKVl2" 10 | curl -c ./cookie -s -L "https://drive.google.com/uc?export=download&id=${fileid}" > /dev/null 11 | curl -Lb ./cookie "https://drive.google.com/uc?export=download&confirm=`awk '/download/ {print $NF}' ./cookie`&id=${fileid}" -o ${FILE} 12 | rm ./cookie 13 | unzip ${FILE} && rm ${FILE} 14 | fi 15 | 16 | echo "Aggregating statistics of the dataset" 17 | python get_stat.py 18 | -------------------------------------------------------------------------------- /neural_code_sum/data/python/test.zip: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/martysai/source-code-summarization/bea10372904f2e66850925f7a3cfda3aabc5ce62/neural_code_sum/data/python/test.zip -------------------------------------------------------------------------------- /neural_code_sum/data/python/train.zip: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/martysai/source-code-summarization/bea10372904f2e66850925f7a3cfda3aabc5ce62/neural_code_sum/data/python/train.zip -------------------------------------------------------------------------------- /neural_code_sum/main/__init__.py: -------------------------------------------------------------------------------- 1 | __author__ = 'wasi' 2 | -------------------------------------------------------------------------------- /neural_code_sum/requirements.txt: -------------------------------------------------------------------------------- 1 | numpy 2 | tqdm 3 | nltk 4 | prettytable 5 | torch>=1.3.0 6 | -------------------------------------------------------------------------------- /neural_code_sum/setup.py: -------------------------------------------------------------------------------- 1 | #!/usr/bin/env python3 2 | # 3 | # This source code is licensed under the license found in the 4 | # LICENSE file in the root directory of this source tree. 5 | 6 | from setuptools import setup, find_packages 7 | 8 | with open('README.md') as f: 9 | readme = f.read() 10 | 11 | with open('LICENSE') as f: 12 | license = f.read() 13 | 14 | with open('requirements.txt') as f: 15 | reqs = f.read() 16 | 17 | setup( 18 | name='c2nl', 19 | version='0.1.0', 20 | description='Code to Natural Language Generation', 21 | long_description=readme, 22 | license=license, 23 | python_requires='>=3.6', 24 | packages=find_packages(exclude=('data')), 25 | install_requires=reqs.strip().split('\n'), 26 | ) 27 | -------------------------------------------------------------------------------- /requirements.txt: -------------------------------------------------------------------------------- 1 | numpy 2 | scipy 3 | pandas 4 | astor 5 | -------------------------------------------------------------------------------- /scripts/run-yapf.sh: -------------------------------------------------------------------------------- 1 | #!/usr/bin/env bash 2 | 3 | while [[ "$#" -gt 0 ]]; do 4 | case $1 in 5 | -i | --in-place) 6 | inplace="--in-place" 7 | shift 8 | ;; 9 | *) 10 | echo "Unknown parameter passed: $1" 11 | exit 1 12 | ;; 13 | esac 14 | shift 15 | done 16 | 17 | yapf \ 18 | --recursive \ 19 | --verbose \ 20 | --exclude="*ipynb" \ 21 | ${inplace:- "--diff"} \ 22 | python150k 23 | -------------------------------------------------------------------------------- /transcoder/README.md: -------------------------------------------------------------------------------- 1 | # TransCoder 2 | 3 | To set up conda environment for this subfolder: 4 | ``` 5 | conda create -n transcoder python=3.7 6 | conda install pytorch torchtext cudatoolkit=10.2 -c pytorch 7 | ``` 8 | 9 | Then installing `fastBPE`: 10 | ``` 11 | cd transcoder/XLM 12 | bash install-tools.sh 13 | ``` 14 | -------------------------------------------------------------------------------- /transcoder/data/.gitignore: -------------------------------------------------------------------------------- 1 | TransCoder_tokenized_test_set_functions 2 | XLM-cpp-java-python-with-comments-functions-sa-cl-split-test 3 | 4 | -------------------------------------------------------------------------------- /transcoder/transcoder/CODE_OF_CONDUCT.md: -------------------------------------------------------------------------------- 1 | # Code of Conduct 2 | 3 | Facebook has adopted a Code of Conduct that we expect project participants to adhere to. 4 | Please read the [full text](https://code.fb.com/codeofconduct/) 5 | so that you can understand what actions will and will not be tolerated. -------------------------------------------------------------------------------- /transcoder/transcoder/CONTRIBUTING.md: -------------------------------------------------------------------------------- 1 | # Contributing to this repo 2 | 3 | ## Pull Requests 4 | 5 | In order to accept your pull request, we need you to submit a CLA. You only need 6 | to do this once to work on any of Facebook's open source projects. 7 | 8 | Complete your CLA here: 9 | 10 | ## Issues 11 | We use GitHub issues to track public bugs. Please ensure your description is 12 | clear and has sufficient instructions to be able to reproduce the issue. 13 | 14 | ## License 15 | By contributing to this repo, you agree that your contributions will be licensed 16 | under the LICENSE file in the root directory of this source tree. -------------------------------------------------------------------------------- /transcoder/transcoder/XLM/src/__init__.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/martysai/source-code-summarization/bea10372904f2e66850925f7a3cfda3aabc5ce62/transcoder/transcoder/XLM/src/__init__.py -------------------------------------------------------------------------------- /transcoder/transcoder/XLM/src/__pycache__/__init__.cpython-37.pyc: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/martysai/source-code-summarization/bea10372904f2e66850925f7a3cfda3aabc5ce62/transcoder/transcoder/XLM/src/__pycache__/__init__.cpython-37.pyc -------------------------------------------------------------------------------- /transcoder/transcoder/XLM/src/__pycache__/logger.cpython-37.pyc: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/martysai/source-code-summarization/bea10372904f2e66850925f7a3cfda3aabc5ce62/transcoder/transcoder/XLM/src/__pycache__/logger.cpython-37.pyc -------------------------------------------------------------------------------- /transcoder/transcoder/XLM/src/__pycache__/utils.cpython-37.pyc: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/martysai/source-code-summarization/bea10372904f2e66850925f7a3cfda3aabc5ce62/transcoder/transcoder/XLM/src/__pycache__/utils.cpython-37.pyc -------------------------------------------------------------------------------- /transcoder/transcoder/XLM/src/data/__init__.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/martysai/source-code-summarization/bea10372904f2e66850925f7a3cfda3aabc5ce62/transcoder/transcoder/XLM/src/data/__init__.py -------------------------------------------------------------------------------- /transcoder/transcoder/XLM/src/data/__pycache__/__init__.cpython-37.pyc: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/martysai/source-code-summarization/bea10372904f2e66850925f7a3cfda3aabc5ce62/transcoder/transcoder/XLM/src/data/__pycache__/__init__.cpython-37.pyc -------------------------------------------------------------------------------- /transcoder/transcoder/XLM/src/data/__pycache__/dictionary.cpython-37.pyc: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/martysai/source-code-summarization/bea10372904f2e66850925f7a3cfda3aabc5ce62/transcoder/transcoder/XLM/src/data/__pycache__/dictionary.cpython-37.pyc -------------------------------------------------------------------------------- /transcoder/transcoder/XLM/src/evaluation/__init__.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/martysai/source-code-summarization/bea10372904f2e66850925f7a3cfda3aabc5ce62/transcoder/transcoder/XLM/src/evaluation/__init__.py -------------------------------------------------------------------------------- /transcoder/transcoder/XLM/src/model/__pycache__/__init__.cpython-37.pyc: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/martysai/source-code-summarization/bea10372904f2e66850925f7a3cfda3aabc5ce62/transcoder/transcoder/XLM/src/model/__pycache__/__init__.cpython-37.pyc -------------------------------------------------------------------------------- /transcoder/transcoder/XLM/src/model/__pycache__/pretrain.cpython-37.pyc: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/martysai/source-code-summarization/bea10372904f2e66850925f7a3cfda3aabc5ce62/transcoder/transcoder/XLM/src/model/__pycache__/pretrain.cpython-37.pyc -------------------------------------------------------------------------------- /transcoder/transcoder/XLM/src/model/__pycache__/transformer.cpython-37.pyc: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/martysai/source-code-summarization/bea10372904f2e66850925f7a3cfda3aabc5ce62/transcoder/transcoder/XLM/src/model/__pycache__/transformer.cpython-37.pyc -------------------------------------------------------------------------------- /transcoder/transcoder/XLM/tools/.sc_api.sh.swp: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/martysai/source-code-summarization/bea10372904f2e66850925f7a3cfda3aabc5ce62/transcoder/transcoder/XLM/tools/.sc_api.sh.swp -------------------------------------------------------------------------------- /transcoder/transcoder/XLM/tools/README.md: -------------------------------------------------------------------------------- 1 | # Tools 2 | 3 | In `TransCoder/XLM/tools/`, you will need to install fastBPE: 4 | ## fastBPE 5 | To get and compile fastBPE: 6 | ``` 7 | git clone https://github.com/glample/fastBPE 8 | cd fastBPE 9 | g++ -std=c++11 -pthread -O3 fastBPE/main.cc -IfastBPE -o fast 10 | ``` 11 | To get the python API (requires Cython) 12 | ``` 13 | python setup.py install 14 | ``` 15 | -------------------------------------------------------------------------------- /transcoder/transcoder/data/evaluation/geeks_for_geeks_successful_test_scripts/cpp/ADD_1_TO_A_GIVEN_NUMBER_1.cpp: -------------------------------------------------------------------------------- 1 | // Copyright (c) 2019-present, Facebook, Inc. 2 | // All rights reserved. 3 | // 4 | // This source code is licensed under the license found in the 5 | // LICENSE file in the root directory of this source tree. 6 | // 7 | 8 | #include 9 | #include 10 | #include 11 | #include 12 | #include 13 | #include 14 | #include 15 | using namespace std; 16 | int f_gold ( int x ) { 17 | return ( - ( ~ x ) ); 18 | } 19 | 20 | 21 | //TOFILL 22 | 23 | int main() { 24 | int n_success = 0; 25 | vector param0 {20,68,52,61,3,88,41,78,94,18}; 26 | for(int i = 0; i < param0.size(); ++i) 27 | { 28 | if(f_filled(param0[i]) == f_gold(param0[i])) 29 | { 30 | n_success+=1; 31 | } 32 | } 33 | cout << "#Results:" << " " << n_success << ", " << param0.size(); 34 | return 0; 35 | } -------------------------------------------------------------------------------- /transcoder/transcoder/data/evaluation/geeks_for_geeks_successful_test_scripts/cpp/AREA_SQUARE_CIRCUMSCRIBED_CIRCLE.cpp: -------------------------------------------------------------------------------- 1 | // Copyright (c) 2019-present, Facebook, Inc. 2 | // All rights reserved. 3 | // 4 | // This source code is licensed under the license found in the 5 | // LICENSE file in the root directory of this source tree. 6 | // 7 | 8 | #include 9 | #include 10 | #include 11 | #include 12 | #include 13 | #include 14 | #include 15 | using namespace std; 16 | int f_gold ( int r ) { 17 | return ( 2 * r * r ); 18 | } 19 | 20 | 21 | //TOFILL 22 | 23 | int main() { 24 | int n_success = 0; 25 | vector param0 {14,78,45,66,18,32,60,16,99,65}; 26 | for(int i = 0; i < param0.size(); ++i) 27 | { 28 | if(f_filled(param0[i]) == f_gold(param0[i])) 29 | { 30 | n_success+=1; 31 | } 32 | } 33 | cout << "#Results:" << " " << n_success << ", " << param0.size(); 34 | return 0; 35 | } -------------------------------------------------------------------------------- /transcoder/transcoder/data/evaluation/geeks_for_geeks_successful_test_scripts/cpp/CASSINIS_IDENTITY.cpp: -------------------------------------------------------------------------------- 1 | // Copyright (c) 2019-present, Facebook, Inc. 2 | // All rights reserved. 3 | // 4 | // This source code is licensed under the license found in the 5 | // LICENSE file in the root directory of this source tree. 6 | // 7 | 8 | #include 9 | #include 10 | #include 11 | #include 12 | #include 13 | #include 14 | #include 15 | using namespace std; 16 | int f_gold ( int n ) { 17 | return ( n & 1 ) ? - 1 : 1; 18 | } 19 | 20 | 21 | //TOFILL 22 | 23 | int main() { 24 | int n_success = 0; 25 | vector param0 {67,2,58,6,42,17,37,44,23,40}; 26 | for(int i = 0; i < param0.size(); ++i) 27 | { 28 | if(f_filled(param0[i]) == f_gold(param0[i])) 29 | { 30 | n_success+=1; 31 | } 32 | } 33 | cout << "#Results:" << " " << n_success << ", " << param0.size(); 34 | return 0; 35 | } -------------------------------------------------------------------------------- /transcoder/transcoder/data/evaluation/geeks_for_geeks_successful_test_scripts/cpp/CHECK_WHETHER_GIVEN_NUMBER_EVEN_ODD.cpp: -------------------------------------------------------------------------------- 1 | // Copyright (c) 2019-present, Facebook, Inc. 2 | // All rights reserved. 3 | // 4 | // This source code is licensed under the license found in the 5 | // LICENSE file in the root directory of this source tree. 6 | // 7 | 8 | #include 9 | #include 10 | #include 11 | #include 12 | #include 13 | #include 14 | #include 15 | using namespace std; 16 | bool f_gold ( int n ) { 17 | return ( n % 2 == 0 ); 18 | } 19 | 20 | 21 | //TOFILL 22 | 23 | int main() { 24 | int n_success = 0; 25 | vector param0 {67,90,55,90,83,32,58,38,87,87}; 26 | for(int i = 0; i < param0.size(); ++i) 27 | { 28 | if(f_filled(param0[i]) == f_gold(param0[i])) 29 | { 30 | n_success+=1; 31 | } 32 | } 33 | cout << "#Results:" << " " << n_success << ", " << param0.size(); 34 | return 0; 35 | } -------------------------------------------------------------------------------- /transcoder/transcoder/data/evaluation/geeks_for_geeks_successful_test_scripts/cpp/CHECK_WHETHER_GIVEN_NUMBER_EVEN_ODD_1.cpp: -------------------------------------------------------------------------------- 1 | // Copyright (c) 2019-present, Facebook, Inc. 2 | // All rights reserved. 3 | // 4 | // This source code is licensed under the license found in the 5 | // LICENSE file in the root directory of this source tree. 6 | // 7 | 8 | #include 9 | #include 10 | #include 11 | #include 12 | #include 13 | #include 14 | #include 15 | using namespace std; 16 | bool f_gold ( int n ) { 17 | return ( ! ( n & 1 ) ); 18 | } 19 | 20 | 21 | //TOFILL 22 | 23 | int main() { 24 | int n_success = 0; 25 | vector param0 {57,73,79,36,71,23,41,66,46,50}; 26 | for(int i = 0; i < param0.size(); ++i) 27 | { 28 | if(f_filled(param0[i]) == f_gold(param0[i])) 29 | { 30 | n_success+=1; 31 | } 32 | } 33 | cout << "#Results:" << " " << n_success << ", " << param0.size(); 34 | return 0; 35 | } -------------------------------------------------------------------------------- /transcoder/transcoder/data/evaluation/geeks_for_geeks_successful_test_scripts/cpp/C_PROGRAM_FACTORIAL_NUMBER_2.cpp: -------------------------------------------------------------------------------- 1 | // Copyright (c) 2019-present, Facebook, Inc. 2 | // All rights reserved. 3 | // 4 | // This source code is licensed under the license found in the 5 | // LICENSE file in the root directory of this source tree. 6 | // 7 | 8 | #include 9 | #include 10 | #include 11 | #include 12 | #include 13 | #include 14 | #include 15 | using namespace std; 16 | int f_gold ( int n ) { 17 | return ( n == 1 || n == 0 ) ? 1 : n * f_gold ( n - 1 ); 18 | } 19 | 20 | 21 | //TOFILL 22 | 23 | int main() { 24 | int n_success = 0; 25 | vector param0 {66,93,39,93,68,20,37,52,52,19}; 26 | for(int i = 0; i < param0.size(); ++i) 27 | { 28 | if(f_filled(param0[i]) == f_gold(param0[i])) 29 | { 30 | n_success+=1; 31 | } 32 | } 33 | cout << "#Results:" << " " << n_success << ", " << param0.size(); 34 | return 0; 35 | } -------------------------------------------------------------------------------- /transcoder/transcoder/data/evaluation/geeks_for_geeks_successful_test_scripts/cpp/EFFICIENT_WAY_CHECK_WHETHER_N_TH_FIBONACCI_NUMBER_MULTIPLE_10.cpp: -------------------------------------------------------------------------------- 1 | // Copyright (c) 2019-present, Facebook, Inc. 2 | // All rights reserved. 3 | // 4 | // This source code is licensed under the license found in the 5 | // LICENSE file in the root directory of this source tree. 6 | // 7 | 8 | #include 9 | #include 10 | #include 11 | #include 12 | #include 13 | #include 14 | #include 15 | using namespace std; 16 | bool f_gold ( int n ) { 17 | return ( n % 15 == 0 ); 18 | } 19 | 20 | 21 | //TOFILL 22 | 23 | int main() { 24 | int n_success = 0; 25 | vector param0 {30,-30,60,90,99,32,21,65,21,99}; 26 | for(int i = 0; i < param0.size(); ++i) 27 | { 28 | if(f_filled(param0[i]) == f_gold(param0[i])) 29 | { 30 | n_success+=1; 31 | } 32 | } 33 | cout << "#Results:" << " " << n_success << ", " << param0.size(); 34 | return 0; 35 | } -------------------------------------------------------------------------------- /transcoder/transcoder/data/evaluation/geeks_for_geeks_successful_test_scripts/cpp/EFFICIENT_WAY_TO_MULTIPLY_WITH_7.cpp: -------------------------------------------------------------------------------- 1 | // Copyright (c) 2019-present, Facebook, Inc. 2 | // All rights reserved. 3 | // 4 | // This source code is licensed under the license found in the 5 | // LICENSE file in the root directory of this source tree. 6 | // 7 | 8 | #include 9 | #include 10 | #include 11 | #include 12 | #include 13 | #include 14 | #include 15 | using namespace std; 16 | long f_gold ( long n ) { 17 | return ( ( n << 3 ) - n ); 18 | } 19 | 20 | 21 | //TOFILL 22 | 23 | int main() { 24 | int n_success = 0; 25 | vector param0 {41,42,62,4,31,75,5,75,85,19}; 26 | for(int i = 0; i < param0.size(); ++i) 27 | { 28 | if(f_filled(param0[i]) == f_gold(param0[i])) 29 | { 30 | n_success+=1; 31 | } 32 | } 33 | cout << "#Results:" << " " << n_success << ", " << param0.size(); 34 | return 0; 35 | } -------------------------------------------------------------------------------- /transcoder/transcoder/data/evaluation/geeks_for_geeks_successful_test_scripts/cpp/FIND_SUM_EVEN_INDEX_BINOMIAL_COEFFICIENTS_1.cpp: -------------------------------------------------------------------------------- 1 | // Copyright (c) 2019-present, Facebook, Inc. 2 | // All rights reserved. 3 | // 4 | // This source code is licensed under the license found in the 5 | // LICENSE file in the root directory of this source tree. 6 | // 7 | 8 | #include 9 | #include 10 | #include 11 | #include 12 | #include 13 | #include 14 | #include 15 | using namespace std; 16 | int f_gold ( int n ) { 17 | return ( 1 << ( n - 1 ) ); 18 | } 19 | 20 | 21 | //TOFILL 22 | 23 | int main() { 24 | int n_success = 0; 25 | vector param0 {56,28,4,24,72,30,48,32,13,19}; 26 | for(int i = 0; i < param0.size(); ++i) 27 | { 28 | if(f_filled(param0[i]) == f_gold(param0[i])) 29 | { 30 | n_success+=1; 31 | } 32 | } 33 | cout << "#Results:" << " " << n_success << ", " << param0.size(); 34 | return 0; 35 | } -------------------------------------------------------------------------------- /transcoder/transcoder/data/evaluation/geeks_for_geeks_successful_test_scripts/cpp/FIND_WHETHER_GIVEN_INTEGER_POWER_3_NOT.cpp: -------------------------------------------------------------------------------- 1 | // Copyright (c) 2019-present, Facebook, Inc. 2 | // All rights reserved. 3 | // 4 | // This source code is licensed under the license found in the 5 | // LICENSE file in the root directory of this source tree. 6 | // 7 | 8 | #include 9 | #include 10 | #include 11 | #include 12 | #include 13 | #include 14 | #include 15 | using namespace std; 16 | bool f_gold ( int n ) { 17 | return 1162261467 % n == 0; 18 | } 19 | 20 | 21 | //TOFILL 22 | 23 | int main() { 24 | int n_success = 0; 25 | vector param0 {1,3,27,9,-9,11,57,21,60,44}; 26 | for(int i = 0; i < param0.size(); ++i) 27 | { 28 | if(f_filled(param0[i]) == f_gold(param0[i])) 29 | { 30 | n_success+=1; 31 | } 32 | } 33 | cout << "#Results:" << " " << n_success << ", " << param0.size(); 34 | return 0; 35 | } -------------------------------------------------------------------------------- /transcoder/transcoder/data/evaluation/geeks_for_geeks_successful_test_scripts/cpp/HEIGHT_COMPLETE_BINARY_TREE_HEAP_N_NODES.cpp: -------------------------------------------------------------------------------- 1 | // Copyright (c) 2019-present, Facebook, Inc. 2 | // All rights reserved. 3 | // 4 | // This source code is licensed under the license found in the 5 | // LICENSE file in the root directory of this source tree. 6 | // 7 | 8 | #include 9 | #include 10 | #include 11 | #include 12 | #include 13 | #include 14 | #include 15 | using namespace std; 16 | int f_gold ( int N ) { 17 | return ceil ( log2 ( N + 1 ) ) - 1; 18 | } 19 | 20 | 21 | //TOFILL 22 | 23 | int main() { 24 | int n_success = 0; 25 | vector param0 {65,94,52,31,9,1,41,98,45,24}; 26 | for(int i = 0; i < param0.size(); ++i) 27 | { 28 | if(f_filled(param0[i]) == f_gold(param0[i])) 29 | { 30 | n_success+=1; 31 | } 32 | } 33 | cout << "#Results:" << " " << n_success << ", " << param0.size(); 34 | return 0; 35 | } -------------------------------------------------------------------------------- /transcoder/transcoder/data/evaluation/geeks_for_geeks_successful_test_scripts/cpp/HEXAGONAL_NUMBER.cpp: -------------------------------------------------------------------------------- 1 | // Copyright (c) 2019-present, Facebook, Inc. 2 | // All rights reserved. 3 | // 4 | // This source code is licensed under the license found in the 5 | // LICENSE file in the root directory of this source tree. 6 | // 7 | 8 | #include 9 | #include 10 | #include 11 | #include 12 | #include 13 | #include 14 | #include 15 | using namespace std; 16 | int f_gold ( int n ) { 17 | return n * ( 2 * n - 1 ); 18 | } 19 | 20 | 21 | //TOFILL 22 | 23 | int main() { 24 | int n_success = 0; 25 | vector param0 {38,44,58,10,31,53,94,64,71,59}; 26 | for(int i = 0; i < param0.size(); ++i) 27 | { 28 | if(f_filled(param0[i]) == f_gold(param0[i])) 29 | { 30 | n_success+=1; 31 | } 32 | } 33 | cout << "#Results:" << " " << n_success << ", " << param0.size(); 34 | return 0; 35 | } -------------------------------------------------------------------------------- /transcoder/transcoder/data/evaluation/geeks_for_geeks_successful_test_scripts/cpp/HYPERCUBE_GRAPH.cpp: -------------------------------------------------------------------------------- 1 | // Copyright (c) 2019-present, Facebook, Inc. 2 | // All rights reserved. 3 | // 4 | // This source code is licensed under the license found in the 5 | // LICENSE file in the root directory of this source tree. 6 | // 7 | 8 | #include 9 | #include 10 | #include 11 | #include 12 | #include 13 | #include 14 | #include 15 | using namespace std; 16 | int f_gold ( int n ) { 17 | if ( n == 1 ) return 2; 18 | return 2 * f_gold ( n - 1 ); 19 | } 20 | 21 | 22 | //TOFILL 23 | 24 | int main() { 25 | int n_success = 0; 26 | vector param0 {72,28,45,41,94,97,97,36,91,84}; 27 | for(int i = 0; i < param0.size(); ++i) 28 | { 29 | if(f_filled(param0[i]) == f_gold(param0[i])) 30 | { 31 | n_success+=1; 32 | } 33 | } 34 | cout << "#Results:" << " " << n_success << ", " << param0.size(); 35 | return 0; 36 | } -------------------------------------------------------------------------------- /transcoder/transcoder/data/evaluation/geeks_for_geeks_successful_test_scripts/cpp/MAXIMUM_POINTS_INTERSECTION_N_CIRCLES.cpp: -------------------------------------------------------------------------------- 1 | // Copyright (c) 2019-present, Facebook, Inc. 2 | // All rights reserved. 3 | // 4 | // This source code is licensed under the license found in the 5 | // LICENSE file in the root directory of this source tree. 6 | // 7 | 8 | #include 9 | #include 10 | #include 11 | #include 12 | #include 13 | #include 14 | #include 15 | using namespace std; 16 | int f_gold ( int n ) { 17 | return n * ( n - 1 ); 18 | } 19 | 20 | 21 | //TOFILL 22 | 23 | int main() { 24 | int n_success = 0; 25 | vector param0 {30,25,69,39,14,60,89,27,29,29}; 26 | for(int i = 0; i < param0.size(); ++i) 27 | { 28 | if(f_filled(param0[i]) == f_gold(param0[i])) 29 | { 30 | n_success+=1; 31 | } 32 | } 33 | cout << "#Results:" << " " << n_success << ", " << param0.size(); 34 | return 0; 35 | } -------------------------------------------------------------------------------- /transcoder/transcoder/data/evaluation/geeks_for_geeks_successful_test_scripts/cpp/MULTIPLY_AN_INTEGER_WITH_3_5.cpp: -------------------------------------------------------------------------------- 1 | // Copyright (c) 2019-present, Facebook, Inc. 2 | // All rights reserved. 3 | // 4 | // This source code is licensed under the license found in the 5 | // LICENSE file in the root directory of this source tree. 6 | // 7 | 8 | #include 9 | #include 10 | #include 11 | #include 12 | #include 13 | #include 14 | #include 15 | using namespace std; 16 | int f_gold ( int x ) { 17 | return ( x << 1 ) + x + ( x >> 1 ); 18 | } 19 | 20 | 21 | //TOFILL 22 | 23 | int main() { 24 | int n_success = 0; 25 | vector param0 {58,16,82,33,88,51,81,38,79,89}; 26 | for(int i = 0; i < param0.size(); ++i) 27 | { 28 | if(f_filled(param0[i]) == f_gold(param0[i])) 29 | { 30 | n_success+=1; 31 | } 32 | } 33 | cout << "#Results:" << " " << n_success << ", " << param0.size(); 34 | return 0; 35 | } -------------------------------------------------------------------------------- /transcoder/transcoder/data/evaluation/geeks_for_geeks_successful_test_scripts/cpp/NTH_PENTAGONAL_NUMBER.cpp: -------------------------------------------------------------------------------- 1 | // Copyright (c) 2019-present, Facebook, Inc. 2 | // All rights reserved. 3 | // 4 | // This source code is licensed under the license found in the 5 | // LICENSE file in the root directory of this source tree. 6 | // 7 | 8 | #include 9 | #include 10 | #include 11 | #include 12 | #include 13 | #include 14 | #include 15 | using namespace std; 16 | int f_gold ( int n ) { 17 | return ( 3 * n * n - n ) / 2; 18 | } 19 | 20 | 21 | //TOFILL 22 | 23 | int main() { 24 | int n_success = 0; 25 | vector param0 {96,93,15,8,21,14,11,79,24,94}; 26 | for(int i = 0; i < param0.size(); ++i) 27 | { 28 | if(f_filled(param0[i]) == f_gold(param0[i])) 29 | { 30 | n_success+=1; 31 | } 32 | } 33 | cout << "#Results:" << " " << n_success << ", " << param0.size(); 34 | return 0; 35 | } -------------------------------------------------------------------------------- /transcoder/transcoder/data/evaluation/geeks_for_geeks_successful_test_scripts/cpp/NUMBER_NON_NEGATIVE_INTEGRAL_SOLUTIONS_B_C_N_1.cpp: -------------------------------------------------------------------------------- 1 | // Copyright (c) 2019-present, Facebook, Inc. 2 | // All rights reserved. 3 | // 4 | // This source code is licensed under the license found in the 5 | // LICENSE file in the root directory of this source tree. 6 | // 7 | 8 | #include 9 | #include 10 | #include 11 | #include 12 | #include 13 | #include 14 | #include 15 | using namespace std; 16 | int f_gold ( int n ) { 17 | return ( ( n + 1 ) * ( n + 2 ) ) / 2; 18 | } 19 | 20 | 21 | //TOFILL 22 | 23 | int main() { 24 | int n_success = 0; 25 | vector param0 {41,72,54,75,87,41,78,80,46,9}; 26 | for(int i = 0; i < param0.size(); ++i) 27 | { 28 | if(f_filled(param0[i]) == f_gold(param0[i])) 29 | { 30 | n_success+=1; 31 | } 32 | } 33 | cout << "#Results:" << " " << n_success << ", " << param0.size(); 34 | return 0; 35 | } -------------------------------------------------------------------------------- /transcoder/transcoder/data/evaluation/geeks_for_geeks_successful_test_scripts/cpp/N_TH_TERM_SERIES_2_12_36_80_150.cpp: -------------------------------------------------------------------------------- 1 | // Copyright (c) 2019-present, Facebook, Inc. 2 | // All rights reserved. 3 | // 4 | // This source code is licensed under the license found in the 5 | // LICENSE file in the root directory of this source tree. 6 | // 7 | 8 | #include 9 | #include 10 | #include 11 | #include 12 | #include 13 | #include 14 | #include 15 | using namespace std; 16 | int f_gold ( int n ) { 17 | return ( n * n ) + ( n * n * n ); 18 | } 19 | 20 | 21 | //TOFILL 22 | 23 | int main() { 24 | int n_success = 0; 25 | vector param0 {90,95,22,29,62,40,52,21,33,11}; 26 | for(int i = 0; i < param0.size(); ++i) 27 | { 28 | if(f_filled(param0[i]) == f_gold(param0[i])) 29 | { 30 | n_success+=1; 31 | } 32 | } 33 | cout << "#Results:" << " " << n_success << ", " << param0.size(); 34 | return 0; 35 | } -------------------------------------------------------------------------------- /transcoder/transcoder/data/evaluation/geeks_for_geeks_successful_test_scripts/cpp/PIZZA_CUT_PROBLEM_CIRCLE_DIVISION_LINES.cpp: -------------------------------------------------------------------------------- 1 | // Copyright (c) 2019-present, Facebook, Inc. 2 | // All rights reserved. 3 | // 4 | // This source code is licensed under the license found in the 5 | // LICENSE file in the root directory of this source tree. 6 | // 7 | 8 | #include 9 | #include 10 | #include 11 | #include 12 | #include 13 | #include 14 | #include 15 | using namespace std; 16 | int f_gold ( int n ) { 17 | return 1 + n * ( n + 1 ) / 2; 18 | } 19 | 20 | 21 | //TOFILL 22 | 23 | int main() { 24 | int n_success = 0; 25 | vector param0 {46,68,4,12,56,14,81,29,26,40}; 26 | for(int i = 0; i < param0.size(); ++i) 27 | { 28 | if(f_filled(param0[i]) == f_gold(param0[i])) 29 | { 30 | n_success+=1; 31 | } 32 | } 33 | cout << "#Results:" << " " << n_success << ", " << param0.size(); 34 | return 0; 35 | } -------------------------------------------------------------------------------- /transcoder/transcoder/data/evaluation/geeks_for_geeks_successful_test_scripts/cpp/PROGRAM_AREA_SQUARE.cpp: -------------------------------------------------------------------------------- 1 | // Copyright (c) 2019-present, Facebook, Inc. 2 | // All rights reserved. 3 | // 4 | // This source code is licensed under the license found in the 5 | // LICENSE file in the root directory of this source tree. 6 | // 7 | 8 | #include 9 | #include 10 | #include 11 | #include 12 | #include 13 | #include 14 | #include 15 | using namespace std; 16 | int f_gold ( int side ) { 17 | int area = side * side; 18 | return area; 19 | } 20 | 21 | 22 | //TOFILL 23 | 24 | int main() { 25 | int n_success = 0; 26 | vector param0 {50,64,92,23,38,55,67,56,60,90}; 27 | for(int i = 0; i < param0.size(); ++i) 28 | { 29 | if(f_filled(param0[i]) == f_gold(param0[i])) 30 | { 31 | n_success+=1; 32 | } 33 | } 34 | cout << "#Results:" << " " << n_success << ", " << param0.size(); 35 | return 0; 36 | } -------------------------------------------------------------------------------- /transcoder/transcoder/data/evaluation/geeks_for_geeks_successful_test_scripts/cpp/PROGRAM_PRINT_SUM_GIVEN_NTH_TERM_1.cpp: -------------------------------------------------------------------------------- 1 | // Copyright (c) 2019-present, Facebook, Inc. 2 | // All rights reserved. 3 | // 4 | // This source code is licensed under the license found in the 5 | // LICENSE file in the root directory of this source tree. 6 | // 7 | 8 | #include 9 | #include 10 | #include 11 | #include 12 | #include 13 | #include 14 | #include 15 | using namespace std; 16 | int f_gold ( long n ) { 17 | return pow ( n, 2 ); 18 | } 19 | 20 | 21 | //TOFILL 22 | 23 | int main() { 24 | int n_success = 0; 25 | vector param0 {42,40,67,73,18,16,74,33,92,22}; 26 | for(int i = 0; i < param0.size(); ++i) 27 | { 28 | if(f_filled(param0[i]) == f_gold(param0[i])) 29 | { 30 | n_success+=1; 31 | } 32 | } 33 | cout << "#Results:" << " " << n_success << ", " << param0.size(); 34 | return 0; 35 | } -------------------------------------------------------------------------------- /transcoder/transcoder/data/evaluation/geeks_for_geeks_successful_test_scripts/cpp/PYTHON_PROGRAM_FIND_PERIMETER_CIRCUMFERENCE_SQUARE_RECTANGLE.cpp: -------------------------------------------------------------------------------- 1 | // Copyright (c) 2019-present, Facebook, Inc. 2 | // All rights reserved. 3 | // 4 | // This source code is licensed under the license found in the 5 | // LICENSE file in the root directory of this source tree. 6 | // 7 | 8 | #include 9 | #include 10 | #include 11 | #include 12 | #include 13 | #include 14 | #include 15 | using namespace std; 16 | int f_gold ( int a ) { 17 | return 4 * a; 18 | } 19 | 20 | 21 | //TOFILL 22 | 23 | int main() { 24 | int n_success = 0; 25 | vector param0 {98,9,18,38,84,8,39,6,60,47}; 26 | for(int i = 0; i < param0.size(); ++i) 27 | { 28 | if(f_filled(param0[i]) == f_gold(param0[i])) 29 | { 30 | n_success+=1; 31 | } 32 | } 33 | cout << "#Results:" << " " << n_success << ", " << param0.size(); 34 | return 0; 35 | } -------------------------------------------------------------------------------- /transcoder/transcoder/data/evaluation/geeks_for_geeks_successful_test_scripts/cpp/SUM_BINOMIAL_COEFFICIENTS_1.cpp: -------------------------------------------------------------------------------- 1 | // Copyright (c) 2019-present, Facebook, Inc. 2 | // All rights reserved. 3 | // 4 | // This source code is licensed under the license found in the 5 | // LICENSE file in the root directory of this source tree. 6 | // 7 | 8 | #include 9 | #include 10 | #include 11 | #include 12 | #include 13 | #include 14 | #include 15 | using namespace std; 16 | int f_gold ( int n ) { 17 | return ( 1 << n ); 18 | } 19 | 20 | 21 | //TOFILL 22 | 23 | int main() { 24 | int n_success = 0; 25 | vector param0 {48,42,15,75,23,41,46,99,36,53}; 26 | for(int i = 0; i < param0.size(); ++i) 27 | { 28 | if(f_filled(param0[i]) == f_gold(param0[i])) 29 | { 30 | n_success+=1; 31 | } 32 | } 33 | cout << "#Results:" << " " << n_success << ", " << param0.size(); 34 | return 0; 35 | } -------------------------------------------------------------------------------- /transcoder/transcoder/data/evaluation/geeks_for_geeks_successful_test_scripts/cpp/SUM_K_TH_GROUP_ODD_POSITIVE_NUMBERS_1.cpp: -------------------------------------------------------------------------------- 1 | // Copyright (c) 2019-present, Facebook, Inc. 2 | // All rights reserved. 3 | // 4 | // This source code is licensed under the license found in the 5 | // LICENSE file in the root directory of this source tree. 6 | // 7 | 8 | #include 9 | #include 10 | #include 11 | #include 12 | #include 13 | #include 14 | #include 15 | using namespace std; 16 | int f_gold ( int k ) { 17 | return k * k * k; 18 | } 19 | 20 | 21 | //TOFILL 22 | 23 | int main() { 24 | int n_success = 0; 25 | vector param0 {57,96,14,64,24,74,85,27,78,1}; 26 | for(int i = 0; i < param0.size(); ++i) 27 | { 28 | if(f_filled(param0[i]) == f_gold(param0[i])) 29 | { 30 | n_success+=1; 31 | } 32 | } 33 | cout << "#Results:" << " " << n_success << ", " << param0.size(); 34 | return 0; 35 | } -------------------------------------------------------------------------------- /transcoder/transcoder/data/evaluation/geeks_for_geeks_successful_test_scripts/cpp/SUM_PAIRWISE_PRODUCTS_2.cpp: -------------------------------------------------------------------------------- 1 | // Copyright (c) 2019-present, Facebook, Inc. 2 | // All rights reserved. 3 | // 4 | // This source code is licensed under the license found in the 5 | // LICENSE file in the root directory of this source tree. 6 | // 7 | 8 | #include 9 | #include 10 | #include 11 | #include 12 | #include 13 | #include 14 | #include 15 | using namespace std; 16 | long long int f_gold ( int n ) { 17 | return n * ( n + 1 ) * ( n + 2 ) * ( 3 * n + 1 ) / 24; 18 | } 19 | 20 | 21 | //TOFILL 22 | 23 | int main() { 24 | int n_success = 0; 25 | vector param0 {57,18,97,9,42,67,71,66,69,18}; 26 | for(int i = 0; i < param0.size(); ++i) 27 | { 28 | if(f_filled(param0[i]) == f_gold(param0[i])) 29 | { 30 | n_success+=1; 31 | } 32 | } 33 | cout << "#Results:" << " " << n_success << ", " << param0.size(); 34 | return 0; 35 | } -------------------------------------------------------------------------------- /transcoder/transcoder/data/evaluation/geeks_for_geeks_successful_test_scripts/cpp/SUM_SERIES_12_32_52_2N_12_1.cpp: -------------------------------------------------------------------------------- 1 | // Copyright (c) 2019-present, Facebook, Inc. 2 | // All rights reserved. 3 | // 4 | // This source code is licensed under the license found in the 5 | // LICENSE file in the root directory of this source tree. 6 | // 7 | 8 | #include 9 | #include 10 | #include 11 | #include 12 | #include 13 | #include 14 | #include 15 | using namespace std; 16 | int f_gold ( int n ) { 17 | return ( n * ( 2 * n - 1 ) * ( 2 * n + 1 ) ) / 3; 18 | } 19 | 20 | 21 | //TOFILL 22 | 23 | int main() { 24 | int n_success = 0; 25 | vector param0 {84,74,91,34,36,28,70,7,24,47}; 26 | for(int i = 0; i < param0.size(); ++i) 27 | { 28 | if(f_filled(param0[i]) == f_gold(param0[i])) 29 | { 30 | n_success+=1; 31 | } 32 | } 33 | cout << "#Results:" << " " << n_success << ", " << param0.size(); 34 | return 0; 35 | } -------------------------------------------------------------------------------- /transcoder/transcoder/data/evaluation/geeks_for_geeks_successful_test_scripts/cpp/SUM_SERIES_555555_N_TERMS.cpp: -------------------------------------------------------------------------------- 1 | // Copyright (c) 2019-present, Facebook, Inc. 2 | // All rights reserved. 3 | // 4 | // This source code is licensed under the license found in the 5 | // LICENSE file in the root directory of this source tree. 6 | // 7 | 8 | #include 9 | #include 10 | #include 11 | #include 12 | #include 13 | #include 14 | #include 15 | using namespace std; 16 | int f_gold ( int n ) { 17 | return 0.6172 * ( pow ( 10, n ) - 1 ) - 0.55 * n; 18 | } 19 | 20 | 21 | //TOFILL 22 | 23 | int main() { 24 | int n_success = 0; 25 | vector param0 {18,81,77,84,87,14,15,3,21,60}; 26 | for(int i = 0; i < param0.size(); ++i) 27 | { 28 | if(f_filled(param0[i]) == f_gold(param0[i])) 29 | { 30 | n_success+=1; 31 | } 32 | } 33 | cout << "#Results:" << " " << n_success << ", " << param0.size(); 34 | return 0; 35 | } -------------------------------------------------------------------------------- /transcoder/transcoder/data/evaluation/geeks_for_geeks_successful_test_scripts/cpp/SWAP_TWO_NIBBLES_BYTE.cpp: -------------------------------------------------------------------------------- 1 | // Copyright (c) 2019-present, Facebook, Inc. 2 | // All rights reserved. 3 | // 4 | // This source code is licensed under the license found in the 5 | // LICENSE file in the root directory of this source tree. 6 | // 7 | 8 | #include 9 | #include 10 | #include 11 | #include 12 | #include 13 | #include 14 | #include 15 | using namespace std; 16 | int f_gold ( int x ) { 17 | return ( ( x & 0x0F ) << 4 | ( x & 0xF0 ) >> 4 ); 18 | } 19 | 20 | 21 | //TOFILL 22 | 23 | int main() { 24 | int n_success = 0; 25 | vector param0 {57,99,66,97,95,42,95,89,3,84}; 26 | for(int i = 0; i < param0.size(); ++i) 27 | { 28 | if(f_filled(param0[i]) == f_gold(param0[i])) 29 | { 30 | n_success+=1; 31 | } 32 | } 33 | cout << "#Results:" << " " << n_success << ", " << param0.size(); 34 | return 0; 35 | } -------------------------------------------------------------------------------- /transcoder/transcoder/data/evaluation/geeks_for_geeks_successful_test_scripts/cpp/TRIANGULAR_MATCHSTICK_NUMBER.cpp: -------------------------------------------------------------------------------- 1 | // Copyright (c) 2019-present, Facebook, Inc. 2 | // All rights reserved. 3 | // 4 | // This source code is licensed under the license found in the 5 | // LICENSE file in the root directory of this source tree. 6 | // 7 | 8 | #include 9 | #include 10 | #include 11 | #include 12 | #include 13 | #include 14 | #include 15 | using namespace std; 16 | int f_gold ( int x ) { 17 | return ( 3 * x * ( x + 1 ) ) / 2; 18 | } 19 | 20 | 21 | //TOFILL 22 | 23 | int main() { 24 | int n_success = 0; 25 | vector param0 {6,25,15,30,17,80,27,13,12,67}; 26 | for(int i = 0; i < param0.size(); ++i) 27 | { 28 | if(f_filled(param0[i]) == f_gold(param0[i])) 29 | { 30 | n_success+=1; 31 | } 32 | } 33 | cout << "#Results:" << " " << n_success << ", " << param0.size(); 34 | return 0; 35 | } -------------------------------------------------------------------------------- /transcoder/transcoder/data/evaluation/geeks_for_geeks_successful_test_scripts/cpp/TURN_OFF_THE_RIGHTMOST_SET_BIT.cpp: -------------------------------------------------------------------------------- 1 | // Copyright (c) 2019-present, Facebook, Inc. 2 | // All rights reserved. 3 | // 4 | // This source code is licensed under the license found in the 5 | // LICENSE file in the root directory of this source tree. 6 | // 7 | 8 | #include 9 | #include 10 | #include 11 | #include 12 | #include 13 | #include 14 | #include 15 | using namespace std; 16 | int f_gold ( unsigned int n ) { 17 | return n & ( n - 1 ); 18 | } 19 | 20 | 21 | //TOFILL 22 | 23 | int main() { 24 | int n_success = 0; 25 | vector param0 {9,54,60,32,41,64,4,51,57,92}; 26 | for(int i = 0; i < param0.size(); ++i) 27 | { 28 | if(f_filled(param0[i]) == f_gold(param0[i])) 29 | { 30 | n_success+=1; 31 | } 32 | } 33 | cout << "#Results:" << " " << n_success << ", " << param0.size(); 34 | return 0; 35 | } -------------------------------------------------------------------------------- /transcoder/transcoder/data/evaluation/geeks_for_geeks_successful_test_scripts/python/ADD_1_TO_A_GIVEN_NUMBER.py: -------------------------------------------------------------------------------- 1 | # Copyright (c) 2019-present, Facebook, Inc. 2 | # All rights reserved. 3 | # 4 | # This source code is licensed under the license found in the 5 | # LICENSE file in the root directory of this source tree. 6 | # 7 | def f_gold ( x ) : 8 | m = 1 ; 9 | while ( x & m ) : 10 | x = x ^ m 11 | m <<= 1 12 | x = x ^ m 13 | return x 14 | 15 | 16 | #TOFILL 17 | 18 | if __name__ == '__main__': 19 | param = [ 20 | (96,), 21 | (66,), 22 | (67,), 23 | (13,), 24 | (75,), 25 | (78,), 26 | (1,), 27 | (83,), 28 | (27,), 29 | (65,) 30 | ] 31 | n_success = 0 32 | for i, parameters_set in enumerate(param): 33 | if f_filled(*parameters_set) == f_gold(*parameters_set): 34 | n_success+=1 35 | print("#Results: %i, %i" % (n_success, len(param))) 36 | -------------------------------------------------------------------------------- /transcoder/transcoder/data/evaluation/geeks_for_geeks_successful_test_scripts/python/ADD_1_TO_A_GIVEN_NUMBER_1.py: -------------------------------------------------------------------------------- 1 | # Copyright (c) 2019-present, Facebook, Inc. 2 | # All rights reserved. 3 | # 4 | # This source code is licensed under the license found in the 5 | # LICENSE file in the root directory of this source tree. 6 | # 7 | def f_gold ( x ) : 8 | return ( - ( ~ x ) ) ; 9 | 10 | 11 | #TOFILL 12 | 13 | if __name__ == '__main__': 14 | param = [ 15 | (20,), 16 | (68,), 17 | (52,), 18 | (61,), 19 | (3,), 20 | (88,), 21 | (41,), 22 | (78,), 23 | (94,), 24 | (18,) 25 | ] 26 | n_success = 0 27 | for i, parameters_set in enumerate(param): 28 | if f_filled(*parameters_set) == f_gold(*parameters_set): 29 | n_success+=1 30 | print("#Results: %i, %i" % (n_success, len(param))) -------------------------------------------------------------------------------- /transcoder/transcoder/data/evaluation/geeks_for_geeks_successful_test_scripts/python/ADD_TWO_NUMBERS_WITHOUT_USING_ARITHMETIC_OPERATORS.py: -------------------------------------------------------------------------------- 1 | # Copyright (c) 2019-present, Facebook, Inc. 2 | # All rights reserved. 3 | # 4 | # This source code is licensed under the license found in the 5 | # LICENSE file in the root directory of this source tree. 6 | # 7 | def f_gold ( x , y ) : 8 | while ( y != 0 ) : 9 | carry = x & y 10 | x = x ^ y 11 | y = carry << 1 12 | return x 13 | 14 | 15 | #TOFILL 16 | 17 | if __name__ == '__main__': 18 | param = [ 19 | (56,60,), 20 | (17,44,), 21 | (73,96,), 22 | (75,3,), 23 | (27,54,), 24 | (61,1,), 25 | (65,63,), 26 | (22,19,), 27 | (61,9,), 28 | (97,23,) 29 | ] 30 | n_success = 0 31 | for i, parameters_set in enumerate(param): 32 | if f_filled(*parameters_set) == f_gold(*parameters_set): 33 | n_success+=1 34 | print("#Results: %i, %i" % (n_success, len(param))) -------------------------------------------------------------------------------- /transcoder/transcoder/data/evaluation/geeks_for_geeks_successful_test_scripts/python/AREA_OF_THE_CIRCLE_THAT_HAS_A_SQUARE_AND_A_CIRCLE_INSCRIBED_IN_IT.py: -------------------------------------------------------------------------------- 1 | # Copyright (c) 2019-present, Facebook, Inc. 2 | # All rights reserved. 3 | # 4 | # This source code is licensed under the license found in the 5 | # LICENSE file in the root directory of this source tree. 6 | # 7 | import math 8 | 9 | def f_gold ( a ) : 10 | area = ( math.pi * a * a ) / 4 11 | return area 12 | 13 | 14 | #TOFILL 15 | 16 | if __name__ == '__main__': 17 | param = [ 18 | (77,), 19 | (18,), 20 | (83,), 21 | (39,), 22 | (68,), 23 | (28,), 24 | (71,), 25 | (14,), 26 | (21,), 27 | (73,) 28 | ] 29 | n_success = 0 30 | for i, parameters_set in enumerate(param): 31 | if abs(1 - (0.0000001 + abs(f_gold(*parameters_set))) / (abs(f_filled(*parameters_set)) + 0.0000001)) < 0.001: 32 | n_success+=1 33 | print("#Results: %i, %i" % (n_success, len(param))) -------------------------------------------------------------------------------- /transcoder/transcoder/data/evaluation/geeks_for_geeks_successful_test_scripts/python/AREA_SQUARE_CIRCUMSCRIBED_CIRCLE.py: -------------------------------------------------------------------------------- 1 | # Copyright (c) 2019-present, Facebook, Inc. 2 | # All rights reserved. 3 | # 4 | # This source code is licensed under the license found in the 5 | # LICENSE file in the root directory of this source tree. 6 | # 7 | def f_gold ( r ) : 8 | return ( 2 * r * r ) 9 | 10 | 11 | #TOFILL 12 | 13 | if __name__ == '__main__': 14 | param = [ 15 | (14,), 16 | (78,), 17 | (45,), 18 | (66,), 19 | (18,), 20 | (32,), 21 | (60,), 22 | (16,), 23 | (99,), 24 | (65,) 25 | ] 26 | n_success = 0 27 | for i, parameters_set in enumerate(param): 28 | if f_filled(*parameters_set) == f_gold(*parameters_set): 29 | n_success+=1 30 | print("#Results: %i, %i" % (n_success, len(param))) -------------------------------------------------------------------------------- /transcoder/transcoder/data/evaluation/geeks_for_geeks_successful_test_scripts/python/BASIC_AND_EXTENDED_EUCLIDEAN_ALGORITHMS.py: -------------------------------------------------------------------------------- 1 | # Copyright (c) 2019-present, Facebook, Inc. 2 | # All rights reserved. 3 | # 4 | # This source code is licensed under the license found in the 5 | # LICENSE file in the root directory of this source tree. 6 | # 7 | def f_gold ( a , b ) : 8 | if a == 0 : 9 | return b 10 | return f_gold ( b % a , a ) 11 | 12 | 13 | #TOFILL 14 | 15 | if __name__ == '__main__': 16 | param = [ 17 | (46,89,), 18 | (26,82,), 19 | (40,12,), 20 | (58,4,), 21 | (25,44,), 22 | (2,87,), 23 | (8,65,), 24 | (21,87,), 25 | (82,10,), 26 | (17,61,) 27 | ] 28 | n_success = 0 29 | for i, parameters_set in enumerate(param): 30 | if f_filled(*parameters_set) == f_gold(*parameters_set): 31 | n_success+=1 32 | print("#Results: %i, %i" % (n_success, len(param))) -------------------------------------------------------------------------------- /transcoder/transcoder/data/evaluation/geeks_for_geeks_successful_test_scripts/python/BREAK_NUMBER_THREE_PARTS_1.py: -------------------------------------------------------------------------------- 1 | # Copyright (c) 2019-present, Facebook, Inc. 2 | # All rights reserved. 3 | # 4 | # This source code is licensed under the license found in the 5 | # LICENSE file in the root directory of this source tree. 6 | # 7 | def f_gold ( n ) : 8 | count = 0 9 | count = ( n + 1 ) * ( n + 2 ) // 2 10 | return count 11 | 12 | 13 | #TOFILL 14 | 15 | if __name__ == '__main__': 16 | param = [ 17 | (71,), 18 | (71,), 19 | (36,), 20 | (3,), 21 | (97,), 22 | (69,), 23 | (15,), 24 | (48,), 25 | (77,), 26 | (6,) 27 | ] 28 | n_success = 0 29 | for i, parameters_set in enumerate(param): 30 | if f_filled(*parameters_set) == f_gold(*parameters_set): 31 | n_success+=1 32 | print("#Results: %i, %i" % (n_success, len(param))) -------------------------------------------------------------------------------- /transcoder/transcoder/data/evaluation/geeks_for_geeks_successful_test_scripts/python/CALCULATE_AREA_TETRAHEDRON.py: -------------------------------------------------------------------------------- 1 | # Copyright (c) 2019-present, Facebook, Inc. 2 | # All rights reserved. 3 | # 4 | # This source code is licensed under the license found in the 5 | # LICENSE file in the root directory of this source tree. 6 | # 7 | import math 8 | 9 | def f_gold ( side ) : 10 | volume = ( side ** 3 / ( 6 * math.sqrt ( 2 ) ) ) 11 | return round ( volume , 2 ) 12 | 13 | 14 | #TOFILL 15 | 16 | if __name__ == '__main__': 17 | param = [ 18 | (58,), 19 | (56,), 20 | (35,), 21 | (99,), 22 | (13,), 23 | (45,), 24 | (40,), 25 | (92,), 26 | (7,), 27 | (13,) 28 | ] 29 | n_success = 0 30 | for i, parameters_set in enumerate(param): 31 | if abs(1 - (0.0000001 + abs(f_gold(*parameters_set))) / (abs(f_filled(*parameters_set)) + 0.0000001)) < 0.001: 32 | n_success+=1 33 | print("#Results: %i, %i" % (n_success, len(param))) -------------------------------------------------------------------------------- /transcoder/transcoder/data/evaluation/geeks_for_geeks_successful_test_scripts/python/CALCULATE_VOLUME_DODECAHEDRON.py: -------------------------------------------------------------------------------- 1 | # Copyright (c) 2019-present, Facebook, Inc. 2 | # All rights reserved. 3 | # 4 | # This source code is licensed under the license found in the 5 | # LICENSE file in the root directory of this source tree. 6 | # 7 | import math 8 | 9 | def f_gold ( side ) : 10 | return ( ( ( 15 + ( 7 * ( math.sqrt ( 5 ) ) ) ) / 4 ) * ( math.pow ( side , 3 ) ) ) 11 | 12 | 13 | #TOFILL 14 | 15 | if __name__ == '__main__': 16 | param = [ 17 | (56,), 18 | (73,), 19 | (22,), 20 | (10,), 21 | (84,), 22 | (20,), 23 | (51,), 24 | (91,), 25 | (10,), 26 | (83,) 27 | ] 28 | n_success = 0 29 | for i, parameters_set in enumerate(param): 30 | if abs(1 - (0.0000001 + abs(f_gold(*parameters_set))) / (abs(f_filled(*parameters_set)) + 0.0000001)) < 0.001: 31 | n_success+=1 32 | print("#Results: %i, %i" % (n_success, len(param))) -------------------------------------------------------------------------------- /transcoder/transcoder/data/evaluation/geeks_for_geeks_successful_test_scripts/python/CASSINIS_IDENTITY.py: -------------------------------------------------------------------------------- 1 | # Copyright (c) 2019-present, Facebook, Inc. 2 | # All rights reserved. 3 | # 4 | # This source code is licensed under the license found in the 5 | # LICENSE file in the root directory of this source tree. 6 | # 7 | def f_gold ( n ) : 8 | return - 1 if ( n & 1 ) else 1 9 | 10 | 11 | #TOFILL 12 | 13 | if __name__ == '__main__': 14 | param = [ 15 | (67,), 16 | (2,), 17 | (58,), 18 | (6,), 19 | (42,), 20 | (17,), 21 | (37,), 22 | (44,), 23 | (23,), 24 | (40,) 25 | ] 26 | n_success = 0 27 | for i, parameters_set in enumerate(param): 28 | if f_filled(*parameters_set) == f_gold(*parameters_set): 29 | n_success+=1 30 | print("#Results: %i, %i" % (n_success, len(param))) -------------------------------------------------------------------------------- /transcoder/transcoder/data/evaluation/geeks_for_geeks_successful_test_scripts/python/CHECK_IF_A_NUMBER_IS_POWER_OF_ANOTHER_NUMBER.py: -------------------------------------------------------------------------------- 1 | # Copyright (c) 2019-present, Facebook, Inc. 2 | # All rights reserved. 3 | # 4 | # This source code is licensed under the license found in the 5 | # LICENSE file in the root directory of this source tree. 6 | # 7 | def f_gold ( x , y ) : 8 | if ( x == 1 ) : 9 | return ( y == 1 ) 10 | pow = 1 11 | while ( pow < y ) : 12 | pow = pow * x 13 | return ( pow == y ) 14 | 15 | 16 | #TOFILL 17 | 18 | if __name__ == '__main__': 19 | param = [ 20 | (57,1,), 21 | (3,9,), 22 | (10,101,), 23 | (10,10000,), 24 | (6,46656,), 25 | (2,2048,), 26 | (1,40,), 27 | (20,79,), 28 | (96,98,), 29 | (25,5,) 30 | ] 31 | n_success = 0 32 | for i, parameters_set in enumerate(param): 33 | if f_filled(*parameters_set) == f_gold(*parameters_set): 34 | n_success+=1 35 | print("#Results: %i, %i" % (n_success, len(param))) -------------------------------------------------------------------------------- /transcoder/transcoder/data/evaluation/geeks_for_geeks_successful_test_scripts/python/CHECK_IF_A_NUMBER_IS_POWER_OF_ANOTHER_NUMBER_1.py: -------------------------------------------------------------------------------- 1 | # Copyright (c) 2019-present, Facebook, Inc. 2 | # All rights reserved. 3 | # 4 | # This source code is licensed under the license found in the 5 | # LICENSE file in the root directory of this source tree. 6 | # 7 | import math 8 | 9 | def f_gold ( x , y ) : 10 | res1 = math.log ( y ) / math.log ( x ) ; 11 | res2 = math.log ( y ) / math.log ( x ) ; 12 | return 1 if ( res1 == res2 ) else 0 ; 13 | 14 | 15 | #TOFILL 16 | 17 | if __name__ == '__main__': 18 | param = [ 19 | (57,1,), 20 | (3,9,), 21 | (10,101,), 22 | (10,10000,), 23 | (6,46656,), 24 | (2,2048,), 25 | (2,40,), 26 | (20,79,), 27 | (96,98,), 28 | (25,5,) 29 | ] 30 | n_success = 0 31 | for i, parameters_set in enumerate(param): 32 | if f_filled(*parameters_set) == f_gold(*parameters_set): 33 | n_success+=1 34 | print("#Results: %i, %i" % (n_success, len(param))) -------------------------------------------------------------------------------- /transcoder/transcoder/data/evaluation/geeks_for_geeks_successful_test_scripts/python/CHECK_LINE_PASSES_ORIGIN.py: -------------------------------------------------------------------------------- 1 | # Copyright (c) 2019-present, Facebook, Inc. 2 | # All rights reserved. 3 | # 4 | # This source code is licensed under the license found in the 5 | # LICENSE file in the root directory of this source tree. 6 | # 7 | def f_gold ( x1 , y1 , x2 , y2 ) : 8 | return ( x1 * ( y2 - y1 ) == y1 * ( x2 - x1 ) ) 9 | 10 | 11 | #TOFILL 12 | 13 | if __name__ == '__main__': 14 | param = [ 15 | (1,28,2,56,), 16 | (10,0,20,0,), 17 | (0,1,0,17,), 18 | (1,1,10,10,), 19 | (82,86,19,4,), 20 | (78,86,11,6,), 21 | (13,46,33,33,), 22 | (18,29,95,12,), 23 | (42,35,25,36,), 24 | (29,17,45,35,) 25 | ] 26 | n_success = 0 27 | for i, parameters_set in enumerate(param): 28 | if f_filled(*parameters_set) == f_gold(*parameters_set): 29 | n_success+=1 30 | print("#Results: %i, %i" % (n_success, len(param))) -------------------------------------------------------------------------------- /transcoder/transcoder/data/evaluation/geeks_for_geeks_successful_test_scripts/python/CHECK_NUMBER_IS_PERFECT_SQUARE_USING_ADDITIONSUBTRACTION.py: -------------------------------------------------------------------------------- 1 | # Copyright (c) 2019-present, Facebook, Inc. 2 | # All rights reserved. 3 | # 4 | # This source code is licensed under the license found in the 5 | # LICENSE file in the root directory of this source tree. 6 | # 7 | def f_gold ( n ) : 8 | i = 1 9 | the_sum = 0 10 | while the_sum < n : 11 | the_sum += i 12 | if the_sum == n : 13 | return True 14 | i += 2 15 | return False 16 | 17 | 18 | #TOFILL 19 | 20 | if __name__ == '__main__': 21 | param = [ 22 | (1,), 23 | (4,), 24 | (9,), 25 | (25,), 26 | (36,), 27 | (3,), 28 | (121,), 29 | (14,), 30 | (17,), 31 | (80,) 32 | ] 33 | n_success = 0 34 | for i, parameters_set in enumerate(param): 35 | if f_filled(*parameters_set) == f_gold(*parameters_set): 36 | n_success+=1 37 | print("#Results: %i, %i" % (n_success, len(param))) -------------------------------------------------------------------------------- /transcoder/transcoder/data/evaluation/geeks_for_geeks_successful_test_scripts/python/CHECK_WHETHER_GIVEN_NUMBER_EVEN_ODD.py: -------------------------------------------------------------------------------- 1 | # Copyright (c) 2019-present, Facebook, Inc. 2 | # All rights reserved. 3 | # 4 | # This source code is licensed under the license found in the 5 | # LICENSE file in the root directory of this source tree. 6 | # 7 | def f_gold ( n ) : 8 | return ( n % 2 == 0 ) 9 | 10 | 11 | #TOFILL 12 | 13 | if __name__ == '__main__': 14 | param = [ 15 | (67,), 16 | (90,), 17 | (55,), 18 | (90,), 19 | (83,), 20 | (32,), 21 | (58,), 22 | (38,), 23 | (87,), 24 | (87,) 25 | ] 26 | n_success = 0 27 | for i, parameters_set in enumerate(param): 28 | if f_filled(*parameters_set) == f_gold(*parameters_set): 29 | n_success+=1 30 | print("#Results: %i, %i" % (n_success, len(param))) -------------------------------------------------------------------------------- /transcoder/transcoder/data/evaluation/geeks_for_geeks_successful_test_scripts/python/CHECK_WHETHER_GIVEN_NUMBER_EVEN_ODD_1.py: -------------------------------------------------------------------------------- 1 | # Copyright (c) 2019-present, Facebook, Inc. 2 | # All rights reserved. 3 | # 4 | # This source code is licensed under the license found in the 5 | # LICENSE file in the root directory of this source tree. 6 | # 7 | def f_gold ( n ) : 8 | return ( not ( n & 1 ) ) 9 | 10 | 11 | #TOFILL 12 | 13 | if __name__ == '__main__': 14 | param = [ 15 | (57,), 16 | (73,), 17 | (79,), 18 | (36,), 19 | (71,), 20 | (23,), 21 | (41,), 22 | (66,), 23 | (46,), 24 | (50,) 25 | ] 26 | n_success = 0 27 | for i, parameters_set in enumerate(param): 28 | if f_filled(*parameters_set) == f_gold(*parameters_set): 29 | n_success+=1 30 | print("#Results: %i, %i" % (n_success, len(param))) -------------------------------------------------------------------------------- /transcoder/transcoder/data/evaluation/geeks_for_geeks_successful_test_scripts/python/CHECK_WHETHER_TRIANGLE_VALID_NOT_SIDES_GIVEN.py: -------------------------------------------------------------------------------- 1 | # Copyright (c) 2019-present, Facebook, Inc. 2 | # All rights reserved. 3 | # 4 | # This source code is licensed under the license found in the 5 | # LICENSE file in the root directory of this source tree. 6 | # 7 | def f_gold ( a , b , c ) : 8 | if ( a + b <= c ) or ( a + c <= b ) or ( b + c <= a ) : 9 | return False 10 | else : 11 | return True 12 | 13 | 14 | #TOFILL 15 | 16 | if __name__ == '__main__': 17 | param = [ 18 | (29,19,52,), 19 | (83,34,49,), 20 | (48,14,65,), 21 | (59,12,94,), 22 | (56,39,22,), 23 | (68,85,9,), 24 | (63,36,41,), 25 | (95,34,37,), 26 | (2,90,27,), 27 | (11,16,1,) 28 | ] 29 | n_success = 0 30 | for i, parameters_set in enumerate(param): 31 | if f_filled(*parameters_set) == f_gold(*parameters_set): 32 | n_success+=1 33 | print("#Results: %i, %i" % (n_success, len(param))) -------------------------------------------------------------------------------- /transcoder/transcoder/data/evaluation/geeks_for_geeks_successful_test_scripts/python/COMPUTE_AVERAGE_TWO_NUMBERS_WITHOUT_OVERFLOW.py: -------------------------------------------------------------------------------- 1 | # Copyright (c) 2019-present, Facebook, Inc. 2 | # All rights reserved. 3 | # 4 | # This source code is licensed under the license found in the 5 | # LICENSE file in the root directory of this source tree. 6 | # 7 | from math import floor 8 | 9 | def f_gold ( a , b ) : 10 | return floor ( ( a + b ) / 2 ) 11 | 12 | 13 | #TOFILL 14 | 15 | if __name__ == '__main__': 16 | param = [ 17 | (1,44,), 18 | (6,61,), 19 | (75,20,), 20 | (51,17,), 21 | (19,25,), 22 | (82,98,), 23 | (72,21,), 24 | (48,41,), 25 | (12,17,), 26 | (41,80,) 27 | ] 28 | n_success = 0 29 | for i, parameters_set in enumerate(param): 30 | if f_filled(*parameters_set) == f_gold(*parameters_set): 31 | n_success+=1 32 | print("#Results: %i, %i" % (n_success, len(param))) -------------------------------------------------------------------------------- /transcoder/transcoder/data/evaluation/geeks_for_geeks_successful_test_scripts/python/COMPUTE_AVERAGE_TWO_NUMBERS_WITHOUT_OVERFLOW_1.py: -------------------------------------------------------------------------------- 1 | # Copyright (c) 2019-present, Facebook, Inc. 2 | # All rights reserved. 3 | # 4 | # This source code is licensed under the license found in the 5 | # LICENSE file in the root directory of this source tree. 6 | # 7 | def f_gold ( a , b ) : 8 | return ( a // 2 ) + ( b // 2 ) + ( ( a % 2 + b % 2 ) // 2 ) 9 | 10 | 11 | #TOFILL 12 | 13 | if __name__ == '__main__': 14 | param = [ 15 | (9,81,), 16 | (68,79,), 17 | (51,2,), 18 | (31,49,), 19 | (14,10,), 20 | (73,9,), 21 | (51,13,), 22 | (75,67,), 23 | (98,51,), 24 | (83,74,) 25 | ] 26 | n_success = 0 27 | for i, parameters_set in enumerate(param): 28 | if f_filled(*parameters_set) == f_gold(*parameters_set): 29 | n_success+=1 30 | print("#Results: %i, %i" % (n_success, len(param))) -------------------------------------------------------------------------------- /transcoder/transcoder/data/evaluation/geeks_for_geeks_successful_test_scripts/python/COMPUTE_MODULUS_DIVISION_BY_A_POWER_OF_2_NUMBER.py: -------------------------------------------------------------------------------- 1 | # Copyright (c) 2019-present, Facebook, Inc. 2 | # All rights reserved. 3 | # 4 | # This source code is licensed under the license found in the 5 | # LICENSE file in the root directory of this source tree. 6 | # 7 | def f_gold ( n , d ) : 8 | return ( n & ( d - 1 ) ) 9 | 10 | 11 | #TOFILL 12 | 13 | if __name__ == '__main__': 14 | param = [ 15 | (54,59,), 16 | (39,84,), 17 | (35,81,), 18 | (9,60,), 19 | (62,68,), 20 | (16,16,), 21 | (93,96,), 22 | (32,38,), 23 | (39,62,), 24 | (63,16,) 25 | ] 26 | n_success = 0 27 | for i, parameters_set in enumerate(param): 28 | if f_filled(*parameters_set) == f_gold(*parameters_set): 29 | n_success+=1 30 | print("#Results: %i, %i" % (n_success, len(param))) -------------------------------------------------------------------------------- /transcoder/transcoder/data/evaluation/geeks_for_geeks_successful_test_scripts/python/COMPUTE_N_UNDER_MODULO_P.py: -------------------------------------------------------------------------------- 1 | # Copyright (c) 2019-present, Facebook, Inc. 2 | # All rights reserved. 3 | # 4 | # This source code is licensed under the license found in the 5 | # LICENSE file in the root directory of this source tree. 6 | # 7 | def f_gold ( n , p ) : 8 | if n >= p : 9 | return 0 10 | result = 1 11 | for i in range ( 1 , n + 1 ) : 12 | result = ( result * i ) % p 13 | return result 14 | 15 | 16 | #TOFILL 17 | 18 | if __name__ == '__main__': 19 | param = [ 20 | (85,18,), 21 | (14,13,), 22 | (83,21,), 23 | (30,35,), 24 | (96,51,), 25 | (55,58,), 26 | (82,71,), 27 | (12,74,), 28 | (38,3,), 29 | (46,73,) 30 | ] 31 | n_success = 0 32 | for i, parameters_set in enumerate(param): 33 | if f_filled(*parameters_set) == f_gold(*parameters_set): 34 | n_success+=1 35 | print("#Results: %i, %i" % (n_success, len(param))) -------------------------------------------------------------------------------- /transcoder/transcoder/data/evaluation/geeks_for_geeks_successful_test_scripts/python/COUNT_FREQUENCY_K_MATRIX_SIZE_N_MATRIXI_J_IJ.py: -------------------------------------------------------------------------------- 1 | # Copyright (c) 2019-present, Facebook, Inc. 2 | # All rights reserved. 3 | # 4 | # This source code is licensed under the license found in the 5 | # LICENSE file in the root directory of this source tree. 6 | # 7 | def f_gold ( n , k ) : 8 | if ( n + 1 >= k ) : 9 | return ( k - 1 ) 10 | else : 11 | return ( 2 * n + 1 - k ) 12 | 13 | 14 | #TOFILL 15 | 16 | if __name__ == '__main__': 17 | param = [ 18 | (90,74,), 19 | (86,36,), 20 | (92,38,), 21 | (72,71,), 22 | (25,57,), 23 | (11,53,), 24 | (94,80,), 25 | (91,75,), 26 | (66,58,), 27 | (34,88,) 28 | ] 29 | n_success = 0 30 | for i, parameters_set in enumerate(param): 31 | if f_filled(*parameters_set) == f_gold(*parameters_set): 32 | n_success+=1 33 | print("#Results: %i, %i" % (n_success, len(param))) -------------------------------------------------------------------------------- /transcoder/transcoder/data/evaluation/geeks_for_geeks_successful_test_scripts/python/COUNT_SET_BITS_IN_AN_INTEGER.py: -------------------------------------------------------------------------------- 1 | # Copyright (c) 2019-present, Facebook, Inc. 2 | # All rights reserved. 3 | # 4 | # This source code is licensed under the license found in the 5 | # LICENSE file in the root directory of this source tree. 6 | # 7 | def f_gold ( n ) : 8 | count = 0 9 | while ( n ) : 10 | count += n & 1 11 | n >>= 1 12 | return count 13 | 14 | 15 | #TOFILL 16 | 17 | if __name__ == '__main__': 18 | param = [ 19 | (58,), 20 | (92,), 21 | (73,), 22 | (52,), 23 | (24,), 24 | (14,), 25 | (58,), 26 | (11,), 27 | (8,), 28 | (52,) 29 | ] 30 | n_success = 0 31 | for i, parameters_set in enumerate(param): 32 | if f_filled(*parameters_set) == f_gold(*parameters_set): 33 | n_success+=1 34 | print("#Results: %i, %i" % (n_success, len(param))) -------------------------------------------------------------------------------- /transcoder/transcoder/data/evaluation/geeks_for_geeks_successful_test_scripts/python/COUNT_SET_BITS_IN_AN_INTEGER_1.py: -------------------------------------------------------------------------------- 1 | # Copyright (c) 2019-present, Facebook, Inc. 2 | # All rights reserved. 3 | # 4 | # This source code is licensed under the license found in the 5 | # LICENSE file in the root directory of this source tree. 6 | # 7 | def f_gold ( n ) : 8 | if ( n == 0 ) : 9 | return 0 10 | else : 11 | return ( n & 1 ) + f_gold ( n >> 1 ) 12 | 13 | 14 | #TOFILL 15 | 16 | if __name__ == '__main__': 17 | param = [ 18 | (43,), 19 | (94,), 20 | (72,), 21 | (86,), 22 | (42,), 23 | (33,), 24 | (8,), 25 | (74,), 26 | (29,), 27 | (34,) 28 | ] 29 | n_success = 0 30 | for i, parameters_set in enumerate(param): 31 | if f_filled(*parameters_set) == f_gold(*parameters_set): 32 | n_success+=1 33 | print("#Results: %i, %i" % (n_success, len(param))) -------------------------------------------------------------------------------- /transcoder/transcoder/data/evaluation/geeks_for_geeks_successful_test_scripts/python/COUNT_SET_BITS_IN_AN_INTEGER_2.py: -------------------------------------------------------------------------------- 1 | # Copyright (c) 2019-present, Facebook, Inc. 2 | # All rights reserved. 3 | # 4 | # This source code is licensed under the license found in the 5 | # LICENSE file in the root directory of this source tree. 6 | # 7 | def f_gold ( n ) : 8 | count = 0 9 | while ( n ) : 10 | n &= ( n - 1 ) 11 | count += 1 12 | return count 13 | 14 | 15 | #TOFILL 16 | 17 | if __name__ == '__main__': 18 | param = [ 19 | (32,), 20 | (94,), 21 | (33,), 22 | (99,), 23 | (17,), 24 | (64,), 25 | (80,), 26 | (42,), 27 | (12,), 28 | (86,) 29 | ] 30 | n_success = 0 31 | for i, parameters_set in enumerate(param): 32 | if f_filled(*parameters_set) == f_gold(*parameters_set): 33 | n_success+=1 34 | print("#Results: %i, %i" % (n_success, len(param))) -------------------------------------------------------------------------------- /transcoder/transcoder/data/evaluation/geeks_for_geeks_successful_test_scripts/python/COUNT_SET_BITS_IN_AN_INTEGER_3.py: -------------------------------------------------------------------------------- 1 | # Copyright (c) 2019-present, Facebook, Inc. 2 | # All rights reserved. 3 | # 4 | # This source code is licensed under the license found in the 5 | # LICENSE file in the root directory of this source tree. 6 | # 7 | def f_gold ( n ) : 8 | if ( n == 0 ) : 9 | return 0 10 | else : 11 | return 1 + f_gold ( n & ( n - 1 ) ) 12 | 13 | 14 | #TOFILL 15 | 16 | if __name__ == '__main__': 17 | param = [ 18 | (6,), 19 | (58,), 20 | (90,), 21 | (69,), 22 | (15,), 23 | (54,), 24 | (60,), 25 | (51,), 26 | (46,), 27 | (91,) 28 | ] 29 | n_success = 0 30 | for i, parameters_set in enumerate(param): 31 | if f_filled(*parameters_set) == f_gold(*parameters_set): 32 | n_success+=1 33 | print("#Results: %i, %i" % (n_success, len(param))) -------------------------------------------------------------------------------- /transcoder/transcoder/data/evaluation/geeks_for_geeks_successful_test_scripts/python/COUNT_STRINGS_CAN_FORMED_USING_B_C_GIVEN_CONSTRAINTS_1.py: -------------------------------------------------------------------------------- 1 | # Copyright (c) 2019-present, Facebook, Inc. 2 | # All rights reserved. 3 | # 4 | # This source code is licensed under the license found in the 5 | # LICENSE file in the root directory of this source tree. 6 | # 7 | def f_gold ( n ) : 8 | return ( 1 + ( n * 2 ) + ( n * ( ( n * n ) - 1 ) // 2 ) ) 9 | 10 | 11 | #TOFILL 12 | 13 | if __name__ == '__main__': 14 | param = [ 15 | (55,), 16 | (36,), 17 | (69,), 18 | (92,), 19 | (73,), 20 | (16,), 21 | (88,), 22 | (19,), 23 | (66,), 24 | (68,) 25 | ] 26 | n_success = 0 27 | for i, parameters_set in enumerate(param): 28 | if f_filled(*parameters_set) == f_gold(*parameters_set): 29 | n_success+=1 30 | print("#Results: %i, %i" % (n_success, len(param))) -------------------------------------------------------------------------------- /transcoder/transcoder/data/evaluation/geeks_for_geeks_successful_test_scripts/python/COUNT_TRAILING_ZEROES_FACTORIAL_NUMBER.py: -------------------------------------------------------------------------------- 1 | # Copyright (c) 2019-present, Facebook, Inc. 2 | # All rights reserved. 3 | # 4 | # This source code is licensed under the license found in the 5 | # LICENSE file in the root directory of this source tree. 6 | # 7 | def f_gold ( n ) : 8 | count = 0 9 | i = 5 10 | while ( n / i >= 1 ) : 11 | count += int ( n / i ) 12 | i *= 5 13 | return int ( count ) 14 | 15 | 16 | #TOFILL 17 | 18 | if __name__ == '__main__': 19 | param = [ 20 | (9,), 21 | (43,), 22 | (50,), 23 | (32,), 24 | (37,), 25 | (51,), 26 | (33,), 27 | (49,), 28 | (1,), 29 | (75,) 30 | ] 31 | n_success = 0 32 | for i, parameters_set in enumerate(param): 33 | if f_filled(*parameters_set) == f_gold(*parameters_set): 34 | n_success+=1 35 | print("#Results: %i, %i" % (n_success, len(param))) -------------------------------------------------------------------------------- /transcoder/transcoder/data/evaluation/geeks_for_geeks_successful_test_scripts/python/C_PROGRAM_CONCATENATE_STRING_GIVEN_NUMBER_TIMES.py: -------------------------------------------------------------------------------- 1 | # Copyright (c) 2019-present, Facebook, Inc. 2 | # All rights reserved. 3 | # 4 | # This source code is licensed under the license found in the 5 | # LICENSE file in the root directory of this source tree. 6 | # 7 | def f_gold ( s , n ) : 8 | s1 = s 9 | for i in range ( 1 , n ) : 10 | s += s1 11 | return s 12 | 13 | 14 | #TOFILL 15 | 16 | if __name__ == '__main__': 17 | param = [ 18 | ('LPWsaI',41,), 19 | ('9037515104',72,), 20 | ('00100010010111',95,), 21 | ('SbwipuE',27,), 22 | ('574314109',5,), 23 | ('1101',70,), 24 | ('f',91,), 25 | ('068',50,), 26 | ('000011001',38,), 27 | ('BWbUtIkC',79,) 28 | ] 29 | n_success = 0 30 | for i, parameters_set in enumerate(param): 31 | if f_filled(*parameters_set) == f_gold(*parameters_set): 32 | n_success+=1 33 | print("#Results: %i, %i" % (n_success, len(param))) -------------------------------------------------------------------------------- /transcoder/transcoder/data/evaluation/geeks_for_geeks_successful_test_scripts/python/C_PROGRAM_FACTORIAL_NUMBER.py: -------------------------------------------------------------------------------- 1 | # Copyright (c) 2019-present, Facebook, Inc. 2 | # All rights reserved. 3 | # 4 | # This source code is licensed under the license found in the 5 | # LICENSE file in the root directory of this source tree. 6 | # 7 | def f_gold ( n ) : 8 | return 1 if ( n == 1 or n == 0 ) else n * f_gold ( n - 1 ) ; 9 | 10 | 11 | #TOFILL 12 | 13 | if __name__ == '__main__': 14 | param = [ 15 | (84,), 16 | (41,), 17 | (5,), 18 | (38,), 19 | (79,), 20 | (80,), 21 | (64,), 22 | (62,), 23 | (24,), 24 | (12,) 25 | ] 26 | n_success = 0 27 | for i, parameters_set in enumerate(param): 28 | if f_filled(*parameters_set) == f_gold(*parameters_set): 29 | n_success+=1 30 | print("#Results: %i, %i" % (n_success, len(param))) -------------------------------------------------------------------------------- /transcoder/transcoder/data/evaluation/geeks_for_geeks_successful_test_scripts/python/C_PROGRAM_FACTORIAL_NUMBER_1.py: -------------------------------------------------------------------------------- 1 | # Copyright (c) 2019-present, Facebook, Inc. 2 | # All rights reserved. 3 | # 4 | # This source code is licensed under the license found in the 5 | # LICENSE file in the root directory of this source tree. 6 | # 7 | def f_gold ( n ) : 8 | return 1 if ( n == 1 or n == 0 ) else n * f_gold ( n - 1 ) ; 9 | 10 | 11 | #TOFILL 12 | 13 | if __name__ == '__main__': 14 | param = [ 15 | (15,), 16 | (7,), 17 | (16,), 18 | (67,), 19 | (71,), 20 | (16,), 21 | (77,), 22 | (27,), 23 | (37,), 24 | (73,) 25 | ] 26 | n_success = 0 27 | for i, parameters_set in enumerate(param): 28 | if f_filled(*parameters_set) == f_gold(*parameters_set): 29 | n_success+=1 30 | print("#Results: %i, %i" % (n_success, len(param))) -------------------------------------------------------------------------------- /transcoder/transcoder/data/evaluation/geeks_for_geeks_successful_test_scripts/python/C_PROGRAM_FACTORIAL_NUMBER_2.py: -------------------------------------------------------------------------------- 1 | # Copyright (c) 2019-present, Facebook, Inc. 2 | # All rights reserved. 3 | # 4 | # This source code is licensed under the license found in the 5 | # LICENSE file in the root directory of this source tree. 6 | # 7 | def f_gold ( n ) : 8 | return 1 if ( n == 1 or n == 0 ) else n * f_gold ( n - 1 ) 9 | 10 | 11 | #TOFILL 12 | 13 | if __name__ == '__main__': 14 | param = [ 15 | (66,), 16 | (93,), 17 | (39,), 18 | (93,), 19 | (68,), 20 | (20,), 21 | (37,), 22 | (52,), 23 | (52,), 24 | (19,) 25 | ] 26 | n_success = 0 27 | for i, parameters_set in enumerate(param): 28 | if f_filled(*parameters_set) == f_gold(*parameters_set): 29 | n_success+=1 30 | print("#Results: %i, %i" % (n_success, len(param))) -------------------------------------------------------------------------------- /transcoder/transcoder/data/evaluation/geeks_for_geeks_successful_test_scripts/python/C_PROGRAM_FIND_AREA_CIRCLE.py: -------------------------------------------------------------------------------- 1 | # Copyright (c) 2019-present, Facebook, Inc. 2 | # All rights reserved. 3 | # 4 | # This source code is licensed under the license found in the 5 | # LICENSE file in the root directory of this source tree. 6 | # 7 | def f_gold ( r ) : 8 | PI = 3.142 9 | return PI * ( r * r ) ; 10 | 11 | 12 | #TOFILL 13 | 14 | if __name__ == '__main__': 15 | param = [ 16 | (93,), 17 | (83,), 18 | (51,), 19 | (77,), 20 | (13,), 21 | (34,), 22 | (49,), 23 | (12,), 24 | (68,), 25 | (80,) 26 | ] 27 | n_success = 0 28 | for i, parameters_set in enumerate(param): 29 | if abs(1 - (0.0000001 + abs(f_gold(*parameters_set))) / (abs(f_filled(*parameters_set)) + 0.0000001)) < 0.001: 30 | n_success+=1 31 | print("#Results: %i, %i" % (n_success, len(param))) -------------------------------------------------------------------------------- /transcoder/transcoder/data/evaluation/geeks_for_geeks_successful_test_scripts/python/DETECT_IF_TWO_INTEGERS_HAVE_OPPOSITE_SIGNS.py: -------------------------------------------------------------------------------- 1 | # Copyright (c) 2019-present, Facebook, Inc. 2 | # All rights reserved. 3 | # 4 | # This source code is licensed under the license found in the 5 | # LICENSE file in the root directory of this source tree. 6 | # 7 | def f_gold ( x , y ) : 8 | return ( ( x ^ y ) < 0 ) ; 9 | 10 | 11 | #TOFILL 12 | 13 | if __name__ == '__main__': 14 | param = [ 15 | (59,-99,), 16 | (-20,-21,), 17 | (-100,79,), 18 | (54,-49,), 19 | (-16,16,), 20 | (-23,-68,), 21 | (93,37,), 22 | (24,-61,), 23 | (-8,69,), 24 | (29,10,) 25 | ] 26 | n_success = 0 27 | for i, parameters_set in enumerate(param): 28 | if f_filled(*parameters_set) == f_gold(*parameters_set): 29 | n_success+=1 30 | print("#Results: %i, %i" % (n_success, len(param))) -------------------------------------------------------------------------------- /transcoder/transcoder/data/evaluation/geeks_for_geeks_successful_test_scripts/python/DIVISIBILITY_9_USING_BITWISE_OPERATORS.py: -------------------------------------------------------------------------------- 1 | # Copyright (c) 2019-present, Facebook, Inc. 2 | # All rights reserved. 3 | # 4 | # This source code is licensed under the license found in the 5 | # LICENSE file in the root directory of this source tree. 6 | # 7 | def f_gold ( n ) : 8 | if ( n == 0 or n == 9 ) : 9 | return True 10 | if ( n < 9 ) : 11 | return False 12 | return f_gold ( ( int ) ( n >> 3 ) - ( int ) ( n & 7 ) ) 13 | 14 | 15 | #TOFILL 16 | 17 | if __name__ == '__main__': 18 | param = [ 19 | (96,), 20 | (85,), 21 | (54,), 22 | (14,), 23 | (47,), 24 | (11,), 25 | (49,), 26 | (99,), 27 | (28,), 28 | (82,) 29 | ] 30 | n_success = 0 31 | for i, parameters_set in enumerate(param): 32 | if f_filled(*parameters_set) == f_gold(*parameters_set): 33 | n_success+=1 34 | print("#Results: %i, %i" % (n_success, len(param))) -------------------------------------------------------------------------------- /transcoder/transcoder/data/evaluation/geeks_for_geeks_successful_test_scripts/python/DOUBLE_FACTORIAL.py: -------------------------------------------------------------------------------- 1 | # Copyright (c) 2019-present, Facebook, Inc. 2 | # All rights reserved. 3 | # 4 | # This source code is licensed under the license found in the 5 | # LICENSE file in the root directory of this source tree. 6 | # 7 | def f_gold ( n ) : 8 | if ( n == 0 or n == 1 ) : 9 | return 1 ; 10 | return n * f_gold ( n - 2 ) ; 11 | 12 | 13 | #TOFILL 14 | 15 | if __name__ == '__main__': 16 | param = [ 17 | (52,), 18 | (93,), 19 | (15,), 20 | (72,), 21 | (61,), 22 | (21,), 23 | (83,), 24 | (87,), 25 | (75,), 26 | (75,) 27 | ] 28 | n_success = 0 29 | for i, parameters_set in enumerate(param): 30 | if f_filled(*parameters_set) == f_gold(*parameters_set): 31 | n_success+=1 32 | print("#Results: %i, %i" % (n_success, len(param))) -------------------------------------------------------------------------------- /transcoder/transcoder/data/evaluation/geeks_for_geeks_successful_test_scripts/python/DOUBLE_FACTORIAL_1.py: -------------------------------------------------------------------------------- 1 | # Copyright (c) 2019-present, Facebook, Inc. 2 | # All rights reserved. 3 | # 4 | # This source code is licensed under the license found in the 5 | # LICENSE file in the root directory of this source tree. 6 | # 7 | def f_gold ( n ) : 8 | res = 1 ; 9 | for i in range ( n , - 1 , - 2 ) : 10 | if ( i == 0 or i == 1 ) : 11 | return res ; 12 | else : 13 | res *= i ; 14 | 15 | 16 | #TOFILL 17 | 18 | if __name__ == '__main__': 19 | param = [ 20 | (88,), 21 | (24,), 22 | (3,), 23 | (22,), 24 | (53,), 25 | (2,), 26 | (88,), 27 | (30,), 28 | (38,), 29 | (2,) 30 | ] 31 | n_success = 0 32 | for i, parameters_set in enumerate(param): 33 | if f_filled(*parameters_set) == f_gold(*parameters_set): 34 | n_success+=1 35 | print("#Results: %i, %i" % (n_success, len(param))) -------------------------------------------------------------------------------- /transcoder/transcoder/data/evaluation/geeks_for_geeks_successful_test_scripts/python/DYCK_PATH.py: -------------------------------------------------------------------------------- 1 | # Copyright (c) 2019-present, Facebook, Inc. 2 | # All rights reserved. 3 | # 4 | # This source code is licensed under the license found in the 5 | # LICENSE file in the root directory of this source tree. 6 | # 7 | def f_gold ( n ) : 8 | res = 1 9 | for i in range ( 0 , n ) : 10 | res *= ( 2 * n - i ) 11 | res /= ( i + 1 ) 12 | return res / ( n + 1 ) 13 | 14 | 15 | #TOFILL 16 | 17 | if __name__ == '__main__': 18 | param = [ 19 | (72,), 20 | (90,), 21 | (61,), 22 | (28,), 23 | (70,), 24 | (13,), 25 | (7,), 26 | (98,), 27 | (99,), 28 | (67,) 29 | ] 30 | n_success = 0 31 | for i, parameters_set in enumerate(param): 32 | if f_filled(*parameters_set) == f_gold(*parameters_set): 33 | n_success+=1 34 | print("#Results: %i, %i" % (n_success, len(param))) -------------------------------------------------------------------------------- /transcoder/transcoder/data/evaluation/geeks_for_geeks_successful_test_scripts/python/DYNAMIC_PROGRAMMING_SET_36_CUT_A_ROPE_TO_MAXIMIZE_PRODUCT_1.py: -------------------------------------------------------------------------------- 1 | # Copyright (c) 2019-present, Facebook, Inc. 2 | # All rights reserved. 3 | # 4 | # This source code is licensed under the license found in the 5 | # LICENSE file in the root directory of this source tree. 6 | # 7 | def f_gold ( n ) : 8 | if ( n == 2 or n == 3 ) : 9 | return ( n - 1 ) 10 | res = 1 11 | while ( n > 4 ) : 12 | n -= 3 ; 13 | res *= 3 ; 14 | return ( n * res ) 15 | 16 | 17 | #TOFILL 18 | 19 | if __name__ == '__main__': 20 | param = [ 21 | (62,), 22 | (53,), 23 | (8,), 24 | (6,), 25 | (35,), 26 | (35,), 27 | (46,), 28 | (74,), 29 | (69,), 30 | (3,) 31 | ] 32 | n_success = 0 33 | for i, parameters_set in enumerate(param): 34 | if f_filled(*parameters_set) == f_gold(*parameters_set): 35 | n_success+=1 36 | print("#Results: %i, %i" % (n_success, len(param))) -------------------------------------------------------------------------------- /transcoder/transcoder/data/evaluation/geeks_for_geeks_successful_test_scripts/python/EFFICIENT_WAY_CHECK_WHETHER_N_TH_FIBONACCI_NUMBER_MULTIPLE_10.py: -------------------------------------------------------------------------------- 1 | # Copyright (c) 2019-present, Facebook, Inc. 2 | # All rights reserved. 3 | # 4 | # This source code is licensed under the license found in the 5 | # LICENSE file in the root directory of this source tree. 6 | # 7 | def f_gold ( n ) : 8 | return ( n % 15 == 0 ) 9 | 10 | 11 | #TOFILL 12 | 13 | if __name__ == '__main__': 14 | param = [ 15 | (30,), 16 | (-30,), 17 | (60,), 18 | (90,), 19 | (99,), 20 | (32,), 21 | (21,), 22 | (65,), 23 | (21,), 24 | (99,) 25 | ] 26 | n_success = 0 27 | for i, parameters_set in enumerate(param): 28 | if f_filled(*parameters_set) == f_gold(*parameters_set): 29 | n_success+=1 30 | print("#Results: %i, %i" % (n_success, len(param))) -------------------------------------------------------------------------------- /transcoder/transcoder/data/evaluation/geeks_for_geeks_successful_test_scripts/python/EFFICIENT_WAY_TO_MULTIPLY_WITH_7.py: -------------------------------------------------------------------------------- 1 | # Copyright (c) 2019-present, Facebook, Inc. 2 | # All rights reserved. 3 | # 4 | # This source code is licensed under the license found in the 5 | # LICENSE file in the root directory of this source tree. 6 | # 7 | def f_gold ( n ) : 8 | return ( ( n << 3 ) - n ) 9 | 10 | 11 | #TOFILL 12 | 13 | if __name__ == '__main__': 14 | param = [ 15 | (41,), 16 | (42,), 17 | (62,), 18 | (4,), 19 | (31,), 20 | (75,), 21 | (5,), 22 | (75,), 23 | (85,), 24 | (19,) 25 | ] 26 | n_success = 0 27 | for i, parameters_set in enumerate(param): 28 | if f_filled(*parameters_set) == f_gold(*parameters_set): 29 | n_success+=1 30 | print("#Results: %i, %i" % (n_success, len(param))) -------------------------------------------------------------------------------- /transcoder/transcoder/data/evaluation/geeks_for_geeks_successful_test_scripts/python/EULERS_CRITERION_CHECK_IF_SQUARE_ROOT_UNDER_MODULO_P_EXISTS.py: -------------------------------------------------------------------------------- 1 | # Copyright (c) 2019-present, Facebook, Inc. 2 | # All rights reserved. 3 | # 4 | # This source code is licensed under the license found in the 5 | # LICENSE file in the root directory of this source tree. 6 | # 7 | def f_gold ( n , p ) : 8 | n = n % p 9 | for x in range ( 2 , p , 1 ) : 10 | if ( ( x * x ) % p == n ) : 11 | return True 12 | return False 13 | 14 | 15 | #TOFILL 16 | 17 | if __name__ == '__main__': 18 | param = [ 19 | (71,78,), 20 | (85,75,), 21 | (4,35,), 22 | (20,99,), 23 | (71,29,), 24 | (72,88,), 25 | (36,54,), 26 | (95,52,), 27 | (83,33,), 28 | (72,13,) 29 | ] 30 | n_success = 0 31 | for i, parameters_set in enumerate(param): 32 | if f_filled(*parameters_set) == f_gold(*parameters_set): 33 | n_success+=1 34 | print("#Results: %i, %i" % (n_success, len(param))) -------------------------------------------------------------------------------- /transcoder/transcoder/data/evaluation/geeks_for_geeks_successful_test_scripts/python/FINDING_POWER_PRIME_NUMBER_P_N.py: -------------------------------------------------------------------------------- 1 | # Copyright (c) 2019-present, Facebook, Inc. 2 | # All rights reserved. 3 | # 4 | # This source code is licensed under the license found in the 5 | # LICENSE file in the root directory of this source tree. 6 | # 7 | def f_gold ( n , p ) : 8 | ans = 0 ; 9 | temp = p ; 10 | while ( temp <= n ) : 11 | ans += n / temp ; 12 | temp = temp * p ; 13 | return ans ; 14 | 15 | 16 | #TOFILL 17 | 18 | if __name__ == '__main__': 19 | param = [ 20 | (49,30,), 21 | (80,25,), 22 | (10,9,), 23 | (81,57,), 24 | (11,4,), 25 | (45,34,), 26 | (86,90,), 27 | (27,78,), 28 | (80,60,), 29 | (97,31,) 30 | ] 31 | n_success = 0 32 | for i, parameters_set in enumerate(param): 33 | if f_filled(*parameters_set) == f_gold(*parameters_set): 34 | n_success+=1 35 | print("#Results: %i, %i" % (n_success, len(param))) -------------------------------------------------------------------------------- /transcoder/transcoder/data/evaluation/geeks_for_geeks_successful_test_scripts/python/FINDING_POWER_PRIME_NUMBER_P_N_1.py: -------------------------------------------------------------------------------- 1 | # Copyright (c) 2019-present, Facebook, Inc. 2 | # All rights reserved. 3 | # 4 | # This source code is licensed under the license found in the 5 | # LICENSE file in the root directory of this source tree. 6 | # 7 | def f_gold ( n , p ) : 8 | ans = 0 9 | temp = p 10 | while ( temp <= n ) : 11 | ans += n / temp 12 | temp = temp * p 13 | return int ( ans ) 14 | 15 | 16 | #TOFILL 17 | 18 | if __name__ == '__main__': 19 | param = [ 20 | (76,43,), 21 | (77,91,), 22 | (9,42,), 23 | (59,67,), 24 | (8,52,), 25 | (97,8,), 26 | (78,24,), 27 | (41,88,), 28 | (72,61,), 29 | (71,28,) 30 | ] 31 | n_success = 0 32 | for i, parameters_set in enumerate(param): 33 | if f_filled(*parameters_set) == f_gold(*parameters_set): 34 | n_success+=1 35 | print("#Results: %i, %i" % (n_success, len(param))) -------------------------------------------------------------------------------- /transcoder/transcoder/data/evaluation/geeks_for_geeks_successful_test_scripts/python/FIND_FIRST_NATURAL_NUMBER_WHOSE_FACTORIAL_DIVISIBLE_X.py: -------------------------------------------------------------------------------- 1 | # Copyright (c) 2019-present, Facebook, Inc. 2 | # All rights reserved. 3 | # 4 | # This source code is licensed under the license found in the 5 | # LICENSE file in the root directory of this source tree. 6 | # 7 | def f_gold ( x ) : 8 | i = 1 ; 9 | fact = 1 ; 10 | for i in range ( 1 , x ) : 11 | fact = fact * i 12 | if ( fact % x == 0 ) : 13 | break 14 | return i 15 | 16 | 17 | #TOFILL 18 | 19 | if __name__ == '__main__': 20 | param = [ 21 | (67,), 22 | (47,), 23 | (57,), 24 | (89,), 25 | (67,), 26 | (40,), 27 | (16,), 28 | (83,), 29 | (93,), 30 | (43,) 31 | ] 32 | n_success = 0 33 | for i, parameters_set in enumerate(param): 34 | if f_filled(*parameters_set) == f_gold(*parameters_set): 35 | n_success+=1 36 | print("#Results: %i, %i" % (n_success, len(param))) -------------------------------------------------------------------------------- /transcoder/transcoder/data/evaluation/geeks_for_geeks_successful_test_scripts/python/FIND_INDEX_GIVEN_FIBONACCI_NUMBER_CONSTANT_TIME_1.py: -------------------------------------------------------------------------------- 1 | # Copyright (c) 2019-present, Facebook, Inc. 2 | # All rights reserved. 3 | # 4 | # This source code is licensed under the license found in the 5 | # LICENSE file in the root directory of this source tree. 6 | # 7 | import math 8 | 9 | def f_gold ( n ) : 10 | fibo = 2.078087 * math.log ( n ) + 1.672276 11 | return round ( fibo ) 12 | 13 | 14 | #TOFILL 15 | 16 | if __name__ == '__main__': 17 | param = [ 18 | (20,), 19 | (95,), 20 | (39,), 21 | (21,), 22 | (94,), 23 | (79,), 24 | (56,), 25 | (62,), 26 | (23,), 27 | (3,) 28 | ] 29 | n_success = 0 30 | for i, parameters_set in enumerate(param): 31 | if f_filled(*parameters_set) == f_gold(*parameters_set): 32 | n_success+=1 33 | print("#Results: %i, %i" % (n_success, len(param))) -------------------------------------------------------------------------------- /transcoder/transcoder/data/evaluation/geeks_for_geeks_successful_test_scripts/python/FIND_MINIMUM_SUM_FACTORS_NUMBER.py: -------------------------------------------------------------------------------- 1 | # Copyright (c) 2019-present, Facebook, Inc. 2 | # All rights reserved. 3 | # 4 | # This source code is licensed under the license found in the 5 | # LICENSE file in the root directory of this source tree. 6 | # 7 | def f_gold ( num ) : 8 | sum = 0 9 | i = 2 10 | while ( i * i <= num ) : 11 | while ( num % i == 0 ) : 12 | sum += i 13 | num /= i 14 | i += 1 15 | sum += num 16 | return sum 17 | 18 | 19 | #TOFILL 20 | 21 | if __name__ == '__main__': 22 | param = [ 23 | (83,), 24 | (88,), 25 | (60,), 26 | (6,), 27 | (26,), 28 | (98,), 29 | (38,), 30 | (90,), 31 | (76,), 32 | (66,) 33 | ] 34 | n_success = 0 35 | for i, parameters_set in enumerate(param): 36 | if f_filled(*parameters_set) == f_gold(*parameters_set): 37 | n_success+=1 38 | print("#Results: %i, %i" % (n_success, len(param))) -------------------------------------------------------------------------------- /transcoder/transcoder/data/evaluation/geeks_for_geeks_successful_test_scripts/python/FIND_PERIMETER_CYLINDER.py: -------------------------------------------------------------------------------- 1 | # Copyright (c) 2019-present, Facebook, Inc. 2 | # All rights reserved. 3 | # 4 | # This source code is licensed under the license found in the 5 | # LICENSE file in the root directory of this source tree. 6 | # 7 | def f_gold ( diameter , height ) : 8 | return 2 * ( diameter + height ) 9 | 10 | 11 | #TOFILL 12 | 13 | if __name__ == '__main__': 14 | param = [ 15 | (70,78,), 16 | (97,46,), 17 | (49,26,), 18 | (56,61,), 19 | (87,79,), 20 | (64,21,), 21 | (75,93,), 22 | (90,16,), 23 | (55,16,), 24 | (73,29,) 25 | ] 26 | n_success = 0 27 | for i, parameters_set in enumerate(param): 28 | if f_filled(*parameters_set) == f_gold(*parameters_set): 29 | n_success+=1 30 | print("#Results: %i, %i" % (n_success, len(param))) -------------------------------------------------------------------------------- /transcoder/transcoder/data/evaluation/geeks_for_geeks_successful_test_scripts/python/FIND_POWER_POWER_MOD_PRIME.py: -------------------------------------------------------------------------------- 1 | # Copyright (c) 2019-present, Facebook, Inc. 2 | # All rights reserved. 3 | # 4 | # This source code is licensed under the license found in the 5 | # LICENSE file in the root directory of this source tree. 6 | # 7 | def f_gold ( A , B , C , M ) : 8 | res = pow ( B , C , M - 1 ) 9 | ans = pow ( A , res , M ) 10 | return ans 11 | 12 | 13 | #TOFILL 14 | 15 | if __name__ == '__main__': 16 | param = [ 17 | (49,7,63,7,), 18 | (31,75,82,61,), 19 | (29,10,82,15,), 20 | (26,59,12,13,), 21 | (10,76,14,53,), 22 | (18,40,71,78,), 23 | (48,21,41,91,), 24 | (17,35,78,80,), 25 | (49,73,69,86,), 26 | (22,85,6,8,) 27 | ] 28 | n_success = 0 29 | for i, parameters_set in enumerate(param): 30 | if f_filled(*parameters_set) == f_gold(*parameters_set): 31 | n_success+=1 32 | print("#Results: %i, %i" % (n_success, len(param))) -------------------------------------------------------------------------------- /transcoder/transcoder/data/evaluation/geeks_for_geeks_successful_test_scripts/python/FIND_SUM_EVEN_INDEX_BINOMIAL_COEFFICIENTS_1.py: -------------------------------------------------------------------------------- 1 | # Copyright (c) 2019-present, Facebook, Inc. 2 | # All rights reserved. 3 | # 4 | # This source code is licensed under the license found in the 5 | # LICENSE file in the root directory of this source tree. 6 | # 7 | def f_gold ( n ) : 8 | return ( 1 << ( n - 1 ) ) 9 | 10 | 11 | #TOFILL 12 | 13 | if __name__ == '__main__': 14 | param = [ 15 | (56,), 16 | (28,), 17 | (4,), 18 | (24,), 19 | (72,), 20 | (30,), 21 | (48,), 22 | (32,), 23 | (13,), 24 | (19,) 25 | ] 26 | n_success = 0 27 | for i, parameters_set in enumerate(param): 28 | if f_filled(*parameters_set) == f_gold(*parameters_set): 29 | n_success+=1 30 | print("#Results: %i, %i" % (n_success, len(param))) -------------------------------------------------------------------------------- /transcoder/transcoder/data/evaluation/geeks_for_geeks_successful_test_scripts/python/FIND_SUM_MODULO_K_FIRST_N_NATURAL_NUMBER.py: -------------------------------------------------------------------------------- 1 | # Copyright (c) 2019-present, Facebook, Inc. 2 | # All rights reserved. 3 | # 4 | # This source code is licensed under the license found in the 5 | # LICENSE file in the root directory of this source tree. 6 | # 7 | def f_gold ( N , K ) : 8 | ans = 0 ; 9 | for i in range ( 1 , N + 1 ) : 10 | ans += ( i % K ) ; 11 | return ans ; 12 | 13 | 14 | #TOFILL 15 | 16 | if __name__ == '__main__': 17 | param = [ 18 | (11,5,), 19 | (36,69,), 20 | (71,28,), 21 | (74,1,), 22 | (66,84,), 23 | (38,14,), 24 | (2,11,), 25 | (73,87,), 26 | (79,11,), 27 | (30,55,) 28 | ] 29 | n_success = 0 30 | for i, parameters_set in enumerate(param): 31 | if f_filled(*parameters_set) == f_gold(*parameters_set): 32 | n_success+=1 33 | print("#Results: %i, %i" % (n_success, len(param))) -------------------------------------------------------------------------------- /transcoder/transcoder/data/evaluation/geeks_for_geeks_successful_test_scripts/python/FIND_SUM_MODULO_K_FIRST_N_NATURAL_NUMBER_1.py: -------------------------------------------------------------------------------- 1 | # Copyright (c) 2019-present, Facebook, Inc. 2 | # All rights reserved. 3 | # 4 | # This source code is licensed under the license found in the 5 | # LICENSE file in the root directory of this source tree. 6 | # 7 | def f_gold ( N , K ) : 8 | ans = 0 ; 9 | y = N / K ; 10 | x = N % K ; 11 | ans = ( ( K * ( K - 1 ) / 2 ) * y + ( x * ( x + 1 ) ) / 2 ) ; 12 | return int ( ans ) ; 13 | 14 | 15 | #TOFILL 16 | 17 | if __name__ == '__main__': 18 | param = [ 19 | (40,90,), 20 | (46,64,), 21 | (97,20,), 22 | (63,1,), 23 | (92,52,), 24 | (60,35,), 25 | (67,40,), 26 | (61,62,), 27 | (74,61,), 28 | (67,41,) 29 | ] 30 | n_success = 0 31 | for i, parameters_set in enumerate(param): 32 | if f_filled(*parameters_set) == f_gold(*parameters_set): 33 | n_success+=1 34 | print("#Results: %i, %i" % (n_success, len(param))) -------------------------------------------------------------------------------- /transcoder/transcoder/data/evaluation/geeks_for_geeks_successful_test_scripts/python/FIND_UNIT_DIGIT_X_RAISED_POWER_Y.py: -------------------------------------------------------------------------------- 1 | # Copyright (c) 2019-present, Facebook, Inc. 2 | # All rights reserved. 3 | # 4 | # This source code is licensed under the license found in the 5 | # LICENSE file in the root directory of this source tree. 6 | # 7 | def f_gold ( x , y ) : 8 | res = 1 9 | for i in range ( y ) : 10 | res = ( res * x ) % 10 11 | return res 12 | 13 | 14 | #TOFILL 15 | 16 | if __name__ == '__main__': 17 | param = [ 18 | (33,55,), 19 | (95,7,), 20 | (21,63,), 21 | (3,62,), 22 | (40,53,), 23 | (64,24,), 24 | (17,23,), 25 | (58,74,), 26 | (44,13,), 27 | (27,54,) 28 | ] 29 | n_success = 0 30 | for i, parameters_set in enumerate(param): 31 | if f_filled(*parameters_set) == f_gold(*parameters_set): 32 | n_success+=1 33 | print("#Results: %i, %i" % (n_success, len(param))) -------------------------------------------------------------------------------- /transcoder/transcoder/data/evaluation/geeks_for_geeks_successful_test_scripts/python/FIND_UNIT_DIGIT_X_RAISED_POWER_Y_1.py: -------------------------------------------------------------------------------- 1 | # Copyright (c) 2019-present, Facebook, Inc. 2 | # All rights reserved. 3 | # 4 | # This source code is licensed under the license found in the 5 | # LICENSE file in the root directory of this source tree. 6 | # 7 | import math 8 | 9 | def f_gold ( x , y ) : 10 | x = x % 10 11 | if y != 0 : 12 | y = y % 4 + 4 13 | return ( ( ( int ) ( math.pow ( x , y ) ) ) % 10 ) 14 | 15 | 16 | #TOFILL 17 | 18 | if __name__ == '__main__': 19 | param = [ 20 | (37,17,), 21 | (70,52,), 22 | (26,23,), 23 | (9,96,), 24 | (82,71,), 25 | (95,36,), 26 | (43,40,), 27 | (7,27,), 28 | (19,56,), 29 | (49,28,) 30 | ] 31 | n_success = 0 32 | for i, parameters_set in enumerate(param): 33 | if f_filled(*parameters_set) == f_gold(*parameters_set): 34 | n_success+=1 35 | print("#Results: %i, %i" % (n_success, len(param))) -------------------------------------------------------------------------------- /transcoder/transcoder/data/evaluation/geeks_for_geeks_successful_test_scripts/python/FIND_VALUE_OF_Y_MOD_2_RAISED_TO_POWER_X.py: -------------------------------------------------------------------------------- 1 | # Copyright (c) 2019-present, Facebook, Inc. 2 | # All rights reserved. 3 | # 4 | # This source code is licensed under the license found in the 5 | # LICENSE file in the root directory of this source tree. 6 | # 7 | def f_gold ( y , x ) : 8 | return ( y % pow ( 2 , x ) ) 9 | 10 | 11 | #TOFILL 12 | 13 | if __name__ == '__main__': 14 | param = [ 15 | (57,76,), 16 | (80,46,), 17 | (84,96,), 18 | (35,16,), 19 | (3,84,), 20 | (42,79,), 21 | (7,2,), 22 | (99,83,), 23 | (13,61,), 24 | (44,8,) 25 | ] 26 | n_success = 0 27 | for i, parameters_set in enumerate(param): 28 | if f_filled(*parameters_set) == f_gold(*parameters_set): 29 | n_success+=1 30 | print("#Results: %i, %i" % (n_success, len(param))) -------------------------------------------------------------------------------- /transcoder/transcoder/data/evaluation/geeks_for_geeks_successful_test_scripts/python/FIND_WHETHER_A_GIVEN_NUMBER_IS_A_POWER_OF_4_OR_NOT.py: -------------------------------------------------------------------------------- 1 | # Copyright (c) 2019-present, Facebook, Inc. 2 | # All rights reserved. 3 | # 4 | # This source code is licensed under the license found in the 5 | # LICENSE file in the root directory of this source tree. 6 | # 7 | def f_gold ( n ) : 8 | if ( n == 0 ) : 9 | return False 10 | while ( n != 1 ) : 11 | if ( n % 4 != 0 ) : 12 | return False 13 | n = n // 4 14 | return True 15 | 16 | 17 | #TOFILL 18 | 19 | if __name__ == '__main__': 20 | param = [ 21 | (45,), 22 | (16,), 23 | (15,), 24 | (91,), 25 | (82,), 26 | (18,), 27 | (31,), 28 | (6,), 29 | (93,), 30 | (35,) 31 | ] 32 | n_success = 0 33 | for i, parameters_set in enumerate(param): 34 | if f_filled(*parameters_set) == f_gold(*parameters_set): 35 | n_success+=1 36 | print("#Results: %i, %i" % (n_success, len(param))) -------------------------------------------------------------------------------- /transcoder/transcoder/data/evaluation/geeks_for_geeks_successful_test_scripts/python/FIND_WHETHER_A_GIVEN_NUMBER_IS_A_POWER_OF_4_OR_NOT_2.py: -------------------------------------------------------------------------------- 1 | # Copyright (c) 2019-present, Facebook, Inc. 2 | # All rights reserved. 3 | # 4 | # This source code is licensed under the license found in the 5 | # LICENSE file in the root directory of this source tree. 6 | # 7 | def f_gold ( n ) : 8 | return ( n != 0 and ( ( n & ( n - 1 ) ) == 0 ) and not ( n & 0xAAAAAAAA ) ) ; 9 | 10 | 11 | #TOFILL 12 | 13 | if __name__ == '__main__': 14 | param = [ 15 | (1,), 16 | (4,), 17 | (64,), 18 | (-64,), 19 | (128,), 20 | (1024,), 21 | (97,), 22 | (86,), 23 | (14,), 24 | (99,) 25 | ] 26 | n_success = 0 27 | for i, parameters_set in enumerate(param): 28 | if f_filled(*parameters_set) == f_gold(*parameters_set): 29 | n_success+=1 30 | print("#Results: %i, %i" % (n_success, len(param))) -------------------------------------------------------------------------------- /transcoder/transcoder/data/evaluation/geeks_for_geeks_successful_test_scripts/python/FIND_WHETHER_GIVEN_INTEGER_POWER_3_NOT.py: -------------------------------------------------------------------------------- 1 | # Copyright (c) 2019-present, Facebook, Inc. 2 | # All rights reserved. 3 | # 4 | # This source code is licensed under the license found in the 5 | # LICENSE file in the root directory of this source tree. 6 | # 7 | def f_gold ( n ) : 8 | return 1162261467 % n == 0 9 | 10 | 11 | #TOFILL 12 | 13 | if __name__ == '__main__': 14 | param = [ 15 | (1,), 16 | (3,), 17 | (27,), 18 | (9,), 19 | (-9,), 20 | (11,), 21 | (57,), 22 | (21,), 23 | (60,), 24 | (44,) 25 | ] 26 | n_success = 0 27 | for i, parameters_set in enumerate(param): 28 | if f_filled(*parameters_set) == f_gold(*parameters_set): 29 | n_success+=1 30 | print("#Results: %i, %i" % (n_success, len(param))) -------------------------------------------------------------------------------- /transcoder/transcoder/data/evaluation/geeks_for_geeks_successful_test_scripts/python/FRIENDS_PAIRING_PROBLEM_2.py: -------------------------------------------------------------------------------- 1 | # Copyright (c) 2019-present, Facebook, Inc. 2 | # All rights reserved. 3 | # 4 | # This source code is licensed under the license found in the 5 | # LICENSE file in the root directory of this source tree. 6 | # 7 | def f_gold ( n ) : 8 | a , b , c = 1 , 2 , 0 ; 9 | if ( n <= 2 ) : 10 | return n ; 11 | for i in range ( 3 , n + 1 ) : 12 | c = b + ( i - 1 ) * a ; 13 | a = b ; 14 | b = c ; 15 | return c ; 16 | 17 | 18 | #TOFILL 19 | 20 | if __name__ == '__main__': 21 | param = [ 22 | (24,), 23 | (1,), 24 | (91,), 25 | (90,), 26 | (89,), 27 | (29,), 28 | (3,), 29 | (60,), 30 | (75,), 31 | (14,) 32 | ] 33 | n_success = 0 34 | for i, parameters_set in enumerate(param): 35 | if f_filled(*parameters_set) == f_gold(*parameters_set): 36 | n_success+=1 37 | print("#Results: %i, %i" % (n_success, len(param))) -------------------------------------------------------------------------------- /transcoder/transcoder/data/evaluation/geeks_for_geeks_successful_test_scripts/python/GCD_ELEMENTS_GIVEN_RANGE.py: -------------------------------------------------------------------------------- 1 | # Copyright (c) 2019-present, Facebook, Inc. 2 | # All rights reserved. 3 | # 4 | # This source code is licensed under the license found in the 5 | # LICENSE file in the root directory of this source tree. 6 | # 7 | def f_gold ( n , m ) : 8 | return n if ( n == m ) else 1 9 | 10 | 11 | #TOFILL 12 | 13 | if __name__ == '__main__': 14 | param = [ 15 | (57,57,), 16 | (22,22,), 17 | (17,17,), 18 | (74,74,), 19 | (93,22,), 20 | (56,54,), 21 | (5,33,), 22 | (5,68,), 23 | (9,75,), 24 | (98,21,) 25 | ] 26 | n_success = 0 27 | for i, parameters_set in enumerate(param): 28 | if f_filled(*parameters_set) == f_gold(*parameters_set): 29 | n_success+=1 30 | print("#Results: %i, %i" % (n_success, len(param))) -------------------------------------------------------------------------------- /transcoder/transcoder/data/evaluation/geeks_for_geeks_successful_test_scripts/python/GCD_FACTORIALS_TWO_NUMBERS.py: -------------------------------------------------------------------------------- 1 | # Copyright (c) 2019-present, Facebook, Inc. 2 | # All rights reserved. 3 | # 4 | # This source code is licensed under the license found in the 5 | # LICENSE file in the root directory of this source tree. 6 | # 7 | import math 8 | 9 | def f_gold ( m , n ) : 10 | return math.factorial ( min ( m , n ) ) 11 | 12 | 13 | #TOFILL 14 | 15 | if __name__ == '__main__': 16 | param = [ 17 | (81,39,), 18 | (19,94,), 19 | (49,37,), 20 | (40,88,), 21 | (36,28,), 22 | (11,46,), 23 | (82,94,), 24 | (80,37,), 25 | (82,75,), 26 | (56,9,) 27 | ] 28 | n_success = 0 29 | for i, parameters_set in enumerate(param): 30 | if f_filled(*parameters_set) == f_gold(*parameters_set): 31 | n_success+=1 32 | print("#Results: %i, %i" % (n_success, len(param))) -------------------------------------------------------------------------------- /transcoder/transcoder/data/evaluation/geeks_for_geeks_successful_test_scripts/python/HEIGHT_COMPLETE_BINARY_TREE_HEAP_N_NODES.py: -------------------------------------------------------------------------------- 1 | # Copyright (c) 2019-present, Facebook, Inc. 2 | # All rights reserved. 3 | # 4 | # This source code is licensed under the license found in the 5 | # LICENSE file in the root directory of this source tree. 6 | # 7 | import math 8 | 9 | def f_gold ( N ) : 10 | return math.ceil ( math.log2 ( N + 1 ) ) - 1 11 | 12 | 13 | #TOFILL 14 | 15 | if __name__ == '__main__': 16 | param = [ 17 | (65,), 18 | (94,), 19 | (52,), 20 | (31,), 21 | (9,), 22 | (1,), 23 | (41,), 24 | (98,), 25 | (45,), 26 | (24,) 27 | ] 28 | n_success = 0 29 | for i, parameters_set in enumerate(param): 30 | if f_filled(*parameters_set) == f_gold(*parameters_set): 31 | n_success+=1 32 | print("#Results: %i, %i" % (n_success, len(param))) -------------------------------------------------------------------------------- /transcoder/transcoder/data/evaluation/geeks_for_geeks_successful_test_scripts/python/HEXAGONAL_NUMBER.py: -------------------------------------------------------------------------------- 1 | # Copyright (c) 2019-present, Facebook, Inc. 2 | # All rights reserved. 3 | # 4 | # This source code is licensed under the license found in the 5 | # LICENSE file in the root directory of this source tree. 6 | # 7 | def f_gold ( n ) : 8 | return n * ( 2 * n - 1 ) 9 | 10 | 11 | #TOFILL 12 | 13 | if __name__ == '__main__': 14 | param = [ 15 | (38,), 16 | (44,), 17 | (58,), 18 | (10,), 19 | (31,), 20 | (53,), 21 | (94,), 22 | (64,), 23 | (71,), 24 | (59,) 25 | ] 26 | n_success = 0 27 | for i, parameters_set in enumerate(param): 28 | if f_filled(*parameters_set) == f_gold(*parameters_set): 29 | n_success+=1 30 | print("#Results: %i, %i" % (n_success, len(param))) -------------------------------------------------------------------------------- /transcoder/transcoder/data/evaluation/geeks_for_geeks_successful_test_scripts/python/HOW_CAN_WE_SUM_THE_DIGITS_OF_A_GIVEN_NUMBER_IN_SINGLE_STATEMENT.py: -------------------------------------------------------------------------------- 1 | # Copyright (c) 2019-present, Facebook, Inc. 2 | # All rights reserved. 3 | # 4 | # This source code is licensed under the license found in the 5 | # LICENSE file in the root directory of this source tree. 6 | # 7 | def f_gold ( n ) : 8 | sum = 0 9 | while ( n != 0 ) : 10 | sum = sum + int ( n % 10 ) 11 | n = int ( n / 10 ) 12 | return sum 13 | 14 | 15 | #TOFILL 16 | 17 | if __name__ == '__main__': 18 | param = [ 19 | (57,), 20 | (21,), 21 | (11,), 22 | (64,), 23 | (88,), 24 | (62,), 25 | (17,), 26 | (49,), 27 | (22,), 28 | (19,) 29 | ] 30 | n_success = 0 31 | for i, parameters_set in enumerate(param): 32 | if f_filled(*parameters_set) == f_gold(*parameters_set): 33 | n_success+=1 34 | print("#Results: %i, %i" % (n_success, len(param))) -------------------------------------------------------------------------------- /transcoder/transcoder/data/evaluation/geeks_for_geeks_successful_test_scripts/python/HOW_CAN_WE_SUM_THE_DIGITS_OF_A_GIVEN_NUMBER_IN_SINGLE_STATEMENT_1.py: -------------------------------------------------------------------------------- 1 | # Copyright (c) 2019-present, Facebook, Inc. 2 | # All rights reserved. 3 | # 4 | # This source code is licensed under the license found in the 5 | # LICENSE file in the root directory of this source tree. 6 | # 7 | def f_gold ( n ) : 8 | sum = 0 9 | while ( n > 0 ) : 10 | sum += int ( n % 10 ) 11 | n = int ( n / 10 ) 12 | return sum 13 | 14 | 15 | #TOFILL 16 | 17 | if __name__ == '__main__': 18 | param = [ 19 | (50,), 20 | (92,), 21 | (49,), 22 | (94,), 23 | (7,), 24 | (30,), 25 | (88,), 26 | (98,), 27 | (94,), 28 | (23,) 29 | ] 30 | n_success = 0 31 | for i, parameters_set in enumerate(param): 32 | if f_filled(*parameters_set) == f_gold(*parameters_set): 33 | n_success+=1 34 | print("#Results: %i, %i" % (n_success, len(param))) -------------------------------------------------------------------------------- /transcoder/transcoder/data/evaluation/geeks_for_geeks_successful_test_scripts/python/HOW_CAN_WE_SUM_THE_DIGITS_OF_A_GIVEN_NUMBER_IN_SINGLE_STATEMENT_2.py: -------------------------------------------------------------------------------- 1 | # Copyright (c) 2019-present, Facebook, Inc. 2 | # All rights reserved. 3 | # 4 | # This source code is licensed under the license found in the 5 | # LICENSE file in the root directory of this source tree. 6 | # 7 | def f_gold ( no ) : 8 | return 0 if no == 0 else int ( no % 10 ) + f_gold ( int ( no / 10 ) ) 9 | 10 | 11 | #TOFILL 12 | 13 | if __name__ == '__main__': 14 | param = [ 15 | (73,), 16 | (91,), 17 | (27,), 18 | (79,), 19 | (31,), 20 | (84,), 21 | (68,), 22 | (9,), 23 | (85,), 24 | (35,) 25 | ] 26 | n_success = 0 27 | for i, parameters_set in enumerate(param): 28 | if f_filled(*parameters_set) == f_gold(*parameters_set): 29 | n_success+=1 30 | print("#Results: %i, %i" % (n_success, len(param))) -------------------------------------------------------------------------------- /transcoder/transcoder/data/evaluation/geeks_for_geeks_successful_test_scripts/python/HOW_TO_TURN_OFF_A_PARTICULAR_BIT_IN_A_NUMBER.py: -------------------------------------------------------------------------------- 1 | # Copyright (c) 2019-present, Facebook, Inc. 2 | # All rights reserved. 3 | # 4 | # This source code is licensed under the license found in the 5 | # LICENSE file in the root directory of this source tree. 6 | # 7 | def f_gold ( n , k ) : 8 | if ( k <= 0 ) : 9 | return n 10 | return ( n & ~ ( 1 << ( k - 1 ) ) ) 11 | 12 | 13 | #TOFILL 14 | 15 | if __name__ == '__main__': 16 | param = [ 17 | (49,15,), 18 | (59,69,), 19 | (76,20,), 20 | (27,76,), 21 | (61,60,), 22 | (67,27,), 23 | (63,71,), 24 | (85,25,), 25 | (90,64,), 26 | (24,55,) 27 | ] 28 | n_success = 0 29 | for i, parameters_set in enumerate(param): 30 | if f_filled(*parameters_set) == f_gold(*parameters_set): 31 | n_success+=1 32 | print("#Results: %i, %i" % (n_success, len(param))) -------------------------------------------------------------------------------- /transcoder/transcoder/data/evaluation/geeks_for_geeks_successful_test_scripts/python/HYPERCUBE_GRAPH.py: -------------------------------------------------------------------------------- 1 | # Copyright (c) 2019-present, Facebook, Inc. 2 | # All rights reserved. 3 | # 4 | # This source code is licensed under the license found in the 5 | # LICENSE file in the root directory of this source tree. 6 | # 7 | def f_gold ( n ) : 8 | if n == 1 : 9 | return 2 10 | return 2 * f_gold ( n - 1 ) 11 | 12 | 13 | #TOFILL 14 | 15 | if __name__ == '__main__': 16 | param = [ 17 | (72,), 18 | (28,), 19 | (45,), 20 | (41,), 21 | (94,), 22 | (97,), 23 | (97,), 24 | (36,), 25 | (91,), 26 | (84,) 27 | ] 28 | n_success = 0 29 | for i, parameters_set in enumerate(param): 30 | if f_filled(*parameters_set) == f_gold(*parameters_set): 31 | n_success+=1 32 | print("#Results: %i, %i" % (n_success, len(param))) -------------------------------------------------------------------------------- /transcoder/transcoder/data/evaluation/geeks_for_geeks_successful_test_scripts/python/LEONARDO_NUMBER_1.py: -------------------------------------------------------------------------------- 1 | # Copyright (c) 2019-present, Facebook, Inc. 2 | # All rights reserved. 3 | # 4 | # This source code is licensed under the license found in the 5 | # LICENSE file in the root directory of this source tree. 6 | # 7 | def f_gold ( n ) : 8 | dp = [ ] ; 9 | dp.append ( 1 ) ; 10 | dp.append ( 1 ) ; 11 | for i in range ( 2 , n + 1 ) : 12 | dp.append ( dp [ i - 1 ] + dp [ i - 2 ] + 1 ) ; 13 | return dp [ n ] ; 14 | 15 | 16 | #TOFILL 17 | 18 | if __name__ == '__main__': 19 | param = [ 20 | (75,), 21 | (76,), 22 | (55,), 23 | (14,), 24 | (43,), 25 | (10,), 26 | (16,), 27 | (30,), 28 | (44,), 29 | (65,) 30 | ] 31 | n_success = 0 32 | for i, parameters_set in enumerate(param): 33 | if f_filled(*parameters_set) == f_gold(*parameters_set): 34 | n_success+=1 35 | print("#Results: %i, %i" % (n_success, len(param))) -------------------------------------------------------------------------------- /transcoder/transcoder/data/evaluation/geeks_for_geeks_successful_test_scripts/python/MAXIMIZE_VOLUME_CUBOID_GIVEN_SUM_SIDES_1.py: -------------------------------------------------------------------------------- 1 | # Copyright (c) 2019-present, Facebook, Inc. 2 | # All rights reserved. 3 | # 4 | # This source code is licensed under the license found in the 5 | # LICENSE file in the root directory of this source tree. 6 | # 7 | def f_gold ( s ) : 8 | length = int ( s / 3 ) 9 | s -= length 10 | breadth = s / 2 11 | height = s - breadth 12 | return int ( length * breadth * height ) 13 | 14 | 15 | #TOFILL 16 | 17 | if __name__ == '__main__': 18 | param = [ 19 | (8,), 20 | (96,), 21 | (96,), 22 | (96,), 23 | (12,), 24 | (95,), 25 | (72,), 26 | (81,), 27 | (42,), 28 | (13,) 29 | ] 30 | n_success = 0 31 | for i, parameters_set in enumerate(param): 32 | if f_filled(*parameters_set) == f_gold(*parameters_set): 33 | n_success+=1 34 | print("#Results: %i, %i" % (n_success, len(param))) -------------------------------------------------------------------------------- /transcoder/transcoder/data/evaluation/geeks_for_geeks_successful_test_scripts/python/MAXIMUM_NUMBER_2X2_SQUARES_CAN_FIT_INSIDE_RIGHT_ISOSCELES_TRIANGLE.py: -------------------------------------------------------------------------------- 1 | # Copyright (c) 2019-present, Facebook, Inc. 2 | # All rights reserved. 3 | # 4 | # This source code is licensed under the license found in the 5 | # LICENSE file in the root directory of this source tree. 6 | # 7 | def f_gold ( base ) : 8 | base = ( base - 2 ) 9 | base = base / 2 10 | return base * ( base + 1 ) / 2 11 | 12 | 13 | #TOFILL 14 | 15 | if __name__ == '__main__': 16 | param = [ 17 | (95,), 18 | (49,), 19 | (10,), 20 | (73,), 21 | (74,), 22 | (40,), 23 | (10,), 24 | (94,), 25 | (64,), 26 | (16,) 27 | ] 28 | n_success = 0 29 | for i, parameters_set in enumerate(param): 30 | if f_filled(*parameters_set) == f_gold(*parameters_set): 31 | n_success+=1 32 | print("#Results: %i, %i" % (n_success, len(param))) -------------------------------------------------------------------------------- /transcoder/transcoder/data/evaluation/geeks_for_geeks_successful_test_scripts/python/MAXIMUM_NUMBER_OF_SQUARES_THAT_CAN_BE_FIT_IN_A_RIGHT_ANGLE_ISOSCELES_TRIANGLE.py: -------------------------------------------------------------------------------- 1 | # Copyright (c) 2019-present, Facebook, Inc. 2 | # All rights reserved. 3 | # 4 | # This source code is licensed under the license found in the 5 | # LICENSE file in the root directory of this source tree. 6 | # 7 | def f_gold ( b , m ) : 8 | return ( b / m - 1 ) * ( b / m ) / 2 9 | 10 | 11 | #TOFILL 12 | 13 | if __name__ == '__main__': 14 | param = [ 15 | (40,74,), 16 | (38,35,), 17 | (47,71,), 18 | (52,29,), 19 | (21,9,), 20 | (50,33,), 21 | (8,82,), 22 | (56,80,), 23 | (93,5,), 24 | (21,90,) 25 | ] 26 | n_success = 0 27 | for i, parameters_set in enumerate(param): 28 | if f_filled(*parameters_set) == f_gold(*parameters_set): 29 | n_success+=1 30 | print("#Results: %i, %i" % (n_success, len(param))) -------------------------------------------------------------------------------- /transcoder/transcoder/data/evaluation/geeks_for_geeks_successful_test_scripts/python/MAXIMUM_POINTS_INTERSECTION_N_CIRCLES.py: -------------------------------------------------------------------------------- 1 | # Copyright (c) 2019-present, Facebook, Inc. 2 | # All rights reserved. 3 | # 4 | # This source code is licensed under the license found in the 5 | # LICENSE file in the root directory of this source tree. 6 | # 7 | def f_gold ( n ) : 8 | return n * ( n - 1 ) ; 9 | 10 | 11 | #TOFILL 12 | 13 | if __name__ == '__main__': 14 | param = [ 15 | (30,), 16 | (25,), 17 | (69,), 18 | (39,), 19 | (14,), 20 | (60,), 21 | (89,), 22 | (27,), 23 | (29,), 24 | (29,) 25 | ] 26 | n_success = 0 27 | for i, parameters_set in enumerate(param): 28 | if f_filled(*parameters_set) == f_gold(*parameters_set): 29 | n_success+=1 30 | print("#Results: %i, %i" % (n_success, len(param))) -------------------------------------------------------------------------------- /transcoder/transcoder/data/evaluation/geeks_for_geeks_successful_test_scripts/python/MINIMIZE_THE_SUM_OF_DIGITS_OF_A_AND_B_SUCH_THAT_A_B_N.py: -------------------------------------------------------------------------------- 1 | # Copyright (c) 2019-present, Facebook, Inc. 2 | # All rights reserved. 3 | # 4 | # This source code is licensed under the license found in the 5 | # LICENSE file in the root directory of this source tree. 6 | # 7 | def f_gold ( n ) : 8 | sum = 0 ; 9 | while ( n > 0 ) : 10 | sum += ( n % 10 ) ; 11 | n //= 10 ; 12 | if ( sum == 1 ) : 13 | return 10 ; 14 | return sum ; 15 | 16 | 17 | #TOFILL 18 | 19 | if __name__ == '__main__': 20 | param = [ 21 | (2,), 22 | (39,), 23 | (31,), 24 | (45,), 25 | (35,), 26 | (94,), 27 | (67,), 28 | (50,), 29 | (4,), 30 | (63,) 31 | ] 32 | n_success = 0 33 | for i, parameters_set in enumerate(param): 34 | if f_filled(*parameters_set) == f_gold(*parameters_set): 35 | n_success+=1 36 | print("#Results: %i, %i" % (n_success, len(param))) -------------------------------------------------------------------------------- /transcoder/transcoder/data/evaluation/geeks_for_geeks_successful_test_scripts/python/MULTIPLY_AN_INTEGER_WITH_3_5.py: -------------------------------------------------------------------------------- 1 | # Copyright (c) 2019-present, Facebook, Inc. 2 | # All rights reserved. 3 | # 4 | # This source code is licensed under the license found in the 5 | # LICENSE file in the root directory of this source tree. 6 | # 7 | def f_gold ( x ) : 8 | return ( x << 1 ) + x + ( x >> 1 ) 9 | 10 | 11 | #TOFILL 12 | 13 | if __name__ == '__main__': 14 | param = [ 15 | (58,), 16 | (16,), 17 | (82,), 18 | (33,), 19 | (88,), 20 | (51,), 21 | (81,), 22 | (38,), 23 | (79,), 24 | (89,) 25 | ] 26 | n_success = 0 27 | for i, parameters_set in enumerate(param): 28 | if f_filled(*parameters_set) == f_gold(*parameters_set): 29 | n_success+=1 30 | print("#Results: %i, %i" % (n_success, len(param))) -------------------------------------------------------------------------------- /transcoder/transcoder/data/evaluation/geeks_for_geeks_successful_test_scripts/python/NEXT_POWER_OF_2.py: -------------------------------------------------------------------------------- 1 | # Copyright (c) 2019-present, Facebook, Inc. 2 | # All rights reserved. 3 | # 4 | # This source code is licensed under the license found in the 5 | # LICENSE file in the root directory of this source tree. 6 | # 7 | def f_gold ( n ) : 8 | count = 0 ; 9 | if ( n and not ( n & ( n - 1 ) ) ) : 10 | return n 11 | while ( n != 0 ) : 12 | n >>= 1 13 | count += 1 14 | return 1 << count ; 15 | 16 | 17 | #TOFILL 18 | 19 | if __name__ == '__main__': 20 | param = [ 21 | (74,), 22 | (70,), 23 | (85,), 24 | (78,), 25 | (71,), 26 | (32,), 27 | (97,), 28 | (90,), 29 | (64,), 30 | (48,) 31 | ] 32 | n_success = 0 33 | for i, parameters_set in enumerate(param): 34 | if f_filled(*parameters_set) == f_gold(*parameters_set): 35 | n_success+=1 36 | print("#Results: %i, %i" % (n_success, len(param))) -------------------------------------------------------------------------------- /transcoder/transcoder/data/evaluation/geeks_for_geeks_successful_test_scripts/python/NEXT_POWER_OF_2_1.py: -------------------------------------------------------------------------------- 1 | # Copyright (c) 2019-present, Facebook, Inc. 2 | # All rights reserved. 3 | # 4 | # This source code is licensed under the license found in the 5 | # LICENSE file in the root directory of this source tree. 6 | # 7 | def f_gold ( n ) : 8 | p = 1 9 | if ( n and not ( n & ( n - 1 ) ) ) : 10 | return n 11 | while ( p < n ) : 12 | p <<= 1 13 | return p ; 14 | 15 | 16 | #TOFILL 17 | 18 | if __name__ == '__main__': 19 | param = [ 20 | (8,), 21 | (79,), 22 | (31,), 23 | (63,), 24 | (18,), 25 | (2,), 26 | (6,), 27 | (85,), 28 | (29,), 29 | (8,) 30 | ] 31 | n_success = 0 32 | for i, parameters_set in enumerate(param): 33 | if f_filled(*parameters_set) == f_gold(*parameters_set): 34 | n_success+=1 35 | print("#Results: %i, %i" % (n_success, len(param))) -------------------------------------------------------------------------------- /transcoder/transcoder/data/evaluation/geeks_for_geeks_successful_test_scripts/python/NEXT_POWER_OF_2_2.py: -------------------------------------------------------------------------------- 1 | # Copyright (c) 2019-present, Facebook, Inc. 2 | # All rights reserved. 3 | # 4 | # This source code is licensed under the license found in the 5 | # LICENSE file in the root directory of this source tree. 6 | # 7 | def f_gold ( n ) : 8 | n -= 1 9 | n |= n >> 1 10 | n |= n >> 2 11 | n |= n >> 4 12 | n |= n >> 8 13 | n |= n >> 16 14 | n += 1 15 | return n 16 | 17 | 18 | #TOFILL 19 | 20 | if __name__ == '__main__': 21 | param = [ 22 | (63,), 23 | (78,), 24 | (13,), 25 | (5,), 26 | (34,), 27 | (69,), 28 | (63,), 29 | (78,), 30 | (80,), 31 | (19,) 32 | ] 33 | n_success = 0 34 | for i, parameters_set in enumerate(param): 35 | if f_filled(*parameters_set) == f_gold(*parameters_set): 36 | n_success+=1 37 | print("#Results: %i, %i" % (n_success, len(param))) -------------------------------------------------------------------------------- /transcoder/transcoder/data/evaluation/geeks_for_geeks_successful_test_scripts/python/NTH_EVEN_LENGTH_PALINDROME.py: -------------------------------------------------------------------------------- 1 | # Copyright (c) 2019-present, Facebook, Inc. 2 | # All rights reserved. 3 | # 4 | # This source code is licensed under the license found in the 5 | # LICENSE file in the root directory of this source tree. 6 | # 7 | def f_gold ( n ) : 8 | res = n 9 | for j in range ( len ( n ) - 1 , - 1 , - 1 ) : 10 | res += n [ j ] 11 | return res 12 | 13 | 14 | #TOFILL 15 | 16 | if __name__ == '__main__': 17 | param = [ 18 | ('lSUhEvxcgfI',), 19 | ('77329283',), 20 | ('010111111',), 21 | ('Stazb',), 22 | ('0702',), 23 | ('01111111',), 24 | ('a',), 25 | ('359118754930',), 26 | ('11011010010',), 27 | ('rznb',) 28 | ] 29 | n_success = 0 30 | for i, parameters_set in enumerate(param): 31 | if f_filled(*parameters_set) == f_gold(*parameters_set): 32 | n_success+=1 33 | print("#Results: %i, %i" % (n_success, len(param))) -------------------------------------------------------------------------------- /transcoder/transcoder/data/evaluation/geeks_for_geeks_successful_test_scripts/python/NTH_PENTAGONAL_NUMBER.py: -------------------------------------------------------------------------------- 1 | # Copyright (c) 2019-present, Facebook, Inc. 2 | # All rights reserved. 3 | # 4 | # This source code is licensed under the license found in the 5 | # LICENSE file in the root directory of this source tree. 6 | # 7 | def f_gold ( n ) : 8 | return ( 3 * n * n - n ) / 2 9 | 10 | 11 | #TOFILL 12 | 13 | if __name__ == '__main__': 14 | param = [ 15 | (96,), 16 | (93,), 17 | (15,), 18 | (8,), 19 | (21,), 20 | (14,), 21 | (11,), 22 | (79,), 23 | (24,), 24 | (94,) 25 | ] 26 | n_success = 0 27 | for i, parameters_set in enumerate(param): 28 | if f_filled(*parameters_set) == f_gold(*parameters_set): 29 | n_success+=1 30 | print("#Results: %i, %i" % (n_success, len(param))) -------------------------------------------------------------------------------- /transcoder/transcoder/data/evaluation/geeks_for_geeks_successful_test_scripts/python/NUMBER_DAYS_TANK_WILL_BECOME_EMPTY.py: -------------------------------------------------------------------------------- 1 | # Copyright (c) 2019-present, Facebook, Inc. 2 | # All rights reserved. 3 | # 4 | # This source code is licensed under the license found in the 5 | # LICENSE file in the root directory of this source tree. 6 | # 7 | import math 8 | 9 | def f_gold ( C , l ) : 10 | if ( l >= C ) : return C 11 | eq_root = ( math.sqrt ( 1 + 8 * ( C - l ) ) - 1 ) / 2 12 | return math.ceil ( eq_root ) + l 13 | 14 | 15 | #TOFILL 16 | 17 | if __name__ == '__main__': 18 | param = [ 19 | (91,29,), 20 | (99,55,), 21 | (11,56,), 22 | (23,56,), 23 | (12,97,), 24 | (1,64,), 25 | (18,5,), 26 | (14,37,), 27 | (13,55,), 28 | (36,99,) 29 | ] 30 | n_success = 0 31 | for i, parameters_set in enumerate(param): 32 | if f_filled(*parameters_set) == f_gold(*parameters_set): 33 | n_success+=1 34 | print("#Results: %i, %i" % (n_success, len(param))) -------------------------------------------------------------------------------- /transcoder/transcoder/data/evaluation/geeks_for_geeks_successful_test_scripts/python/NUMBER_DIGITS_PRODUCT_TWO_NUMBERS_1.py: -------------------------------------------------------------------------------- 1 | # Copyright (c) 2019-present, Facebook, Inc. 2 | # All rights reserved. 3 | # 4 | # This source code is licensed under the license found in the 5 | # LICENSE file in the root directory of this source tree. 6 | # 7 | import math 8 | 9 | def f_gold ( a , b ) : 10 | if ( a == 0 or b == 0 ) : 11 | return 1 12 | return math.floor ( math.log10 ( abs ( a ) ) + math.log10 ( abs ( b ) ) ) + 1 13 | 14 | 15 | #TOFILL 16 | 17 | if __name__ == '__main__': 18 | param = [ 19 | (97,91,), 20 | (52,49,), 21 | (95,34,), 22 | (35,40,), 23 | (40,85,), 24 | (18,97,), 25 | (92,15,), 26 | (73,98,), 27 | (10,62,), 28 | (82,22,) 29 | ] 30 | n_success = 0 31 | for i, parameters_set in enumerate(param): 32 | if f_filled(*parameters_set) == f_gold(*parameters_set): 33 | n_success+=1 34 | print("#Results: %i, %i" % (n_success, len(param))) -------------------------------------------------------------------------------- /transcoder/transcoder/data/evaluation/geeks_for_geeks_successful_test_scripts/python/NUMBER_IS_DIVISIBLE_BY_29_OR_NOT.py: -------------------------------------------------------------------------------- 1 | # Copyright (c) 2019-present, Facebook, Inc. 2 | # All rights reserved. 3 | # 4 | # This source code is licensed under the license found in the 5 | # LICENSE file in the root directory of this source tree. 6 | # 7 | def f_gold ( n ) : 8 | while ( int ( n / 100 ) ) : 9 | last_digit = int ( n % 10 ) 10 | n = int ( n / 10 ) 11 | n += last_digit * 3 12 | return ( n % 29 == 0 ) 13 | 14 | 15 | #TOFILL 16 | 17 | if __name__ == '__main__': 18 | param = [ 19 | (29,), 20 | (0,), 21 | (65,), 22 | (1419,), 23 | (54,), 24 | (7,), 25 | (44,), 26 | (34,), 27 | (1160,), 28 | (292929002929,) 29 | ] 30 | n_success = 0 31 | for i, parameters_set in enumerate(param): 32 | if f_filled(*parameters_set) == f_gold(*parameters_set): 33 | n_success+=1 34 | print("#Results: %i, %i" % (n_success, len(param))) 35 | -------------------------------------------------------------------------------- /transcoder/transcoder/data/evaluation/geeks_for_geeks_successful_test_scripts/python/NUMBER_NON_NEGATIVE_INTEGRAL_SOLUTIONS_B_C_N_1.py: -------------------------------------------------------------------------------- 1 | # Copyright (c) 2019-present, Facebook, Inc. 2 | # All rights reserved. 3 | # 4 | # This source code is licensed under the license found in the 5 | # LICENSE file in the root directory of this source tree. 6 | # 7 | def f_gold ( n ) : 8 | return int ( ( ( n + 1 ) * ( n + 2 ) ) / 2 ) 9 | 10 | 11 | #TOFILL 12 | 13 | if __name__ == '__main__': 14 | param = [ 15 | (41,), 16 | (72,), 17 | (54,), 18 | (75,), 19 | (87,), 20 | (41,), 21 | (78,), 22 | (80,), 23 | (46,), 24 | (9,) 25 | ] 26 | n_success = 0 27 | for i, parameters_set in enumerate(param): 28 | if f_filled(*parameters_set) == f_gold(*parameters_set): 29 | n_success+=1 30 | print("#Results: %i, %i" % (n_success, len(param))) -------------------------------------------------------------------------------- /transcoder/transcoder/data/evaluation/geeks_for_geeks_successful_test_scripts/python/NUMBER_OF_TRIANGLES_IN_A_PLANE_IF_NO_MORE_THAN_TWO_POINTS_ARE_COLLINEAR.py: -------------------------------------------------------------------------------- 1 | # Copyright (c) 2019-present, Facebook, Inc. 2 | # All rights reserved. 3 | # 4 | # This source code is licensed under the license found in the 5 | # LICENSE file in the root directory of this source tree. 6 | # 7 | def f_gold ( n ) : 8 | return ( n * ( n - 1 ) * ( n - 2 ) // 6 ) 9 | 10 | 11 | #TOFILL 12 | 13 | if __name__ == '__main__': 14 | param = [ 15 | (67,), 16 | (58,), 17 | (67,), 18 | (60,), 19 | (4,), 20 | (97,), 21 | (9,), 22 | (16,), 23 | (83,), 24 | (87,) 25 | ] 26 | n_success = 0 27 | for i, parameters_set in enumerate(param): 28 | if f_filled(*parameters_set) == f_gold(*parameters_set): 29 | n_success+=1 30 | print("#Results: %i, %i" % (n_success, len(param))) -------------------------------------------------------------------------------- /transcoder/transcoder/data/evaluation/geeks_for_geeks_successful_test_scripts/python/NUMBER_RECTANGLES_NM_GRID.py: -------------------------------------------------------------------------------- 1 | # Copyright (c) 2019-present, Facebook, Inc. 2 | # All rights reserved. 3 | # 4 | # This source code is licensed under the license found in the 5 | # LICENSE file in the root directory of this source tree. 6 | # 7 | def f_gold ( n , m ) : 8 | return ( m * n * ( n + 1 ) * ( m + 1 ) ) // 4 9 | 10 | 11 | #TOFILL 12 | 13 | if __name__ == '__main__': 14 | param = [ 15 | (86,70,), 16 | (33,65,), 17 | (3,5,), 18 | (91,12,), 19 | (33,27,), 20 | (13,75,), 21 | (75,36,), 22 | (58,64,), 23 | (50,51,), 24 | (4,44,) 25 | ] 26 | n_success = 0 27 | for i, parameters_set in enumerate(param): 28 | if f_filled(*parameters_set) == f_gold(*parameters_set): 29 | n_success+=1 30 | print("#Results: %i, %i" % (n_success, len(param))) -------------------------------------------------------------------------------- /transcoder/transcoder/data/evaluation/geeks_for_geeks_successful_test_scripts/python/NUMBER_SUBSTRINGS_STRING.py: -------------------------------------------------------------------------------- 1 | # Copyright (c) 2019-present, Facebook, Inc. 2 | # All rights reserved. 3 | # 4 | # This source code is licensed under the license found in the 5 | # LICENSE file in the root directory of this source tree. 6 | # 7 | def f_gold ( str ) : 8 | n = len ( str ) ; 9 | return int ( n * ( n + 1 ) / 2 ) ; 10 | 11 | 12 | #TOFILL 13 | 14 | if __name__ == '__main__': 15 | param = [ 16 | ('gZFGZsHCimLf',), 17 | ('505357',), 18 | ('011011101',), 19 | ('ovfwP Osauz',), 20 | ('92132238746026',), 21 | ('01100',), 22 | ('RaOWYQRfiWKSyC',), 23 | ('861330202',), 24 | ('001100010',), 25 | ('uvpKlGUBLOMba',) 26 | ] 27 | n_success = 0 28 | for i, parameters_set in enumerate(param): 29 | if f_filled(*parameters_set) == f_gold(*parameters_set): 30 | n_success+=1 31 | print("#Results: %i, %i" % (n_success, len(param))) -------------------------------------------------------------------------------- /transcoder/transcoder/data/evaluation/geeks_for_geeks_successful_test_scripts/python/NUMBER_TRIANGLES_N_MOVES.py: -------------------------------------------------------------------------------- 1 | # Copyright (c) 2019-present, Facebook, Inc. 2 | # All rights reserved. 3 | # 4 | # This source code is licensed under the license found in the 5 | # LICENSE file in the root directory of this source tree. 6 | # 7 | def f_gold ( n ) : 8 | answer = [ None ] * ( n + 1 ) ; 9 | answer [ 0 ] = 1 ; 10 | i = 1 11 | while i <= n : 12 | answer [ i ] = answer [ i - 1 ] * 3 + 2 ; 13 | i = i + 1 14 | return answer [ n ] ; 15 | 16 | 17 | #TOFILL 18 | 19 | if __name__ == '__main__': 20 | param = [ 21 | (33,), 22 | (72,), 23 | (81,), 24 | (93,), 25 | (8,), 26 | (76,), 27 | (97,), 28 | (91,), 29 | (61,), 30 | (6,) 31 | ] 32 | n_success = 0 33 | for i, parameters_set in enumerate(param): 34 | if f_filled(*parameters_set) == f_gold(*parameters_set): 35 | n_success+=1 36 | print("#Results: %i, %i" % (n_success, len(param))) -------------------------------------------------------------------------------- /transcoder/transcoder/data/evaluation/geeks_for_geeks_successful_test_scripts/python/NUMBER_TRIANGLES_N_MOVES_1.py: -------------------------------------------------------------------------------- 1 | # Copyright (c) 2019-present, Facebook, Inc. 2 | # All rights reserved. 3 | # 4 | # This source code is licensed under the license found in the 5 | # LICENSE file in the root directory of this source tree. 6 | # 7 | def f_gold ( n ) : 8 | ans = 2 * ( pow ( 3 , n ) ) - 1 ; 9 | return ans ; 10 | 11 | 12 | #TOFILL 13 | 14 | if __name__ == '__main__': 15 | param = [ 16 | (78,), 17 | (89,), 18 | (46,), 19 | (56,), 20 | (79,), 21 | (71,), 22 | (80,), 23 | (77,), 24 | (48,), 25 | (16,) 26 | ] 27 | n_success = 0 28 | for i, parameters_set in enumerate(param): 29 | if abs(1 - (0.0000001 + abs(f_gold(*parameters_set))) / (abs(f_filled(*parameters_set)) + 0.0000001)) < 0.001: 30 | n_success+=1 31 | print("#Results: %i, %i" % (n_success, len(param))) -------------------------------------------------------------------------------- /transcoder/transcoder/data/evaluation/geeks_for_geeks_successful_test_scripts/python/NUMBER_WAYS_NODE_MAKE_LOOP_SIZE_K_UNDIRECTED_COMPLETE_CONNECTED_GRAPH_N_NODES.py: -------------------------------------------------------------------------------- 1 | # Copyright (c) 2019-present, Facebook, Inc. 2 | # All rights reserved. 3 | # 4 | # This source code is licensed under the license found in the 5 | # LICENSE file in the root directory of this source tree. 6 | # 7 | def f_gold ( n , k ) : 8 | p = 1 9 | if ( k % 2 ) : 10 | p = - 1 11 | return ( pow ( n - 1 , k ) + p * ( n - 1 ) ) / n 12 | 13 | 14 | #TOFILL 15 | 16 | if __name__ == '__main__': 17 | param = [ 18 | (27,59,), 19 | (70,87,), 20 | (77,40,), 21 | (83,26,), 22 | (16,2,), 23 | (90,66,), 24 | (39,72,), 25 | (48,26,), 26 | (56,77,), 27 | (10,47,) 28 | ] 29 | n_success = 0 30 | for i, parameters_set in enumerate(param): 31 | if f_filled(*parameters_set) == f_gold(*parameters_set): 32 | n_success+=1 33 | print("#Results: %i, %i" % (n_success, len(param))) -------------------------------------------------------------------------------- /transcoder/transcoder/data/evaluation/geeks_for_geeks_successful_test_scripts/python/N_TH_NUMBER_WHOSE_SUM_OF_DIGITS_IS_TEN_2.py: -------------------------------------------------------------------------------- 1 | # Copyright (c) 2019-present, Facebook, Inc. 2 | # All rights reserved. 3 | # 4 | # This source code is licensed under the license found in the 5 | # LICENSE file in the root directory of this source tree. 6 | # 7 | import math 8 | 9 | def f_gold ( n ) : 10 | nthElement = 19 + ( n - 1 ) * 9 11 | outliersCount = int ( math.log10 ( nthElement ) ) - 1 12 | nthElement += 9 * outliersCount 13 | return nthElement 14 | 15 | 16 | #TOFILL 17 | 18 | if __name__ == '__main__': 19 | param = [ 20 | (68,), 21 | (70,), 22 | (69,), 23 | (93,), 24 | (99,), 25 | (44,), 26 | (91,), 27 | (8,), 28 | (83,), 29 | (51,) 30 | ] 31 | n_success = 0 32 | for i, parameters_set in enumerate(param): 33 | if f_filled(*parameters_set) == f_gold(*parameters_set): 34 | n_success+=1 35 | print("#Results: %i, %i" % (n_success, len(param))) -------------------------------------------------------------------------------- /transcoder/transcoder/data/evaluation/geeks_for_geeks_successful_test_scripts/python/N_TH_TERM_SERIES_2_12_36_80_150.py: -------------------------------------------------------------------------------- 1 | # Copyright (c) 2019-present, Facebook, Inc. 2 | # All rights reserved. 3 | # 4 | # This source code is licensed under the license found in the 5 | # LICENSE file in the root directory of this source tree. 6 | # 7 | def f_gold ( n ) : 8 | return ( n * n ) + ( n * n * n ) 9 | 10 | 11 | #TOFILL 12 | 13 | if __name__ == '__main__': 14 | param = [ 15 | (90,), 16 | (95,), 17 | (22,), 18 | (29,), 19 | (62,), 20 | (40,), 21 | (52,), 22 | (21,), 23 | (33,), 24 | (11,) 25 | ] 26 | n_success = 0 27 | for i, parameters_set in enumerate(param): 28 | if f_filled(*parameters_set) == f_gold(*parameters_set): 29 | n_success+=1 30 | print("#Results: %i, %i" % (n_success, len(param))) -------------------------------------------------------------------------------- /transcoder/transcoder/data/evaluation/geeks_for_geeks_successful_test_scripts/python/ONE_LINE_FUNCTION_FOR_FACTORIAL_OF_A_NUMBER.py: -------------------------------------------------------------------------------- 1 | # Copyright (c) 2019-present, Facebook, Inc. 2 | # All rights reserved. 3 | # 4 | # This source code is licensed under the license found in the 5 | # LICENSE file in the root directory of this source tree. 6 | # 7 | def f_gold ( n ) : 8 | return 1 if ( n == 1 or n == 0 ) else n * f_gold ( n - 1 ) ; 9 | 10 | 11 | #TOFILL 12 | 13 | if __name__ == '__main__': 14 | param = [ 15 | (58,), 16 | (42,), 17 | (76,), 18 | (16,), 19 | (49,), 20 | (60,), 21 | (99,), 22 | (45,), 23 | (6,), 24 | (70,) 25 | ] 26 | n_success = 0 27 | for i, parameters_set in enumerate(param): 28 | if f_filled(*parameters_set) == f_gold(*parameters_set): 29 | n_success+=1 30 | print("#Results: %i, %i" % (n_success, len(param))) -------------------------------------------------------------------------------- /transcoder/transcoder/data/evaluation/geeks_for_geeks_successful_test_scripts/python/PIZZA_CUT_PROBLEM_CIRCLE_DIVISION_LINES.py: -------------------------------------------------------------------------------- 1 | # Copyright (c) 2019-present, Facebook, Inc. 2 | # All rights reserved. 3 | # 4 | # This source code is licensed under the license found in the 5 | # LICENSE file in the root directory of this source tree. 6 | # 7 | def f_gold ( n ) : 8 | return int ( 1 + n * ( n + 1 ) / 2 ) 9 | 10 | 11 | #TOFILL 12 | 13 | if __name__ == '__main__': 14 | param = [ 15 | (46,), 16 | (68,), 17 | (4,), 18 | (12,), 19 | (56,), 20 | (14,), 21 | (81,), 22 | (29,), 23 | (26,), 24 | (40,) 25 | ] 26 | n_success = 0 27 | for i, parameters_set in enumerate(param): 28 | if f_filled(*parameters_set) == f_gold(*parameters_set): 29 | n_success+=1 30 | print("#Results: %i, %i" % (n_success, len(param))) -------------------------------------------------------------------------------- /transcoder/transcoder/data/evaluation/geeks_for_geeks_successful_test_scripts/python/POSITION_OF_RIGHTMOST_SET_BIT.py: -------------------------------------------------------------------------------- 1 | # Copyright (c) 2019-present, Facebook, Inc. 2 | # All rights reserved. 3 | # 4 | # This source code is licensed under the license found in the 5 | # LICENSE file in the root directory of this source tree. 6 | # 7 | import math 8 | 9 | def f_gold ( n ) : 10 | return math.log2 ( n & - n ) + 1 11 | 12 | 13 | #TOFILL 14 | 15 | if __name__ == '__main__': 16 | param = [ 17 | (45,), 18 | (26,), 19 | (74,), 20 | (80,), 21 | (46,), 22 | (67,), 23 | (16,), 24 | (87,), 25 | (27,), 26 | (17,) 27 | ] 28 | n_success = 0 29 | for i, parameters_set in enumerate(param): 30 | if f_filled(*parameters_set) == f_gold(*parameters_set): 31 | n_success+=1 32 | print("#Results: %i, %i" % (n_success, len(param))) -------------------------------------------------------------------------------- /transcoder/transcoder/data/evaluation/geeks_for_geeks_successful_test_scripts/python/POSITION_OF_RIGHTMOST_SET_BIT_1.py: -------------------------------------------------------------------------------- 1 | # Copyright (c) 2019-present, Facebook, Inc. 2 | # All rights reserved. 3 | # 4 | # This source code is licensed under the license found in the 5 | # LICENSE file in the root directory of this source tree. 6 | # 7 | def f_gold ( n ) : 8 | position = 1 9 | m = 1 10 | while ( not ( n & m ) ) : 11 | m = m << 1 12 | position += 1 13 | return position 14 | 15 | 16 | #TOFILL 17 | 18 | if __name__ == '__main__': 19 | param = [ 20 | (17,), 21 | (97,), 22 | (73,), 23 | (68,), 24 | (6,), 25 | (84,), 26 | (72,), 27 | (66,), 28 | (57,), 29 | (11,) 30 | ] 31 | n_success = 0 32 | for i, parameters_set in enumerate(param): 33 | if f_filled(*parameters_set) == f_gold(*parameters_set): 34 | n_success+=1 35 | print("#Results: %i, %i" % (n_success, len(param))) -------------------------------------------------------------------------------- /transcoder/transcoder/data/evaluation/geeks_for_geeks_successful_test_scripts/python/PRIMALITY_TEST_SET_1_INTRODUCTION_AND_SCHOOL_METHOD.py: -------------------------------------------------------------------------------- 1 | # Copyright (c) 2019-present, Facebook, Inc. 2 | # All rights reserved. 3 | # 4 | # This source code is licensed under the license found in the 5 | # LICENSE file in the root directory of this source tree. 6 | # 7 | def f_gold ( n ) : 8 | if n <= 1 : 9 | return False 10 | for i in range ( 2 , n ) : 11 | if n % i == 0 : 12 | return False ; 13 | return True 14 | 15 | 16 | #TOFILL 17 | 18 | if __name__ == '__main__': 19 | param = [ 20 | (37,), 21 | (39,), 22 | (73,), 23 | (8,), 24 | (28,), 25 | (66,), 26 | (20,), 27 | (36,), 28 | (6,), 29 | (51,) 30 | ] 31 | n_success = 0 32 | for i, parameters_set in enumerate(param): 33 | if f_filled(*parameters_set) == f_gold(*parameters_set): 34 | n_success+=1 35 | print("#Results: %i, %i" % (n_success, len(param))) -------------------------------------------------------------------------------- /transcoder/transcoder/data/evaluation/geeks_for_geeks_successful_test_scripts/python/PRIME_NUMBERS.py: -------------------------------------------------------------------------------- 1 | # Copyright (c) 2019-present, Facebook, Inc. 2 | # All rights reserved. 3 | # 4 | # This source code is licensed under the license found in the 5 | # LICENSE file in the root directory of this source tree. 6 | # 7 | def f_gold ( n ) : 8 | if ( n <= 1 ) : 9 | return False 10 | for i in range ( 2 , n ) : 11 | if ( n % i == 0 ) : 12 | return False 13 | return True 14 | 15 | 16 | #TOFILL 17 | 18 | if __name__ == '__main__': 19 | param = [ 20 | (2,), 21 | (74,), 22 | (46,), 23 | (38,), 24 | (51,), 25 | (48,), 26 | (6,), 27 | (14,), 28 | (31,), 29 | (10,) 30 | ] 31 | n_success = 0 32 | for i, parameters_set in enumerate(param): 33 | if f_filled(*parameters_set) == f_gold(*parameters_set): 34 | n_success+=1 35 | print("#Results: %i, %i" % (n_success, len(param))) -------------------------------------------------------------------------------- /transcoder/transcoder/data/evaluation/geeks_for_geeks_successful_test_scripts/python/PROBABILITY_THREE_RANDOMLY_CHOSEN_NUMBERS_AP.py: -------------------------------------------------------------------------------- 1 | # Copyright (c) 2019-present, Facebook, Inc. 2 | # All rights reserved. 3 | # 4 | # This source code is licensed under the license found in the 5 | # LICENSE file in the root directory of this source tree. 6 | # 7 | def f_gold ( n ) : 8 | return ( 3.0 * n ) / ( 4.0 * ( n * n ) - 1 ) 9 | 10 | 11 | #TOFILL 12 | 13 | if __name__ == '__main__': 14 | param = [ 15 | (46,), 16 | (5,), 17 | (44,), 18 | (15,), 19 | (72,), 20 | (2,), 21 | (86,), 22 | (17,), 23 | (30,), 24 | (42,) 25 | ] 26 | n_success = 0 27 | for i, parameters_set in enumerate(param): 28 | if abs(1 - (0.0000001 + abs(f_gold(*parameters_set))) / (abs(f_filled(*parameters_set)) + 0.0000001)) < 0.001: 29 | n_success+=1 30 | print("#Results: %i, %i" % (n_success, len(param))) -------------------------------------------------------------------------------- /transcoder/transcoder/data/evaluation/geeks_for_geeks_successful_test_scripts/python/PROGRAM_AREA_SQUARE.py: -------------------------------------------------------------------------------- 1 | # Copyright (c) 2019-present, Facebook, Inc. 2 | # All rights reserved. 3 | # 4 | # This source code is licensed under the license found in the 5 | # LICENSE file in the root directory of this source tree. 6 | # 7 | def f_gold ( side ) : 8 | area = side * side 9 | return area 10 | 11 | 12 | #TOFILL 13 | 14 | if __name__ == '__main__': 15 | param = [ 16 | (50,), 17 | (64,), 18 | (92,), 19 | (23,), 20 | (38,), 21 | (55,), 22 | (67,), 23 | (56,), 24 | (60,), 25 | (90,) 26 | ] 27 | n_success = 0 28 | for i, parameters_set in enumerate(param): 29 | if f_filled(*parameters_set) == f_gold(*parameters_set): 30 | n_success+=1 31 | print("#Results: %i, %i" % (n_success, len(param))) -------------------------------------------------------------------------------- /transcoder/transcoder/data/evaluation/geeks_for_geeks_successful_test_scripts/python/PROGRAM_FOR_DEADLOCK_FREE_CONDITION_IN_OPERATING_SYSTEM.py: -------------------------------------------------------------------------------- 1 | # Copyright (c) 2019-present, Facebook, Inc. 2 | # All rights reserved. 3 | # 4 | # This source code is licensed under the license found in the 5 | # LICENSE file in the root directory of this source tree. 6 | # 7 | def f_gold ( process , need ) : 8 | minResources = 0 9 | minResources = process * ( need - 1 ) + 1 10 | return minResources 11 | 12 | 13 | #TOFILL 14 | 15 | if __name__ == '__main__': 16 | param = [ 17 | (38,37,), 18 | (82,3,), 19 | (2,26,), 20 | (38,72,), 21 | (31,85,), 22 | (80,73,), 23 | (11,9,), 24 | (2,31,), 25 | (26,59,), 26 | (37,67,) 27 | ] 28 | n_success = 0 29 | for i, parameters_set in enumerate(param): 30 | if f_filled(*parameters_set) == f_gold(*parameters_set): 31 | n_success+=1 32 | print("#Results: %i, %i" % (n_success, len(param))) -------------------------------------------------------------------------------- /transcoder/transcoder/data/evaluation/geeks_for_geeks_successful_test_scripts/python/PROGRAM_FOR_FACTORIAL_OF_A_NUMBER.py: -------------------------------------------------------------------------------- 1 | # Copyright (c) 2019-present, Facebook, Inc. 2 | # All rights reserved. 3 | # 4 | # This source code is licensed under the license found in the 5 | # LICENSE file in the root directory of this source tree. 6 | # 7 | def f_gold ( n ) : 8 | return 1 if ( n == 1 or n == 0 ) else n * f_gold ( n - 1 ) ; 9 | 10 | 11 | #TOFILL 12 | 13 | if __name__ == '__main__': 14 | param = [ 15 | (79,), 16 | (95,), 17 | (84,), 18 | (12,), 19 | (72,), 20 | (67,), 21 | (82,), 22 | (14,), 23 | (2,), 24 | (69,) 25 | ] 26 | n_success = 0 27 | for i, parameters_set in enumerate(param): 28 | if f_filled(*parameters_set) == f_gold(*parameters_set): 29 | n_success+=1 30 | print("#Results: %i, %i" % (n_success, len(param))) -------------------------------------------------------------------------------- /transcoder/transcoder/data/evaluation/geeks_for_geeks_successful_test_scripts/python/PROGRAM_FOR_FACTORIAL_OF_A_NUMBER_1.py: -------------------------------------------------------------------------------- 1 | # Copyright (c) 2019-present, Facebook, Inc. 2 | # All rights reserved. 3 | # 4 | # This source code is licensed under the license found in the 5 | # LICENSE file in the root directory of this source tree. 6 | # 7 | def f_gold ( n ) : 8 | return 1 if ( n == 1 or n == 0 ) else n * f_gold ( n - 1 ) ; 9 | 10 | 11 | #TOFILL 12 | 13 | if __name__ == '__main__': 14 | param = [ 15 | (57,), 16 | (28,), 17 | (23,), 18 | (79,), 19 | (52,), 20 | (42,), 21 | (79,), 22 | (77,), 23 | (99,), 24 | (70,) 25 | ] 26 | n_success = 0 27 | for i, parameters_set in enumerate(param): 28 | if f_filled(*parameters_set) == f_gold(*parameters_set): 29 | n_success+=1 30 | print("#Results: %i, %i" % (n_success, len(param))) -------------------------------------------------------------------------------- /transcoder/transcoder/data/evaluation/geeks_for_geeks_successful_test_scripts/python/PROGRAM_FOR_FACTORIAL_OF_A_NUMBER_2.py: -------------------------------------------------------------------------------- 1 | # Copyright (c) 2019-present, Facebook, Inc. 2 | # All rights reserved. 3 | # 4 | # This source code is licensed under the license found in the 5 | # LICENSE file in the root directory of this source tree. 6 | # 7 | def f_gold ( n ) : 8 | return 1 if ( n == 1 or n == 0 ) else n * f_gold ( n - 1 ) 9 | 10 | 11 | #TOFILL 12 | 13 | if __name__ == '__main__': 14 | param = [ 15 | (24,), 16 | (46,), 17 | (47,), 18 | (41,), 19 | (98,), 20 | (69,), 21 | (83,), 22 | (2,), 23 | (12,), 24 | (11,) 25 | ] 26 | n_success = 0 27 | for i, parameters_set in enumerate(param): 28 | if f_filled(*parameters_set) == f_gold(*parameters_set): 29 | n_success+=1 30 | print("#Results: %i, %i" % (n_success, len(param))) -------------------------------------------------------------------------------- /transcoder/transcoder/data/evaluation/geeks_for_geeks_successful_test_scripts/python/PROGRAM_PRINT_SUM_GIVEN_NTH_TERM.py: -------------------------------------------------------------------------------- 1 | # Copyright (c) 2019-present, Facebook, Inc. 2 | # All rights reserved. 3 | # 4 | # This source code is licensed under the license found in the 5 | # LICENSE file in the root directory of this source tree. 6 | # 7 | def f_gold ( n ) : 8 | S = 0 9 | for i in range ( 1 , n + 1 ) : 10 | S += i * i - ( i - 1 ) * ( i - 1 ) 11 | return S 12 | 13 | 14 | #TOFILL 15 | 16 | if __name__ == '__main__': 17 | param = [ 18 | (39,), 19 | (20,), 20 | (10,), 21 | (39,), 22 | (70,), 23 | (21,), 24 | (21,), 25 | (80,), 26 | (89,), 27 | (99,) 28 | ] 29 | n_success = 0 30 | for i, parameters_set in enumerate(param): 31 | if f_filled(*parameters_set) == f_gold(*parameters_set): 32 | n_success+=1 33 | print("#Results: %i, %i" % (n_success, len(param))) -------------------------------------------------------------------------------- /transcoder/transcoder/data/evaluation/geeks_for_geeks_successful_test_scripts/python/PROGRAM_PRINT_SUM_GIVEN_NTH_TERM_1.py: -------------------------------------------------------------------------------- 1 | # Copyright (c) 2019-present, Facebook, Inc. 2 | # All rights reserved. 3 | # 4 | # This source code is licensed under the license found in the 5 | # LICENSE file in the root directory of this source tree. 6 | # 7 | import math 8 | 9 | def f_gold ( n ) : 10 | return math.pow ( n , 2 ) 11 | 12 | 13 | #TOFILL 14 | 15 | if __name__ == '__main__': 16 | param = [ 17 | (42,), 18 | (40,), 19 | (67,), 20 | (73,), 21 | (18,), 22 | (16,), 23 | (74,), 24 | (33,), 25 | (92,), 26 | (22,) 27 | ] 28 | n_success = 0 29 | for i, parameters_set in enumerate(param): 30 | if f_filled(*parameters_set) == f_gold(*parameters_set): 31 | n_success+=1 32 | print("#Results: %i, %i" % (n_success, len(param))) -------------------------------------------------------------------------------- /transcoder/transcoder/data/evaluation/geeks_for_geeks_successful_test_scripts/python/PROGRAM_TO_FIND_REMAINDER_WITHOUT_USING_MODULO_OR_OPERATOR.py: -------------------------------------------------------------------------------- 1 | # Copyright (c) 2019-present, Facebook, Inc. 2 | # All rights reserved. 3 | # 4 | # This source code is licensed under the license found in the 5 | # LICENSE file in the root directory of this source tree. 6 | # 7 | def f_gold ( num , divisor ) : 8 | return ( num - divisor * ( num // divisor ) ) 9 | 10 | 11 | #TOFILL 12 | 13 | if __name__ == '__main__': 14 | param = [ 15 | (80,54,), 16 | (63,21,), 17 | (1,56,), 18 | (22,39,), 19 | (66,7,), 20 | (61,67,), 21 | (45,63,), 22 | (29,44,), 23 | (95,65,), 24 | (9,68,) 25 | ] 26 | n_success = 0 27 | for i, parameters_set in enumerate(param): 28 | if f_filled(*parameters_set) == f_gold(*parameters_set): 29 | n_success+=1 30 | print("#Results: %i, %i" % (n_success, len(param))) -------------------------------------------------------------------------------- /transcoder/transcoder/data/evaluation/geeks_for_geeks_successful_test_scripts/python/PROGRAM_TO_FIND_REMAINDER_WITHOUT_USING_MODULO_OR_OPERATOR_2.py: -------------------------------------------------------------------------------- 1 | # Copyright (c) 2019-present, Facebook, Inc. 2 | # All rights reserved. 3 | # 4 | # This source code is licensed under the license found in the 5 | # LICENSE file in the root directory of this source tree. 6 | # 7 | def f_gold ( num , divisor ) : 8 | while ( num >= divisor ) : 9 | num -= divisor ; 10 | return num ; 11 | 12 | 13 | #TOFILL 14 | 15 | if __name__ == '__main__': 16 | param = [ 17 | (70,13,), 18 | (77,3,), 19 | (77,73,), 20 | (88,54,), 21 | (96,39,), 22 | (6,10,), 23 | (79,95,), 24 | (44,32,), 25 | (26,86,), 26 | (82,91,) 27 | ] 28 | n_success = 0 29 | for i, parameters_set in enumerate(param): 30 | if f_filled(*parameters_set) == f_gold(*parameters_set): 31 | n_success+=1 32 | print("#Results: %i, %i" % (n_success, len(param))) -------------------------------------------------------------------------------- /transcoder/transcoder/data/evaluation/geeks_for_geeks_successful_test_scripts/python/PYTHAGOREAN_QUADRUPLE.py: -------------------------------------------------------------------------------- 1 | # Copyright (c) 2019-present, Facebook, Inc. 2 | # All rights reserved. 3 | # 4 | # This source code is licensed under the license found in the 5 | # LICENSE file in the root directory of this source tree. 6 | # 7 | def f_gold ( a , b , c , d ) : 8 | sum = a * a + b * b + c * c ; 9 | if ( d * d == sum ) : 10 | return True 11 | else : 12 | return False 13 | 14 | 15 | #TOFILL 16 | 17 | if __name__ == '__main__': 18 | param = [ 19 | (1,1,1,3,), 20 | (3,2,5,38,), 21 | (0,0,0,0,), 22 | (-1,-1,-1,1,), 23 | (82,79,6,59,), 24 | (14,57,35,29,), 25 | (6,96,45,75,), 26 | (13,7,3,63,), 27 | (96,65,72,93,), 28 | (70,33,6,2,) 29 | ] 30 | n_success = 0 31 | for i, parameters_set in enumerate(param): 32 | if f_filled(*parameters_set) == f_gold(*parameters_set): 33 | n_success+=1 34 | print("#Results: %i, %i" % (n_success, len(param))) 35 | -------------------------------------------------------------------------------- /transcoder/transcoder/data/evaluation/geeks_for_geeks_successful_test_scripts/python/PYTHON_PROGRAM_FIND_PERIMETER_CIRCUMFERENCE_SQUARE_RECTANGLE.py: -------------------------------------------------------------------------------- 1 | # Copyright (c) 2019-present, Facebook, Inc. 2 | # All rights reserved. 3 | # 4 | # This source code is licensed under the license found in the 5 | # LICENSE file in the root directory of this source tree. 6 | # 7 | def f_gold ( a ) : 8 | return ( 4 * a ) 9 | 10 | 11 | #TOFILL 12 | 13 | if __name__ == '__main__': 14 | param = [ 15 | (98,), 16 | (9,), 17 | (18,), 18 | (38,), 19 | (84,), 20 | (8,), 21 | (39,), 22 | (6,), 23 | (60,), 24 | (47,) 25 | ] 26 | n_success = 0 27 | for i, parameters_set in enumerate(param): 28 | if f_filled(*parameters_set) == f_gold(*parameters_set): 29 | n_success+=1 30 | print("#Results: %i, %i" % (n_success, len(param))) -------------------------------------------------------------------------------- /transcoder/transcoder/data/evaluation/geeks_for_geeks_successful_test_scripts/python/PYTHON_PROGRAM_FIND_PERIMETER_CIRCUMFERENCE_SQUARE_RECTANGLE_1.py: -------------------------------------------------------------------------------- 1 | # Copyright (c) 2019-present, Facebook, Inc. 2 | # All rights reserved. 3 | # 4 | # This source code is licensed under the license found in the 5 | # LICENSE file in the root directory of this source tree. 6 | # 7 | def f_gold ( l , w ) : 8 | return ( 2 * ( l + w ) ) 9 | 10 | 11 | #TOFILL 12 | 13 | if __name__ == '__main__': 14 | param = [ 15 | (58,39,), 16 | (37,49,), 17 | (56,52,), 18 | (22,43,), 19 | (77,12,), 20 | (34,31,), 21 | (74,54,), 22 | (37,52,), 23 | (21,37,), 24 | (75,30,) 25 | ] 26 | n_success = 0 27 | for i, parameters_set in enumerate(param): 28 | if f_filled(*parameters_set) == f_gold(*parameters_set): 29 | n_success+=1 30 | print("#Results: %i, %i" % (n_success, len(param))) -------------------------------------------------------------------------------- /transcoder/transcoder/data/evaluation/geeks_for_geeks_successful_test_scripts/python/QUICK_WAY_CHECK_CHARACTERS_STRING.py: -------------------------------------------------------------------------------- 1 | # Copyright (c) 2019-present, Facebook, Inc. 2 | # All rights reserved. 3 | # 4 | # This source code is licensed under the license found in the 5 | # LICENSE file in the root directory of this source tree. 6 | # 7 | def f_gold ( s ) : 8 | n = len ( s ) 9 | for i in range ( 1 , n ) : 10 | if s [ i ] != s [ 0 ] : 11 | return False 12 | return True 13 | 14 | 15 | #TOFILL 16 | 17 | if __name__ == '__main__': 18 | param = [ 19 | ('',), 20 | ('ggg',), 21 | ('11',), 22 | ('KoYIHns',), 23 | ('232',), 24 | ('10111000011101',), 25 | ('DDDD',), 26 | ('11',), 27 | ('11111',), 28 | ('ewJvixQzu',) 29 | ] 30 | n_success = 0 31 | for i, parameters_set in enumerate(param): 32 | if f_filled(*parameters_set) == f_gold(*parameters_set): 33 | n_success+=1 34 | print("#Results: %i, %i" % (n_success, len(param))) -------------------------------------------------------------------------------- /transcoder/transcoder/data/evaluation/geeks_for_geeks_successful_test_scripts/python/RECURSIVELY_BREAK_NUMBER_3_PARTS_GET_MAXIMUM_SUM.py: -------------------------------------------------------------------------------- 1 | # Copyright (c) 2019-present, Facebook, Inc. 2 | # All rights reserved. 3 | # 4 | # This source code is licensed under the license found in the 5 | # LICENSE file in the root directory of this source tree. 6 | # 7 | def f_gold ( n ) : 8 | if ( n == 0 or n == 1 ) : 9 | return n 10 | return max ( ( f_gold ( n // 2 ) + f_gold ( n // 3 ) + f_gold ( n // 4 ) ) , n ) 11 | 12 | 13 | #TOFILL 14 | 15 | if __name__ == '__main__': 16 | param = [ 17 | (39,), 18 | (79,), 19 | (7,), 20 | (76,), 21 | (48,), 22 | (18,), 23 | (58,), 24 | (17,), 25 | (36,), 26 | (5,) 27 | ] 28 | n_success = 0 29 | for i, parameters_set in enumerate(param): 30 | if f_filled(*parameters_set) == f_gold(*parameters_set): 31 | n_success+=1 32 | print("#Results: %i, %i" % (n_success, len(param))) -------------------------------------------------------------------------------- /transcoder/transcoder/data/evaluation/geeks_for_geeks_successful_test_scripts/python/ROUND_THE_GIVEN_NUMBER_TO_NEAREST_MULTIPLE_OF_10.py: -------------------------------------------------------------------------------- 1 | # Copyright (c) 2019-present, Facebook, Inc. 2 | # All rights reserved. 3 | # 4 | # This source code is licensed under the license found in the 5 | # LICENSE file in the root directory of this source tree. 6 | # 7 | def f_gold ( n ) : 8 | a = ( n // 10 ) * 10 9 | b = a + 10 10 | return ( b if n - a > b - n else a ) 11 | 12 | 13 | #TOFILL 14 | 15 | if __name__ == '__main__': 16 | param = [ 17 | (31,), 18 | (78,), 19 | (19,), 20 | (36,), 21 | (77,), 22 | (94,), 23 | (86,), 24 | (16,), 25 | (95,), 26 | (2,) 27 | ] 28 | n_success = 0 29 | for i, parameters_set in enumerate(param): 30 | if f_filled(*parameters_set) == f_gold(*parameters_set): 31 | n_success+=1 32 | print("#Results: %i, %i" % (n_success, len(param))) -------------------------------------------------------------------------------- /transcoder/transcoder/data/evaluation/geeks_for_geeks_successful_test_scripts/python/SMALLEST_OF_THREE_INTEGERS_WITHOUT_COMPARISON_OPERATORS_1.py: -------------------------------------------------------------------------------- 1 | # Copyright (c) 2019-present, Facebook, Inc. 2 | # All rights reserved. 3 | # 4 | # This source code is licensed under the license found in the 5 | # LICENSE file in the root directory of this source tree. 6 | # 7 | def f_gold ( x , y , z ) : 8 | if ( not ( y / x ) ) : 9 | return y if ( not ( y / z ) ) else z 10 | return x if ( not ( x / z ) ) else z 11 | 12 | 13 | #TOFILL 14 | 15 | if __name__ == '__main__': 16 | param = [ 17 | (48,63,56,), 18 | (11,55,84,), 19 | (50,89,96,), 20 | (21,71,74,), 21 | (94,39,42,), 22 | (22,44,86,), 23 | (3,41,68,), 24 | (67,62,94,), 25 | (59,2,83,), 26 | (50,11,1,) 27 | ] 28 | n_success = 0 29 | for i, parameters_set in enumerate(param): 30 | if f_filled(*parameters_set) == f_gold(*parameters_set): 31 | n_success+=1 32 | print("#Results: %i, %i" % (n_success, len(param))) -------------------------------------------------------------------------------- /transcoder/transcoder/data/evaluation/geeks_for_geeks_successful_test_scripts/python/SMALLEST_POWER_OF_2_GREATER_THAN_OR_EQUAL_TO_N.py: -------------------------------------------------------------------------------- 1 | # Copyright (c) 2019-present, Facebook, Inc. 2 | # All rights reserved. 3 | # 4 | # This source code is licensed under the license found in the 5 | # LICENSE file in the root directory of this source tree. 6 | # 7 | def f_gold ( n ) : 8 | count = 0 ; 9 | if ( n and not ( n & ( n - 1 ) ) ) : 10 | return n 11 | while ( n != 0 ) : 12 | n >>= 1 13 | count += 1 14 | return 1 << count ; 15 | 16 | 17 | #TOFILL 18 | 19 | if __name__ == '__main__': 20 | param = [ 21 | (13,), 22 | (27,), 23 | (1,), 24 | (24,), 25 | (98,), 26 | (94,), 27 | (36,), 28 | (41,), 29 | (74,), 30 | (39,) 31 | ] 32 | n_success = 0 33 | for i, parameters_set in enumerate(param): 34 | if f_filled(*parameters_set) == f_gold(*parameters_set): 35 | n_success+=1 36 | print("#Results: %i, %i" % (n_success, len(param))) -------------------------------------------------------------------------------- /transcoder/transcoder/data/evaluation/geeks_for_geeks_successful_test_scripts/python/SMALLEST_POWER_OF_2_GREATER_THAN_OR_EQUAL_TO_N_1.py: -------------------------------------------------------------------------------- 1 | # Copyright (c) 2019-present, Facebook, Inc. 2 | # All rights reserved. 3 | # 4 | # This source code is licensed under the license found in the 5 | # LICENSE file in the root directory of this source tree. 6 | # 7 | def f_gold ( n ) : 8 | p = 1 9 | if ( n and not ( n & ( n - 1 ) ) ) : 10 | return n 11 | while ( p < n ) : 12 | p <<= 1 13 | return p ; 14 | 15 | 16 | #TOFILL 17 | 18 | if __name__ == '__main__': 19 | param = [ 20 | (31,), 21 | (89,), 22 | (92,), 23 | (66,), 24 | (38,), 25 | (34,), 26 | (17,), 27 | (24,), 28 | (54,), 29 | (20,) 30 | ] 31 | n_success = 0 32 | for i, parameters_set in enumerate(param): 33 | if f_filled(*parameters_set) == f_gold(*parameters_set): 34 | n_success+=1 35 | print("#Results: %i, %i" % (n_success, len(param))) -------------------------------------------------------------------------------- /transcoder/transcoder/data/evaluation/geeks_for_geeks_successful_test_scripts/python/SMALLEST_POWER_OF_2_GREATER_THAN_OR_EQUAL_TO_N_2.py: -------------------------------------------------------------------------------- 1 | # Copyright (c) 2019-present, Facebook, Inc. 2 | # All rights reserved. 3 | # 4 | # This source code is licensed under the license found in the 5 | # LICENSE file in the root directory of this source tree. 6 | # 7 | def f_gold ( n ) : 8 | n -= 1 9 | n |= n >> 1 10 | n |= n >> 2 11 | n |= n >> 4 12 | n |= n >> 8 13 | n |= n >> 16 14 | n += 1 15 | return n 16 | 17 | 18 | #TOFILL 19 | 20 | if __name__ == '__main__': 21 | param = [ 22 | (60,), 23 | (20,), 24 | (33,), 25 | (34,), 26 | (68,), 27 | (79,), 28 | (20,), 29 | (41,), 30 | (36,), 31 | (17,) 32 | ] 33 | n_success = 0 34 | for i, parameters_set in enumerate(param): 35 | if f_filled(*parameters_set) == f_gold(*parameters_set): 36 | n_success+=1 37 | print("#Results: %i, %i" % (n_success, len(param))) -------------------------------------------------------------------------------- /transcoder/transcoder/data/evaluation/geeks_for_geeks_successful_test_scripts/python/SQUARED_TRIANGULAR_NUMBER_SUM_CUBES.py: -------------------------------------------------------------------------------- 1 | # Copyright (c) 2019-present, Facebook, Inc. 2 | # All rights reserved. 3 | # 4 | # This source code is licensed under the license found in the 5 | # LICENSE file in the root directory of this source tree. 6 | # 7 | def f_gold ( s ) : 8 | _sum = 0 9 | n = 1 10 | while ( _sum < s ) : 11 | _sum += n * n * n 12 | n += 1 13 | n -= 1 14 | if _sum == s : 15 | return n 16 | return - 1 17 | 18 | 19 | #TOFILL 20 | 21 | if __name__ == '__main__': 22 | param = [ 23 | (15,), 24 | (36,), 25 | (39,), 26 | (43,), 27 | (75,), 28 | (49,), 29 | (56,), 30 | (14,), 31 | (62,), 32 | (97,) 33 | ] 34 | n_success = 0 35 | for i, parameters_set in enumerate(param): 36 | if f_filled(*parameters_set) == f_gold(*parameters_set): 37 | n_success+=1 38 | print("#Results: %i, %i" % (n_success, len(param))) -------------------------------------------------------------------------------- /transcoder/transcoder/data/evaluation/geeks_for_geeks_successful_test_scripts/python/SQUARE_PYRAMIDAL_NUMBER_SUM_SQUARES.py: -------------------------------------------------------------------------------- 1 | # Copyright (c) 2019-present, Facebook, Inc. 2 | # All rights reserved. 3 | # 4 | # This source code is licensed under the license found in the 5 | # LICENSE file in the root directory of this source tree. 6 | # 7 | def f_gold ( s ) : 8 | _sum = 0 9 | n = 1 10 | while ( _sum < s ) : 11 | _sum += n * n 12 | n += 1 13 | n -= 1 14 | if _sum == s : 15 | return n 16 | return - 1 17 | 18 | 19 | #TOFILL 20 | 21 | if __name__ == '__main__': 22 | param = [ 23 | (1,), 24 | (5,), 25 | (14,), 26 | (140,), 27 | (204,), 28 | (3,), 29 | (506,), 30 | (42,), 31 | (4,), 32 | (87,) 33 | ] 34 | n_success = 0 35 | for i, parameters_set in enumerate(param): 36 | if f_filled(*parameters_set) == f_gold(*parameters_set): 37 | n_success+=1 38 | print("#Results: %i, %i" % (n_success, len(param))) -------------------------------------------------------------------------------- /transcoder/transcoder/data/evaluation/geeks_for_geeks_successful_test_scripts/python/SQUARE_ROOT_OF_AN_INTEGER.py: -------------------------------------------------------------------------------- 1 | # Copyright (c) 2019-present, Facebook, Inc. 2 | # All rights reserved. 3 | # 4 | # This source code is licensed under the license found in the 5 | # LICENSE file in the root directory of this source tree. 6 | # 7 | def f_gold ( x ) : 8 | if ( x == 0 or x == 1 ) : 9 | return x 10 | i = 1 ; result = 1 11 | while ( result <= x ) : 12 | i += 1 13 | result = i * i 14 | return i - 1 15 | 16 | 17 | #TOFILL 18 | 19 | if __name__ == '__main__': 20 | param = [ 21 | (89,), 22 | (11,), 23 | (14,), 24 | (92,), 25 | (76,), 26 | (63,), 27 | (51,), 28 | (16,), 29 | (83,), 30 | (66,) 31 | ] 32 | n_success = 0 33 | for i, parameters_set in enumerate(param): 34 | if f_filled(*parameters_set) == f_gold(*parameters_set): 35 | n_success+=1 36 | print("#Results: %i, %i" % (n_success, len(param))) -------------------------------------------------------------------------------- /transcoder/transcoder/data/evaluation/geeks_for_geeks_successful_test_scripts/python/SUM_BINOMIAL_COEFFICIENTS_1.py: -------------------------------------------------------------------------------- 1 | # Copyright (c) 2019-present, Facebook, Inc. 2 | # All rights reserved. 3 | # 4 | # This source code is licensed under the license found in the 5 | # LICENSE file in the root directory of this source tree. 6 | # 7 | def f_gold ( n ) : 8 | return ( 1 << n ) ; 9 | 10 | 11 | #TOFILL 12 | 13 | if __name__ == '__main__': 14 | param = [ 15 | (48,), 16 | (42,), 17 | (15,), 18 | (75,), 19 | (23,), 20 | (41,), 21 | (46,), 22 | (99,), 23 | (36,), 24 | (53,) 25 | ] 26 | n_success = 0 27 | for i, parameters_set in enumerate(param): 28 | if f_filled(*parameters_set) == f_gold(*parameters_set): 29 | n_success+=1 30 | print("#Results: %i, %i" % (n_success, len(param))) -------------------------------------------------------------------------------- /transcoder/transcoder/data/evaluation/geeks_for_geeks_successful_test_scripts/python/SUM_DIVISORS_1_N_1.py: -------------------------------------------------------------------------------- 1 | # Copyright (c) 2019-present, Facebook, Inc. 2 | # All rights reserved. 3 | # 4 | # This source code is licensed under the license found in the 5 | # LICENSE file in the root directory of this source tree. 6 | # 7 | def f_gold ( n ) : 8 | sum = 0 9 | for i in range ( 1 , n + 1 ) : 10 | sum += int ( n / i ) * i 11 | return int ( sum ) 12 | 13 | 14 | #TOFILL 15 | 16 | if __name__ == '__main__': 17 | param = [ 18 | (73,), 19 | (41,), 20 | (36,), 21 | (28,), 22 | (49,), 23 | (24,), 24 | (85,), 25 | (59,), 26 | (82,), 27 | (40,) 28 | ] 29 | n_success = 0 30 | for i, parameters_set in enumerate(param): 31 | if f_filled(*parameters_set) == f_gold(*parameters_set): 32 | n_success+=1 33 | print("#Results: %i, %i" % (n_success, len(param))) -------------------------------------------------------------------------------- /transcoder/transcoder/data/evaluation/geeks_for_geeks_successful_test_scripts/python/SUM_K_TH_GROUP_ODD_POSITIVE_NUMBERS.py: -------------------------------------------------------------------------------- 1 | # Copyright (c) 2019-present, Facebook, Inc. 2 | # All rights reserved. 3 | # 4 | # This source code is licensed under the license found in the 5 | # LICENSE file in the root directory of this source tree. 6 | # 7 | def f_gold ( k ) : 8 | cur = int ( ( k * ( k - 1 ) ) + 1 ) 9 | sum = 0 10 | while k : 11 | sum += cur 12 | cur += 2 13 | k = k - 1 14 | return sum 15 | 16 | 17 | #TOFILL 18 | 19 | if __name__ == '__main__': 20 | param = [ 21 | (91,), 22 | (52,), 23 | (78,), 24 | (51,), 25 | (65,), 26 | (39,), 27 | (42,), 28 | (12,), 29 | (56,), 30 | (98,) 31 | ] 32 | n_success = 0 33 | for i, parameters_set in enumerate(param): 34 | if f_filled(*parameters_set) == f_gold(*parameters_set): 35 | n_success+=1 36 | print("#Results: %i, %i" % (n_success, len(param))) -------------------------------------------------------------------------------- /transcoder/transcoder/data/evaluation/geeks_for_geeks_successful_test_scripts/python/SUM_K_TH_GROUP_ODD_POSITIVE_NUMBERS_1.py: -------------------------------------------------------------------------------- 1 | # Copyright (c) 2019-present, Facebook, Inc. 2 | # All rights reserved. 3 | # 4 | # This source code is licensed under the license found in the 5 | # LICENSE file in the root directory of this source tree. 6 | # 7 | def f_gold ( k ) : 8 | return k * k * k 9 | 10 | 11 | #TOFILL 12 | 13 | if __name__ == '__main__': 14 | param = [ 15 | (57,), 16 | (96,), 17 | (14,), 18 | (64,), 19 | (24,), 20 | (74,), 21 | (85,), 22 | (27,), 23 | (78,), 24 | (1,) 25 | ] 26 | n_success = 0 27 | for i, parameters_set in enumerate(param): 28 | if f_filled(*parameters_set) == f_gold(*parameters_set): 29 | n_success+=1 30 | print("#Results: %i, %i" % (n_success, len(param))) -------------------------------------------------------------------------------- /transcoder/transcoder/data/evaluation/geeks_for_geeks_successful_test_scripts/python/SUM_MATRIX_ELEMENT_ABSOLUTE_DIFFERENCE_ROW_COLUMN_NUMBERS_1.py: -------------------------------------------------------------------------------- 1 | # Copyright (c) 2019-present, Facebook, Inc. 2 | # All rights reserved. 3 | # 4 | # This source code is licensed under the license found in the 5 | # LICENSE file in the root directory of this source tree. 6 | # 7 | def f_gold ( n ) : 8 | sum = 0 9 | for i in range ( n ) : 10 | sum += i * ( n - i ) 11 | return 2 * sum 12 | 13 | 14 | #TOFILL 15 | 16 | if __name__ == '__main__': 17 | param = [ 18 | (63,), 19 | (72,), 20 | (28,), 21 | (35,), 22 | (6,), 23 | (70,), 24 | (20,), 25 | (8,), 26 | (8,), 27 | (35,) 28 | ] 29 | n_success = 0 30 | for i, parameters_set in enumerate(param): 31 | if f_filled(*parameters_set) == f_gold(*parameters_set): 32 | n_success+=1 33 | print("#Results: %i, %i" % (n_success, len(param))) -------------------------------------------------------------------------------- /transcoder/transcoder/data/evaluation/geeks_for_geeks_successful_test_scripts/python/SUM_MATRIX_ELEMENT_ABSOLUTE_DIFFERENCE_ROW_COLUMN_NUMBERS_2.py: -------------------------------------------------------------------------------- 1 | # Copyright (c) 2019-present, Facebook, Inc. 2 | # All rights reserved. 3 | # 4 | # This source code is licensed under the license found in the 5 | # LICENSE file in the root directory of this source tree. 6 | # 7 | def f_gold ( n ) : 8 | n -= 1 9 | sum = 0 10 | sum += ( n * ( n + 1 ) ) / 2 11 | sum += ( n * ( n + 1 ) * ( 2 * n + 1 ) ) / 6 12 | return int ( sum ) 13 | 14 | 15 | #TOFILL 16 | 17 | if __name__ == '__main__': 18 | param = [ 19 | (12,), 20 | (89,), 21 | (76,), 22 | (2,), 23 | (81,), 24 | (11,), 25 | (26,), 26 | (35,), 27 | (16,), 28 | (66,) 29 | ] 30 | n_success = 0 31 | for i, parameters_set in enumerate(param): 32 | if f_filled(*parameters_set) == f_gold(*parameters_set): 33 | n_success+=1 34 | print("#Results: %i, %i" % (n_success, len(param))) -------------------------------------------------------------------------------- /transcoder/transcoder/data/evaluation/geeks_for_geeks_successful_test_scripts/python/SUM_MATRIX_ELEMENT_ELEMENT_INTEGER_DIVISION_ROW_COLUMN.py: -------------------------------------------------------------------------------- 1 | # Copyright (c) 2019-present, Facebook, Inc. 2 | # All rights reserved. 3 | # 4 | # This source code is licensed under the license found in the 5 | # LICENSE file in the root directory of this source tree. 6 | # 7 | def f_gold ( N ) : 8 | ans = 0 9 | for i in range ( 1 , N + 1 ) : 10 | for j in range ( 1 , N + 1 ) : 11 | ans += i // j 12 | return ans 13 | 14 | 15 | #TOFILL 16 | 17 | if __name__ == '__main__': 18 | param = [ 19 | (60,), 20 | (74,), 21 | (8,), 22 | (74,), 23 | (34,), 24 | (66,), 25 | (96,), 26 | (11,), 27 | (45,), 28 | (72,) 29 | ] 30 | n_success = 0 31 | for i, parameters_set in enumerate(param): 32 | if f_filled(*parameters_set) == f_gold(*parameters_set): 33 | n_success+=1 34 | print("#Results: %i, %i" % (n_success, len(param))) -------------------------------------------------------------------------------- /transcoder/transcoder/data/evaluation/geeks_for_geeks_successful_test_scripts/python/SUM_OF_ALL_ELEMENTS_UP_TO_NTH_ROW_IN_A_PASCALS_TRIANGLE.py: -------------------------------------------------------------------------------- 1 | # Copyright (c) 2019-present, Facebook, Inc. 2 | # All rights reserved. 3 | # 4 | # This source code is licensed under the license found in the 5 | # LICENSE file in the root directory of this source tree. 6 | # 7 | def f_gold ( n ) : 8 | sum = 0 9 | for row in range ( n ) : 10 | sum = sum + ( 1 << row ) 11 | return sum 12 | 13 | 14 | #TOFILL 15 | 16 | if __name__ == '__main__': 17 | param = [ 18 | (21,), 19 | (4,), 20 | (31,), 21 | (79,), 22 | (38,), 23 | (75,), 24 | (36,), 25 | (32,), 26 | (23,), 27 | (65,) 28 | ] 29 | n_success = 0 30 | for i, parameters_set in enumerate(param): 31 | if f_filled(*parameters_set) == f_gold(*parameters_set): 32 | n_success+=1 33 | print("#Results: %i, %i" % (n_success, len(param))) -------------------------------------------------------------------------------- /transcoder/transcoder/data/evaluation/geeks_for_geeks_successful_test_scripts/python/SUM_OF_ALL_ELEMENTS_UP_TO_NTH_ROW_IN_A_PASCALS_TRIANGLE_1.py: -------------------------------------------------------------------------------- 1 | # Copyright (c) 2019-present, Facebook, Inc. 2 | # All rights reserved. 3 | # 4 | # This source code is licensed under the license found in the 5 | # LICENSE file in the root directory of this source tree. 6 | # 7 | def f_gold ( n ) : 8 | sum = 0 9 | sum = 1 << n ; 10 | return ( sum - 1 ) 11 | 12 | 13 | #TOFILL 14 | 15 | if __name__ == '__main__': 16 | param = [ 17 | (53,), 18 | (3,), 19 | (28,), 20 | (44,), 21 | (84,), 22 | (83,), 23 | (46,), 24 | (3,), 25 | (16,), 26 | (89,) 27 | ] 28 | n_success = 0 29 | for i, parameters_set in enumerate(param): 30 | if f_filled(*parameters_set) == f_gold(*parameters_set): 31 | n_success+=1 32 | print("#Results: %i, %i" % (n_success, len(param))) -------------------------------------------------------------------------------- /transcoder/transcoder/data/evaluation/geeks_for_geeks_successful_test_scripts/python/SUM_PAIRWISE_PRODUCTS.py: -------------------------------------------------------------------------------- 1 | # Copyright (c) 2019-present, Facebook, Inc. 2 | # All rights reserved. 3 | # 4 | # This source code is licensed under the license found in the 5 | # LICENSE file in the root directory of this source tree. 6 | # 7 | def f_gold ( n ) : 8 | sm = 0 9 | for i in range ( 1 , n + 1 ) : 10 | for j in range ( i , n + 1 ) : 11 | sm = sm + i * j 12 | return sm 13 | 14 | 15 | #TOFILL 16 | 17 | if __name__ == '__main__': 18 | param = [ 19 | (21,), 20 | (32,), 21 | (16,), 22 | (38,), 23 | (9,), 24 | (3,), 25 | (5,), 26 | (46,), 27 | (45,), 28 | (87,) 29 | ] 30 | n_success = 0 31 | for i, parameters_set in enumerate(param): 32 | if f_filled(*parameters_set) == f_gold(*parameters_set): 33 | n_success+=1 34 | print("#Results: %i, %i" % (n_success, len(param))) -------------------------------------------------------------------------------- /transcoder/transcoder/data/evaluation/geeks_for_geeks_successful_test_scripts/python/SUM_PAIRWISE_PRODUCTS_1.py: -------------------------------------------------------------------------------- 1 | # Copyright (c) 2019-present, Facebook, Inc. 2 | # All rights reserved. 3 | # 4 | # This source code is licensed under the license found in the 5 | # LICENSE file in the root directory of this source tree. 6 | # 7 | def f_gold ( n ) : 8 | multiTerms = n * ( n + 1 ) // 2 9 | sm = multiTerms 10 | for i in range ( 2 , n + 1 ) : 11 | multiTerms = multiTerms - ( i - 1 ) 12 | sm = sm + multiTerms * i 13 | return sm 14 | 15 | 16 | #TOFILL 17 | 18 | if __name__ == '__main__': 19 | param = [ 20 | (41,), 21 | (50,), 22 | (67,), 23 | (18,), 24 | (60,), 25 | (6,), 26 | (27,), 27 | (46,), 28 | (50,), 29 | (20,) 30 | ] 31 | n_success = 0 32 | for i, parameters_set in enumerate(param): 33 | if f_filled(*parameters_set) == f_gold(*parameters_set): 34 | n_success+=1 35 | print("#Results: %i, %i" % (n_success, len(param))) -------------------------------------------------------------------------------- /transcoder/transcoder/data/evaluation/geeks_for_geeks_successful_test_scripts/python/SUM_PAIRWISE_PRODUCTS_2.py: -------------------------------------------------------------------------------- 1 | # Copyright (c) 2019-present, Facebook, Inc. 2 | # All rights reserved. 3 | # 4 | # This source code is licensed under the license found in the 5 | # LICENSE file in the root directory of this source tree. 6 | # 7 | def f_gold ( n ) : 8 | return n * ( n + 1 ) * ( n + 2 ) * ( 3 * n + 1 ) / 24 9 | 10 | 11 | #TOFILL 12 | 13 | if __name__ == '__main__': 14 | param = [ 15 | (57,), 16 | (18,), 17 | (97,), 18 | (9,), 19 | (42,), 20 | (67,), 21 | (71,), 22 | (66,), 23 | (69,), 24 | (18,) 25 | ] 26 | n_success = 0 27 | for i, parameters_set in enumerate(param): 28 | if f_filled(*parameters_set) == f_gold(*parameters_set): 29 | n_success+=1 30 | print("#Results: %i, %i" % (n_success, len(param))) -------------------------------------------------------------------------------- /transcoder/transcoder/data/evaluation/geeks_for_geeks_successful_test_scripts/python/SUM_SEQUENCE_2_22_222.py: -------------------------------------------------------------------------------- 1 | # Copyright (c) 2019-present, Facebook, Inc. 2 | # All rights reserved. 3 | # 4 | # This source code is licensed under the license found in the 5 | # LICENSE file in the root directory of this source tree. 6 | # 7 | import math 8 | 9 | def f_gold ( n ) : 10 | return 0.0246 * ( math.pow ( 10 , n ) - 1 - ( 9 * n ) ) 11 | 12 | 13 | #TOFILL 14 | 15 | if __name__ == '__main__': 16 | param = [ 17 | (88,), 18 | (79,), 19 | (7,), 20 | (36,), 21 | (23,), 22 | (10,), 23 | (27,), 24 | (30,), 25 | (71,), 26 | (6,) 27 | ] 28 | n_success = 0 29 | for i, parameters_set in enumerate(param): 30 | if abs(1 - (0.0000001 + abs(f_gold(*parameters_set))) / (abs(f_filled(*parameters_set)) + 0.0000001)) < 0.001: 31 | n_success+=1 32 | print("#Results: %i, %i" % (n_success, len(param))) -------------------------------------------------------------------------------- /transcoder/transcoder/data/evaluation/geeks_for_geeks_successful_test_scripts/python/SUM_SERIES_0_6_0_06_0_006_0_0006_N_TERMS.py: -------------------------------------------------------------------------------- 1 | # Copyright (c) 2019-present, Facebook, Inc. 2 | # All rights reserved. 3 | # 4 | # This source code is licensed under the license found in the 5 | # LICENSE file in the root directory of this source tree. 6 | # 7 | def f_gold ( n ) : 8 | return ( ( 0.666 ) * ( 1 - 1 / pow ( 10 , n ) ) ) ; 9 | 10 | 11 | #TOFILL 12 | 13 | if __name__ == '__main__': 14 | param = [ 15 | (1,), 16 | (2,), 17 | (3,), 18 | (4,), 19 | (5,), 20 | (74,), 21 | (77,), 22 | (67,), 23 | (9,), 24 | (12,) 25 | ] 26 | n_success = 0 27 | for i, parameters_set in enumerate(param): 28 | if abs(1 - (0.0000001 + abs(f_gold(*parameters_set))) / (abs(f_filled(*parameters_set)) + 0.0000001)) < 0.001: 29 | n_success+=1 30 | print("#Results: %i, %i" % (n_success, len(param))) -------------------------------------------------------------------------------- /transcoder/transcoder/data/evaluation/geeks_for_geeks_successful_test_scripts/python/SUM_SERIES_12_32_52_2N_12.py: -------------------------------------------------------------------------------- 1 | # Copyright (c) 2019-present, Facebook, Inc. 2 | # All rights reserved. 3 | # 4 | # This source code is licensed under the license found in the 5 | # LICENSE file in the root directory of this source tree. 6 | # 7 | def f_gold ( n ) : 8 | sum = 0 9 | for i in range ( 1 , n + 1 ) : 10 | sum = sum + ( 2 * i - 1 ) * ( 2 * i - 1 ) 11 | return sum 12 | 13 | 14 | #TOFILL 15 | 16 | if __name__ == '__main__': 17 | param = [ 18 | (14,), 19 | (61,), 20 | (37,), 21 | (86,), 22 | (47,), 23 | (98,), 24 | (70,), 25 | (24,), 26 | (76,), 27 | (24,) 28 | ] 29 | n_success = 0 30 | for i, parameters_set in enumerate(param): 31 | if f_filled(*parameters_set) == f_gold(*parameters_set): 32 | n_success+=1 33 | print("#Results: %i, %i" % (n_success, len(param))) -------------------------------------------------------------------------------- /transcoder/transcoder/data/evaluation/geeks_for_geeks_successful_test_scripts/python/SUM_SERIES_12_32_52_2N_12_1.py: -------------------------------------------------------------------------------- 1 | # Copyright (c) 2019-present, Facebook, Inc. 2 | # All rights reserved. 3 | # 4 | # This source code is licensed under the license found in the 5 | # LICENSE file in the root directory of this source tree. 6 | # 7 | def f_gold ( n ) : 8 | return int ( ( n * ( 2 * n - 1 ) * ( 2 * n + 1 ) ) / 3 ) 9 | 10 | 11 | #TOFILL 12 | 13 | if __name__ == '__main__': 14 | param = [ 15 | (84,), 16 | (74,), 17 | (91,), 18 | (34,), 19 | (36,), 20 | (28,), 21 | (70,), 22 | (7,), 23 | (24,), 24 | (47,) 25 | ] 26 | n_success = 0 27 | for i, parameters_set in enumerate(param): 28 | if f_filled(*parameters_set) == f_gold(*parameters_set): 29 | n_success+=1 30 | print("#Results: %i, %i" % (n_success, len(param))) -------------------------------------------------------------------------------- /transcoder/transcoder/data/evaluation/geeks_for_geeks_successful_test_scripts/python/SUM_SERIES_555555_N_TERMS.py: -------------------------------------------------------------------------------- 1 | # Copyright (c) 2019-present, Facebook, Inc. 2 | # All rights reserved. 3 | # 4 | # This source code is licensed under the license found in the 5 | # LICENSE file in the root directory of this source tree. 6 | # 7 | def f_gold ( n ) : 8 | return ( int ) ( 0.6172 * ( pow ( 10 , n ) - 1 ) - 0.55 * n ) 9 | 10 | 11 | #TOFILL 12 | 13 | if __name__ == '__main__': 14 | param = [ 15 | (18,), 16 | (81,), 17 | (77,), 18 | (84,), 19 | (87,), 20 | (14,), 21 | (15,), 22 | (3,), 23 | (21,), 24 | (60,) 25 | ] 26 | n_success = 0 27 | for i, parameters_set in enumerate(param): 28 | if f_filled(*parameters_set) == f_gold(*parameters_set): 29 | n_success+=1 30 | print("#Results: %i, %i" % (n_success, len(param))) -------------------------------------------------------------------------------- /transcoder/transcoder/data/evaluation/geeks_for_geeks_successful_test_scripts/python/SUM_SUBSETS_SET_FORMED_FIRST_N_NATURAL_NUMBERS.py: -------------------------------------------------------------------------------- 1 | # Copyright (c) 2019-present, Facebook, Inc. 2 | # All rights reserved. 3 | # 4 | # This source code is licensed under the license found in the 5 | # LICENSE file in the root directory of this source tree. 6 | # 7 | def f_gold ( n ) : 8 | return ( n * ( n + 1 ) / 2 ) * ( 1 << ( n - 1 ) ) 9 | 10 | 11 | #TOFILL 12 | 13 | if __name__ == '__main__': 14 | param = [ 15 | (76,), 16 | (26,), 17 | (45,), 18 | (35,), 19 | (34,), 20 | (22,), 21 | (3,), 22 | (25,), 23 | (22,), 24 | (78,) 25 | ] 26 | n_success = 0 27 | for i, parameters_set in enumerate(param): 28 | if f_filled(*parameters_set) == f_gold(*parameters_set): 29 | n_success+=1 30 | print("#Results: %i, %i" % (n_success, len(param))) -------------------------------------------------------------------------------- /transcoder/transcoder/data/evaluation/geeks_for_geeks_successful_test_scripts/python/SWAP_ALL_ODD_AND_EVEN_BITS.py: -------------------------------------------------------------------------------- 1 | # Copyright (c) 2019-present, Facebook, Inc. 2 | # All rights reserved. 3 | # 4 | # This source code is licensed under the license found in the 5 | # LICENSE file in the root directory of this source tree. 6 | # 7 | def f_gold ( x ) : 8 | even_bits = x & 0xAAAAAAAA 9 | odd_bits = x & 0x55555555 10 | even_bits >>= 1 11 | odd_bits <<= 1 12 | return ( even_bits | odd_bits ) 13 | 14 | 15 | #TOFILL 16 | 17 | if __name__ == '__main__': 18 | param = [ 19 | (99,), 20 | (94,), 21 | (11,), 22 | (3,), 23 | (77,), 24 | (57,), 25 | (54,), 26 | (66,), 27 | (98,), 28 | (36,) 29 | ] 30 | n_success = 0 31 | for i, parameters_set in enumerate(param): 32 | if f_filled(*parameters_set) == f_gold(*parameters_set): 33 | n_success+=1 34 | print("#Results: %i, %i" % (n_success, len(param))) -------------------------------------------------------------------------------- /transcoder/transcoder/data/evaluation/geeks_for_geeks_successful_test_scripts/python/SWAP_TWO_NIBBLES_BYTE.py: -------------------------------------------------------------------------------- 1 | # Copyright (c) 2019-present, Facebook, Inc. 2 | # All rights reserved. 3 | # 4 | # This source code is licensed under the license found in the 5 | # LICENSE file in the root directory of this source tree. 6 | # 7 | def f_gold ( x ) : 8 | return ( ( x & 0x0F ) << 4 | ( x & 0xF0 ) >> 4 ) 9 | 10 | 11 | #TOFILL 12 | 13 | if __name__ == '__main__': 14 | param = [ 15 | (57,), 16 | (99,), 17 | (66,), 18 | (97,), 19 | (95,), 20 | (42,), 21 | (95,), 22 | (89,), 23 | (3,), 24 | (84,) 25 | ] 26 | n_success = 0 27 | for i, parameters_set in enumerate(param): 28 | if f_filled(*parameters_set) == f_gold(*parameters_set): 29 | n_success+=1 30 | print("#Results: %i, %i" % (n_success, len(param))) -------------------------------------------------------------------------------- /transcoder/transcoder/data/evaluation/geeks_for_geeks_successful_test_scripts/python/TAIL_RECURSION.py: -------------------------------------------------------------------------------- 1 | # Copyright (c) 2019-present, Facebook, Inc. 2 | # All rights reserved. 3 | # 4 | # This source code is licensed under the license found in the 5 | # LICENSE file in the root directory of this source tree. 6 | # 7 | def f_gold ( n ) : 8 | if ( n == 0 ) : 9 | return 1 10 | return n * f_gold ( n - 1 ) 11 | 12 | 13 | #TOFILL 14 | 15 | if __name__ == '__main__': 16 | param = [ 17 | (77,), 18 | (62,), 19 | (42,), 20 | (16,), 21 | (82,), 22 | (37,), 23 | (29,), 24 | (32,), 25 | (82,), 26 | (91,) 27 | ] 28 | n_success = 0 29 | for i, parameters_set in enumerate(param): 30 | if f_filled(*parameters_set) == f_gold(*parameters_set): 31 | n_success+=1 32 | print("#Results: %i, %i" % (n_success, len(param))) -------------------------------------------------------------------------------- /transcoder/transcoder/data/evaluation/geeks_for_geeks_successful_test_scripts/python/TAIL_RECURSION_FIBONACCI.py: -------------------------------------------------------------------------------- 1 | # Copyright (c) 2019-present, Facebook, Inc. 2 | # All rights reserved. 3 | # 4 | # This source code is licensed under the license found in the 5 | # LICENSE file in the root directory of this source tree. 6 | # 7 | def f_gold ( n , a = 0 , b = 1 ) : 8 | if n == 0 : 9 | return a 10 | if n == 1 : 11 | return b 12 | return f_gold ( n - 1 , b , a + b ) ; 13 | 14 | 15 | #TOFILL 16 | 17 | if __name__ == '__main__': 18 | param = [ 19 | (4,43,24,), 20 | (60,48,98,), 21 | (92,21,69,), 22 | (73,79,38,), 23 | (58,38,30,), 24 | (82,26,12,), 25 | (53,10,17,), 26 | (57,37,26,), 27 | (47,91,99,), 28 | (83,3,64,) 29 | ] 30 | n_success = 0 31 | for i, parameters_set in enumerate(param): 32 | if f_filled(*parameters_set) == f_gold(*parameters_set): 33 | n_success+=1 34 | print("#Results: %i, %i" % (n_success, len(param))) -------------------------------------------------------------------------------- /transcoder/transcoder/data/evaluation/geeks_for_geeks_successful_test_scripts/python/TOTAL_NUMBER_OF_NON_DECREASING_NUMBERS_WITH_N_DIGITS_1.py: -------------------------------------------------------------------------------- 1 | # Copyright (c) 2019-present, Facebook, Inc. 2 | # All rights reserved. 3 | # 4 | # This source code is licensed under the license found in the 5 | # LICENSE file in the root directory of this source tree. 6 | # 7 | def f_gold ( n ) : 8 | N = 10 9 | count = 1 10 | for i in range ( 1 , n + 1 ) : 11 | count = int ( count * ( N + i - 1 ) ) 12 | count = int ( count / i ) 13 | return count 14 | 15 | 16 | #TOFILL 17 | 18 | if __name__ == '__main__': 19 | param = [ 20 | (40,), 21 | (11,), 22 | (94,), 23 | (73,), 24 | (6,), 25 | (73,), 26 | (58,), 27 | (40,), 28 | (64,), 29 | (66,) 30 | ] 31 | n_success = 0 32 | for i, parameters_set in enumerate(param): 33 | if f_filled(*parameters_set) == f_gold(*parameters_set): 34 | n_success+=1 35 | print("#Results: %i, %i" % (n_success, len(param))) -------------------------------------------------------------------------------- /transcoder/transcoder/data/evaluation/geeks_for_geeks_successful_test_scripts/python/TRIANGULAR_MATCHSTICK_NUMBER.py: -------------------------------------------------------------------------------- 1 | # Copyright (c) 2019-present, Facebook, Inc. 2 | # All rights reserved. 3 | # 4 | # This source code is licensed under the license found in the 5 | # LICENSE file in the root directory of this source tree. 6 | # 7 | def f_gold ( x ) : 8 | return ( 3 * x * ( x + 1 ) ) / 2 9 | 10 | 11 | #TOFILL 12 | 13 | if __name__ == '__main__': 14 | param = [ 15 | (6,), 16 | (25,), 17 | (15,), 18 | (30,), 19 | (17,), 20 | (80,), 21 | (27,), 22 | (13,), 23 | (12,), 24 | (67,) 25 | ] 26 | n_success = 0 27 | for i, parameters_set in enumerate(param): 28 | if f_filled(*parameters_set) == f_gold(*parameters_set): 29 | n_success+=1 30 | print("#Results: %i, %i" % (n_success, len(param))) -------------------------------------------------------------------------------- /transcoder/transcoder/data/evaluation/geeks_for_geeks_successful_test_scripts/python/TURN_OFF_THE_RIGHTMOST_SET_BIT.py: -------------------------------------------------------------------------------- 1 | # Copyright (c) 2019-present, Facebook, Inc. 2 | # All rights reserved. 3 | # 4 | # This source code is licensed under the license found in the 5 | # LICENSE file in the root directory of this source tree. 6 | # 7 | def f_gold ( n ) : 8 | return n & ( n - 1 ) 9 | 10 | 11 | #TOFILL 12 | 13 | if __name__ == '__main__': 14 | param = [ 15 | (9,), 16 | (54,), 17 | (60,), 18 | (32,), 19 | (41,), 20 | (64,), 21 | (4,), 22 | (51,), 23 | (57,), 24 | (92,) 25 | ] 26 | n_success = 0 27 | for i, parameters_set in enumerate(param): 28 | if f_filled(*parameters_set) == f_gold(*parameters_set): 29 | n_success+=1 30 | print("#Results: %i, %i" % (n_success, len(param))) -------------------------------------------------------------------------------- /transcoder/transcoder/data/evaluation/geeks_for_geeks_successful_test_scripts/python/WRITE_A_C_PROGRAM_TO_FIND_THE_PARITY_OF_AN_UNSIGNED_INTEGER.py: -------------------------------------------------------------------------------- 1 | # Copyright (c) 2019-present, Facebook, Inc. 2 | # All rights reserved. 3 | # 4 | # This source code is licensed under the license found in the 5 | # LICENSE file in the root directory of this source tree. 6 | # 7 | def f_gold ( n ) : 8 | parity = 0 9 | while n : 10 | parity = ~ parity 11 | n = n & ( n - 1 ) 12 | return parity 13 | 14 | 15 | #TOFILL 16 | 17 | if __name__ == '__main__': 18 | param = [ 19 | (63,), 20 | (64,), 21 | (85,), 22 | (36,), 23 | (20,), 24 | (63,), 25 | (42,), 26 | (19,), 27 | (62,), 28 | (97,) 29 | ] 30 | n_success = 0 31 | for i, parameters_set in enumerate(param): 32 | if f_filled(*parameters_set) == f_gold(*parameters_set): 33 | n_success+=1 34 | print("#Results: %i, %i" % (n_success, len(param))) -------------------------------------------------------------------------------- /transcoder/transcoder/data/evaluation/geeks_for_geeks_successful_test_scripts/python/WRITE_ONE_LINE_C_FUNCTION_TO_FIND_WHETHER_A_NO_IS_POWER_OF_TWO.py: -------------------------------------------------------------------------------- 1 | # Copyright (c) 2019-present, Facebook, Inc. 2 | # All rights reserved. 3 | # 4 | # This source code is licensed under the license found in the 5 | # LICENSE file in the root directory of this source tree. 6 | # 7 | def f_gold ( n ) : 8 | if ( n == 0 ) : 9 | return False 10 | while ( n != 1 ) : 11 | if ( n % 2 != 0 ) : 12 | return False 13 | n = n // 2 14 | return True 15 | 16 | 17 | #TOFILL 18 | 19 | if __name__ == '__main__': 20 | param = [ 21 | (1,), 22 | (2,), 23 | (8,), 24 | (1024,), 25 | (24,), 26 | (7,), 27 | (46,), 28 | (61,), 29 | (73,), 30 | (66,) 31 | ] 32 | n_success = 0 33 | for i, parameters_set in enumerate(param): 34 | if f_filled(*parameters_set) == f_gold(*parameters_set): 35 | n_success+=1 36 | print("#Results: %i, %i" % (n_success, len(param))) -------------------------------------------------------------------------------- /transcoder/transcoder/data/evaluation/geeks_for_geeks_successful_test_scripts/python/WRITE_ONE_LINE_C_FUNCTION_TO_FIND_WHETHER_A_NO_IS_POWER_OF_TWO_1.py: -------------------------------------------------------------------------------- 1 | # Copyright (c) 2019-present, Facebook, Inc. 2 | # All rights reserved. 3 | # 4 | # This source code is licensed under the license found in the 5 | # LICENSE file in the root directory of this source tree. 6 | # 7 | def f_gold ( x ) : 8 | return ( x and ( not ( x & ( x - 1 ) ) ) ) 9 | 10 | 11 | #TOFILL 12 | 13 | if __name__ == '__main__': 14 | param = [ 15 | (1,), 16 | (2,), 17 | (8,), 18 | (1024,), 19 | (24,), 20 | (7,), 21 | (46,), 22 | (61,), 23 | (73,), 24 | (66,) 25 | ] 26 | n_success = 0 27 | for i, parameters_set in enumerate(param): 28 | if f_filled(*parameters_set) == f_gold(*parameters_set): 29 | n_success+=1 30 | print("#Results: %i, %i" % (n_success, len(param))) -------------------------------------------------------------------------------- /transcoder/transcoder/data/test_dataset/cpp/cpp.000.json.gz: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/martysai/source-code-summarization/bea10372904f2e66850925f7a3cfda3aabc5ce62/transcoder/transcoder/data/test_dataset/cpp/cpp.000.json.gz -------------------------------------------------------------------------------- /transcoder/transcoder/data/test_dataset/cpp/cpp.001.json.gz: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/martysai/source-code-summarization/bea10372904f2e66850925f7a3cfda3aabc5ce62/transcoder/transcoder/data/test_dataset/cpp/cpp.001.json.gz -------------------------------------------------------------------------------- /transcoder/transcoder/data/test_dataset/java/java.000.json.gz: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/martysai/source-code-summarization/bea10372904f2e66850925f7a3cfda3aabc5ce62/transcoder/transcoder/data/test_dataset/java/java.000.json.gz -------------------------------------------------------------------------------- /transcoder/transcoder/data/test_dataset/java/java.001.json.gz: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/martysai/source-code-summarization/bea10372904f2e66850925f7a3cfda3aabc5ce62/transcoder/transcoder/data/test_dataset/java/java.001.json.gz -------------------------------------------------------------------------------- /transcoder/transcoder/data/test_dataset/python/python.000.json.gz: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/martysai/source-code-summarization/bea10372904f2e66850925f7a3cfda3aabc5ce62/transcoder/transcoder/data/test_dataset/python/python.000.json.gz -------------------------------------------------------------------------------- /transcoder/transcoder/data/test_dataset/python/python.001.json.gz: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/martysai/source-code-summarization/bea10372904f2e66850925f7a3cfda3aabc5ce62/transcoder/transcoder/data/test_dataset/python/python.001.json.gz -------------------------------------------------------------------------------- /transcoder/transcoder/input_code.cpp: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | 5 | using namespace std; 6 | 7 | int main() { 8 | int t, n; 9 | cin >> t; 10 | for (int k = 0; k < t; ++k) { 11 | int a_left, a_right, a; 12 | cin >> n; 13 | for (int i = 0; i < n; ++i) { 14 | if (i == 0) 15 | cin >> a_left; 16 | else if (i == n - 1) 17 | cin >> a_right; 18 | else 19 | cin >> a; 20 | } 21 | if (a_left < a_right) 22 | cout << "YES\n"; 23 | else 24 | cout << "NO\n"; 25 | } 26 | } 27 | -------------------------------------------------------------------------------- /transcoder/transcoder/preprocessing/__init__.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/martysai/source-code-summarization/bea10372904f2e66850925f7a3cfda3aabc5ce62/transcoder/transcoder/preprocessing/__init__.py -------------------------------------------------------------------------------- /transcoder/transcoder/preprocessing/__pycache__/__init__.cpython-37.pyc: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/martysai/source-code-summarization/bea10372904f2e66850925f7a3cfda3aabc5ce62/transcoder/transcoder/preprocessing/__pycache__/__init__.cpython-37.pyc -------------------------------------------------------------------------------- /transcoder/transcoder/preprocessing/src/__init__.py: -------------------------------------------------------------------------------- 1 | # Copyright (c) 2019-present, Facebook, Inc. 2 | # All rights reserved. 3 | # 4 | # This source code is licensed under the license found in the 5 | # LICENSE file in the root directory of this source tree. 6 | # -------------------------------------------------------------------------------- /transcoder/transcoder/preprocessing/src/__pycache__/__init__.cpython-37.pyc: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/martysai/source-code-summarization/bea10372904f2e66850925f7a3cfda3aabc5ce62/transcoder/transcoder/preprocessing/src/__pycache__/__init__.cpython-37.pyc -------------------------------------------------------------------------------- /transcoder/transcoder/preprocessing/src/__pycache__/code_tokenizer.cpython-37.pyc: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/martysai/source-code-summarization/bea10372904f2e66850925f7a3cfda3aabc5ce62/transcoder/transcoder/preprocessing/src/__pycache__/code_tokenizer.cpython-37.pyc -------------------------------------------------------------------------------- /transcoder/transcoder/preprocessing/src/__pycache__/javalang_tokenizer.cpython-37.pyc: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/martysai/source-code-summarization/bea10372904f2e66850925f7a3cfda3aabc5ce62/transcoder/transcoder/preprocessing/src/__pycache__/javalang_tokenizer.cpython-37.pyc -------------------------------------------------------------------------------- /transcoder/transcoder/preprocessing/src/__pycache__/timeout.cpython-37.pyc: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/martysai/source-code-summarization/bea10372904f2e66850925f7a3cfda3aabc5ce62/transcoder/transcoder/preprocessing/src/__pycache__/timeout.cpython-37.pyc -------------------------------------------------------------------------------- /transcoder/transcoder/sc_run_translate.sh: -------------------------------------------------------------------------------- 1 | #!/bin/bash 2 | #SBATCH --job-name=TC-Translate 3 | #SBATCH --error=TC-Translate-%j.err 4 | #SBATCH --output=TC-Translate-%j.log 5 | #SBATCH --time=10:00 6 | #SBATCH --cpus-per-task=4 7 | #SBATCH --gpus=1 8 | 9 | python translate.py --src_lang cpp --tgt_lang python --model_path models/model_2.pth < input_code.cpp 10 | 11 | -------------------------------------------------------------------------------- /tree_transformer/heatmap/__init__.py: -------------------------------------------------------------------------------- 1 | from . import heatmap_utils 2 | from . import sequence_scorer -------------------------------------------------------------------------------- /tree_transformer/runs/sc_code_infer.sh: -------------------------------------------------------------------------------- 1 | #!/bin/bash 2 | #SBATCH --job-name=inference 3 | #SBATCH --error=inference-%j.err 4 | #SBATCH --output=inference-%j.log 5 | #SBATCH --time=2:00:00 6 | #SBATCH --partition=normal 7 | #SBATCH --cpus-per-task=4 8 | #SBATCH --gpus=1 9 | 10 | bash tt_code_infer.sh 11 | -------------------------------------------------------------------------------- /tree_transformer/runs/sc_code_train.sh: -------------------------------------------------------------------------------- 1 | #!/bin/bash 2 | #SBATCH --job-name=tuned_training 3 | #SBATCH --error=tuned_training-%j.err 4 | #SBATCH --output=tuned_training-%j.log 5 | #SBATCH --time=18:00:00 6 | #SBATCH --partition=normal 7 | #SBATCH --cpus-per-task=4 8 | #SBATCH --gpus=1 9 | 10 | bash tt_code_train.sh 11 | -------------------------------------------------------------------------------- /tree_transformer/runs/tt_code_infer.sh: -------------------------------------------------------------------------------- 1 | export MAXTOKENS=1024 2 | export INFER=y 3 | export dis_port_str=--master_port=6102 4 | export problem=nstack_merge_summ_cdds_65k 5 | export MAX_UPDATE=61000 6 | export UPDATE_FREQ=1 7 | export att_dropout=0.2 8 | export DROPOUT=0.3 && 9 | 10 | export CUDA_VISIBLE_DEVICES=`nvidia-smi --query-gpu=index --format=csv,noheader | tr '\n' ',' | sed 's/,$/\n/'` 11 | echo "TT CODE TRAIN" 12 | echo "CUDA VISIBLE DEVICES = $CUDA_VISIBLE_DEVICES" 13 | 14 | bash run_code_nstack_nmt_infer.sh dwnstack_merge2seq_node_iwslt_onvalue_base_upmean_mean_mlesubenc_allcross_hier $CUDA_VISIBLE_DEVICES 15 | -------------------------------------------------------------------------------- /tree_transformer/runs/tt_code_train.sh: -------------------------------------------------------------------------------- 1 | export MAXTOKENS=1024 2 | export INFER=n 3 | export dis_port_str=--master_port=6102 4 | export problem=nstack_merge_summ_cdds_65k 5 | export MAX_UPDATE=61000 6 | export UPDATE_FREQ=1 7 | export att_dropout=0.2 8 | export DROPOUT=0.3 && 9 | 10 | export CUDA_VISIBLE_DEVICES=`nvidia-smi --query-gpu=index --format=csv,noheader | tr '\n' ',' | sed 's/,$/\n/'` 11 | echo "TT CODE TRAIN" 12 | echo "CUDA VISIBLE DEVICES = $CUDA_VISIBLE_DEVICES" 13 | 14 | bash run_code_nstack_nmt.sh dwnstack_merge2seq_node_iwslt_onvalue_base_upmean_mean_mlesubenc_allcross_hier $CUDA_VISIBLE_DEVICES 15 | -------------------------------------------------------------------------------- /tree_transformer/scripts/__init__.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/martysai/source-code-summarization/bea10372904f2e66850925f7a3cfda3aabc5ce62/tree_transformer/scripts/__init__.py -------------------------------------------------------------------------------- /tree_transformer/scripts/compound_split_bleu.sh: -------------------------------------------------------------------------------- 1 | #!/bin/bash 2 | 3 | if [ $# -ne 1 ]; then 4 | echo "usage: $0 GENERATE_PY_OUTPUT" 5 | exit 1 6 | fi 7 | 8 | GEN=$1 9 | 10 | SYS=$GEN.sys 11 | REF=$GEN.ref 12 | 13 | if [ $(tail -n 1 $GEN | grep BLEU | wc -l) -ne 1 ]; then 14 | echo "not done generating" 15 | exit 16 | fi 17 | 18 | grep ^H $GEN | cut -f3- | perl -ple 's{(\S)-(\S)}{$1 ##AT##-##AT## $2}g' > $SYS 19 | grep ^T $GEN | cut -f2- | perl -ple 's{(\S)-(\S)}{$1 ##AT##-##AT## $2}g' > $REF 20 | 21 | perl -ple 's{(\S)-(\S)}{$1 ##AT##-##AT## $2}g' > $REF 22 | python score.py --sys $SYS --ref $REF 23 | -------------------------------------------------------------------------------- /tree_transformer/scripts/sacrebleu_pregen.sh: -------------------------------------------------------------------------------- 1 | #!/bin/bash 2 | 3 | if [ $# -ne 4 ]; then 4 | echo "usage: $0 TESTSET SRCLANG TGTLANG GEN" 5 | exit 1 6 | fi 7 | 8 | TESTSET=$1 9 | SRCLANG=$2 10 | TGTLANG=$3 11 | 12 | GEN=$4 13 | 14 | echo 'Cloning Moses github repository (for tokenization scripts)...' 15 | git clone https://github.com/moses-smt/mosesdecoder.git 16 | 17 | SCRIPTS=mosesdecoder/scripts 18 | DETOKENIZER=$SCRIPTS/tokenizer/tokenizer.perl 19 | 20 | grep ^H $GEN \ 21 | | sed 's/^H\-//' \ 22 | | sort -n -k 1 \ 23 | | cut -f 3 \ 24 | | perl $DETOKENIZER -l $TGTLANG \ 25 | | sed "s/ - /-/g" \ 26 | > $GEN.sorted.detok 27 | 28 | sacrebleu --test-set $TESTSET --language-pair "${SRCLANG}-${TGTLANG}" < $GEN.sorted.detok 29 | -------------------------------------------------------------------------------- /tree_transformer/src/bpe/__init__.py: -------------------------------------------------------------------------------- 1 | from . import bpe_utils -------------------------------------------------------------------------------- /tree_transformer/src/criterions/__init__.py: -------------------------------------------------------------------------------- 1 | from . import classification_cross_entropy 2 | 3 | 4 | 5 | -------------------------------------------------------------------------------- /tree_transformer/src/data/transforms/__init__.py: -------------------------------------------------------------------------------- 1 | # Copyright (c) 2017-present, Facebook, Inc. 2 | # All rights reserved. 3 | # 4 | # This source code is licensed under the license found in the LICENSE file in 5 | # the root directory of this source tree. An additional grant of patent rights 6 | # can be found in the PATENTS file in the same directory. 7 | 8 | 9 | import importlib 10 | import os 11 | 12 | from fairseq import registry 13 | 14 | 15 | build_tokenizer, register_tokenizer, TOKENIZER_REGISTRY = registry.setup_registry( 16 | '--tokenizer', 17 | default='space', 18 | ) 19 | 20 | 21 | build_bpe, register_bpe, BPE_REGISTRY = registry.setup_registry( 22 | '--bpe', 23 | default=None, 24 | ) 25 | 26 | 27 | # automatically import any Python files in the transforms/ directory 28 | for file in os.listdir(os.path.dirname(__file__)): 29 | if file.endswith('.py') and not file.startswith('_'): 30 | module = file[:file.find('.py')] 31 | importlib.import_module('fairseq.data.transforms.' + module) 32 | -------------------------------------------------------------------------------- /tree_transformer/src/data/transforms/nltk_tokenizer.py: -------------------------------------------------------------------------------- 1 | # Copyright (c) 2017-present, Facebook, Inc. 2 | # All rights reserved. 3 | # 4 | # This source code is licensed under the license found in the LICENSE file in 5 | # the root directory of this source tree. An additional grant of patent rights 6 | # can be found in the PATENTS file in the same directory. 7 | 8 | from fairseq.data.transforms import register_tokenizer 9 | 10 | 11 | @register_tokenizer('nltk') 12 | class NLTKTokenizer(object): 13 | 14 | def __init__(self, source_lang=None, target_lang=None): 15 | try: 16 | from nltk.tokenize import word_tokenize 17 | self.word_tokenize = word_tokenize 18 | except ImportError: 19 | raise ImportError('Please install nltk with: pip install nltk') 20 | 21 | def encode(self, x: str) -> str: 22 | return ' '.join(self.word_tokenize(x)) 23 | 24 | def decode(self, x: str) -> str: 25 | return x 26 | -------------------------------------------------------------------------------- /tree_transformer/src/data/transforms/space_tokenizer.py: -------------------------------------------------------------------------------- 1 | # Copyright (c) 2017-present, Facebook, Inc. 2 | # All rights reserved. 3 | # 4 | # This source code is licensed under the license found in the LICENSE file in 5 | # the root directory of this source tree. An additional grant of patent rights 6 | # can be found in the PATENTS file in the same directory. 7 | 8 | import re 9 | 10 | from fairseq.data.transforms import register_tokenizer 11 | 12 | 13 | @register_tokenizer('space') 14 | class SpaceTokenizer(object): 15 | 16 | def __init__(self, source_lang=None, target_lang=None): 17 | self.space_tok = re.compile(r"\s+") 18 | 19 | def encode(self, x: str) -> str: 20 | return self.space_tok.sub(" ", x).strip().split() 21 | 22 | def decode(self, x: str) -> str: 23 | return x 24 | -------------------------------------------------------------------------------- /tree_transformer/src/dptree/__init__.py: -------------------------------------------------------------------------------- 1 | from .tree_process import * 2 | from .tree_builder import * 3 | from .nstack_process import * 4 | 5 | -------------------------------------------------------------------------------- /tree_transformer/src/heatmap/__init__.py: -------------------------------------------------------------------------------- 1 | # from . import heatmap_utils 2 | # from . import sequence_scorer -------------------------------------------------------------------------------- /tree_transformer/src/models/__init__.py: -------------------------------------------------------------------------------- 1 | 2 | from . import dptree2seg_transformer 3 | from . import nstack_transformer 4 | from . import nstack_archs 5 | -------------------------------------------------------------------------------- /tree_transformer/src/optim/__init__.py: -------------------------------------------------------------------------------- 1 | from . import lr_scheduler -------------------------------------------------------------------------------- /tree_transformer/src/optim/lr_scheduler/__init__.py: -------------------------------------------------------------------------------- 1 | from . import flex_inv_sqrt_schedule 2 | 3 | 4 | -------------------------------------------------------------------------------- /tree_transformer/src/tasks/__init__.py: -------------------------------------------------------------------------------- 1 | from .dptree2seq_translation import * 2 | from .fairseq_classification import * 3 | from .dptree_classification import * 4 | from .dptree_sep_classification import * 5 | from .dptree2seq_sep_translation import * 6 | from .nstack_from_dptree_classification import * 7 | from .nstack_classification import * 8 | from .nstack2seq_translation import * 9 | 10 | 11 | -------------------------------------------------------------------------------- /tree_transformer/src/trainers/__init__.py: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/martysai/source-code-summarization/bea10372904f2e66850925f7a3cfda3aabc5ce62/tree_transformer/src/trainers/__init__.py --------------------------------------------------------------------------------