Panda Guru LogoPanda
Guru

PHILIPS SDE INTERN Technical Interview(On Campus)

Round 1

Questions:

DSA Question:

You are given two strings (say BEAR and BARE). You need to find if they are anagrams or not.

Candidate's Approach
  • Used hashmaps to solve the anagram problem, achieving a solution in O(N) time complexity and O(N) space complexity.
  • When asked to solve without hashmaps, the candidate suggested using sorting and explained the intuition behind this approach.
  • Follow-up questions on space and time complexity were addressed, including explanations of big O, big omega, and big theta.
Interviewer's Feedback

No feedback provided.


Managerial Round

Questions:

Candidate's Approach

No approach provided.

Interviewer's Feedback

No feedback provided.