Elite Developer Hiring Challenge 2025


Exp: +1 yr

Apply now

https://assessment.hackerearth.com/challenges/new/hiring/sellergize-hiring-challenge-2025/

📘 DSA Roadmap (Data Structures & Algorithms) 🔥

✅ 1. Basics of Programming
🔹 Variables, Data Types, Loops, Conditions
🔹 Functions & Recursion
🔹 Time & Space Complexity (Big O Notation)

✅ 2. Arrays & Strings
🔹 Searching & Sorting (Binary Search, Bubble, Merge, Quick Sort)
🔹 Two-pointer Technique
🔹 Sliding Window
🔹 Prefix Sum, Kadane’s Algorithm

✅ 3. Linked Lists
🔹 Singly & Doubly Linked List
🔹 Reversing, Detecting Cycles (Floyd's Algorithm)
🔹 Merge Two Sorted Lists

✅ 4. Stacks & Queues
🔹 Using Arrays or Linked Lists
🔹 Applications: Valid Parentheses, Next Greater Element
🔹 Queue, Deque, Circular Queue

✅ 5. Trees
🔹 Binary Trees, Binary Search Trees
🔹 Tree Traversals (Inorder, Preorder, Postorder)
🔹 Lowest Common Ancestor (LCA), Diameter
🔹 Heaps & Priority Queues

✅ 6. Hashing & Maps
🔹 HashMap, HashSet
🔹 Frequency Count, Group Anagrams
🔹 Implementing custom hash

✅ 7. Recursion & Backtracking
🔹 Subsets, Permutations
🔹 N-Queens, Sudoku Solver
🔹 Rat in a Maze

✅ 8. Dynamic Programming (DP)
🔹 Fibonacci, 0/1 Knapsack, Longest Common Subsequence
🔹 Tabulation vs Memoization
🔹 DP on Strings, Grids, Subsets

✅ 9. Graphs
🔹 Representation: Adjacency List/Matrix
🔹 BFS, DFS
🔹 Dijkstra, Prim’s, Kruskal’s Algorithms
🔹 Topological Sort, Cycle Detection

✅ 10. Advanced Topics
🔹 Tries
🔹 Segment Tree, Fenwick Tree
🔹 Disjoint Set Union (DSU)
🔹 Bit Manipulation

💻 Practice on: LeetCode, Codeforces, HackerRank, GFG

Company Name : Cleartrip (Flipkart)
Batch : 2024/2023 passouts
Role : SDE 1

Link : https://docs.google.com/forms/d/e/1FAIpQLSdfVXrSYoIQX76RsOURs1cFcsooz7q3XEmzZpxup4VGQ9VweQ/viewform

🔹 1. L&T Mass Hiring (2024 & 2025 Batch)
👨‍💻 Role: Software Engineer
🔗 https://larsentoubrocareers.peoplestrong.com/job/detail/LNT_SE-LS_1347522


---

🔹 2. L&T – 2025 Batch via Superset
🎓 Eligibility: 2025 Graduates
🔗 https://app.joinsuperset.com/join/#/signup/student/jobprofiles/dd2482f5-5ddb-496b-97de-63e0c4b379b5


---

🔹 3. Wipro – Software Engineer Role
📌 Via Superset
🔗 https://app.joinsuperset.com/join/#/signup/student/jobprofiles/76683f43-08e5-4f54-a2c1-00249d701655


---

🔹 4. EY Hiring for Freshers (2023–2025)
🏢 Company: Ernst & Young (EY)
🔗 https://eyglobal.yello.co/jobs/0Iy0Oeg60FgeeOOcQQugBw?job_board_id=c1riT--B2O-KySgYWsZO1Q&src=JB-10820


---

📩 DM for any OA help:
👉 @Mrtrueliving_ix

📢 Share & support your friends – More updates coming daily!
🚀 Stay consistent, stay placed.

🚨 Announcing: Amazon ML School – Free Coding Help 🚨

🔥 We’re posting all solutions and guidance on our page – absolutely FREE!


If you truly trust our work,
💬 Support us by sharing with your friends
Let’s #HelpThemToSucceed 🚀

📌 Main Channel:
🔗 https://t.me/code_alphix

📌 Discussion Group – Ask Doubts & Post Your Codes:
🔗 https://t.me/code_alphix2


👨‍💻 Happy Coding, Best of Luck! 🤞🤗


Previous year Proofs

https://t.me/code_alphix/372

https://t.me/code_alphix/369

https://t.me/code_alphix/387

📂 Amazon ML – Previous Year Question
👨‍💻 Tag: Dynamic Programming / Pascal’s Triangle
📌 Solved by: https://t.me/code_alphix/372

class UserMainCode(object):

    @classmethod
    def theLastChocolate(cls, input1, input2):
        # https://t.me/code_alphix
        dp = [[0] * (input1 + 1) for _ in range(input1 + 1)]
        dp[1][1] = 1

        for i in range(2, input1 + 1):
            for j in range(1, i + 1):
                dp[i][j] += dp[i - 1][j - 1]
                dp[i][j] += dp[i - 1][j]

        return dp[input1][input2]

⚠️ Not able to access the group or your ID isn't visible?
You might be on the ban list 🚫

📩 DM us to get unbanned and regain access!
We’re here to help you out 💬


@Mrtrueliving_ix @Mrtrueliving_ix

🚨 Reminder for IDFC Hackathon!

📥 Download the SEB tool and do a system check before the test.
🛑 Only one attempt is allowed – no second chance!

📌 Don’t wait till the last minute. Be ready by 5 PM today!