Passa al contenutoPassa al piè di pagina
  • Lavori
  • Aziende
  • Stipendi
  • Per le aziende

      Migliora la tua carriera

      Scopri le tue potenzialità di guadagno, trova lavori da sogno e condividi approfondimenti su lavoro e vita privata in forma anonima.

      employer cover photo
      employer logo
      employer logo

      Nayan

      Questa è la tua azienda?

      Circa
      Recensioni
      Stipendi e benefit
      Lavori
      Colloqui
      Colloqui
      Ricerche correlate: Recensioni su Nayan | Offerte di lavoro di Nayan | Stipendi di Nayan | Benefit di Nayan
      Colloqui di NayanColloqui per Assistant Software Engineer (ASE) presso NayanColloquio di Nayan


      Glassdoor

      • Chi siamo
      • Contattaci

      Aziende

      • Account Business gratuito
      • Spazio per le aziende
      • Blog per le aziende

      Informazioni

      • Aiuto
      • Linee guida
      • Condizioni d'uso
      • Privacy e scelte pubblicitarie
      • Non vendere né condividere le mie informazioni
      • Strumento per l'accettazione dei cookie

      Lavora con noi

      • Inserzionisti
      • Carriere
      Scarica l'app

      • Cerca:
      • Aziende
      • Lavori
      • Località

      Copyright © 2008-2026. Glassdoor LLC. "Glassdoor," "Worklife Pro," "Bowls" e il relativo logo sono marchi registrati di Glassdoor LLC.

      Aziende seguite

      Non lasciarti sfuggire opportunità e informazioni privilegiate seguendo le aziende dove vorresti lavorare.

      Ricerche di lavoro

      Ricevi suggerimenti e aggiornamenti personalizzati avviando le tue ricerche.

      Colloquio per Assistant Software Engineer (ASE)

      5 mar 2025
      Candidato anonimo a colloquio
      Poona
      Nessuna offerta
      Esperienza neutra
      Colloquio difficile

      Candidatura

      Ho sostenuto un colloquio presso Nayan (Poona)

      Colloquio

      The interview process typically consists of several stages designed to assess a candidate's technical skills, problem-solving abilities, and cultural fit for the company. Here’s a general breakdown: ### **1. Online Assessment (OA)** - **Format**: Usually includes multiple-choice questions (MCQs) and coding challenges. - **Topics**: Aptitude, logical reasoning, data structures, algorithms, and domain-specific questions. - **Example**: Platforms like HackerRank, CodeSignal, or Codility may be used. ### **2. Technical Interview(s)** - **Format**: Conducted virtually or in person, often on platforms like Zoom, Microsoft Teams, or Google Meet. - **Topics Covered**: - **Coding Questions**: Data structures and algorithms (arrays, strings, linked lists, dynamic programming, graphs, etc.). - **System Design (for experienced roles)**: Design scalable systems, database design, and architectural decisions. - **Problem-Solving**: Whiteboarding or live coding exercises. ### **3. Behavioral Interview (HR Round)** - **Objective**: Assess cultural fit, communication skills, and past experiences. - **Common Questions**: - “Tell me about yourself.” - “Why do you want to work here?” - “Describe a challenging project you worked on.” - “How do you handle conflicts in a team?” ### **4. Final Round (Optional – Managerial/Onsite Interview)** - **For senior roles or specific companies**, there may be an additional interview with a hiring manager or senior executives. - Focuses on leadership, teamwork, and project management skills. ### **Post-Interview Process** - **Feedback & Decision**: The company reviews all rounds and provides feedback (can take a few days to weeks). - **Offer Letter**: If selected, you receive an offer detailing salary, benefits, and joining formalities.

      Domande di colloquio [1]

      Domanda 1

      Arrays & Strings Find the missing number in an array of 1 to N. Find the largest subarray sum (Kadane’s Algorithm). Reverse a string without using extra space. Find the longest palindrome substring. Linked Lists Detect a cycle in a linked list (Floyd’s Cycle Detection). Reverse a linked list iteratively and recursively. Find the middle node of a linked list. Trees & Graphs Find the lowest common ancestor (LCA) of two nodes in a binary tree. Implement Depth First Search (DFS) & Breadth First Search (BFS). Check if a given graph is a valid tree. Dynamic Programming (DP) Solve the 0/1 Knapsack problem. Find the longest increasing subsequence. Solve the Coin Change problem.
      Rispondi alla domanda

      Le migliori aziende per "stipendio e benefit" vicino a te

      avatar
      IBM
      3.6★Stipendio e benefit
      avatar
      Dell Technologies
      3.5★Stipendio e benefit
      avatar
      BTC Business Technology Consulting
      3.7★Stipendio e benefit