https://mycareernet.in/mycareernet/contests/IDFC-FIRST-Bank-IDFC-FIRST-Bank-Technology-C-239

DM @Mrtrueliving_ix for test Clearance ✔️✅

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