hacker earth amazon hiring challenge questions(Amazon)

Introduction：

1、Leaderboard for Make My Trip Problem Statement

2、Leaderboard for Social Media analytics

Leaderboard for Make My Trip Problem Statement ♂

　　Developers are ranked according to the total score. Developers who have the same total score are ranked by least effective time.

Leaderboard for Social Media analytics ♂

　　Developers are ranked according to the total score. Developers who have the same total score are ranked by least effective time.

Related questions

For the HackerEarth Amazon Hiring Challenge, expect coding questions focused on data structures, algorithms, and problem-solving skills. Below is a structured overview of potential topics and example problems:

Key Topics

1. Data Structures:

   • Arrays, Strings, Linked Lists
   • Trees (Binary Trees, BSTs, Tries)
   • Graphs, Stacks/Queues, Hash Tables
   • Heaps (Priority Queues)

2. Algorithms:

   • Sorting (QuickSort, MergeSort)
   • Searching (Binary Search)
   • Dynamic Programming (Knapsack, LCS, Coin Change)
   • Greedy Algorithms (Activity Selection)
   • Graph Algorithms (BFS, DFS, Dijkstra, MST)
   • Sliding Window, Two Pointers, Bit Manipulation

3. Problem Types:

   • Optimization, Counting, Simulation
   • Real-world scenarios (e.g., logistics, resource management)

Example Questions

1. Greedy Algorithm
   Activity Selection: Schedule maximum non-overlapping tasks given start/end times.
   Approach: Sort by end time, greedily select earliest-ending tasks.

2. Graph Traversal
   Rotting Oranges: Calculate time to rot all oranges in a grid using BFS.
   Approach: Track fresh oranges and spread rot from multiple sources.

3. Dynamic Programming
   Coin Change: Count ways to form a sum with given coin denominations.
   Approach: DP table with unbounded knapsack logic.

4. Heap/Priority Queue
   Minimum Cost to Connect Ropes: Merge ropes with minimum cost.
   Approach: Use a min-heap to always merge the two shortest ropes.

5. Trie & Search
   Autocomplete System: Return top N frequent keywords for a prefix.
   Approach: Trie nodes storing frequencies + DFS to collect suggestions.

6. Matrix/Grid
   Shortest Path with Obstacles: Find the shortest path in a grid with ≤ K obstacles.
   Approach: BFS with state (x, y, remaining breaks).

Amazon-Specific Scenarios

• Delivery Optimization: Minimize delivery trips with weight constraints (Bin Packing variant).
• AWS Task Scheduling: Efficiently schedule tasks on servers (Interval Scheduling).
• Inventory Management: Dynamic programming for stock/order matching.

Preparation Tips

• Practice Platforms: Solve Amazon-tagged problems on LeetCode, HackerRank.
• Focus Areas: Master arrays, strings, trees, graphs, and DP.
• Edge Cases: Test for empty inputs, large values, and efficiency (time/space).

Final Note: Expect 3-4 questions of increasing difficulty. Prioritize clean, efficient code and handle edge cases robustly.