• Skip to primary navigation
  • Skip to content
  • Skip to primary sidebar
  • Skip to secondary sidebar

GoHired

Interview Questions asked in Google, Microsoft, Amazon

Join WeekEnd Online Batch from 4-April-2020 on How to Crack Coding Interview in Just 10 Weeks : Fees just 20,000 INR

  • Home
  • Best Java Books
  • Algorithm
  • Internship
  • Certificates
  • About Us
  • Contact Us
  • Privacy Policy
  • Array
  • Stack
  • Queue
  • LinkedList
  • DP
  • Strings
  • Tree
  • Mathametical
  • Puzzles
  • Graph

How strtok() Works

April 13, 2015 by Dhaval Dave

strtok() : Split string into tokens
Syntax :

char * strtok ( char * str, const char * delimiters );

Parameters
str C string to truncate.Notice that this string is modified by being broken into smaller strings (tokens). Alternativelly, a null pointer may be specified, in which case the function continues scanning where a previous successful call to the function ended.

delimiters   C string containing the delimiter characters. These can be different from one call to another.

Example

/* strtok example */
 #include <stdio.h>
 #include <string.h>
int main (){
char str[] ="- This, a sample string.";
char * pch;
printf ("Splitting string \"%s\" into tokens:\n",str);
pch = strtok (str," ,.-");
while (pch != NULL){
printf ("%s\n",pch);
pch = strtok (NULL, " ,.-");
}
return 0;
}

code courtesy : cplusplus.com

Why Function strtok() is not Thread Safe / reentrant

The strtok() function uses a intermediate static buffer while parsing, and reuse them at each call so it’s not thread safe.

Solution :

Use  strtok_r() to use strtok as thread safe

 

Similar Articles

Filed Under: Adobe Interview Questions, problem Tagged With: c, string

Reader Interactions

Primary Sidebar

Join WeekEnd Online/Offline Batch from 4-April-2020 on How to Crack Coding Interview in Just 10 Weeks : Fees just 20,000 INR

Join WeekEnd Online/Offline Batch from 4-April-2020

WhatsApp us

Secondary Sidebar

Custom Search

  • How I cracked AMAZON
  • LeetCode
  • Adobe
  • Amazon
  • Facebook
  • Microsoft
  • Hacker Earth
  • CSE Interview

Top Rated Questions

write a c program that given a set a of n numbers and another number x determines whether or not there exist two elements in s whose sum is exactly x

Maximum sum contiguous subarray of an Array

Find an index i such that Arr [i] = i in array of n distinct integers sorted in ascending order.

Binary Tree in Java

Advanced SQL Injection

Convert Decimal to Roman numbers / Romanizer HackerEarth Code

Find position of the only set bit

Length of the longest substring without repeating characters

Generic Object Oriented Stack with Template

Find next greater number with same set of digits

Find loop in Singly linked list

The Magic HackerEarth Nirvana solutions Hiring Challenge

Best Java Book | Top Java Programming Book for Beginners

Spanning Tree

Puzzle : 100 doors in a row Visit and Toggle the door. What state the door will be after nth pass ?

Cisco Hiring Event 21st – 22nd Feb 2015

Client Server C program

VMWare SDEII Interview

Inorder and Preorder traversals of a Binary Tree given. Output the Postorder traversal of it.

Python Dictionaries

Given Set of words or A String find whether chain is possible from these words or not

Given a float number convert it into the string WITHOUT using any inbuilt Function

Linked List V/S Binary Search Tree

Maximum occurred Smallest integer in n ranges

Implement a generic binary search algorithm for Integer Double String etc

Edit Distance ( Dynamic Programming )

building with N steps, we can take 1,2,3 steps calculate number of ways to reach at top of building

Number of Islands BFS/DFS

FizzBuzz Solution C C++

simple sql injection

Copyright © 2026 · Genesis Framework · WordPress · Log in