i
Zikrabyte Solutions
Filter interviews by
Facebook Ads are paid advertisements on the Facebook platform that allow businesses to reach their target audience.
Facebook Ads can be targeted based on demographics, interests, behaviors, and more.
Advertisers can choose from various ad formats such as image ads, video ads, carousel ads, etc.
Facebook Ads can be optimized for different objectives like brand awareness, lead generation, website traffic, etc.
Ad performance...
Digital marketing is the use of online channels to promote products or services to a targeted audience.
Digital marketing involves using various online platforms such as social media, email, search engines, and websites to reach potential customers.
It includes strategies like search engine optimization (SEO), pay-per-click advertising, content marketing, and social media marketing.
Digital marketing allows for targeted a...
Create a web page of furniture design.
I applied via Campus Placement
Html, css using create home page
Top trending discussions
I applied via Approached by Company and was interviewed before Sep 2021. There were 2 interview rounds.
I applied via Referral and was interviewed in May 2022. There were 3 interview rounds.
Basic Javascript Questions
Duration 2 Hr
We were group of four asked to find a solution to a live project frontend , like discuss with each other as a team and find an optimum approach.
React is a JavaScript library for building user interfaces.
React is component-based and allows for reusable code.
React uses a virtual DOM for efficient updates.
React is often used with Redux for state management.
AngularJS is a full-featured framework while React is a library.
React uses JSX syntax while AngularJS uses HTML templates.
CSS styles can be applied inline, in a separate file, or with a CSS-in-JS library like s...
I applied via Referral and was interviewed in May 2022. There were 4 interview rounds.
The first round was coding round to test the candidate's ability . Test duration was one hour. The coding test was based on basic javascript logics.
The second round was group discussion. The topic was strategy to build a project, folder structure and API integration etc.
I am a highly skilled Full Stack Developer with a strong track record of delivering high-quality projects.
I have extensive experience in both front-end and back-end development.
I am proficient in multiple programming languages and frameworks, allowing me to adapt to any project requirements.
I have a proven ability to work well in teams and collaborate effectively with stakeholders.
I am constantly learning and staying u...
I can bring a strong technical skillset, a passion for problem-solving, and a collaborative mindset to the company.
Strong technical skillset in full stack development
Ability to solve complex problems and find innovative solutions
Collaborative mindset to work effectively in a team
Experience with relevant technologies and frameworks
Strong communication and interpersonal skills
My strength is problem-solving and my weakness is public speaking.
Strength: Proficient in identifying and solving complex problems
Weakness: Nervousness while speaking in front of large audiences
Strength: Ability to learn and adapt to new technologies quickly
Weakness: Difficulty in delegating tasks to others
Strength: Attention to detail and ability to work under pressure
Weakness: Tendency to overthink and second-guess d
I would expect a salary that is competitive and reflective of my skills and experience.
Research the average salary range for Full Stack Developers in your area.
Consider your years of experience, education, and any specialized skills you have.
Be prepared to negotiate and discuss your salary expectations during the interview process.
I have worked on a variety of technologies including JavaScript, React, Node.js, MongoDB, SQL, HTML, CSS, and Git.
JavaScript
React
Node.js
MongoDB
SQL
HTML
CSS
Git
CRUD API with login and registration functionality using jwt with 2 days of duration.
Probability of a horse going out of a chessboard in 'n' steps.
The total number of possible moves for a horse is 8.
The probability of going out of the board depends on the position of the horse.
For example, if the horse is at a corner, the probability of going out of the board is higher.
The probability can be calculated using combinatorics and geometry.
Algorithms for manipulating arrays and strings in coding
Use sorting algorithms like quicksort and mergesort for arrays
Use string manipulation functions like substring and replace for strings
Use dynamic programming for optimizing solutions to array and string problems
Designing a large scale Ad Server
Use distributed systems for scalability
Implement caching for faster ad delivery
Ensure high availability and fault tolerance
Use real-time bidding for efficient ad placement
Implement fraud detection mechanisms
Ensure compliance with privacy regulations
Maximum sub sequence sum in an array
Use Kadane's algorithm
Initialize max_so_far and max_ending_here to 0
Iterate through the array and update max_ending_here and max_so_far
Return max_so_far
Endianness refers to the byte order of a system. It determines how multi-byte data types are stored in memory.
Little-endian systems store the least significant byte first, while big-endian systems store the most significant byte first.
Endianness can affect the way data is transmitted between systems.
To determine the endianness of a system, you can use the byte order mark (BOM) or write a test program that checks the by...
Sort an array of 0's and 1's only.
Use two pointers, one at the beginning and one at the end of the array.
Swap 0's from the beginning with 1's from the end until the pointers meet.
Alternatively, use a counting sort algorithm to count the number of 0's and 1's and then reconstruct the array.
Heaps are data structures used to efficiently find the maximum or minimum element in a collection.
Max heap: parent nodes are always greater than or equal to child nodes
Min heap: parent nodes are always smaller than or equal to child nodes
Heaps are commonly used in priority queues and sorting algorithms
Heap operations include insert, delete, and extract max/min
Example: An array [3, 8, 2, 5, 1, 4, 6] can be represented a
Find 3 numbers in an array where a+b=c.
Loop through the array and check for all possible combinations of a and b.
Use a hash table to store the values of a and b, and check if c is present in the hash table.
Sort the array and use two pointers to find a and b, and then check if their sum equals c.
based on 1 interview
Interview experience
based on 16 reviews
Rating in categories
Manual Test Engineer
5
salaries
| ₹0 L/yr - ₹0 L/yr |
Test Engineer
4
salaries
| ₹0 L/yr - ₹0 L/yr |
Android Developer
4
salaries
| ₹0 L/yr - ₹0 L/yr |
UI/UX Designer
3
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Test Engineer
3
salaries
| ₹0 L/yr - ₹0 L/yr |
R.R. Donnelley
Denave
Smollan Group
Echobooom Management & Entrepreneurial Solutions