Upload Button Icon Add office photos

Filter interviews by

AccuKnox Python and Django Developer Interview Questions and Answers

Updated 19 Sep 2024

AccuKnox Python and Django Developer Interview Experiences

1 interview found

Interview experience
1
Bad
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Not Selected

I applied via LinkedIn and was interviewed in Aug 2024. There were 2 interview rounds.

Round 1 - Assignment 

Django signals and custom class in python .
Django signals topic had 3 questions to be solved

Round 2 - HR 

(2 Questions)

  • Q1. Introduce yourselves and why you chose Accuknox
  • Ans. 

    We are experienced Python and Django developers who chose Accuknox for its innovative projects and collaborative work environment.

    • Experienced in Python and Django development

    • Chose Accuknox for its innovative projects

    • Attracted to the collaborative work environment

  • Answered by AI
  • Q2. Tell us about your passion
  • Ans. 

    My passion lies in creating innovative solutions through coding and problem-solving.

    • I enjoy tackling complex coding challenges and finding efficient solutions.

    • I love experimenting with new technologies and frameworks to enhance my skills.

    • I find satisfaction in building user-friendly applications that make a positive impact.

    • I actively participate in coding communities and open-source projects to contribute and learn fro

  • Answered by AI

Interview questions from similar companies

Interview experience
1
Bad
Difficulty level
Hard
Process Duration
2-4 weeks
Result
Not Selected

I applied via Company Website and was interviewed in May 2024. There was 1 interview round.

Round 1 - Assignment 

The task was a Codility type

Interview experience
5
Excellent
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Technical 

(1 Question)

  • Q1. Data structures, Algorithm
Interview experience
4
Good
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Not Selected

I applied via Company Website and was interviewed in Feb 2024. There were 3 interview rounds.

Round 1 - Aptitude Test 

Basic question asked

Round 2 - One-on-one 

(4 Questions)

  • Q1. Computer networking based question
  • Q2. Dsa question based on graph and dp
  • Q3. Based on operating system
  • Q4. Function of oops
  • Ans. 

    Object-oriented programming paradigm that focuses on objects and classes for code organization and reusability.

    • Encapsulation: bundling data and methods that operate on the data into a single unit (object)

    • Inheritance: ability of a class to inherit properties and behavior from another class

    • Polymorphism: ability to present the same interface for different data types

  • Answered by AI
Round 3 - HR 

(1 Question)

  • Q1. Behavior question asked

Interview Preparation Tips

Interview preparation tips for other job seekers - prepare well practice on dsa question
Interview experience
3
Average
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Not Selected

I applied via Company Website and was interviewed in Mar 2024. There was 1 interview round.

Round 1 - Technical 

(1 Question)

  • Q1. Implement readers-writer lock

I was interviewed in Mar 2022.

Round 1 - Face to Face 

Round duration - 120 Minutes
Round difficulty - Medium

Machine Coding Round
2 Hours in Total
15 Mins for Question Explaination and Doubts
1.5 Hours for coding
15 mins to discuss the approach 

Timing - 3 to 5 pm (They are flexible)
Interviewer was very patient and helped me understand the question

Round 2 - Face to Face 

(2 Questions)

Round duration - 60 Minutes
Round difficulty - Medium

2 Data Strucutre Questions
Timing 5-6 pm (They are flexible)
Google Meet
Online IDE

  • Q1. 

    Unique Binary Search Trees Problem Statement

    Given an integer 'N', your task is to compute the number of structurally unique BSTs (binary search trees) that can be formed using an exact number of 'N' uniq...

  • Ans. 

    The task is to compute the number of structurally unique BSTs that can be formed using an exact number of unique values.

    • Use dynamic programming to solve the problem efficiently.

    • The number of structurally unique BSTs can be calculated using Catalan numbers.

    • For N nodes, the number of structurally unique BSTs is given by the Nth Catalan number.

    • Example: For N=3, the number of structurally unique BSTs is 5.

  • Answered by AI
  • Q2. 

    Subsequences of String Problem Statement

    You are provided with a string 'STR' that consists of lowercase English letters ranging from 'a' to 'z'. Your task is to determine all non-empty possible subsequen...

  • Ans. 

    Generate all possible subsequences of a given string.

    • Use recursion to generate all possible subsequences by including or excluding each character in the string.

    • Maintain a current index to keep track of the characters being considered.

    • Append the current character to each subsequence generated so far.

    • Recursively call the function with the next index to include or exclude the next character.

    • Base case: When the current ind...

  • Answered by AI
Round 3 - HR 

Round duration - 60 Minutes
Round difficulty - Easy

HIRING MANAGER ROUND

Discussion about the organisation now questions

Interview Preparation Tips

Professional and academic backgroundI applied for the job as SDE - 1 in BangaloreEligibility criteriaNASwiggy interview preparation:Topics to prepare for the interview - Dynamic Programming, Basic OOPS, Commonly Asked Algorithms (Kadane’s, Dutch National Flag and more), Data Structures (Heaps, Stack, Queues, HashMaps and more), Low Level Design (Machine Coding)Time required to prepare for the interview - 2 monthsInterview preparation tips for other job seekers

Tip 1 : Practice is they to success, every person will need a different path for preparation, the resources that you should use will depend upon your current expertise.
Tip 2 : For Machine Coding Rounds speed is key, you need to practice atleast 20 questions, Try to figure out techniques to common out code, code out your first question, and then spend good 2-3 hours in reducing no of lines and removing redundancy, try to note down methods you used to achieve less redundancy and for all the next questions you practice try to achieve that same quality from the beginning which will automatically increase your speed
Tip 3 : Do company wise preparation, look for interview experiences and try to map out commonly asked questions and categories of those questions and practice accordingly

Application resume tips for other job seekers

Tip 1 : If applying for any non FE role (or any role that does not require designing or creative skills) keep a minimalistic resume
Tip 2 : Ensure to add a summary at the top which mentions all the criterias HRs consider while short listing resumes (Experience, Degree and Branch, Languages you have experience in, City, Willingness to Relocate, Notice Period, If already on notice period mention your last working day)

Final outcome of the interviewSelected

Skills evaluated in this interview

I was interviewed in Jan 2021.

Round 1 - Coding Test 

(2 Questions)

Round duration - 60 Minutes
Round difficulty - Easy

4 Questions which were of Easy, Medium, and Hard level.

  • Q1. 

    Lowest Common Ancestor of a Binary Tree III

    The structure of a binary tree has been modified so that each node includes a reference to its parent node.

    Problem Statement

    You are provided with two nodes,...

  • Ans. 

    This question is about finding the lowest common ancestor of two nodes in a binary tree with parent references.

    • Traverse from the given nodes to their respective root nodes and store the paths in two separate lists.

    • Compare the two lists and find the last common node.

    • Return the last common node as the lowest common ancestor.

  • Answered by AI
  • Q2. 

    Maximum Subarray Problem Statement

    Ninja has been given an array, and he wants to find a subarray such that the sum of all elements in the subarray is maximum.

    A subarray 'A' is considered greater than a...

  • Ans. 

    The problem is to find a subarray with the maximum sum in a given array.

    • Iterate through the array and keep track of the maximum sum and the current sum.

    • If the current sum becomes negative, reset it to 0.

    • Update the maximum sum if the current sum is greater.

    • Also keep track of the start and end indices of the subarray with the maximum sum.

    • Return the subarray using the start and end indices.

  • Answered by AI
Round 2 - Video Call 

(2 Questions)

Round duration - 50 Minutes
Round difficulty - Easy

  • Q1. 

    Next Greater Element Problem Statement

    Given a list of integers of size N, your task is to determine the Next Greater Element (NGE) for every element. The Next Greater Element for an element X is the firs...

  • Ans. 

    The task is to find the next greater element for each element in an array.

    • Iterate through the array from right to left.

    • Use a stack to keep track of the elements that have a greater element to their right.

    • For each element, pop elements from the stack until a greater element is found or the stack is empty.

    • If a greater element is found, it is the next greater element for the current element.

    • If the stack becomes empty, the...

  • Answered by AI
  • Q2. 

    Trapping Rain Water Problem Statement

    You are given a long type array/list ARR of size N, representing an elevation map. The value ARR[i] denotes the elevation of the ith bar. Your task is to determine th...

  • Ans. 

    The question asks to find the total amount of rainwater that can be trapped in the given elevation map.

    • Iterate through the array and find the maximum height on the left and right side of each bar.

    • Calculate the amount of water that can be trapped at each bar by taking the minimum of the maximum heights on both sides and subtracting the height of the bar.

    • Sum up the amount of water trapped at each bar to get the total amo

  • Answered by AI
Round 3 - HR 

Round duration - 30 Minutes
Round difficulty - Easy

It is just a formality round, asked basic questions like relocation and joining date etc

Interview Preparation Tips

Professional and academic backgroundI applied for the job as SDE - 1 in BengaluruEligibility criteriawith resumeSwiggy interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, Puzzles, Project, Mock Interviews, etcTime required to prepare for the interview - 2 monthsInterview preparation tips for other job seekers

Tip 1 : Be good with all data structures and algorithms
Tip 2 : Able to explain your projects well 
Tip 3 : focus on basics

Application resume tips for other job seekers

Tip 1 : Try to make a single-page resume. 
Tip 2 : Don't write unnecessary details like hobbies, family, etc.

Final outcome of the interviewSelected

Skills evaluated in this interview

I was interviewed before Sep 2020.

Round 1 - Face to Face 

(2 Questions)

Round duration - 60 Minutes
Round difficulty - Easy

  • Q1. 

    0/1 Knapsack Problem Statement

    A thief is planning to rob a store and can carry a maximum weight of 'W' in his knapsack. The store contains 'N' items where the ith item has a weight of 'wi' and a value of...

  • Ans. 

    Yes, the 0/1 Knapsack problem can be solved using dynamic programming with a space complexity of not more than O(W).

    • Use a 1D array to store the maximum value that can be stolen for each weight capacity from 0 to W.

    • Iterate through each item and update the array based on whether including the item would increase the total value.

    • The final value in the array at index W will be the maximum value that can be stolen.

  • Answered by AI
  • Q2. 

    Find the Second Largest Element

    Given an array or list of integers 'ARR', identify the second largest element in 'ARR'.

    If a second largest element does not exist, return -1.

    Example:

    Input:
    ARR = [2,...
  • Ans. 

    Find the second largest element in an array of integers.

    • Iterate through the array to find the largest and second largest elements.

    • Handle cases where all elements are identical.

    • Return -1 if a second largest element does not exist.

  • Answered by AI
Round 2 - Video Call 

(1 Question)

Round duration - 60 Minutes
Round difficulty - Easy

System Design Round

  • Q1. Design a system for Twitter, discussing its architecture, key components, and scalability considerations.
  • Ans. 

    Design a scalable system for Twitter with key components and architecture.

    • Use microservices architecture for scalability and fault isolation.

    • Key components include user service, tweet service, timeline service, and notification service.

    • Use a distributed database like Cassandra for storing tweets and user data.

    • Implement a message queue like Kafka for handling real-time updates and notifications.

    • Use a caching layer like ...

  • Answered by AI
Round 3 - HR 

Round duration - 30 Minutes
Round difficulty - Easy

It is just a formality

Interview Preparation Tips

Professional and academic backgroundI applied for the job as SDE - 1 in BangaloreEligibility criteriaResume shortlistingSwiggy interview preparation:Topics to prepare for the interview - OOPS, Data Structures, Core Java, Algorithms, DBMS, SQL,Time required to prepare for the interview - 3 monthsInterview preparation tips for other job seekers

Tip 1 : System Design
Tip 2 : Practice questions from leetcode
Tip 3 : Have some projects.

Application resume tips for other job seekers

Tip 1 : Mention what you know 
Tip 2 : Good previous work to showcase

Final outcome of the interviewSelected

Skills evaluated in this interview

I was interviewed before May 2021.

Round 1 - Coding Test 

(3 Questions)

Round duration - 90 Minutes
Round difficulty - Medium

1 easy and 2 medium-hard DSA problems to solve

  • Q1. 

    Hurdle Game Problem Statement

    Kevin is playing a hurdle game where he must jump over hurdles to clear levels. Each level ‘i’ consists of ‘i’ hurdles (e.g., Level 6 has 6 hurdles).

    Given the total number ...

  • Ans. 

    Given the total number of hurdles Kevin has jumped, determine how many levels he has cleared.

    • Iterate through levels while subtracting hurdles from total jumped until remaining hurdles are less than current level

    • Return the current level as the number of levels cleared

  • Answered by AI
  • Q2. 

    N Queens Problem

    Given an integer N, find all possible placements of N queens on an N x N chessboard such that no two queens threaten each other.

    Explanation:

    A queen can attack another queen if they ar...

  • Ans. 

    The N Queens Problem involves finding all possible placements of N queens on an N x N chessboard without threatening each other.

    • Use backtracking algorithm to explore all possible configurations.

    • Keep track of rows, columns, and diagonals to ensure queens do not threaten each other.

    • Generate valid configurations recursively and backtrack when a solution is not possible.

  • Answered by AI
  • Q3. 

    Count Ways To Travel Triangular Pyramid

    Bob is given a triangular pyramid with vertices 'O', 'X', 'Y', and 'Z'. He is also provided with an integer 'N'. Bob can move to any adjacent vertex in a single ste...

  • Ans. 

    Calculate the number of ways Bob can complete a journey in a triangular pyramid after N steps.

    • Bob can move to any adjacent vertex in a single step

    • Bob must return to vertex 'O' after exactly 'N' steps

    • Calculate the number of different ways Bob can complete the journey

    • Return the result modulo 1000000007

    • Consider the constraints provided

  • Answered by AI
Round 2 - Face to Face 

(2 Questions)

Round duration - 60 Minutes
Round difficulty - Medium

2 DSA problems and computer subject questions

  • Q1. 

    Generate Binary Strings with No Consecutive 1s

    Given an integer K, your task is to produce all binary strings of length 'K' that do not contain consecutive '1's.

    Input:

    The input begins with an integer ...
  • Ans. 

    Generate all binary strings of length 'K' with no consecutive '1's in lexicographically increasing order.

    • Use backtracking to generate all possible binary strings of length 'K' with no consecutive '1's.

    • Start with an empty string and recursively add '0' or '1' based on the condition of no consecutive '1's.

    • Sort the generated strings in lexicographically increasing order before outputting them.

  • Answered by AI
  • Q2. 

    Shuffle Two Strings Problem Statement

    You are provided with three strings A, B, and C. The task is to determine if C is formed by interleaving A and B. C is considered an interleaving of A and B if:

    • T...
  • Ans. 

    Check if a string is formed by interleaving two other strings.

    • Iterate through characters of A, B, and C simultaneously to check if C is formed by interleaving A and B.

    • Use dynamic programming to efficiently solve the problem.

    • Handle edge cases like empty strings or unequal lengths of A, B, and C.

    • Example: A = 'aab', B = 'abc', C = 'aaabbc' should return True.

  • Answered by AI
Round 3 - Face to Face 

(2 Questions)

Round duration - 60 Minutes
Round difficulty - Easy

DSA round

  • Q1. 

    Ninja and Intersection of Lines

    You are given coordinates for two lines on a 2D plane: Line 'AB' is defined by points 'A' and 'B', and Line 'PQ' is defined by points 'P' and 'Q'. Your task is to find the ...

  • Ans. 

    Find the intersection point of two lines on a 2D plane given their coordinates.

    • Calculate the slopes of both lines using the given coordinates.

    • Use the slope-intercept form of a line to find the equations of the two lines.

    • Solve the equations simultaneously to find the intersection point.

    • Return the coordinates of the intersection point with precision up to 6 decimal places.

  • Answered by AI
  • Q2. 

    Cycle Detection in Directed Graph

    Determine if a given directed graph contains a cycle. If the graph has at least one cycle, return true. Otherwise, return false.

    Input:

    The first line of input contains...
  • Ans. 

    Detect cycles in a directed graph and return true if a cycle exists, false otherwise.

    • Use Depth First Search (DFS) to detect cycles in the directed graph.

    • Maintain a visited array to keep track of visited vertices and a recursion stack to detect back edges.

    • If a vertex is visited and is present in the recursion stack, then a cycle exists.

    • Example: For the input 4 4, the graph has a cycle 0 -> 1 -> 2 -> 3 -> 1.

  • Answered by AI
Round 4 - Face to Face 

(1 Question)

Round duration - 30 Minutes
Round difficulty - Easy

It is a managerial round

  • Q1. How does a URL work and what is a load balancer?
  • Ans. 

    A URL is a web address that specifies the location of a resource on the internet. A load balancer distributes incoming network traffic across multiple servers to ensure optimal resource utilization and prevent overload.

    • A URL (Uniform Resource Locator) is a reference to a web resource that specifies its location on a computer network and the mechanism for retrieving it.

    • URLs typically consist of a protocol (such as HTTP ...

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI completed Computer Science Engineering from Jalpaiguri Government Engineering College. Eligibility criteriaNASwiggy interview preparation:Topics to prepare for the interview - DSA, Networking, Operating Systems, DBMS, Spring JavaTime required to prepare for the interview - 2 MonthsInterview preparation tips for other job seekers

Tip 1 : Practice Trees, Graphs, DP
Tip 2 : Be sure about your projects

Application resume tips for other job seekers

Tip 1 : Be genuine about your resume
Tip 2 : Have at least two projects on resume

Final outcome of the interviewSelected

Skills evaluated in this interview

Interview experience
2
Poor
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Coding Test 

HAckerrank based test

AccuKnox Interview FAQs

How many rounds are there in AccuKnox Python and Django Developer interview?
AccuKnox interview process usually has 2 rounds. The most common rounds in the AccuKnox interview process are Assignment and HR.

Tell us how to improve this page.

AccuKnox Python and Django Developer Interview Process

based on 1 interview

Interview experience

1
  
Bad
View more

Interview Questions from Similar Companies

Swiggy Interview Questions
3.8
 • 428 Interviews
Udaan Interview Questions
4.0
 • 334 Interviews
CARS24 Interview Questions
3.5
 • 331 Interviews
Meesho Interview Questions
3.7
 • 328 Interviews
Zepto Interview Questions
3.5
 • 207 Interviews
Blinkit Interview Questions
3.7
 • 181 Interviews
BlackBuck Interview Questions
3.8
 • 176 Interviews
Tata 1mg Interview Questions
3.6
 • 146 Interviews
Digit Insurance Interview Questions
4.0
 • 142 Interviews
Paisabazaar.com Interview Questions
3.4
 • 139 Interviews
View all

AccuKnox Python and Django Developer Reviews and Ratings

based on 3 reviews

1.9/5

Rating in categories

3.1

Skill development

2.3

Work-life balance

1.6

Salary

1.6

Job security

2.2

Company culture

1.3

Promotions

1.9

Work satisfaction

Explore 3 Reviews and Ratings
Software Engineer
21 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Devops Engineer
7 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Python Developer
6 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Software Developer
4 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Associate DevOps Engineer
4 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Explore more salaries
Compare AccuKnox with

CyberArk

3.8
Compare

Gen

4.0
Compare

Palo Alto Networks

3.9
Compare

FireEye

4.3
Compare
Did you find this page helpful?
Yes No
write
Share an Interview