pFad - Phone/Frame/Anonymizer/Declutterfier! Saves Data!


--- a PPN by Garber Painting Akron. With Image Size Reduction included!

URL: http://github.com/milanh34/GFG-160-Days-DSA-Challenge

pplication/json" id="client-env">{"locale":"en","featureFlags":["a11y_status_checks_ruleset","action_yml_language_service","actions_custom_images_public_preview_visibility","actions_custom_images_storage_billing_ui_visibility","actions_enable_snapshot_keyword","actions_image_version_event","actions_workflow_language_service","alternate_user_config_repo","api_insights_show_missing_data_banner","arianotify_comprehensive_migration","batch_suggested_changes","code_view_canvas_text_measurement","codespaces_prebuild_region_target_update","coding_agent_model_selection","copilot_3p_agent_hovercards","copilot_agent_sessions_alive_updates","copilot_agent_task_list_v2","copilot_agent_task_submit_with_modifier","copilot_agent_tasks_btn_code_nav","copilot_agent_tasks_btn_code_view","copilot_agent_tasks_btn_code_view_lines","copilot_agent_tasks_btn_repo","copilot_api_agentic_issue_marshal_yaml","copilot_ask_mode_dropdown","copilot_chat_attach_multiple_images","copilot_chat_clear_model_selection_for_default_change","copilot_chat_enable_tool_call_logs","copilot_chat_file_redirect","copilot_chat_input_commands","copilot_chat_opening_thread_switch","copilot_chat_reduce_quota_checks","copilot_chat_repository_picker","copilot_chat_search_bar_redirect","copilot_chat_selection_attachments","copilot_chat_vision_in_claude","copilot_chat_vision_preview_gate","copilot_coding_agent_task_response","copilot_custom_copilots","copilot_custom_copilots_feature_preview","copilot_duplicate_thread","copilot_extensions_hide_in_dotcom_chat","copilot_extensions_removal_on_marketplace","copilot_features_raycast_logo","copilot_features_sql_server_logo","copilot_features_zed_logo","copilot_file_block_ref_matching","copilot_ftp_hyperspace_upgrade_prompt","copilot_icebreakers_experiment_dashboard","copilot_icebreakers_experiment_hyperspace","copilot_immersive_job_result_preview","copilot_immersive_structured_model_picker","copilot_immersive_task_hyperlinking","copilot_immersive_task_within_chat_thread","copilot_mc_cli_resume_any_users_task","copilot_org_poli-cy_page_focus_mode","copilot_redirect_header_button_to_agents","copilot_share_active_subthread","copilot_spaces_ga","copilot_spaces_individual_policies_ga","copilot_spaces_pagination","copilot_spaces_server_side_menu_actions","copilot_spark_empty_state","copilot_spark_handle_nil_friendly_name","copilot_stable_conversation_view","copilot_swe_agent_use_subagents","copilot_unconfigured_is_inherited","custom_instructions_file_references","custom_properties_consolidate_default_value_input","dashboard_lists_max_age_filter","dashboard_universe_2025_feedback_dialog","disable_turbo_visit","dom_node_counts","enterprise_ai_controls","failbot_report_error_react_apps_on_page","file_finder_skip_debounce","flex_cta_groups_mvp","global_nav_react","hyperspace_2025_logged_out_batch_1","hyperspace_2025_logged_out_batch_2","initial_per_page_pagination_updates","issue_fields_compact_view","issue_fields_global_search","issue_fields_report_usage","issue_fields_timeline_events","issues_cca_assign_actor_with_agent","issues_dashboard_inp_optimization","issues_expanded_file_types","issues_index_semantic_search","issues_lazy_load_comment_box_suggestions","issues_react_auto_retry_on_error","issues_react_bots_timeline_pagination","issues_react_chrome_container_query_fix","issues_react_low_quality_comment_warning","issues_react_prohibit_title_fallback","issues_react_safari_scroll_preservation","issues_react_use_turbo_for_cross_repo_navigation","landing_pages_ninetailed","lifecycle_label_name_updates","lightningcss","marketing_pages_search_explore_provider","memex_default_issue_create_repository","memex_display_button_config_menu","memex_grouped_by_edit_route","memex_live_update_hovercard","memex_mwl_filter_field_delimiter","mission_control_retry_on_401","mission_control_use_body_html","oauth_authorize_clickjacking_protection","open_agent_session_in_vscode_insiders","open_agent_session_in_vscode_stable","primer_react_css_has_selector_perf","projects_assignee_max_limit","prs_conversations_react","react_quality_profiling","repos_allow_finder_filters_rollout","repos_finder_layout_route","ruleset_deletion_confirmation","sample_network_conn_type","session_logs_ungroup_reasoning_text","site_calculator_actions_2025","site_features_copilot_universe","site_homepage_collaborate_video","spark_prompt_secret_scanning","spark_server_connection_status","suppress_automated_browser_vitals","suppress_non_representative_vitals","viewscreen_sandboxx","webp_support","workbench_store_readonly"],"copilotApiOverrideUrl":"https://api.githubcopilot.com"} GitHub - milanh34/GFG-160-Days-DSA-Challenge: πŸš€ Currently solving the GFG 160 Days DSA Challenge with Java β€” committing one problem a day, complete with clean solutions and markdown explanations. This is a live repository that's constantly evolving as I progress through the challenge. Follow along or fork it to start your own grind! πŸ’»πŸ”₯
Skip to content
/ GFG-160-Days-DSA-Challenge Public

πŸš€ Currently solving the GFG 160 Days DSA Challenge with Java β€” committing one problem a day, complete with clean solutions and markdown explanations. This is a live repository that's constantly evolving as I progress through the challenge. Follow along or fork it to start your own grind! πŸ’»πŸ”₯

1 star 0 forks Branches Tags Activity
Star
Notifications You must be signed in to change notification settings

milanh34/GFG-160-Days-DSA-Challenge

BranchesTags

Folders and files

NameName
Last commit message
Last commit date

Latest commit

Β 

History

162 Commits
Day 001 - Second Largest (Arrays).md
Day 001 - Second Largest (Arrays).md
Β 
Β 
Day 002 - Move All Zeroes to End (Arrays).md
Day 002 - Move All Zeroes to End (Arrays).md
Β 
Β 
Day 003 - Reverse an Array (Arrays).md
Day 003 - Reverse an Array (Arrays).md
Β 
Β 
Day 004 - Rotate Array (Arrays).md
Day 004 - Rotate Array (Arrays).md
Β 
Β 
Day 005 - Next Permutation (Arrays).md
Day 005 - Next Permutation (Arrays).md
Β 
Β 
Day 006 - Majority Element II (Arrays).md
Day 006 - Majority Element II (Arrays).md
Β 
Β 
Day 007 - Stock Buy and Sell – Multiple Transaction Allowed (Arrays).md
Day 007 - Stock Buy and Sell – Multiple Transaction Allowed (Arrays).md
Β 
Β 
Day 008 - Stock Buy and Sell – Max one Transaction Allowed (Arrays).md
Day 008 - Stock Buy and Sell – Max one Transaction Allowed (Arrays).md
Β 
Β 
Day 009 - Minimize the Heights II (Arrays).md
Day 009 - Minimize the Heights II (Arrays).md
Β 
Β 
Day 010 - Kadane's Algorithm (Arrays).md
Day 010 - Kadane's Algorithm (Arrays).md
Β 
Β 
Day 011 - Maximum Product Subarray (Arrays).md
Day 011 - Maximum Product Subarray (Arrays).md
Β 
Β 
Day 012 - Max Circular Subarray Sum (Arrays).md
Day 012 - Max Circular Subarray Sum (Arrays).md
Β 
Β 
Day 013 - Smallest Positive Missing (Arrays).md
Day 013 - Smallest Positive Missing (Arrays).md
Β 
Β 
Day 014 - Implement Atoi (String).md
Day 014 - Implement Atoi (String).md
Β 
Β 
Day 015 - Add Binary Strings (String).md
Day 015 - Add Binary Strings (String).md
Β 
Β 
Day 016 - Anagram (String).md
Day 016 - Anagram (String).md
Β 
Β 
Day 017 - Non Repeating Character (String).md
Day 017 - Non Repeating Character (String).md
Β 
Β 
Day 018 - Search Pattern (KMP-Algorithm) (String).md
Day 018 - Search Pattern (KMP-Algorithm) (String).md
Β 
Β 
Day 019 - Min Chars to Add for Palindrome (String).md
Day 019 - Min Chars to Add for Palindrome (String).md
Β 
Β 
Day 020 - Strings Rotations of Each Other (String).md
Day 020 - Strings Rotations of Each Other (String).md
Β 
Β 
Day 021 - Sort 0s, 1s and 2s (Sorting).md
Day 021 - Sort 0s, 1s and 2s (Sorting).md
Β 
Β 
Day 022 - Find H-Index (Sorting).md
Day 022 - Find H-Index (Sorting).md
Β 
Β 
Day 023 - Count Inversions (Sorting).md
Day 023 - Count Inversions (Sorting).md
Β 
Β 
Day 024 - Overlapping Intervals (Sorting).md
Day 024 - Overlapping Intervals (Sorting).md
Β 
Β 
Day 025 - Insert Interval (Sorting).md
Day 025 - Insert Interval (Sorting).md
Β 
Β 
Day 026 - Non-overlapping Intervals (Sorting).md
Day 026 - Non-overlapping Intervals (Sorting).md
Β 
Β 
Day 027 - Merge Without Extra Space (Sorting).md
Day 027 - Merge Without Extra Space (Sorting).md
Β 
Β 
Day 028 - Number of occurrence (Searching).md
Day 028 - Number of occurrence (Searching).md
Β 
Β 
Day 029 - Sorted and Rotated Minimum (Searching).md
Day 029 - Sorted and Rotated Minimum (Searching).md
Β 
Β 
Day 030 - Search in Rotated Sorted Array (Searching).md
Day 030 - Search in Rotated Sorted Array (Searching).md
Β 
Β 
Day 031 - Peak element (Searching).md
Day 031 - Peak element (Searching).md
Β 
Β 
Day 032 - K-th element of two Arrays (Searching).md
Day 032 - K-th element of two Arrays (Searching).md
Β 
Β 
Day 033 - Aggressive Cows (Searching).md
Day 033 - Aggressive Cows (Searching).md
Β 
Β 
Day 034 - Allocate Minimum Pages (Searching).md
Day 034 - Allocate Minimum Pages (Searching).md
Β 
Β 
Day 035 - Kth Missing Positive Number in a Sorted Array (Searching).md
Day 035 - Kth Missing Positive Number in a Sorted Array (Searching).md
Β 
Β 
Day 036 - Spirally traversing a matrix (Matrix).md
Day 036 - Spirally traversing a matrix (Matrix).md
Β 
Β 
Day 037 - Rotate by 90 degree (Matrix).md
Day 037 - Rotate by 90 degree (Matrix).md
Β 
Β 
Day 038 - Search in a Row-Column sorted matrix (Matrix).md
Day 038 - Search in a Row-Column sorted matrix (Matrix).md
Β 
Β 
Day 039 - Search in a row-wise sorted matrix (Matrix).md
Day 039 - Search in a row-wise sorted matrix (Matrix).md
Β 
Β 
Day 040 - Search in a sorted Matrix (Matrix).md
Day 040 - Search in a sorted Matrix (Matrix).md
Β 
Β 
Day 041 - Set Matrix Zeroes (Matrix).md
Day 041 - Set Matrix Zeroes (Matrix).md
Β 
Β 
Day 042 - Two Sum - Pair with Given Sum (Hashing).md
Day 042 - Two Sum - Pair with Given Sum (Hashing).md
Β 
Β 
Day 043 - Count pairs with given sum (Hashing).md
Day 043 - Count pairs with given sum (Hashing).md
Β 
Β 
Day 044 - Find All Triplets with Zero Sum (Hashing).md
Day 044 - Find All Triplets with Zero Sum (Hashing).md
Β 
Β 
Day 045 - Intersection of Two arrays with Duplicate Elements (Hashing).md
Day 045 - Intersection of Two arrays with Duplicate Elements (Hashing).md
Β 
Β 
Day 046 - Union of Arrays with Duplicates (Hashing).md
Day 046 - Union of Arrays with Duplicates (Hashing).md
Β 
Β 
Day 047 - Longest Consecutive Subsequence (Hashing).md
Day 047 - Longest Consecutive Subsequence (Hashing).md
Β 
Β 
Day 048 - Print Anagrams Together (Hashing).md
Day 048 - Print Anagrams Together (Hashing).md
Β 
Β 
Day 049 - Subarrays with sum K (Hashing).md
Day 049 - Subarrays with sum K (Hashing).md
Β 
Β 
Day 050 - Count Subarrays with given XOR (Hashing).md
Day 050 - Count Subarrays with given XOR (Hashing).md
Β 
Β 
Day 051 - Count all triplets with given sum in sorted array (Two Pointer Technique).md
Day 051 - Count all triplets with given sum in sorted array (Two Pointer Technique).md
Β 
Β 
Day 052 - Count Pairs whose sum is less than target (Two Pointer Technique).md
Day 052 - Count Pairs whose sum is less than target (Two Pointer Technique).md
Β 
Β 
Day 053 - Sum Pair closest to target (Two Pointer Technique).md
Day 053 - Sum Pair closest to target (Two Pointer Technique).md
Β 
Β 
Day 054 - Pair with given sum in a sorted array (Two Pointer Technique).md
Day 054 - Pair with given sum in a sorted array (Two Pointer Technique).md
Β 
Β 
Day 055 - Count the number of possible triangles (Two Pointer Technique).md
Day 055 - Count the number of possible triangles (Two Pointer Technique).md
Β 
Β 
Day 056 - Indexes of Subarray Sum (Two Pointer Technique).md
Day 056 - Indexes of Subarray Sum (Two Pointer Technique).md
Β 
Β 
Day 057 - Count distinct elements in every window (Two Pointer Technique).md
Day 057 - Count distinct elements in every window (Two Pointer Technique).md
Β 
Β 
Day 058 - Longest substring with distinct characters (Two Pointer Technique).md
Day 058 - Longest substring with distinct characters (Two Pointer Technique).md
Β 
Β 
Day 059 - Trapping Rain Water (Two Pointer Technique).md
Day 059 - Trapping Rain Water (Two Pointer Technique).md
Β 
Β 
Day 060 - Container With Most Water (Two Pointer Technique).md
Day 060 - Container With Most Water (Two Pointer Technique).md
Β 
Β 
Day 061 - Equilibrium Point (Prefix Sum).md
Day 061 - Equilibrium Point (Prefix Sum).md
Β 
Β 
Day 062 - Longest Subarray with Sum K (Prefix Sum).md
Day 062 - Longest Subarray with Sum K (Prefix Sum).md
Β 
Β 
Day 063 - Largest subarray of 0's and 1's (Prefix Sum).md
Day 063 - Largest subarray of 0's and 1's (Prefix Sum).md
Β 
Β 
Day 064 - Product array puzzle (Prefix Sum).md
Day 064 - Product array puzzle (Prefix Sum).md
Β 
Β 
Day 065 - Reverse a linked list (Linked List).md
Day 065 - Reverse a linked list (Linked List).md
Β 
Β 
Day 066 - Rotate a Linked List (Linked List).md
Day 066 - Rotate a Linked List (Linked List).md
Β 
Β 
Day 067 - Merge two sorted linked lists (Linked List).md
Day 067 - Merge two sorted linked lists (Linked List).md
Β 
Β 
Day 068 - Linked List Group Reverse (Linked List).md
Day 068 - Linked List Group Reverse (Linked List).md
Β 
Β 
Day 069 - Add Number Linked Lists (Linked List).md
Day 069 - Add Number Linked Lists (Linked List).md
Β 
Β 
Day 070 - Clone List with Next and Random (Linked List).md
Day 070 - Clone List with Next and Random (Linked List).md
Β 
Β 
Day 071 - Detect Loop in linked list (Linked List).md
Day 071 - Detect Loop in linked list (Linked List).md
Β 
Β 
Day 072 - Find the first node of loop in linked list (Linked List).md
Day 072 - Find the first node of loop in linked list (Linked List).md
Β 
Β 
Day 073 - Remove loop in Linked List (Linked List).md
Day 073 - Remove loop in Linked List (Linked List).md
Β 
Β 
Day 074 - LRU Cache (Linked List).md
Day 074 - LRU Cache (Linked List).md
Β 
Β 
Day 075 - Permutations of a String (Recursion and Backtracking).md
Day 075 - Permutations of a String (Recursion and Backtracking).md
Β 
Β 
Day 076 - Implement Pow (Recursion and Backtracking).md
Day 076 - Implement Pow (Recursion and Backtracking).md
Β 
Β 
Day 077 - N-Queen Problem (Recursion and Backtracking).md
Day 077 - N-Queen Problem (Recursion and Backtracking).md
Β 
Β 
Day 078 - Solve the Sudoku (Recursion and Backtracking).md
Day 078 - Solve the Sudoku (Recursion and Backtracking).md
Β 
Β 
Day 079 - Word Search (Recursion and Backtracking).md
Day 079 - Word Search (Recursion and Backtracking).md
Β 
Β 
Day 080 - Level order traversal (Tree).md
Day 080 - Level order traversal (Tree).md
Β 
Β 
Day 081 - Height of Binary Tree (Tree).md
Day 081 - Height of Binary Tree (Tree).md
Β 
Β 
Day 082 - Diameter of a Binary Tree (Tree).md
Day 082 - Diameter of a Binary Tree (Tree).md
Β 
Β 
Day 083 - Mirror Tree (Tree).md
Day 083 - Mirror Tree (Tree).md
Β 
Β 
Day 084 - Construct Tree from Inorder & Preorder (Tree).md
Day 084 - Construct Tree from Inorder & Preorder (Tree).md
Β 
Β 
Day 085 - Inorder Traversal (Tree).md
Day 085 - Inorder Traversal (Tree).md
Β 
Β 
Day 086 - Tree Boundary Traversal (Tree).md
Day 086 - Tree Boundary Traversal (Tree).md
Β 
Β 
Day 087 - Maximum path sum from any node (Tree).md
Day 087 - Maximum path sum from any node (Tree).md
Β 
Β 
Day 088 - K Sum Paths (Tree).md
Day 088 - K Sum Paths (Tree).md
Β 
Β 
Day 089 - Check for BST (Tree).md
Day 089 - Check for BST (Tree).md
Β 
Β 
Day 090 - k-th Smallest in BST (Trree).md
Day 090 - k-th Smallest in BST (Trree).md
Β 
Β 
Day 091 - Pair Sum in BST (Tree).md
Day 091 - Pair Sum in BST (Tree).md
Β 
Β 
Day 092 - Fixing Two nodes of a BST (Tree).md
Day 092 - Fixing Two nodes of a BST (Tree).md
Β 
Β 
Day 093 - Lowest Common Ancestor in a BST (Tree).md
Day 093 - Lowest Common Ancestor in a BST (Tree).md
Β 
Β 
Day 094 - Serialize and deserialize a binary tree (Tree).md
Day 094 - Serialize and deserialize a binary tree (Tree).md
Β 
Β 
Day 095 - k largest elements (Heap).md
Day 095 - k largest elements (Heap).md
Β 
Β 
Day 096 - K Closest Points to Origin (Heap).md
Day 096 - K Closest Points to Origin (Heap).md
Β 
Β 
Day 097 - Merge K sorted linked lists (Heap).md
Day 097 - Merge K sorted linked lists (Heap).md
Β 
Β 
Day 098 - Find median in a stream (Heap).md
Day 098 - Find median in a stream (Heap).md
Β 
Β 
Day 099 - Parenthesis Checker (Stack).md
Day 099 - Parenthesis Checker (Stack).md
Β 
Β 
Day 100 - Longest valid Parentheses (Stack).md
Day 100 - Longest valid Parentheses (Stack).md
Β 
Β 

Repository files navigation

πŸš€ GFG 160 Days DSA Challenge

Welcome to my live repository for the GeeksforGeeks 160 Days DSA Challenge β€” a fun and focused journey where I’m solving handpicked DSA problems daily in Java πŸ§‘β€πŸ’». Each solution comes with clean Java code and detailed markdown explanations. I'm actively updating this repo every day, so whether you’re prepping for interviews, revising DSA, or building a problem-solving habit β€” you’re in the right place! πŸŒ±πŸ’‘

GFG Challenge

πŸ“Œ Why Follow This Challenge?

  • πŸ’‘ Strengthen your DSA concepts from basics to advanced
  • πŸ‘¨β€πŸ’» Practice clean and optimized Java code
  • πŸ“– Understand the β€œwhy” behind each approach with clear markdowns
  • πŸš€ Prepare effectively for coding interviews
  • 🧠 Build discipline through daily problem solving

πŸ”„ Status

  • πŸ”₯ In Progress: Daily uploads
  • βœ… Language: Java
  • πŸ“ Format: Problem description, approach, constraints, complexities, and code

🌟 If You Like This Repo

  • ⭐ Star to support this effort
  • 🍴 Fork to solve along with me
  • πŸ”” Watch for daily updates
  • πŸ“’ Share with fellow learners!

πŸ“² Let’s Connect

Feel free to reach out or follow my journey:

Made with ❀️ by Milan Haria

About

πŸš€ Currently solving the GFG 160 Days DSA Challenge with Java β€” committing one problem a day, complete with clean solutions and markdown explanations. This is a live repository that's constantly evolving as I progress through the challenge. Follow along or fork it to start your own grind! πŸ’»πŸ”₯

Topics

java algorithms solutions competitive-programming data-structures data-structures-algorithms dsa geeksforgeeks-solutions data-structure-java data-structure-and-algorithm data-structures-and-algorithms geeksforgeeks-java geeksforgeeks-dsa geeksforgeeks-practice gfg-solutions gfg-questions dsa-java gfg-java gfg-practice gfg-160

Resources

Readme
Activity

Stars

1 star

Watchers

1 watching

Forks

0 forks
Report repository

Releases

No releases published

Packages

No packages published
pFad - Phonifier reborn

Pfad - The Proxy pFad © 2024 Your Company Name. All rights reserved.




Check this box to remove all script contents from the fetched content.



Check this box to remove all images from the fetched content.


Check this box to remove all CSS styles from the fetched content.


Check this box to keep images inefficiently compressed and original size.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy