SDE 2 at Cognitree
- Difficulty
- Process took
- 1-2 Weeks
- Rounds
- 2
- Format
- Remote
- Applied via
- Company Website
How it went
- What i realize at end confidence matters, even if you don’t know the exact method or any concept, explain your reasoning and potential solution but do not waste time by seating silently.
What they would tell you
- What i realize at end confidence matters, even if you don’t know the exact method or any concept, explain your reasoning and potential solution but do not waste time by seating silently.
How to prepare
- DSA & Core OOP's concept
Round by round
- 1
Data Structures and Algorithms Round 160 min
Q1: Merge Two Sorted Arrays Problem: Given two sorted arrays, merge them into one sorted array without using extra space. Q2: Top K Largest Numbers Problem: Return the k largest numbers from an unsorted array efficiently.
- 2
Technical Core Round60 min
Object oriented programming principles and basic of LLD Q1: Detect Cycle in Linked List Given a singly linked list, check if it contains a cycle. Q2: First Non-Repeating Character in a Stream Given a stream of characters, for each character, find the first character that has not repeated so far.
And one Hashmap related question was also there
What came up
A candidate-reported account, lightly edited. Interview processes change by team and date.