Interviewer Reveals Screening Round Questions – Know This To Land Your Tech Giant Job News24 –

Landing a job at Google is a dream for many, especially engineers. With its lucrative salary, top-notch facilities, and enviable lifestyle, it’s no surprise that the competition is fierce. Naturally, such a coveted job comes with an equally challenging interview process—tougher than one might expect. Don’t worry, there are people to help you with Google tips.

Hyderabad-based Google software engineer Anu Sharma, 22, who conducts job interviews as part of extra community contribution, has recently shared a few tips and tricks that candidates can use while preparing for their interview with the tech giant.

In a post on X, she listed essential data structures and algorithms like arrays, graphs, recursion, and backtracking while advising against spending time on rarely asked topics like segment trees and tries. Sharma, who has conducted over 15 interviews, has explained that the most eliminations usually happens in this round, which will remain a herculean task for those candidates who aren’t focused.

“These topics are asked in Google screening round! I got rejected here twice because most eliminations happen at this stage, so clearing it should be your priority,” Sharma wrote. Sharma emphasised the significance of practising arrays, pointers, Graphs etc..

See The Post Here..

These topics are asked in Google screening round! ✅

I got rejected here twice because most eliminations happen at this stage, so clearing it should be your priority. Focus on:
🔹 Arrays: Sliding window, two pointers, binary search, sorting, greedy algorithms
🔹 Strings:…

— Anu Sharma (@O_Anu_O) March 11, 2025

Important Topics To Focus

• Arrays: Sliding window, two pointers, binary search, sorting, greedy algorithms
  Strings: Palindromes, pattern matching
  Stacks And Queues: Next greater/smaller element, BFS, flood fill
  Trees: Binary trees, BSTs, traversals
  Graphs: DFS, BFS, Dijkstra’s algorithm, Minimum Spanning Tree (MST) using Prim’s/Kruskal’s algorithms, Disjoint Set Union (DSU)
• Heaps: Min/max heap, Kth smallest/largest element
• Recursion and backtracking (very very important): Permutations and combinations

How Netizens Reacted

Sharma’s insights sparked discussions among job aspirants and engineers. While many users on X appreciated her efforts in sharing these resources to help job seekers, not everyone fully agreed with her views. Among them were candidates who had previously attended Google interviews. Some mentioned that interviewers had questioned them on tries and bit manipulation.

“In the Google screening, I was once asked a question on tries. Not sure if we can narrow it down to the topics you mentioned,” one candidate shared.

However, the majority appreciated her efforts. “Great help. Thanks for sharing, Anu,” one user commented. Another added, “I appreciate you sharing this—your experience says it all! Learning from someone with such insights is truly valuable.”