GitHub - RahulBenaka/JAVA-: THIS CONTAINS ALL THE QUESTIONS WITH THEIR SOLUTIONS WHICH I SOLVED WHILE DOING CODING NINJAS COURSE ON JAVA LANGUAGE.

Branches Tags

Name		Name	Last commit message	Last commit date
Latest commit History 2 Commits
0_1_2_sort.txt		0_1_2_sort.txt
0_1_Sort.txt		0_1_Sort.txt
2nd_Largest_in_array.txt		2nd_Largest_in_array.txt
Access_Modifiers_Classification.PNG		Access_Modifiers_Classification.PNG
All_Substrings.txt		All_Substrings.txt
Amstrong_number.txt		Amstrong_number.txt
Append_N_elements_to_LL.txt		Append_N_elements_to_LL.txt
Arranging_num_in_arr.txt		Arranging_num_in_arr.txt
Array_Equilibrium_index(Time_complexity).txt		Array_Equilibrium_index(Time_complexity).txt
Array_Intersection(Time_complexity).txt		Array_Intersection(Time_complexity).txt
Array_Intersectiontxt.txt		Array_Intersectiontxt.txt
Array_Manipulation.txt		Array_Manipulation.txt
BST_class.txt		BST_class.txt
BST_to_LL.txt		BST_to_LL.txt
Binary_search.txt		Binary_search.txt
Binary_to_Dec.txt		Binary_to_Dec.txt
Bitwise_mcq.txt		Bitwise_mcq.txt
Bob_and_his_Strings(CODEKAZE_21_MOCK_TEST_PROBLEM).txt		Bob_and_his_Strings(CODEKAZE_21_MOCK_TEST_PROBLEM).txt
Bubble_Sort.txt		Bubble_Sort.txt
Buy_the_Tickets_PriorityQueue.txt		Buy_the_Tickets_PriorityQueue.txt
Car_Championship_Problem_(Coding_ninjas_test_problem).txt		Car_Championship_Problem_(Coding_ninjas_test_problem).txt
Char_pattern.txt		Char_pattern.txt
Char_pattern2.txt		Char_pattern2.txt
Char_pattern3.txt		Char_pattern3.txt
Check_Max_Heap_PriorityQueues.txt		Check_Max_Heap_PriorityQueues.txt
Check_Num_Seq.txt		Check_Num_Seq.txt
Check_Tree_is_Balanced_(Time_Complexity_of_O(n)_).jpg		Check_Tree_is_Balanced_(Time_Complexity_of_O(n)_).jpg
Check_Tree_is_Balanced_(Time_Complexity_of_O(n^2)_).jpg		Check_Tree_is_Balanced_(Time_Complexity_of_O(n^2)_).jpg
Check_array_rotation.txt		Check_array_rotation.txt
Check_if_it_is_BST_or_not(New_type of O(n)).jpg		Check_if_it_is_BST_or_not(New_type of O(n)).jpg
Check_permutation.txt		Check_permutation.txt
Code_Kaze_Mock_Test_Problems.txt		Code_Kaze_Mock_Test_Problems.txt
Complex_Number.txt		Complex_Number.txt
Compressing_string.txt		Compressing_string.txt
Construct_BST_for_given_Sorted_array.txt		Construct_BST_for_given_Sorted_array.txt
Construct_Tree_using_Inorder_and_Postorder.txt		Construct_Tree_using_Inorder_and_Postorder.txt
Construct_Tree_using_Inorder_and_Preorder.txt		Construct_Tree_using_Inorder_and_Preorder.txt
Count_words.txt		Count_words.txt
Create_and_replace_duplicate_node_Trees.txt		Create_and_replace_duplicate_node_Trees.txt
Dec_to_Binary.txt		Dec_to_Binary.txt
Delete_Node_LL.txt		Delete_Node_LL.txt
Delete_node_rec_LL.txt		Delete_node_rec_LL.txt
Diameter_of_a_Tree.txt		Diameter_of_a_Tree.txt
Diamond_pattern.txt		Diamond_pattern.txt
Extract_unique_char_Hashmap.txt		Extract_unique_char_Hashmap.txt
FInd_duplicate_element(Time_complexity).txt		FInd_duplicate_element(Time_complexity).txt
FInd_unique_element(Time_complexity).txt		FInd_unique_element(Time_complexity).txt
Fibonnaci_function.txt		Fibonnaci_function.txt
Find_Largest_BST_in_given_Binary_Tree.txt		Find_Largest_BST_in_given_Binary_Tree.txt
Find_Path_in_BST.txt		Find_Path_in_BST.txt
Find_duplicate.txt		Find_duplicate.txt
Find_node_LL.txt		Find_node_LL.txt
Find_node_in_LL_rec.txt		Find_node_in_LL_rec.txt
Find_unique.txt		Find_unique.txt
Finding_Max_and_Min_elements_of_a_Tree.txt		Finding_Max_and_Min_elements_of_a_Tree.txt
Finding_midpoint_LL.txt		Finding_midpoint_LL.txt
Function_return_mcq.txt		Function_return_mcq.txt
Half_Diamond_triangle.txt		Half_Diamond_triangle.txt
Height_of_a_Tree.txt		Height_of_a_Tree.txt
Highest_occuring_character.txt		Highest_occuring_character.txt
Increasing_Isoscoles_pattern.txt		Increasing_Isoscoles_pattern.txt
Inplace_Heap_Sort.txt		Inplace_Heap_Sort.txt
Input_function_to_take_input_for_tree_nodes_in_level_order.jpg		Input_function_to_take_input_for_tree_nodes_in_level_order.jpg
Insert_Nod_LL.txt		Insert_Nod_LL.txt
Insert_node_LL_rec.txt		Insert_node_LL_rec.txt
Insertion_Sort.txt		Insertion_Sort.txt
Inverse_triangle_pattern.txt		Inverse_triangle_pattern.txt
K_Largest_elem_PriorityQueue.txt		K_Largest_elem_PriorityQueue.txt
K_Smallest_elem_PriorityQueue.txt		K_Smallest_elem_PriorityQueue.txt
Kth_Largest_elem_PriorityQueue.txt		Kth_Largest_elem_PriorityQueue.txt
Largest_row_or_column.txt		Largest_row_or_column.txt
Leader_in_array.txt		Leader_in_array.txt
Longest_consecutive_integers_Hashmap.txt		Longest_consecutive_integers_Hashmap.txt
Longest_sequnce_of_no._having_sum_0_Hashmap.txt		Longest_sequnce_of_no._having_sum_0_Hashmap.txt
Lowest_common_ancestor_of_given_two_nodes_of_BST.txt		Lowest_common_ancestor_of_given_two_nodes_of_BST.txt
MIrror_Binary_Tree.txt		MIrror_Binary_Tree.txt
Max_Freq_elem_Hashmap.txt		Max_Freq_elem_Hashmap.txt
Max_Heap_implementation.txt		Max_Heap_implementation.txt
Merge_2_sorted_LL.txt		Merge_2_sorted_LL.txt
Merge_Sort.txt		Merge_Sort.txt
Merge_Sort_LL.txt		Merge_Sort_LL.txt
Merge_Two_Sorted_array(Merge_Sort).txt		Merge_Two_Sorted_array(Merge_Sort).txt
Min_Heap_implementation.txt		Min_Heap_implementation.txt
Min_steps_to_1.txt		Min_steps_to_1.txt
Min_steps_to_1_DP.txt		Min_steps_to_1_DP.txt
Minimum_swaps_Algorithm.txt		Minimum_swaps_Algorithm.txt
Mirror_pattern.txt		Mirror_pattern.txt
Most_imp_qsn_Hashmap.txt		Most_imp_qsn_Hashmap.txt
New_Year_Chaos.txt		New_Year_Chaos.txt
No._Isoscoles_triangle_pattern.txt		No._Isoscoles_triangle_pattern.txt
Nodes_greater_than_X_Trees.txt		Nodes_greater_than_X_Trees.txt
Nodes_without_Siblings_Trees.txt		Nodes_without_Siblings_Trees.txt
Number_of_leaf_nodes_in_a_Tree_code.jpg		Number_of_leaf_nodes_in_a_Tree_code.jpg
Number_star_pattern.txt		Number_star_pattern.txt
Odd_Square_pattern.txt		Odd_Square_pattern.txt
Pair_Sum(Time_complexity).txt		Pair_Sum(Time_complexity).txt
Pair_Sum_in_BST.txt		Pair_Sum_in_BST.txt
Pair_sum.txt		Pair_sum.txt
Pair_sum_0_Hashmap.txt		Pair_sum_0_Hashmap.txt
Pairs_with_diff_k_Hashmap.txt		Pairs_with_diff_k_Hashmap.txt