0PP
Interview
Given a Linked list, the task is to print a singly linked list in a spiral fashion, starting from the mid and rotating clockwise. If the linked list has even nodes, then you have to choose the left mid.
Linked ListGiven the root of a binary tree. Your task is to return the left view of the binary tree. The left view of a binary tree is the set of nodes visible when the tree is viewed from the left side.
Binary Trees✨ Excited to Share! Selected by Versa Network ✨ I’m happy to announce that I have been selected after successfully clearing my interview at Versa Network. # The Process The interview process covered a wide range of topics and tested both fundamentals and practical understanding. The key areas included: ## Resume & Project Discussion – Walkthrough of my work, responsibilities, and the project I developed. 🔹 OOPS Concepts – Four pillars of OOPS, virtual functions, and memory layout. 🔹 DBMS – Core concepts and real-world application. 🔹 DSA – Two coding questions (one from LeetCode arrays and one based on linked list basics and implementation). 🔹 Computer Networks – Difference between TCP and HTTP, and related networking principles. # Result I’m grateful for this opportunity and excited for the journey ahead. Looking forward to contributing, learning, and growing with the team! 🚀
✨ Excited to Share! Selected by Versa Network ✨ I’m happy to announce that I have been selected after successfully clearing my interview at Versa Network. # The Process The interview process covered a wide range of topics and tested both fundamentals and practical understanding. The key areas included: ## Resume & Project Discussion – Walkthrough of my work, responsibilities, and the project I developed. 🔹 OOPS Concepts – Four pillars of OOPS, virtual functions, and memory layout. 🔹 DBMS – Core concepts and real-world application. 🔹 DSA – Two coding questions (one from LeetCode arrays and one based on linked list basics and implementation). 🔹 Computer Networks – Difference between TCP and HTTP, and related networking principles. # Result I’m grateful for this opportunity and excited for the journey ahead. Looking forward to contributing, learning, and growing with the team! 🚀
Excited to Share! Selected by Arista Networks for an internship, and I'm happy to share my experience. # Overall process I had got the opportunity to appear for the Software Engineer Intern recruitment process at Arista Networks, which consisted of three rounds and ranged from medium to hard in difficulty. The first round was an online assessment with around 10–15 multiple-choice questions focused on basic C/C++ syntax, debugging, and fundamental Object-Oriented Programming concepts. After clearing the OA, I proceeded to the second round, which was a technical interview covering data structures and C++ fundamentals. I was asked questions related to Linked Lists, OOPs, trees (including some hard-level problems), and pointer-based code analysis. The final round was another technical interview where the focus shifted to more advanced data structures and problem-solving. I received questions based on stacks, graph algorithms, and was also asked to design a phonebook system using a Trie. # My thoughts Overall, the experience was challenging yet insightful, and it provided a good opportunity to test my understanding of core computer science concepts.
Excited to Share! Selected by Arista Networks for an internship, and I'm happy to share my experience. # Overall process I had got the opportunity to appear for the Software Engineer Intern recruitment process at Arista Networks, which consisted of three rounds and ranged from medium to hard in difficulty. The first round was an online assessment with around 10–15 multiple-choice questions focused on basic C/C++ syntax, debugging, and fundamental Object-Oriented Programming concepts. After clearing the OA, I proceeded to the second round, which was a technical interview covering data structures and C++ fundamentals. I was asked questions related to Linked Lists, OOPs, trees (including some hard-level problems), and pointer-based code analysis. The final round was another technical interview where the focus shifted to more advanced data structures and problem-solving. I received questions based on stacks, graph algorithms, and was also asked to design a phonebook system using a Trie. # My thoughts Overall, the experience was challenging yet insightful, and it provided a good opportunity to test my understanding of core computer science concepts.
# The selection process for Deloitte typically focuses on core data structures, algorithmic optimization, and database architecture. ## Selection Process: * PPT Presentation * Online Coding Test * Technical Interview 1/ 2/3 (Based on the interview performance) * HR Interview ## Recruiting Tips From developing a standout resume to putting your best foot forward in the interview, we want you to feel prepared and confident as you explore opportunities at Hashedin Technologies. Here are some recruiting tips from our Team * Be Prepared to discuss your approach to challenges and problem-solving, explaining your thought process and decision making. * Be ready to discuss personal projects in detail, highlighting your role and contributions to showcase your technical skills and communication abilities. * Research the company thoroughly to understand its values, mission, culture and recent developments, demonstrating your genuine interest. * During problem-solving or case study interviews, focus on demonstrating your unique approach and thought process by showcasing your innovative thinking. ## Round Details ## 1. Coding Round - **Number of Questions**: 3 Questions - **Breakdown**: 1 Easy, 2 Medium - **Key Problems**: - String search: Check if a given string is present in an array of strings. - Array Optimization: Find all pairs $(i, j)$ where $arr[i] > arr[j] * 3$. - *Note: Requires an optimized $O(n \log n)$ approach to pass large test cases.* ## 2. Technical Interview (One-to-One) - **Number of Questions**: 3–5 Questions - **Difficulty**: Medium - **Topics**: - **Heaps**: Implementation or priority queue applications. - **Two Pointers**: Used for array/string manipulation. - **Linked Lists**: Detecting cycles and finding the intersection point of two lists. ## 3. Database Design Round - **Focus**: System architecture and data modeling. - **Scenario**: Airport Booking System. - **Requirements**: - Draw/Explain ER Diagrams. - Perform Schema Design. - Write complex SQL queries based on the designed schema. --- ## **Tips** * **Communication is Key**: If you explain your logic confidently and correctly, interviewers may waive the requirement to write the full code for certain questions. * **Optimization**: For array pair problems, think beyond nested loops; consider modified Merge Sort or Fenwick tree logic for large constraints.
# The selection process for Deloitte typically focuses on core data structures, algorithmic optimization, and database architecture. ## Selection Process: * PPT Presentation * Online Coding Test * Technical Interview 1/ 2/3 (Based on the interview performance) * HR Interview ## Recruiting Tips From developing a standout resume to putting your best foot forward in the interview, we want you to feel prepared and confident as you explore opportunities at Hashedin Technologies. Here are some recruiting tips from our Team * Be Prepared to discuss your approach to challenges and problem-solving, explaining your thought process and decision making. * Be ready to discuss personal projects in detail, highlighting your role and contributions to showcase your technical skills and communication abilities. * Research the company thoroughly to understand its values, mission, culture and recent developments, demonstrating your genuine interest. * During problem-solving or case study interviews, focus on demonstrating your unique approach and thought process by showcasing your innovative thinking. ## Round Details ## 1. Coding Round - **Number of Questions**: 3 Questions - **Breakdown**: 1 Easy, 2 Medium - **Key Problems**: - String search: Check if a given string is present in an array of strings. - Array Optimization: Find all pairs $(i, j)$ where $arr[i] > arr[j] * 3$. - *Note: Requires an optimized $O(n \log n)$ approach to pass large test cases.* ## 2. Technical Interview (One-to-One) - **Number of Questions**: 3–5 Questions - **Difficulty**: Medium - **Topics**: - **Heaps**: Implementation or priority queue applications. - **Two Pointers**: Used for array/string manipulation. - **Linked Lists**: Detecting cycles and finding the intersection point of two lists. ## 3. Database Design Round - **Focus**: System architecture and data modeling. - **Scenario**: Airport Booking System. - **Requirements**: - Draw/Explain ER Diagrams. - Perform Schema Design. - Write complex SQL queries based on the designed schema. --- ## **Tips** * **Communication is Key**: If you explain your logic confidently and correctly, interviewers may waive the requirement to write the full code for certain questions. * **Optimization**: For array pair problems, think beyond nested loops; consider modified Merge Sort or Fenwick tree logic for large constraints.
• Add a node to end of the linked list.
• Print fibonacci sequence. ( the question was more complicated and they had given it in terms of binary tree).
Want to join the conversation?
Be the first to comment!